- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(first(0,X)) -> mark(nil) [2] active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) [3] active(from(X)) -> mark(cons(X,from(s(X)))) [4] mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) [5] mark(0) -> active(0) [6] mark(nil) -> active(nil) [7] mark(s(X)) -> active(s(mark(X))) [8] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [9] mark(from(X)) -> active(from(mark(X))) [10] first(mark(X1),X2) -> first(X1,X2) [11] first(X1,mark(X2)) -> first(X1,X2) [12] first(active(X1),X2) -> first(X1,X2) [13] first(X1,active(X2)) -> first(X1,X2) [14] s(mark(X)) -> s(X) [15] s(active(X)) -> s(X) [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] from(mark(X)) -> from(X) [21] from(active(X)) -> from(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(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(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_first(mark(X1),X2) >= Marked_first(X1,X2) ; Marked_first(active(X1),X2) >= Marked_first(X1,X2) ; Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) ; Marked_first(X1,active(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(mark(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(active(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(X1,mark(X2)) > Marked_first(X1,X2) ; } { Marked_first(X1,active(X2)) > Marked_first(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_first(mark(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(active(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) constraint: Marked_first(X1,active(X2)) >= Marked_first(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(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(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(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(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_from(mark(X)) >= Marked_from(X) ; Marked_from(active(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(mark(X)) > Marked_from(X) ; } { Marked_from(active(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_from(mark(X)) >= Marked_from(X) constraint: Marked_from(active(X)) >= Marked_from(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(from(X)) >= Marked_active(from(mark(X))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(from(X)) > Marked_active(from(mark(X))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } } === 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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(from(X)) >= Marked_active(from(mark(X))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } } === 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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; } + Disjunctions:{ { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } } === 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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) 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(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_first(mark(X1),X2) >= Marked_first(X1,X2) ; Marked_first(active(X1),X2) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(mark(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(active(X1),X2) > Marked_first(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_first(mark(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(active(X1),X2) >= Marked_first(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(0) >= active(0) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(from(X)) >= active(from(mark(X))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_first(mark(X1),X2) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(mark(X1),X2) > Marked_first(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(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(0) >= active(0) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(from(X)) >= active(from(mark(X))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_first(mark(X1),X2) >= Marked_first(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(first(0,X)) -> mark(nil) [2] active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) [3] active(from(X)) -> mark(cons(X,from(s(X)))) [4] mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) [5] mark(0) -> active(0) [6] mark(nil) -> active(nil) [7] mark(s(X)) -> active(s(mark(X))) [8] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [9] mark(from(X)) -> active(from(mark(X))) [10] first(mark(X1),X2) -> first(X1,X2) [11] first(X1,mark(X2)) -> first(X1,X2) [12] first(active(X1),X2) -> first(X1,X2) [13] first(X1,active(X2)) -> first(X1,X2) [14] s(mark(X)) -> s(X) [15] s(active(X)) -> s(X) [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] from(mark(X)) -> from(X) [21] from(active(X)) -> from(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ 0 ] () = 0; [ Marked_mark ] (X0) = 1; [ active ] (X0) = 0; [ s ] (X0) = 1; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ Marked_active ] (X0) = 1*X0; [ first ] (X0,X1) = 1; [ from ] (X0) = 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ 0 ] () = 0; [ Marked_mark ] (X0) = 2; [ active ] (X0) = 0; [ s ] (X0) = 0; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ Marked_active ] (X0) = 2*X0; [ first ] (X0,X1) = 1; [ from ] (X0) = 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ 0 ] () = 0; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ s ] (X0) = 2*X0; [ nil ] () = 0; [ cons ] (X0,X1) = 1*X0; [ Marked_active ] (X0) = 2*X0; [ first ] (X0,X1) = 2*X1 + 2*X0; [ from ] (X0) = 2*X0 + 1; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ 0 ] () = 0; [ Marked_mark ] (X0) = 1; [ active ] (X0) = 0; [ s ] (X0) = 0; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ Marked_active ] (X0) = 1*X0; [ first ] (X0,X1) = 1; [ from ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ 0 ] () = 1; [ Marked_mark ] (X0) = 2*X0; [ active ] (X0) = 1*X0; [ s ] (X0) = 1*X0 + 3; [ nil ] () = 0; [ cons ] (X0,X1) = 1*X0; [ Marked_active ] (X0) = 1*X0; [ first ] (X0,X1) = 2*X1 + 2*X0 + 2; [ from ] (X0) = 2*X0; removing < Marked_mark(first(X1,X2)),Marked_active(first(mark(X1),mark(X2)))> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2*X0 + 0; [ 0 ] () = 0; [ Marked_mark ] (X0) = 3*X0 + 0; [ active ] (X0) = 1*X0 + 0; [ s ] (X0) = 1 + 0; [ nil ] () = 0; [ cons ] (X0,X1) = 1 + 1*X0 + 0; [ first ] (X0,X1) = 2*X1 + 0; [ from ] (X0) = 2 + 2*X0 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 1; [ 0 ] () = 0; [ active ] (X0) = 2*X0 + 1; [ s ] (X0) = 0; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ Marked_first ] (X0,X1) = 1*X1; [ from ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 3*X0; [ 0 ] () = 2; [ active ] (X0) = 2*X0 + 2; [ s ] (X0) = 2; [ nil ] () = 2; [ cons ] (X0,X1) = 2; [ first ] (X0,X1) = 3; [ Marked_first ] (X0,X1) = 3*X0; [ from ] (X0) = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 1*X0 + 0; [ 0 ] () = 0; [ active ] (X0) = 2 + 1*X0 + 0; [ s ] (X0) = 0; [ nil ] () = 1 + 0; [ cons ] (X0,X1) = 0; [ first ] (X0,X1) = 2 + 0; [ Marked_first ] (X0,X1) = 3*X0 + 0; [ from ] (X0) = 2 + 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ 0 ] () = 0; [ active ] (X0) = 1 + 1*X0 + 0; [ Marked_s ] (X0) = 3*X0 + 0; [ s ] (X0) = 0; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ from ] (X0) = 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 3 + 3*X0 + 0; [ 0 ] () = 0; [ active ] (X0) = 3 + 3*X0 + 0; [ s ] (X0) = 0; [ nil ] () = 0; [ Marked_cons ] (X0,X1) = 3*X0 + 3*X1 + 0; [ cons ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ from ] (X0) = 2 + 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 2*X0 + 0; [ Marked_from ] (X0) = 3*X0 + 0; [ 0 ] () = 0; [ active ] (X0) = 1 + 1*X0 + 0; [ s ] (X0) = 0; [ nil ] () = 0; [ cons ] (X0,X1) = 0; [ first ] (X0,X1) = 2 + 0; [ from ] (X0) = 0; ]} ]} ]} Cime worked for 1.288475 seconds (real time) Cime Exit Status: 0