- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(incr(nil)) -> mark(nil) [2] active(incr(cons(X,L))) -> mark(cons(s(X),incr(L))) [3] active(adx(nil)) -> mark(nil) [4] active(adx(cons(X,L))) -> mark(incr(cons(X,adx(L)))) [5] active(nats) -> mark(adx(zeros)) [6] active(zeros) -> mark(cons(0,zeros)) [7] active(head(cons(X,L))) -> mark(X) [8] active(tail(cons(X,L))) -> mark(L) [9] mark(incr(X)) -> active(incr(mark(X))) [10] mark(nil) -> active(nil) [11] mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) [12] mark(s(X)) -> active(s(mark(X))) [13] mark(adx(X)) -> active(adx(mark(X))) [14] mark(nats) -> active(nats) [15] mark(zeros) -> active(zeros) [16] mark(0) -> active(0) [17] mark(head(X)) -> active(head(mark(X))) [18] mark(tail(X)) -> active(tail(mark(X))) [19] incr(mark(X)) -> incr(X) [20] incr(active(X)) -> incr(X) [21] cons(mark(X1),X2) -> cons(X1,X2) [22] cons(X1,mark(X2)) -> cons(X1,X2) [23] cons(active(X1),X2) -> cons(X1,X2) [24] cons(X1,active(X2)) -> cons(X1,X2) [25] s(mark(X)) -> s(X) [26] s(active(X)) -> s(X) [27] adx(mark(X)) -> adx(X) [28] adx(active(X)) -> adx(X) [29] head(mark(X)) -> head(X) [30] head(active(X)) -> head(X) [31] tail(mark(X)) -> tail(X) [32] tail(active(X)) -> tail(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 7 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; 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(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(nats) >= Marked_active(nats) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(nats) >= Marked_mark(adx(zeros)) ; Marked_active(head(cons(X,L))) >= Marked_mark(X) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { 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(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(nats) > Marked_active(nats) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(nats) > Marked_mark(adx(zeros)) ; } { Marked_active(head(cons(X,L))) > Marked_mark(X) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(nats) >= Marked_active(nats) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(nats) >= Marked_mark(adx(zeros)) constraint: Marked_active(head(cons(X,L))) >= Marked_mark(X) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Subterm criterion) ST: Marked_incr -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_s -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_adx -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_head -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_tail -> 1 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; 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(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(head(cons(X,L))) >= Marked_mark(X) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { 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(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(head(cons(X,L))) > Marked_mark(X) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(head(cons(X,L))) >= Marked_mark(X) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; 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(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(head(cons(X,L))) >= Marked_mark(X) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { 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(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(head(cons(X,L))) > Marked_mark(X) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(head(cons(X,L))) >= Marked_mark(X) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(head(X)) >= Marked_mark(X) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(head(cons(X,L))) >= Marked_mark(X) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(head(X)) > Marked_mark(X) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(head(cons(X,L))) > Marked_mark(X) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(head(X)) >= Marked_mark(X) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(head(cons(X,L))) >= Marked_mark(X) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(head(X)) >= Marked_active(head(mark(X))) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(head(X)) > Marked_active(head(mark(X))) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(head(X)) >= Marked_active(head(mark(X))) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(tail(X)) >= Marked_mark(X) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; Marked_active(tail(cons(X,L))) >= Marked_mark(L) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(tail(X)) > Marked_mark(X) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } { Marked_active(tail(cons(X,L))) > Marked_mark(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(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(tail(X)) >= Marked_mark(X) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) constraint: Marked_active(tail(cons(X,L))) >= Marked_mark(L) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } } === 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(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_mark(zeros) >= Marked_active(zeros) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_mark(zeros) > Marked_active(zeros) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } { Marked_active(zeros) > Marked_mark(cons(0,zeros)) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(nil) >= active(nil) constraint: mark(incr(X)) >= active(incr(mark(X))) constraint: mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(adx(X)) >= active(adx(mark(X))) constraint: mark(zeros) >= active(zeros) constraint: mark(nats) >= active(nats) constraint: mark(0) >= active(0) constraint: mark(head(X)) >= active(head(mark(X))) constraint: mark(tail(X)) >= active(tail(mark(X))) constraint: active(incr(nil)) >= mark(nil) constraint: active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) constraint: active(adx(nil)) >= mark(nil) constraint: active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) constraint: active(zeros) >= mark(cons(0,zeros)) constraint: active(nats) >= mark(adx(zeros)) constraint: active(head(cons(X,L))) >= mark(X) constraint: active(tail(cons(X,L))) >= mark(L) constraint: incr(mark(X)) >= incr(X) constraint: incr(active(X)) >= incr(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: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: adx(mark(X)) >= adx(X) constraint: adx(active(X)) >= adx(X) constraint: head(mark(X)) >= head(X) constraint: head(active(X)) >= head(X) constraint: tail(mark(X)) >= tail(X) constraint: tail(active(X)) >= tail(X) constraint: Marked_mark(incr(X)) >= Marked_mark(X) constraint: Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) constraint: Marked_mark(zeros) >= Marked_active(zeros) constraint: Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) constraint: Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) >= Marked_mark(X) ; Marked_mark(incr(X)) >= Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_active(incr(cons(X,L))) >= Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) >= Marked_mark(incr(cons(X,adx(L)))) ; } + Disjunctions:{ { Marked_mark(incr(X)) > Marked_mark(X) ; } { Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; } { Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(adx(X)) > Marked_active(adx(mark(X))) ; } { Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; } { Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) > Marked_mark(X) ; Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(nil) >= active(nil) ; mark(incr(X)) >= active(incr(mark(X))) ; mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ; mark(s(X)) >= active(s(mark(X))) ; mark(adx(X)) >= active(adx(mark(X))) ; mark(zeros) >= active(zeros) ; mark(nats) >= active(nats) ; mark(0) >= active(0) ; mark(head(X)) >= active(head(mark(X))) ; mark(tail(X)) >= active(tail(mark(X))) ; active(incr(nil)) >= mark(nil) ; active(incr(cons(X,L))) >= mark(cons(s(X),incr(L))) ; active(adx(nil)) >= mark(nil) ; active(adx(cons(X,L))) >= mark(incr(cons(X,adx(L)))) ; active(zeros) >= mark(cons(0,zeros)) ; active(nats) >= mark(adx(zeros)) ; active(head(cons(X,L))) >= mark(X) ; active(tail(cons(X,L))) >= mark(L) ; incr(mark(X)) >= incr(X) ; incr(active(X)) >= incr(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) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; adx(mark(X)) >= adx(X) ; adx(active(X)) >= adx(X) ; head(mark(X)) >= head(X) ; head(active(X)) >= head(X) ; tail(mark(X)) >= tail(X) ; tail(active(X)) >= tail(X) ; Marked_mark(incr(X)) > Marked_mark(X) ; Marked_mark(incr(X)) > Marked_active(incr(mark(X))) ; Marked_mark(cons(X1,X2)) > Marked_mark(X1) ; Marked_mark(s(X)) > Marked_mark(X) ; Marked_mark(adx(X)) >= Marked_active(adx(mark(X))) ; Marked_active(incr(cons(X,L))) > Marked_mark(cons(s(X),incr(L))) ; Marked_active(adx(cons(X,L))) > Marked_mark(incr(cons(X,adx(L)))) ; } + Disjunctions:{ } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === No solution found for these parameters.(513 bt (547) [228]) === 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 timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_cons -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 114.232764 seconds (real time) Cime Exit Status: 0