- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(and(true,X)) -> mark(X) [2] active(and(false,Y)) -> mark(false) [3] active(if(true,X,Y)) -> mark(X) [4] active(if(false,X,Y)) -> mark(Y) [5] active(add(0,X)) -> mark(X) [6] active(add(s(X),Y)) -> mark(s(add(X,Y))) [7] active(first(0,X)) -> mark(nil) [8] active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) [9] active(from(X)) -> mark(cons(X,from(s(X)))) [10] mark(and(X1,X2)) -> active(and(mark(X1),X2)) [11] mark(true) -> active(true) [12] mark(false) -> active(false) [13] mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) [14] mark(add(X1,X2)) -> active(add(mark(X1),X2)) [15] mark(0) -> active(0) [16] mark(s(X)) -> active(s(X)) [17] mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) [18] mark(nil) -> active(nil) [19] mark(cons(X1,X2)) -> active(cons(X1,X2)) [20] mark(from(X)) -> active(from(X)) [21] and(mark(X1),X2) -> and(X1,X2) [22] and(X1,mark(X2)) -> and(X1,X2) [23] and(active(X1),X2) -> and(X1,X2) [24] and(X1,active(X2)) -> and(X1,X2) [25] if(mark(X1),X2,X3) -> if(X1,X2,X3) [26] if(X1,mark(X2),X3) -> if(X1,X2,X3) [27] if(X1,X2,mark(X3)) -> if(X1,X2,X3) [28] if(active(X1),X2,X3) -> if(X1,X2,X3) [29] if(X1,active(X2),X3) -> if(X1,X2,X3) [30] if(X1,X2,active(X3)) -> if(X1,X2,X3) [31] add(mark(X1),X2) -> add(X1,X2) [32] add(X1,mark(X2)) -> add(X1,X2) [33] add(active(X1),X2) -> add(X1,X2) [34] add(X1,active(X2)) -> add(X1,X2) [35] s(mark(X)) -> s(X) [36] s(active(X)) -> s(X) [37] first(mark(X1),X2) -> first(X1,X2) [38] first(X1,mark(X2)) -> first(X1,X2) [39] first(active(X1),X2) -> first(X1,X2) [40] first(X1,active(X2)) -> first(X1,X2) [41] cons(mark(X1),X2) -> cons(X1,X2) [42] cons(X1,mark(X2)) -> cons(X1,X2) [43] cons(active(X1),X2) -> cons(X1,X2) [44] cons(X1,active(X2)) -> cons(X1,X2) [45] from(mark(X)) -> from(X) [46] from(active(X)) -> from(X) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 8 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) ; Marked_mark(add(X1,X2)) >= Marked_mark(X1) ; Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(from(X)) >= Marked_active(from(X)) ; Marked_active(and(true,X)) >= Marked_mark(X) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(if(false,X,Y)) >= Marked_mark(Y) ; Marked_active(add(0,X)) >= Marked_mark(X) ; Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),X2,X3)) ; } { Marked_mark(add(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(add(X1,X2)) > Marked_active(add(mark(X1),X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(from(X)) > Marked_active(from(X)) ; } { Marked_active(and(true,X)) > Marked_mark(X) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(if(false,X,Y)) > Marked_mark(Y) ; } { Marked_active(add(0,X)) > Marked_mark(X) ; } { Marked_active(add(s(X),Y)) > Marked_mark(s(add(X,Y))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) constraint: Marked_mark(add(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(from(X)) >= Marked_active(from(X)) constraint: Marked_active(and(true,X)) >= Marked_mark(X) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(if(false,X,Y)) >= Marked_mark(Y) constraint: Marked_active(add(0,X)) >= Marked_mark(X) constraint: Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ; Marked_and(active(X1),X2) >= Marked_and(X1,X2) ; Marked_and(X1,mark(X2)) >= Marked_and(X1,X2) ; Marked_and(X1,active(X2)) >= Marked_and(X1,X2) ; } + Disjunctions:{ { Marked_and(mark(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(active(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(X1,mark(X2)) > Marked_and(X1,X2) ; } { Marked_and(X1,active(X2)) > Marked_and(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(active(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(X1,mark(X2)) >= Marked_and(X1,X2) constraint: Marked_and(X1,active(X2)) >= Marked_and(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(mark(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(active(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,mark(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === 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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_add(mark(X1),X2) >= Marked_add(X1,X2) ; Marked_add(active(X1),X2) >= Marked_add(X1,X2) ; Marked_add(X1,mark(X2)) >= Marked_add(X1,X2) ; Marked_add(X1,active(X2)) >= Marked_add(X1,X2) ; } + Disjunctions:{ { Marked_add(mark(X1),X2) > Marked_add(X1,X2) ; } { Marked_add(active(X1),X2) > Marked_add(X1,X2) ; } { Marked_add(X1,mark(X2)) > Marked_add(X1,X2) ; } { Marked_add(X1,active(X2)) > Marked_add(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_add(mark(X1),X2) >= Marked_add(X1,X2) constraint: Marked_add(active(X1),X2) >= Marked_add(X1,X2) constraint: Marked_add(X1,mark(X2)) >= Marked_add(X1,X2) constraint: Marked_add(X1,active(X2)) >= Marked_add(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(active(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(active(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_first(mark(X1),X2) >= Marked_first(X1,X2) ; Marked_first(active(X1),X2) >= Marked_first(X1,X2) ; Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) ; Marked_first(X1,active(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(mark(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(active(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(X1,mark(X2)) > Marked_first(X1,X2) ; } { Marked_first(X1,active(X2)) > Marked_first(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_first(mark(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(active(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) constraint: Marked_first(X1,active(X2)) >= Marked_first(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) ; Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(active(X1),X2) > Marked_cons(X1,X2) ; } { Marked_cons(X1,mark(X2)) > Marked_cons(X1,X2) ; } { Marked_cons(X1,active(X2)) > Marked_cons(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) constraint: Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_from(mark(X)) >= Marked_from(X) ; Marked_from(active(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(mark(X)) > Marked_from(X) ; } { Marked_from(active(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_from(mark(X)) >= Marked_from(X) constraint: Marked_from(active(X)) >= Marked_from(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) ; Marked_mark(add(X1,X2)) >= Marked_mark(X1) ; Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) ; Marked_mark(s(X)) >= Marked_active(s(X)) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) ; Marked_mark(from(X)) >= Marked_active(from(X)) ; Marked_active(and(true,X)) >= Marked_mark(X) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(add(0,X)) >= Marked_mark(X) ; Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),X2,X3)) ; } { Marked_mark(add(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(add(X1,X2)) > Marked_active(add(mark(X1),X2)) ; } { Marked_mark(s(X)) > Marked_active(s(X)) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(cons(X1,X2)) > Marked_active(cons(X1,X2)) ; } { Marked_mark(from(X)) > Marked_active(from(X)) ; } { Marked_active(and(true,X)) > Marked_mark(X) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(add(0,X)) > Marked_mark(X) ; } { Marked_active(add(s(X),Y)) > Marked_mark(s(add(X,Y))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) constraint: Marked_mark(add(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) constraint: Marked_mark(s(X)) >= Marked_active(s(X)) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(X1,X2)) constraint: Marked_mark(from(X)) >= Marked_active(from(X)) constraint: Marked_active(and(true,X)) >= Marked_mark(X) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(add(0,X)) >= Marked_mark(X) constraint: Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) ; Marked_mark(add(X1,X2)) >= Marked_mark(X1) ; Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) ; Marked_mark(from(X)) >= Marked_active(from(X)) ; Marked_active(and(true,X)) >= Marked_mark(X) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(add(0,X)) >= Marked_mark(X) ; Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) ; Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons(Y,first(X,Z))) ; Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(and(X1,X2)) > Marked_active(and(mark(X1),X2)) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),X2,X3)) ; } { Marked_mark(add(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(add(X1,X2)) > Marked_active(add(mark(X1),X2)) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(first(X1,X2)) > Marked_active(first(mark(X1),mark(X2))) ; } { Marked_mark(from(X)) > Marked_active(from(X)) ; } { Marked_active(and(true,X)) > Marked_mark(X) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(add(0,X)) > Marked_mark(X) ; } { Marked_active(add(s(X),Y)) > Marked_mark(s(add(X,Y))) ; } { Marked_active(first(s(X),cons(Y,Z))) > Marked_mark(cons(Y,first(X,Z))) ; } { Marked_active(from(X)) > Marked_mark(cons(X,from(s(X)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(and(X1,X2)) >= Marked_active(and(mark(X1),X2)) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) constraint: Marked_mark(add(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(add(X1,X2)) >= Marked_active(add(mark(X1),X2)) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(first(X1,X2)) >= Marked_active(first(mark(X1),mark(X2))) constraint: Marked_mark(from(X)) >= Marked_active(from(X)) constraint: Marked_active(and(true,X)) >= Marked_mark(X) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(add(0,X)) >= Marked_mark(X) constraint: Marked_active(add(s(X),Y)) >= Marked_mark(s(add(X,Y))) constraint: Marked_active(first(s(X),cons(Y,Z))) >= Marked_mark(cons( Y,first(X,Z))) constraint: Marked_active(from(X)) >= Marked_mark(cons(X,from(s(X)))) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(add(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(add(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(add(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(and(X1,X2)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; } + Disjunctions:{ { Marked_mark(and(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(and(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; } + Disjunctions:{ { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_mark(first(X1,X2)) >= Marked_mark(X1) ; Marked_mark(first(X1,X2)) >= Marked_mark(X2) ; } + Disjunctions:{ { Marked_mark(first(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(first(X1,X2)) > Marked_mark(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(first(X1,X2)) >= Marked_mark(X2) 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(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ; Marked_and(X1,mark(X2)) >= Marked_and(X1,X2) ; } + Disjunctions:{ { Marked_and(mark(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(X1,mark(X2)) > Marked_and(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(X1,mark(X2)) >= Marked_and(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(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(mark(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(active(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,mark(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } } === 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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(active(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } } === 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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) 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(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_add(active(X1),X2) >= Marked_add(X1,X2) ; Marked_add(X1,active(X2)) >= Marked_add(X1,X2) ; } + Disjunctions:{ { Marked_add(active(X1),X2) > Marked_add(X1,X2) ; } { Marked_add(X1,active(X2)) > Marked_add(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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_add(active(X1),X2) >= Marked_add(X1,X2) constraint: Marked_add(X1,active(X2)) >= Marked_add(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_first(active(X1),X2) >= Marked_first(X1,X2) ; Marked_first(X1,active(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(active(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(X1,active(X2)) > Marked_first(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_first(active(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(X1,active(X2)) >= Marked_first(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(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ; Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { 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(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) 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 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(and(X1,X2)) >= active(and(mark(X1),X2)) ; mark(true) >= active(true) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(add(X1,X2)) >= active(add(mark(X1),X2)) ; mark(0) >= active(0) ; mark(s(X)) >= active(s(X)) ; mark(nil) >= active(nil) ; mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) ; mark(cons(X1,X2)) >= active(cons(X1,X2)) ; mark(from(X)) >= active(from(X)) ; active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= and(X1,X2) ; and(active(X1),X2) >= and(X1,X2) ; and(X1,mark(X2)) >= and(X1,X2) ; and(X1,active(X2)) >= and(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; add(mark(X1),X2) >= add(X1,X2) ; add(active(X1),X2) >= add(X1,X2) ; add(X1,mark(X2)) >= add(X1,X2) ; add(X1,active(X2)) >= add(X1,X2) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; first(mark(X1),X2) >= first(X1,X2) ; first(active(X1),X2) >= first(X1,X2) ; first(X1,mark(X2)) >= first(X1,X2) ; first(X1,active(X2)) >= first(X1,X2) ; cons(mark(X1),X2) >= cons(X1,X2) ; cons(active(X1),X2) >= cons(X1,X2) ; cons(X1,mark(X2)) >= cons(X1,X2) ; cons(X1,active(X2)) >= cons(X1,X2) ; from(mark(X)) >= from(X) ; from(active(X)) >= from(X) ; Marked_from(active(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(active(X)) > Marked_from(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(and(X1,X2)) >= active(and(mark(X1),X2)) constraint: mark(true) >= active(true) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(add(X1,X2)) >= active(add(mark(X1),X2)) constraint: mark(0) >= active(0) constraint: mark(s(X)) >= active(s(X)) constraint: mark(nil) >= active(nil) constraint: mark(first(X1,X2)) >= active(first(mark(X1),mark(X2))) constraint: mark(cons(X1,X2)) >= active(cons(X1,X2)) constraint: mark(from(X)) >= active(from(X)) constraint: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= and(X1,X2) constraint: and(active(X1),X2) >= and(X1,X2) constraint: and(X1,mark(X2)) >= and(X1,X2) constraint: and(X1,active(X2)) >= and(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: add(mark(X1),X2) >= add(X1,X2) constraint: add(active(X1),X2) >= add(X1,X2) constraint: add(X1,mark(X2)) >= add(X1,X2) constraint: add(X1,active(X2)) >= add(X1,X2) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: first(mark(X1),X2) >= first(X1,X2) constraint: first(active(X1),X2) >= first(X1,X2) constraint: first(X1,mark(X2)) >= first(X1,X2) constraint: first(X1,active(X2)) >= first(X1,X2) constraint: cons(mark(X1),X2) >= cons(X1,X2) constraint: cons(active(X1),X2) >= cons(X1,X2) constraint: cons(X1,mark(X2)) >= cons(X1,X2) constraint: cons(X1,active(X2)) >= cons(X1,X2) constraint: from(mark(X)) >= from(X) constraint: from(active(X)) >= from(X) constraint: Marked_from(active(X)) >= Marked_from(X) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(and(true,X)) -> mark(X) [2] active(and(false,Y)) -> mark(false) [3] active(if(true,X,Y)) -> mark(X) [4] active(if(false,X,Y)) -> mark(Y) [5] active(add(0,X)) -> mark(X) [6] active(add(s(X),Y)) -> mark(s(add(X,Y))) [7] active(first(0,X)) -> mark(nil) [8] active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) [9] active(from(X)) -> mark(cons(X,from(s(X)))) [10] mark(and(X1,X2)) -> active(and(mark(X1),X2)) [11] mark(true) -> active(true) [12] mark(false) -> active(false) [13] mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) [14] mark(add(X1,X2)) -> active(add(mark(X1),X2)) [15] mark(0) -> active(0) [16] mark(s(X)) -> active(s(X)) [17] mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) [18] mark(nil) -> active(nil) [19] mark(cons(X1,X2)) -> active(cons(X1,X2)) [20] mark(from(X)) -> active(from(X)) [21] and(mark(X1),X2) -> and(X1,X2) [22] and(X1,mark(X2)) -> and(X1,X2) [23] and(active(X1),X2) -> and(X1,X2) [24] and(X1,active(X2)) -> and(X1,X2) [25] if(mark(X1),X2,X3) -> if(X1,X2,X3) [26] if(X1,mark(X2),X3) -> if(X1,X2,X3) [27] if(X1,X2,mark(X3)) -> if(X1,X2,X3) [28] if(active(X1),X2,X3) -> if(X1,X2,X3) [29] if(X1,active(X2),X3) -> if(X1,X2,X3) [30] if(X1,X2,active(X3)) -> if(X1,X2,X3) [31] add(mark(X1),X2) -> add(X1,X2) [32] add(X1,mark(X2)) -> add(X1,X2) [33] add(active(X1),X2) -> add(X1,X2) [34] add(X1,active(X2)) -> add(X1,X2) [35] s(mark(X)) -> s(X) [36] s(active(X)) -> s(X) [37] first(mark(X1),X2) -> first(X1,X2) [38] first(X1,mark(X2)) -> first(X1,X2) [39] first(active(X1),X2) -> first(X1,X2) [40] first(X1,active(X2)) -> first(X1,X2) [41] cons(mark(X1),X2) -> cons(X1,X2) [42] cons(X1,mark(X2)) -> cons(X1,X2) [43] cons(active(X1),X2) -> cons(X1,X2) [44] cons(X1,active(X2)) -> cons(X1,X2) [45] from(mark(X)) -> from(X) [46] from(active(X)) -> from(X) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ s ] (X0) = 0; [ false ] () = 1; [ Marked_mark ] (X0) = 2*X0; [ from ] (X0) = 0; [ and ] (X0,X1) = 3*X1 + 2*X0; [ first ] (X0,X1) = 1*X1 + 2*X0; [ add ] (X0,X1) = 3*X1 + 2*X0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 2*X0; [ Marked_active ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 0; [ false ] () = 0; [ Marked_mark ] (X0) = 2; [ from ] (X0) = 1; [ and ] (X0,X1) = 1; [ first ] (X0,X1) = 1; [ add ] (X0,X1) = 1; [ active ] (X0) = 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1; [ Marked_active ] (X0) = 2*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ s ] (X0) = 2; [ false ] () = 0; [ Marked_mark ] (X0) = 2*X0 + 2; [ from ] (X0) = 2; [ and ] (X0,X1) = 2*X1 + 1*X0; [ first ] (X0,X1) = 1*X1 + 1*X0; [ add ] (X0,X1) = 2*X1 + 2*X0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0; [ Marked_active ] (X0) = 2*X0; [ true ] () = 2; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; removing < Marked_active(from(X)),Marked_mark(cons(X,from(s(X))))>< Marked_mark(add(X1,X2)),Marked_active(add(mark(X1),X2))> [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ s ] (X0) = 0; [ false ] () = 0; [ Marked_mark ] (X0) = 3*X0; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 2*X1 + 2*X0; [ first ] (X0,X1) = 1*X1 + 2*X0; [ add ] (X0,X1) = 2*X1 + 1*X0 + 2; [ active ] (X0) = 1*X0; [ nil ] () = 1; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ s ] (X0) = 0; [ false ] () = 0; [ Marked_mark ] (X0) = 3*X0; [ from ] (X0) = 2*X0 + 2; [ and ] (X0,X1) = 2*X1 + 1*X0 + 2; [ first ] (X0,X1) = 1*X1 + 2*X0; [ add ] (X0,X1) = 3*X1; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0; [ s ] (X0) = 2; [ false ] () = 0; [ Marked_mark ] (X0) = 3*X0; [ from ] (X0) = 0; [ and ] (X0,X1) = 2*X1 + 2; [ first ] (X0,X1) = 2*X1 + 1*X0; [ add ] (X0,X1) = 3*X1 + 2*X0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0 + 1; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1*X0 + 0; [ s ] (X0) = 1*X0 + 0; [ false ] () = 3 + 0; [ Marked_mark ] (X0) = 3*X0 + 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 3*X0 + 2*X1 + 0; [ first ] (X0,X1) = 1 + 2*X0 + 2*X1 + 0; [ add ] (X0,X1) = 1*X1 + 0; [ active ] (X0) = 1*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X1 + 2*X2 + 0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1 + 0; [ 0 ] () = 1 + 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 3*X0; [ s ] (X0) = 2; [ false ] () = 2; [ from ] (X0) = 1*X0 + 3; [ and ] (X0,X1) = 2*X1 + 3; [ first ] (X0,X1) = 2; [ add ] (X0,X1) = 3*X1 + 2; [ active ] (X0) = 2*X0 + 2; [ nil ] () = 2; [ if ] (X0,X1,X2) = 2*X2 + 3*X1 + 3; [ true ] () = 3; [ Marked_and ] (X0,X1) = 3*X1 + 3*X0; [ cons ] (X0,X1) = 2; [ 0 ] () = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 2*X0 + 0; [ s ] (X0) = 0; [ false ] () = 2 + 0; [ from ] (X0) = 2*X0 + 0; [ and ] (X0,X1) = 3 + 2*X0 + 2*X1 + 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 3 + 3*X0 + 3*X1 + 0; [ active ] (X0) = 1 + 1*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X1 + 2*X2 + 0; [ true ] () = 1 + 0; [ Marked_and ] (X0,X1) = 3*X0 + 3*X1 + 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 0; [ false ] () = 1; [ from ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 2; [ Marked_if ] (X0,X1,X2) = 2*X2; [ first ] (X0,X1) = 3; [ add ] (X0,X1) = 2*X1; [ active ] (X0) = 2*X0 + 1; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 3; [ false ] () = 3; [ from ] (X0) = 1; [ and ] (X0,X1) = 2*X1 + 3*X0 + 2; [ Marked_if ] (X0,X1,X2) = 3*X1 + 3*X0; [ first ] (X0,X1) = 1*X1 + 1*X0 + 1; [ add ] (X0,X1) = 3*X1 + 2*X0 + 1; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ Marked_if ] (X0,X1,X2) = 3*X0 + 3*X1 + 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 0; [ active ] (X0) = 1 + 2*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 0; [ false ] () = 3; [ from ] (X0) = 2*X0 + 1; [ and ] (X0,X1) = 2*X1 + 3*X0 + 2; [ first ] (X0,X1) = 2*X0 + 2; [ add ] (X0,X1) = 2*X1 + 1; [ active ] (X0) = 1*X0; [ Marked_add ] (X0,X1) = 3*X1 + 3*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 2; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 0; [ active ] (X0) = 1 + 2*X0 + 0; [ Marked_add ] (X0,X1) = 3*X0 + 3*X1 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 2*X0 + 0; [ Marked_s ] (X0) = 3*X0 + 0; [ s ] (X0) = 0; [ false ] () = 1 + 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 2 + 2*X1 + 0; [ first ] (X0,X1) = 2 + 0; [ add ] (X0,X1) = 3*X1 + 0; [ active ] (X0) = 1 + 2*X0 + 0; [ nil ] () = 1 + 0; [ if ] (X0,X1,X2) = 2*X1 + 2*X2 + 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 2*X0 + 1; [ and ] (X0,X1) = 2*X1 + 1; [ first ] (X0,X1) = 2; [ add ] (X0,X1) = 3*X1 + 2; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ true ] () = 1; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; [ Marked_first ] (X0,X1) = 3*X1 + 3*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 0; [ active ] (X0) = 1 + 2*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ Marked_first ] (X0,X1) = 3*X0 + 3*X1 + 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 2*X0 + 1; [ and ] (X0,X1) = 2*X1 + 1; [ first ] (X0,X1) = 1; [ add ] (X0,X1) = 2*X1 + 2; [ Marked_cons ] (X0,X1) = 3*X1 + 3*X0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 2; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 0; [ Marked_cons ] (X0,X1) = 3*X0 + 3*X1 + 0; [ active ] (X0) = 1 + 2*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 1; [ s ] (X0) = 2; [ false ] () = 3; [ from ] (X0) = 1; [ and ] (X0,X1) = 2*X1 + 3*X0 + 2; [ first ] (X0,X1) = 1*X1 + 2*X0 + 2; [ add ] (X0,X1) = 2*X1 + 2*X0 + 1; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1; [ Marked_from ] (X0) = 3*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 2*X0 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 2*X0 + 0; [ and ] (X0,X1) = 2*X1 + 0; [ first ] (X0,X1) = 0; [ add ] (X0,X1) = 2*X1 + 0; [ active ] (X0) = 1 + 1*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X1 + 2*X2 + 0; [ Marked_from ] (X0) = 3*X0 + 0; [ true ] () = 1 + 0; [ cons ] (X0,X1) = 1*X1 + 0; [ 0 ] () = 0; ]} ]} ]} ]} ]} Cime worked for 3.259725 seconds (real time) Cime Exit Status: 0