- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(eq(0,0)) -> mark(true) [2] active(eq(s(X),s(Y))) -> mark(eq(X,Y)) [3] active(eq(X,Y)) -> mark(false) [4] active(inf(X)) -> mark(cons(X,inf(s(X)))) [5] active(take(0,X)) -> mark(nil) [6] active(take(s(X),cons(Y,L))) -> mark(cons(Y,take(X,L))) [7] active(length(nil)) -> mark(0) [8] active(length(cons(X,L))) -> mark(s(length(L))) [9] mark(eq(X1,X2)) -> active(eq(X1,X2)) [10] mark(0) -> active(0) [11] mark(true) -> active(true) [12] mark(s(X)) -> active(s(X)) [13] mark(false) -> active(false) [14] mark(inf(X)) -> active(inf(mark(X))) [15] mark(cons(X1,X2)) -> active(cons(X1,X2)) [16] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [17] mark(nil) -> active(nil) [18] mark(length(X)) -> active(length(mark(X))) [19] eq(mark(X1),X2) -> eq(X1,X2) [20] eq(X1,mark(X2)) -> eq(X1,X2) [21] eq(active(X1),X2) -> eq(X1,X2) [22] eq(X1,active(X2)) -> eq(X1,X2) [23] s(mark(X)) -> s(X) [24] s(active(X)) -> s(X) [25] inf(mark(X)) -> inf(X) [26] inf(active(X)) -> inf(X) [27] cons(mark(X1),X2) -> cons(X1,X2) [28] cons(X1,mark(X2)) -> cons(X1,X2) [29] cons(active(X1),X2) -> cons(X1,X2) [30] cons(X1,active(X2)) -> cons(X1,X2) [31] take(mark(X1),X2) -> take(X1,X2) [32] take(X1,mark(X2)) -> take(X1,X2) [33] take(active(X1),X2) -> take(X1,X2) [34] take(X1,active(X2)) -> take(X1,X2) [35] length(mark(X)) -> length(X) [36] length(active(X)) -> length(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 7 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(inf(X)) >= Marked_mark(X) ; Marked_mark(inf(X)) >= Marked_active(inf(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_mark(length(X)) >= Marked_mark(X) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; Marked_active(take(s(X),cons(Y,L))) >= Marked_mark(cons(Y,take(X,L))) ; Marked_active(length(cons(X,L))) >= Marked_mark(s(length(L))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(inf(X)) > Marked_mark(X) ; } { Marked_mark(inf(X)) > Marked_active(inf(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_mark(length(X)) > Marked_mark(X) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(s(X)))) ; } { Marked_active(take(s(X),cons(Y,L))) > Marked_mark(cons(Y,take(X,L))) ; } { Marked_active(length(cons(X,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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(inf(X)) >= Marked_mark(X) constraint: Marked_mark(inf(X)) >= Marked_active(inf(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_mark(length(X)) >= Marked_mark(X) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) constraint: Marked_active(take(s(X),cons(Y,L))) >= Marked_mark(cons(Y, take(X,L))) constraint: Marked_active(length(cons(X,L))) >= Marked_mark(s(length(L))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_eq(mark(X1),X2) >= Marked_eq(X1,X2) ; Marked_eq(active(X1),X2) >= Marked_eq(X1,X2) ; Marked_eq(X1,mark(X2)) >= Marked_eq(X1,X2) ; Marked_eq(X1,active(X2)) >= Marked_eq(X1,X2) ; } + Disjunctions:{ { Marked_eq(mark(X1),X2) > Marked_eq(X1,X2) ; } { Marked_eq(active(X1),X2) > Marked_eq(X1,X2) ; } { Marked_eq(X1,mark(X2)) > Marked_eq(X1,X2) ; } { Marked_eq(X1,active(X2)) > Marked_eq(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_eq(mark(X1),X2) >= Marked_eq(X1,X2) constraint: Marked_eq(active(X1),X2) >= Marked_eq(X1,X2) constraint: Marked_eq(X1,mark(X2)) >= Marked_eq(X1,X2) constraint: Marked_eq(X1,active(X2)) >= Marked_eq(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(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(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_inf(mark(X)) >= Marked_inf(X) ; Marked_inf(active(X)) >= Marked_inf(X) ; } + Disjunctions:{ { Marked_inf(mark(X)) > Marked_inf(X) ; } { Marked_inf(active(X)) > Marked_inf(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_inf(mark(X)) >= Marked_inf(X) constraint: Marked_inf(active(X)) >= Marked_inf(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(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(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_take(mark(X1),X2) >= Marked_take(X1,X2) ; Marked_take(active(X1),X2) >= Marked_take(X1,X2) ; Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) ; Marked_take(X1,active(X2)) >= Marked_take(X1,X2) ; } + Disjunctions:{ { Marked_take(mark(X1),X2) > Marked_take(X1,X2) ; } { Marked_take(active(X1),X2) > Marked_take(X1,X2) ; } { Marked_take(X1,mark(X2)) > Marked_take(X1,X2) ; } { Marked_take(X1,active(X2)) > Marked_take(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_take(mark(X1),X2) >= Marked_take(X1,X2) constraint: Marked_take(active(X1),X2) >= Marked_take(X1,X2) constraint: Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) constraint: Marked_take(X1,active(X2)) >= Marked_take(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_length(mark(X)) >= Marked_length(X) constraint: Marked_length(active(X)) >= Marked_length(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(inf(X)) >= Marked_mark(X) ; Marked_mark(inf(X)) >= Marked_active(inf(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_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; Marked_active(take(s(X),cons(Y,L))) >= Marked_mark(cons(Y,take(X,L))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(inf(X)) > Marked_mark(X) ; } { Marked_mark(inf(X)) > Marked_active(inf(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_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(s(X)))) ; } { Marked_active(take(s(X),cons(Y,L))) > Marked_mark(cons(Y,take(X,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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(inf(X)) >= Marked_mark(X) constraint: Marked_mark(inf(X)) >= Marked_active(inf(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_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) constraint: Marked_active(take(s(X),cons(Y,L))) >= Marked_mark(cons(Y, take(X,L))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) ; Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(inf(X)) > Marked_active(inf(mark(X))) ; } { Marked_mark(take(X1,X2)) > Marked_active(take(mark(X1),mark(X2))) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) constraint: Marked_mark(take(X1,X2)) >= Marked_active(take(mark(X1),mark(X2))) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) ; Marked_mark(length(X)) >= Marked_active(length(mark(X))) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(inf(X)) > Marked_active(inf(mark(X))) ; } { Marked_mark(length(X)) > Marked_active(length(mark(X))) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) constraint: Marked_mark(length(X)) >= Marked_active(length(mark(X))) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_mark(inf(X)) > Marked_active(inf(mark(X))) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_mark(inf(X)) >= Marked_active(inf(mark(X))) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } { Marked_active(inf(X)) > Marked_mark(cons(X,inf(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) constraint: Marked_active(inf(X)) >= Marked_mark(cons(X,inf(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) ; Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) ; } + Disjunctions:{ { Marked_mark(eq(X1,X2)) > Marked_active(eq(X1,X2)) ; } { Marked_active(eq(s(X),s(Y))) > Marked_mark(eq(X,Y)) ; } } === 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 : 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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_mark(eq(X1,X2)) >= Marked_active(eq(X1,X2)) constraint: Marked_active(eq(s(X),s(Y))) >= Marked_mark(eq(X,Y)) 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 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) ; Marked_take(X1,active(X2)) >= Marked_take(X1,X2) ; } + Disjunctions:{ { Marked_take(X1,mark(X2)) > Marked_take(X1,X2) ; } { Marked_take(X1,active(X2)) > Marked_take(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_take(X1,mark(X2)) >= Marked_take(X1,X2) constraint: Marked_take(X1,active(X2)) >= Marked_take(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(true) >= active(true) ; mark(eq(X1,X2)) >= active(eq(X1,X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(false) >= active(false) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(inf(X)) >= active(inf(mark(X))) ; mark(nil) >= active(nil) ; mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) ; mark(length(X)) >= active(length(mark(X))) ; active(eq(0,0)) >= mark(true) ; active(eq(s(X),s(Y))) >= mark(eq(X,Y)) ; active(eq(X,Y)) >= mark(false) ; active(inf(X)) >= mark(cons(X,inf(s(X)))) ; active(take(0,X)) >= mark(nil) ; active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) ; active(length(cons(X,L))) >= mark(s(length(L))) ; active(length(nil)) >= mark(0) ; eq(mark(X1),X2) >= eq(X1,X2) ; eq(active(X1),X2) >= eq(X1,X2) ; eq(X1,mark(X2)) >= eq(X1,X2) ; eq(X1,active(X2)) >= eq(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(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) ; inf(mark(X)) >= inf(X) ; inf(active(X)) >= inf(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) ; length(mark(X)) >= length(X) ; length(active(X)) >= length(X) ; Marked_take(X1,active(X2)) >= Marked_take(X1,X2) ; } + Disjunctions:{ { Marked_take(X1,active(X2)) > Marked_take(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(true) >= active(true) constraint: mark(eq(X1,X2)) >= active(eq(X1,X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(false) >= active(false) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(inf(X)) >= active(inf(mark(X))) constraint: mark(nil) >= active(nil) constraint: mark(take(X1,X2)) >= active(take(mark(X1),mark(X2))) constraint: mark(length(X)) >= active(length(mark(X))) constraint: active(eq(0,0)) >= mark(true) constraint: active(eq(s(X),s(Y))) >= mark(eq(X,Y)) constraint: active(eq(X,Y)) >= mark(false) constraint: active(inf(X)) >= mark(cons(X,inf(s(X)))) constraint: active(take(0,X)) >= mark(nil) constraint: active(take(s(X),cons(Y,L))) >= mark(cons(Y,take(X,L))) constraint: active(length(cons(X,L))) >= mark(s(length(L))) constraint: active(length(nil)) >= mark(0) constraint: eq(mark(X1),X2) >= eq(X1,X2) constraint: eq(active(X1),X2) >= eq(X1,X2) constraint: eq(X1,mark(X2)) >= eq(X1,X2) constraint: eq(X1,active(X2)) >= eq(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(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: inf(mark(X)) >= inf(X) constraint: inf(active(X)) >= inf(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: length(mark(X)) >= length(X) constraint: length(active(X)) >= length(X) constraint: Marked_take(X1,active(X2)) >= Marked_take(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(eq(0,0)) -> mark(true) [2] active(eq(s(X),s(Y))) -> mark(eq(X,Y)) [3] active(eq(X,Y)) -> mark(false) [4] active(inf(X)) -> mark(cons(X,inf(s(X)))) [5] active(take(0,X)) -> mark(nil) [6] active(take(s(X),cons(Y,L))) -> mark(cons(Y,take(X,L))) [7] active(length(nil)) -> mark(0) [8] active(length(cons(X,L))) -> mark(s(length(L))) [9] mark(eq(X1,X2)) -> active(eq(X1,X2)) [10] mark(0) -> active(0) [11] mark(true) -> active(true) [12] mark(s(X)) -> active(s(X)) [13] mark(false) -> active(false) [14] mark(inf(X)) -> active(inf(mark(X))) [15] mark(cons(X1,X2)) -> active(cons(X1,X2)) [16] mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) [17] mark(nil) -> active(nil) [18] mark(length(X)) -> active(length(mark(X))) [19] eq(mark(X1),X2) -> eq(X1,X2) [20] eq(X1,mark(X2)) -> eq(X1,X2) [21] eq(active(X1),X2) -> eq(X1,X2) [22] eq(X1,active(X2)) -> eq(X1,X2) [23] s(mark(X)) -> s(X) [24] s(active(X)) -> s(X) [25] inf(mark(X)) -> inf(X) [26] inf(active(X)) -> inf(X) [27] cons(mark(X1),X2) -> cons(X1,X2) [28] cons(X1,mark(X2)) -> cons(X1,X2) [29] cons(active(X1),X2) -> cons(X1,X2) [30] cons(X1,active(X2)) -> cons(X1,X2) [31] take(mark(X1),X2) -> take(X1,X2) [32] take(X1,mark(X2)) -> take(X1,X2) [33] take(active(X1),X2) -> take(X1,X2) [34] take(X1,active(X2)) -> take(X1,X2) [35] length(mark(X)) -> length(X) [36] length(active(X)) -> length(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ inf ] (X0) = 1*X0; [ 0 ] () = 0; [ active ] (X0) = 1*X0; [ Marked_mark ] (X0) = 2*X0 + 3; [ take ] (X0,X1) = 2*X1 + 1*X0; [ false ] () = 0; [ true ] () = 2; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 2; [ Marked_active ] (X0) = 2*X0 + 3; [ length ] (X0) = 2*X0 + 1; [ cons ] (X0,X1) = 0; removing < Marked_mark(length(X)),Marked_mark(X)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ inf ] (X0) = 1*X0 + 2; [ 0 ] () = 0; [ active ] (X0) = 1*X0; [ Marked_mark ] (X0) = 3*X0 + 3; [ take ] (X0,X1) = 1*X1 + 2*X0 + 2; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 1; [ s ] (X0) = 3; [ eq ] (X0,X1) = 0; [ Marked_active ] (X0) = 3*X0 + 3; [ length ] (X0) = 1*X0 + 1; [ cons ] (X0,X1) = 1*X0 + 2; removing < Marked_mark(inf(X)),Marked_mark(X)>< Marked_mark(take(X1,X2)),Marked_mark(X2)> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ inf ] (X0) = 0; [ 0 ] () = 0; [ active ] (X0) = 0; [ Marked_mark ] (X0) = 2*X0; [ take ] (X0,X1) = 1; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 0; [ Marked_active ] (X0) = 0; [ length ] (X0) = 0; [ cons ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ inf ] (X0) = 1; [ 0 ] () = 0; [ active ] (X0) = 0; [ Marked_mark ] (X0) = 2; [ take ] (X0,X1) = 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 1; [ Marked_active ] (X0) = 2*X0; [ length ] (X0) = 0; [ cons ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ inf ] (X0) = 2; [ 0 ] () = 0; [ active ] (X0) = 0; [ Marked_mark ] (X0) = 2*X0; [ take ] (X0,X1) = 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 0; [ Marked_active ] (X0) = 0; [ length ] (X0) = 0; [ cons ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ inf ] (X0) = 0; [ 0 ] () = 0; [ active ] (X0) = 0; [ Marked_mark ] (X0) = 1*X0; [ take ] (X0,X1) = 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 1; [ Marked_active ] (X0) = 1; [ length ] (X0) = 0; [ cons ] (X0,X1) = 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 ] [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ inf ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_mark ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ take ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ false ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ true ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ nil ] () = [ [ 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 ] [ 1 , 0 , 0 ] ]; [ eq ] (X0,X1) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X1 + [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_active ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ length ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 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 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 2*X0 + 0; [ inf ] (X0) = 0; [ 0 ] () = 1 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ take ] (X0,X1) = 1 + 0; [ false ] () = 1 + 0; [ true ] () = 0; [ Marked_eq ] (X0,X1) = 3*X0 + 3*X1 + 0; [ nil ] () = 0; [ s ] (X0) = 2 + 0; [ eq ] (X0,X1) = 1 + 0; [ length ] (X0) = 3 + 0; [ cons ] (X0,X1) = 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 1*X0 + 0; [ Marked_s ] (X0) = 3*X0 + 0; [ inf ] (X0) = 0; [ 0 ] () = 0; [ active ] (X0) = 2 + 1*X0 + 0; [ take ] (X0,X1) = 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ eq ] (X0,X1) = 0; [ length ] (X0) = 0; [ cons ] (X0,X1) = 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 2*X0 + 0; [ inf ] (X0) = 0; [ 0 ] () = 2 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ take ] (X0,X1) = 1 + 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 2 + 0; [ eq ] (X0,X1) = 2 + 0; [ length ] (X0) = 3 + 0; [ cons ] (X0,X1) = 1*X1 + 0; [ Marked_inf ] (X0) = 3*X0 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 2*X0 + 0; [ inf ] (X0) = 0; [ 0 ] () = 1 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ take ] (X0,X1) = 0; [ false ] () = 0; [ Marked_cons ] (X0,X1) = 3*X0 + 3*X1 + 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 3 + 0; [ eq ] (X0,X1) = 3 + 0; [ length ] (X0) = 3 + 0; [ cons ] (X0,X1) = 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 2; [ inf ] (X0) = 3; [ 0 ] () = 1; [ active ] (X0) = 2*X0 + 2; [ take ] (X0,X1) = 0; [ false ] () = 2; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 3; [ Marked_take ] (X0,X1) = 2*X0; [ eq ] (X0,X1) = 3; [ length ] (X0) = 3; [ cons ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 2; [ inf ] (X0) = 1; [ 0 ] () = 0; [ active ] (X0) = 2*X0; [ take ] (X0,X1) = 2; [ false ] () = 2; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ Marked_take ] (X0,X1) = 3*X1; [ eq ] (X0,X1) = 2; [ length ] (X0) = 2; [ cons ] (X0,X1) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 0; [ inf ] (X0) = 0; [ 0 ] () = 0; [ active ] (X0) = 1 + 1*X0 + 0; [ take ] (X0,X1) = 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 0; [ Marked_take ] (X0,X1) = 3*X1 + 0; [ eq ] (X0,X1) = 0; [ length ] (X0) = 0; [ cons ] (X0,X1) = 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 2*X0 + 0; [ inf ] (X0) = 0; [ 0 ] () = 1 + 0; [ Marked_length ] (X0) = 3*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ take ] (X0,X1) = 1 + 0; [ false ] () = 0; [ true ] () = 0; [ nil ] () = 0; [ s ] (X0) = 2 + 0; [ eq ] (X0,X1) = 0; [ length ] (X0) = 3 + 0; [ cons ] (X0,X1) = 0; ]} ]} ]} Cime worked for 5.590366 seconds (real time) Cime Exit Status: 0