- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(length(nil)) -> mark(0) [3] active(length(cons(X,Y))) -> mark(s(length1(Y))) [4] active(length1(X)) -> mark(length(X)) [5] mark(from(X)) -> active(from(mark(X))) [6] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [7] mark(s(X)) -> active(s(mark(X))) [8] mark(length(X)) -> active(length(X)) [9] mark(nil) -> active(nil) [10] mark(0) -> active(0) [11] mark(length1(X)) -> active(length1(X)) [12] from(mark(X)) -> from(X) [13] from(active(X)) -> from(X) [14] cons(mark(X1),X2) -> cons(X1,X2) [15] cons(X1,mark(X2)) -> cons(X1,X2) [16] cons(active(X1),X2) -> cons(X1,X2) [17] cons(X1,active(X2)) -> cons(X1,X2) [18] s(mark(X)) -> s(X) [19] s(active(X)) -> s(X) [20] length(mark(X)) -> length(X) [21] length(active(X)) -> length(X) [22] length1(mark(X)) -> length1(X) [23] length1(active(X)) -> length1(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 6 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_from(mark(X)) >= Marked_from(X) ; Marked_from(active(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(mark(X)) > Marked_from(X) ; } { Marked_from(active(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_from(mark(X)) >= Marked_from(X) constraint: Marked_from(active(X)) >= Marked_from(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) ; Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(active(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(X1,mark(X2)) > Marked_cons(X1,X2) ; } { Marked_cons(X1,active(X2)) > Marked_cons(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(active(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(active(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_length(mark(X)) >= Marked_length(X) ; Marked_length(active(X)) >= Marked_length(X) ; } + Disjunctions:{ { Marked_length(mark(X)) > Marked_length(X) ; } { Marked_length(active(X)) > Marked_length(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_length(mark(X)) >= Marked_length(X) constraint: Marked_length(active(X)) >= Marked_length(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_length1(mark(X)) >= Marked_length1(X) ; Marked_length1(active(X)) >= Marked_length1(X) ; } + Disjunctions:{ { Marked_length1(mark(X)) > Marked_length1(X) ; } { Marked_length1(active(X)) > Marked_length1(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_length1(mark(X)) >= Marked_length1(X) constraint: Marked_length1(active(X)) >= Marked_length1(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(length(cons(X,Y))) > Marked_mark(s(length1(Y))) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(length(cons(X,Y))) >= Marked_mark(s(length1(Y))) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(X)) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(X)) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(X)) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(length1(X)) >= Marked_active(length1(X)) ; Marked_active(length1(X)) >= Marked_mark(length(X)) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(length1(X)) > Marked_active(length1(X)) ; } { Marked_active(length1(X)) > Marked_mark(length(X)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(length1(X)) >= Marked_active(length1(X)) constraint: Marked_active(length1(X)) >= Marked_mark(length(X)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(from(X)) >= active(from(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(0) >= active(0) ; mark(length(X)) >= active(length(X)) ; mark(nil) >= active(nil) ; mark(length1(X)) >= active(length1(X)) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; active(length(cons(X,Y))) >= mark(s(length1(Y))) ; active(length(nil)) >= mark(0) ; active(length1(X)) >= mark(length(X)) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; length1(mark(X)) >= length1(X) ; length1(active(X)) >= length1(X) ; Marked_mark(s(X)) >= Marked_mark(X) ; } + Disjunctions:{ { Marked_mark(s(X)) > Marked_mark(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(from(X)) >= active(from(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(0) >= active(0) constraint: mark(length(X)) >= active(length(X)) constraint: mark(nil) >= active(nil) constraint: mark(length1(X)) >= active(length1(X)) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: active(length(cons(X,Y))) >= mark(s(length1(Y))) constraint: active(length(nil)) >= mark(0) constraint: active(length1(X)) >= mark(length(X)) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: length1(mark(X)) >= length1(X) constraint: length1(active(X)) >= length1(X) constraint: Marked_mark(s(X)) >= Marked_mark(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(from(X)) -> mark(cons(X,from(s(X)))) [2] active(length(nil)) -> mark(0) [3] active(length(cons(X,Y))) -> mark(s(length1(Y))) [4] active(length1(X)) -> mark(length(X)) [5] mark(from(X)) -> active(from(mark(X))) [6] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [7] mark(s(X)) -> active(s(mark(X))) [8] mark(length(X)) -> active(length(X)) [9] mark(nil) -> active(nil) [10] mark(0) -> active(0) [11] mark(length1(X)) -> active(length1(X)) [12] from(mark(X)) -> from(X) [13] from(active(X)) -> from(X) [14] cons(mark(X1),X2) -> cons(X1,X2) [15] cons(X1,mark(X2)) -> cons(X1,X2) [16] cons(active(X1),X2) -> cons(X1,X2) [17] cons(X1,active(X2)) -> cons(X1,X2) [18] s(mark(X)) -> s(X) [19] s(active(X)) -> s(X) [20] length(mark(X)) -> length(X) [21] length(active(X)) -> length(X) [22] length1(mark(X)) -> length1(X) [23] length1(active(X)) -> length1(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ length1 ] (X0) = 2; [ active ] (X0) = 0; [ from ] (X0) = 2; [ length ] (X0) = 2; [ Marked_mark ] (X0) = 2; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ s ] (X0) = 2; [ nil ] () = 0; [ Marked_active ] (X0) = 1*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ length1 ] (X0) = 1; [ active ] (X0) = 0; [ from ] (X0) = 1; [ length ] (X0) = 1; [ Marked_mark ] (X0) = 2; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ s ] (X0) = 0; [ nil ] () = 0; [ Marked_active ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ length1 ] (X0) = 0; [ active ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 1; [ length ] (X0) = 0; [ Marked_mark ] (X0) = 2*X0; [ cons ] (X0,X1) = 2*X0; [ 0 ] () = 0; [ s ] (X0) = 2*X0; [ nil ] () = 0; [ Marked_active ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ length1 ] (X0) = 0; [ active ] (X0) = 1*X0; [ from ] (X0) = 3*X0 + 1; [ length ] (X0) = 0; [ Marked_mark ] (X0) = 1*X0; [ cons ] (X0,X1) = 1*X0; [ 0 ] () = 0; [ s ] (X0) = 2*X0; [ nil ] () = 0; [ Marked_active ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ length1 ] (X0) = 0; [ active ] (X0) = 1*X0; [ from ] (X0) = 2*X0 + 2; [ length ] (X0) = 0; [ Marked_mark ] (X0) = 1*X0; [ cons ] (X0,X1) = 1*X0 + 1; [ 0 ] () = 0; [ s ] (X0) = 2*X0; [ nil ] () = 2; [ Marked_active ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ length1 ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ from ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ length ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 1 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ nil ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_active ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ length1 ] (X0) = 2; [ active ] (X0) = 0; [ from ] (X0) = 0; [ length ] (X0) = 0; [ Marked_mark ] (X0) = 2; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ s ] (X0) = 0; [ nil ] () = 0; [ Marked_active ] (X0) = 1*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] [ 0 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ length1 ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 0 ] ]; [ active ] (X0) = [ [ 0 , 1 , 0 ] [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ from ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ length ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ nil ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_active ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ length1 ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ from ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ length ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 0 ] () = [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ nil ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ length1 ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ from ] (X0) = 2 + 0; [ length ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 1 + 0; [ Marked_from ] (X0) = 3*X0 + 0; [ s ] (X0) = 0; [ nil ] () = 2 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ length1 ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ Marked_cons ] (X0,X1) = 3*X0 + 3*X1 + 0; [ from ] (X0) = 2 + 0; [ length ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 1 + 0; [ 0 ] () = 1 + 0; [ s ] (X0) = 0; [ nil ] () = 2 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ length1 ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ from ] (X0) = 2 + 0; [ length ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 1 + 0; [ 0 ] () = 0; [ s ] (X0) = 0; [ Marked_s ] (X0) = 3*X0 + 0; [ nil ] () = 2 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ length1 ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ from ] (X0) = 3 + 0; [ Marked_length ] (X0) = 3*X0 + 0; [ length ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 1 + 0; [ s ] (X0) = 0; [ nil ] () = 2 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ length1 ] (X0) = 3 + 2*X0 + 0; [ active ] (X0) = 3 + 2*X0 + 0; [ from ] (X0) = 0; [ length ] (X0) = 1 + 1*X0 + 0; [ cons ] (X0,X1) = 0; [ Marked_length1 ] (X0) = 3*X0 + 0; [ 0 ] () = 1 + 0; [ s ] (X0) = 0; [ nil ] () = 2 + 0; ]} ]} ]} Cime worked for 5.788372 seconds (real time) Cime Exit Status: 0