- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(zeros) -> mark(cons(0,zeros)) [2] active(and(tt,X)) -> mark(X) [3] active(length(nil)) -> mark(0) [4] active(length(cons(N,L))) -> mark(s(length(L))) [5] active(take(0,IL)) -> mark(nil) [6] active(take(s(M),cons(N,IL))) -> mark(cons(N,take(M,IL))) [7] mark(zeros) -> active(zeros) [8] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [9] mark(0) -> active(0) [10] mark(and(X1,X2)) -> active(and(mark(X1),X2)) [11] mark(tt) -> active(tt) [12] mark(length(X)) -> active(length(mark(X))) [13] mark(nil) -> active(nil) [14] mark(s(X)) -> active(s(mark(X))) [15] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [16] cons(mark(X1),X2) -> cons(X1,X2) [17] cons(X1,mark(X2)) -> cons(X1,X2) [18] cons(active(X1),X2) -> cons(X1,X2) [19] cons(X1,active(X2)) -> cons(X1,X2) [20] and(mark(X1),X2) -> and(X1,X2) [21] and(X1,mark(X2)) -> and(X1,X2) [22] and(active(X1),X2) -> and(X1,X2) [23] and(X1,active(X2)) -> and(X1,X2) [24] length(mark(X)) -> length(X) [25] length(active(X)) -> length(X) [26] s(mark(X)) -> s(X) [27] s(active(X)) -> s(X) [28] take(mark(X1),X2) -> take(X1,X2) [29] take(X1,mark(X2)) -> take(X1,X2) [30] take(active(X1),X2) -> take(X1,X2) [31] take(X1,active(X2)) -> take(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 6 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(and(tt,X)) >= Marked_mark(X) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(and(tt,X)) > Marked_mark(X) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(and(tt,X)) >= Marked_mark(X) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_and -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_length -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_take -> 2 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_mark(X1) ; Marked_mark(take(X1,X2)) >= Marked_mark(X2) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(take(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(take(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons(N,take(M,IL))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } { Marked_active(take(s(M),cons(N,IL))) > Marked_mark(cons(N,take(M,IL))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) constraint: Marked_active(take(s(M),cons(N,IL))) >= Marked_mark(cons( N,take(M,IL))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } } === 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(0) >= active(0) constraint: mark(zeros) >= active(zeros) constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(tt) >= active(tt) constraint: mark(length(X)) >= active(length(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) 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: active(zeros) >= mark(cons(0,zeros)) constraint: active(and(tt,X)) >= mark(X) constraint: active(length(cons(N,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: active(take(0,IL)) >= mark(nil) constraint: active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: take(mark(X1),X2) >= take(X1,X2) constraint: take(active(X1),X2) >= take(X1,X2) constraint: take(X1,mark(X2)) >= take(X1,X2) constraint: take(X1,active(X2)) >= take(X1,X2) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(length(cons(N,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } } === 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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(0) >= active(0) ; mark(zeros) >= active(zeros) ; mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(tt) >= active(tt) ; mark(length(X)) >= active(length(mark(X))) ; mark(nil) >= active(nil) ; mark(s(X)) >= active(s(mark(X))) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; 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) ; active(zeros) >= mark(cons(0,zeros)) ; active(and(tt,X)) >= mark(X) ; active(length(cons(N,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; active(take(0,IL)) >= mark(nil) ; active(take(s(M),cons(N,IL))) >= mark(cons(N,take(M,IL))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; take(mark(X1),X2) >= take(X1,X2) ; take(active(X1),X2) >= take(X1,X2) ; take(X1,mark(X2)) >= take(X1,X2) ; take(X1,active(X2)) >= take(X1,X2) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_active(length(cons(N,L))) > Marked_mark(s(length(L))) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(518 bt (684) [45]) === 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 === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_and -> 1 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 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_take -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 82.856719 seconds (real time) Cime Exit Status: 0