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