- : 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] active(and(X1,X2)) -> and(active(X1),X2) [11] active(if(X1,X2,X3)) -> if(active(X1),X2,X3) [12] active(add(X1,X2)) -> add(active(X1),X2) [13] active(first(X1,X2)) -> first(active(X1),X2) [14] active(first(X1,X2)) -> first(X1,active(X2)) [15] and(mark(X1),X2) -> mark(and(X1,X2)) [16] if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) [17] add(mark(X1),X2) -> mark(add(X1,X2)) [18] first(mark(X1),X2) -> mark(first(X1,X2)) [19] first(X1,mark(X2)) -> mark(first(X1,X2)) [20] proper(and(X1,X2)) -> and(proper(X1),proper(X2)) [21] proper(true) -> ok(true) [22] proper(false) -> ok(false) [23] proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) [24] proper(add(X1,X2)) -> add(proper(X1),proper(X2)) [25] proper(0) -> ok(0) [26] proper(s(X)) -> s(proper(X)) [27] proper(first(X1,X2)) -> first(proper(X1),proper(X2)) [28] proper(nil) -> ok(nil) [29] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [30] proper(from(X)) -> from(proper(X)) [31] and(ok(X1),ok(X2)) -> ok(and(X1,X2)) [32] if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) [33] add(ok(X1),ok(X2)) -> ok(add(X1,X2)) [34] s(ok(X)) -> ok(s(X)) [35] first(ok(X1),ok(X2)) -> ok(first(X1,X2)) [36] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [37] from(ok(X)) -> ok(from(X)) [38] top(mark(X)) -> top(proper(X)) [39] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 10 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } { --> } { --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) >= Marked_top(proper(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(mark(X)) > Marked_top(proper(X)) ; } { Marked_top(ok(X)) > Marked_top(active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(mark(X)) >= Marked_top(proper(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(and(X1,X2)) >= Marked_proper(X1) ; Marked_proper(and(X1,X2)) >= Marked_proper(X2) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(s(X)) >= Marked_proper(X) ; Marked_proper(first(X1,X2)) >= Marked_proper(X1) ; Marked_proper(first(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(and(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(and(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X1) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X2) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X3) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(s(X)) > Marked_proper(X) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(and(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(and(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(s(X)) >= Marked_proper(X) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(and(X1,X2)) >= Marked_active(X1) ; Marked_active(if(X1,X2,X3)) >= Marked_active(X1) ; Marked_active(add(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X2) ; } + Disjunctions:{ { Marked_active(and(X1,X2)) > Marked_active(X1) ; } { Marked_active(if(X1,X2,X3)) > Marked_active(X1) ; } { Marked_active(add(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(and(X1,X2)) >= Marked_active(X1) constraint: Marked_active(if(X1,X2,X3)) >= Marked_active(X1) constraint: Marked_active(add(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2) ; } + Disjunctions:{ { Marked_cons(ok(X1),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_from(ok(X)) >= Marked_from(X) ; } + Disjunctions:{ { Marked_from(ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_from(ok(X)) >= Marked_from(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_s(ok(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_s(ok(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ; Marked_and(ok(X1),ok(X2)) >= Marked_and(X1,X2) ; } + Disjunctions:{ { Marked_and(mark(X1),X2) > Marked_and(X1,X2) ; } { Marked_and(ok(X1),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_and(mark(X1),X2) >= Marked_and(X1,X2) constraint: Marked_and(ok(X1),ok(X2)) >= Marked_and(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(ok(X1),ok(X2),ok(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(mark(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(ok(X1),ok(X2),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(ok(X1),ok(X2),ok(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_add(mark(X1),X2) >= Marked_add(X1,X2) ; Marked_add(ok(X1),ok(X2)) >= Marked_add(X1,X2) ; } + Disjunctions:{ { Marked_add(mark(X1),X2) > Marked_add(X1,X2) ; } { Marked_add(ok(X1),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_add(mark(X1),X2) >= Marked_add(X1,X2) constraint: Marked_add(ok(X1),ok(X2)) >= Marked_add(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_first(mark(X1),X2) >= Marked_first(X1,X2) ; Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) ; Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(mark(X1),X2) > Marked_first(X1,X2) ; } { Marked_first(ok(X1),ok(X2)) > Marked_first(X1,X2) ; } { Marked_first(X1,mark(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_first(mark(X1),X2) >= Marked_first(X1,X2) constraint: Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) constraint: Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(ok(X)) > Marked_top(active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(s(X)) >= Marked_proper(X) ; Marked_proper(first(X1,X2)) >= Marked_proper(X1) ; Marked_proper(first(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(if(X1,X2,X3)) > Marked_proper(X1) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X2) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X3) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(s(X)) > Marked_proper(X) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(s(X)) >= Marked_proper(X) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) ; Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(first(X1,X2)) >= Marked_proper(X1) ; Marked_proper(first(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(if(X1,X2,X3)) > Marked_proper(X1) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X2) ; } { Marked_proper(if(X1,X2,X3)) > Marked_proper(X3) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X1) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X2) constraint: Marked_proper(if(X1,X2,X3)) >= Marked_proper(X3) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(first(X1,X2)) >= Marked_proper(X1) ; Marked_proper(first(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(first(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(first(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ; Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(cons(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; Marked_proper(from(X)) >= Marked_proper(X) ; } + Disjunctions:{ { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(X2) ; } { Marked_proper(from(X)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X2) constraint: Marked_proper(from(X)) >= Marked_proper(X) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_proper(add(X1,X2)) >= Marked_proper(X1) ; Marked_proper(add(X1,X2)) >= Marked_proper(X2) ; } + Disjunctions:{ { Marked_proper(add(X1,X2)) > Marked_proper(X1) ; } { Marked_proper(add(X1,X2)) > Marked_proper(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(X1) constraint: Marked_proper(add(X1,X2)) >= Marked_proper(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: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(and(X1,X2)) >= Marked_active(X1) ; Marked_active(if(X1,X2,X3)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X2) ; } + Disjunctions:{ { Marked_active(and(X1,X2)) > Marked_active(X1) ; } { Marked_active(if(X1,X2,X3)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(and(X1,X2)) >= Marked_active(X1) constraint: Marked_active(if(X1,X2,X3)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(and(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X2) ; } + Disjunctions:{ { Marked_active(and(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(and(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_active(first(X1,X2)) >= Marked_active(X1) ; Marked_active(first(X1,X2)) >= Marked_active(X2) ; } + Disjunctions:{ { Marked_active(first(X1,X2)) > Marked_active(X1) ; } { Marked_active(first(X1,X2)) > Marked_active(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_active(first(X1,X2)) >= Marked_active(X1) constraint: Marked_active(first(X1,X2)) >= Marked_active(X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_and(mark(X1),X2) >= Marked_and(X1,X2) ; } + Disjunctions:{ { Marked_and(mark(X1),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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_and(mark(X1),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: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_if(ok(X1),ok(X2),ok(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(ok(X1),ok(X2),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_if(ok(X1),ok(X2),ok(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: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_add(mark(X1),X2) >= Marked_add(X1,X2) ; } + Disjunctions:{ { Marked_add(mark(X1),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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_add(mark(X1),X2) >= Marked_add(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: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) ; Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(ok(X1),ok(X2)) > Marked_first(X1,X2) ; } { Marked_first(X1,mark(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) constraint: Marked_first(X1,mark(X2)) >= Marked_first(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { active(and(true,X)) >= mark(X) ; active(and(false,Y)) >= mark(false) ; active(and(X1,X2)) >= and(active(X1),X2) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(if(X1,X2,X3)) >= if(active(X1),X2,X3) ; active(add(0,X)) >= mark(X) ; active(add(s(X),Y)) >= mark(s(add(X,Y))) ; active(add(X1,X2)) >= add(active(X1),X2) ; active(first(0,X)) >= mark(nil) ; active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) ; active(first(X1,X2)) >= first(active(X1),X2) ; active(first(X1,X2)) >= first(X1,active(X2)) ; active(from(X)) >= mark(cons(X,from(s(X)))) ; and(mark(X1),X2) >= mark(and(X1,X2)) ; and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ; if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) ; if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) ; add(mark(X1),X2) >= mark(add(X1,X2)) ; add(ok(X1),ok(X2)) >= ok(add(X1,X2)) ; s(ok(X)) >= ok(s(X)) ; first(mark(X1),X2) >= mark(first(X1,X2)) ; first(ok(X1),ok(X2)) >= ok(first(X1,X2)) ; first(X1,mark(X2)) >= mark(first(X1,X2)) ; cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ; from(ok(X)) >= ok(from(X)) ; proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ; proper(true) >= ok(true) ; proper(false) >= ok(false) ; proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) ; proper(add(X1,X2)) >= add(proper(X1),proper(X2)) ; proper(0) >= ok(0) ; proper(s(X)) >= s(proper(X)) ; proper(nil) >= ok(nil) ; proper(first(X1,X2)) >= first(proper(X1),proper(X2)) ; proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ; proper(from(X)) >= from(proper(X)) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) ; } + Disjunctions:{ { Marked_first(ok(X1),ok(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: active(and(true,X)) >= mark(X) constraint: active(and(false,Y)) >= mark(false) constraint: active(and(X1,X2)) >= and(active(X1),X2) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(if(X1,X2,X3)) >= if(active(X1),X2,X3) constraint: active(add(0,X)) >= mark(X) constraint: active(add(s(X),Y)) >= mark(s(add(X,Y))) constraint: active(add(X1,X2)) >= add(active(X1),X2) constraint: active(first(0,X)) >= mark(nil) constraint: active(first(s(X),cons(Y,Z))) >= mark(cons(Y,first(X,Z))) constraint: active(first(X1,X2)) >= first(active(X1),X2) constraint: active(first(X1,X2)) >= first(X1,active(X2)) constraint: active(from(X)) >= mark(cons(X,from(s(X)))) constraint: and(mark(X1),X2) >= mark(and(X1,X2)) constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2)) constraint: if(mark(X1),X2,X3) >= mark(if(X1,X2,X3)) constraint: if(ok(X1),ok(X2),ok(X3)) >= ok(if(X1,X2,X3)) constraint: add(mark(X1),X2) >= mark(add(X1,X2)) constraint: add(ok(X1),ok(X2)) >= ok(add(X1,X2)) constraint: s(ok(X)) >= ok(s(X)) constraint: first(mark(X1),X2) >= mark(first(X1,X2)) constraint: first(ok(X1),ok(X2)) >= ok(first(X1,X2)) constraint: first(X1,mark(X2)) >= mark(first(X1,X2)) constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) constraint: from(ok(X)) >= ok(from(X)) constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2)) constraint: proper(true) >= ok(true) constraint: proper(false) >= ok(false) constraint: proper(if(X1,X2,X3)) >= if(proper(X1),proper(X2),proper(X3)) constraint: proper(add(X1,X2)) >= add(proper(X1),proper(X2)) constraint: proper(0) >= ok(0) constraint: proper(s(X)) >= s(proper(X)) constraint: proper(nil) >= ok(nil) constraint: proper(first(X1,X2)) >= first(proper(X1),proper(X2)) constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) constraint: proper(from(X)) >= from(proper(X)) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_first(ok(X1),ok(X2)) >= Marked_first(X1,X2) 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] active(and(X1,X2)) -> and(active(X1),X2) [11] active(if(X1,X2,X3)) -> if(active(X1),X2,X3) [12] active(add(X1,X2)) -> add(active(X1),X2) [13] active(first(X1,X2)) -> first(active(X1),X2) [14] active(first(X1,X2)) -> first(X1,active(X2)) [15] and(mark(X1),X2) -> mark(and(X1,X2)) [16] if(mark(X1),X2,X3) -> mark(if(X1,X2,X3)) [17] add(mark(X1),X2) -> mark(add(X1,X2)) [18] first(mark(X1),X2) -> mark(first(X1,X2)) [19] first(X1,mark(X2)) -> mark(first(X1,X2)) [20] proper(and(X1,X2)) -> and(proper(X1),proper(X2)) [21] proper(true) -> ok(true) [22] proper(false) -> ok(false) [23] proper(if(X1,X2,X3)) -> if(proper(X1),proper(X2),proper(X3)) [24] proper(add(X1,X2)) -> add(proper(X1),proper(X2)) [25] proper(0) -> ok(0) [26] proper(s(X)) -> s(proper(X)) [27] proper(first(X1,X2)) -> first(proper(X1),proper(X2)) [28] proper(nil) -> ok(nil) [29] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) [30] proper(from(X)) -> from(proper(X)) [31] and(ok(X1),ok(X2)) -> ok(and(X1,X2)) [32] if(ok(X1),ok(X2),ok(X3)) -> ok(if(X1,X2,X3)) [33] add(ok(X1),ok(X2)) -> ok(add(X1,X2)) [34] s(ok(X)) -> ok(s(X)) [35] first(ok(X1),ok(X2)) -> ok(first(X1,X2)) [36] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) [37] from(ok(X)) -> ok(from(X)) [38] top(mark(X)) -> top(proper(X)) [39] top(ok(X)) -> top(active(X)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 1; [ Marked_top ] (X0) = 2*X0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 1; [ and ] (X0,X1) = 2*X1 + 2*X0 + 1; [ first ] (X0,X1) = 1*X1 + 1*X0 + 1; [ add ] (X0,X1) = 1*X1 + 1*X0 + 2; [ ok ] (X0) = 1*X0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0 + 2; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ Marked_top ] (X0) = 2*X0 + 0; [ s ] (X0) = 3*X0 + 0; [ false ] () = 2 + 0; [ from ] (X0) = 2*X0 + 0; [ and ] (X0,X1) = 2*X1 + 0; [ first ] (X0,X1) = 2*X0 + 0; [ add ] (X0,X1) = 2*X0 + 0; [ ok ] (X0) = 2 + 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ nil ] () = 3 + 0; [ if ] (X0,X1,X2) = 2 + 3*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 2*X0 + 0; [ 0 ] () = 3 + 0; [ top ] (X0) = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ s ] (X0) = 1*X0; [ false ] () = 1; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 2*X0 + 2; [ Marked_proper ] (X0) = 3*X0; [ first ] (X0,X1) = 2*X1 + 1*X0; [ add ] (X0,X1) = 1*X1 + 2*X0; [ ok ] (X0) = 0; [ active ] (X0) = 2*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 1*X1 + 1*X0; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1 + 2*X0; [ 0 ] () = 1; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 2; [ false ] () = 0; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 3*X0; [ first ] (X0,X1) = 2*X1 + 1*X0; [ add ] (X0,X1) = 1*X1 + 2*X0; [ ok ] (X0) = 0; [ active ] (X0) = 2*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 2*X1 + 2*X0; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1 + 3*X0; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 1*X0; [ first ] (X0,X1) = 3*X1 + 1*X0; [ add ] (X0,X1) = 2*X1 + 1*X0; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 2*X1 + 1*X0 + 2; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1 + 2*X0; [ 0 ] () = 1; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 1*X0; [ false ] () = 0; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 3*X0; [ first ] (X0,X1) = 2*X1 + 1*X0 + 2; [ add ] (X0,X1) = 2*X1 + 1*X0; [ ok ] (X0) = 0; [ active ] (X0) = 2*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ proper ] (X0) = 1*X0; [ true ] () = 2; [ cons ] (X0,X1) = 1*X1 + 2*X0; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0; [ false ] () = 2; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 3*X0; [ first ] (X0,X1) = 1*X0; [ add ] (X0,X1) = 2*X1 + 1*X0; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ nil ] () = 1; [ if ] (X0,X1,X2) = 0; [ proper ] (X0) = 1*X0; [ true ] () = 2; [ cons ] (X0,X1) = 1*X1 + 1*X0 + 2; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2; [ false ] () = 0; [ from ] (X0) = 2*X0 + 1; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 3*X0; [ first ] (X0,X1) = 2*X0; [ add ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 0; [ false ] () = 2 + 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ Marked_proper ] (X0) = 3*X0 + 0; [ first ] (X0,X1) = 2*X1 + 0; [ add ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 0; [ proper ] (X0) = 1*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 1*X0 + 0; [ 0 ] () = 0; [ top ] (X0) = 0; ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 2*X0; [ first ] (X0,X1) = 2*X1 + 2*X0; [ add ] (X0,X1) = 2*X1 + 2*X0 + 2; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 2; [ if ] (X0,X1,X2) = 1*X0; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X0 + 1; [ 0 ] () = 2; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 1*X0; [ first ] (X0,X1) = 2*X1 + 2*X0; [ add ] (X0,X1) = 2*X1 + 2*X0; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X0 + 2; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0; [ s ] (X0) = 1*X0; [ false ] () = 0; [ from ] (X0) = 2; [ and ] (X0,X1) = 1*X1 + 1*X0 + 1; [ first ] (X0,X1) = 1*X1 + 2*X0; [ add ] (X0,X1) = 1*X1; [ ok ] (X0) = 0; [ active ] (X0) = 1*X0; [ Marked_active ] (X0) = 3*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 1*X1; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1; [ 0 ] () = 2; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 0; [ false ] () = 2 + 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 0; [ first ] (X0,X1) = 1 + 2*X0 + 1*X1 + 0; [ add ] (X0,X1) = 0; [ ok ] (X0) = 0; [ active ] (X0) = 2*X0 + 0; [ Marked_active ] (X0) = 3*X0 + 0; [ nil ] () = 2 + 0; [ if ] (X0,X1,X2) = 0; [ proper ] (X0) = 1*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 1*X0 + 1*X1 + 0; [ 0 ] () = 0; [ top ] (X0) = 0; ]} ]} ]} ]} ]} ]} ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 0; [ false ] () = 2 + 0; [ Marked_cons ] (X0,X1) = 1*X1 + 0; [ from ] (X0) = 1*X0 + 0; [ and ] (X0,X1) = 2*X1 + 0; [ first ] (X0,X1) = 2*X0 + 0; [ add ] (X0,X1) = 2 + 3*X1 + 0; [ ok ] (X0) = 1 + 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ nil ] () = 3 + 0; [ if ] (X0,X1,X2) = 2*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 2*X0 + 0; [ 0 ] () = 2 + 0; [ top ] (X0) = 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 0; [ false ] () = 3 + 0; [ from ] (X0) = 1*X0 + 0; [ and ] (X0,X1) = 1*X1 + 0; [ first ] (X0,X1) = 2*X0 + 0; [ add ] (X0,X1) = 3*X0 + 1*X1 + 0; [ ok ] (X0) = 2 + 2*X0 + 0; [ active ] (X0) = 1*X0 + 0; [ nil ] () = 2 + 0; [ if ] (X0,X1,X2) = 2*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 2 + 0; [ Marked_from ] (X0) = 3*X0 + 0; [ cons ] (X0,X1) = 2*X0 + 0; [ 0 ] () = 2 + 0; [ top ] (X0) = 0; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2 + 2*X0 + 0; [ false ] () = 0; [ from ] (X0) = 2 + 2*X0 + 0; [ and ] (X0,X1) = 1*X1 + 0; [ first ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ add ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; [ Marked_s ] (X0) = 3*X0 + 0; [ ok ] (X0) = 2 + 2*X0 + 0; [ active ] (X0) = 2 + 2*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2 + 2*X0 + 0; [ proper ] (X0) = 2 + 3*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 1*X0 + 0; [ 0 ] () = 2 + 0; [ top ] (X0) = 0; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 1; [ false ] () = 2; [ from ] (X0) = 2*X0 + 2; [ and ] (X0,X1) = 1*X1 + 1*X0 + 2; [ first ] (X0,X1) = 2*X0; [ add ] (X0,X1) = 2*X0; [ ok ] (X0) = 1*X0 + 1; [ active ] (X0) = 1*X0; [ nil ] () = 1; [ Marked_and ] (X0,X1) = 1*X1; [ if ] (X0,X1,X2) = 3*X2 + 1*X1 + 2*X0 + 2; [ proper ] (X0) = 2*X0; [ true ] () = 1; [ cons ] (X0,X1) = 3*X1 + 3*X0 + 2; [ 0 ] () = 2; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 1*X0 + 1*X1 + 0; [ first ] (X0,X1) = 1*X0 + 1*X1 + 0; [ add ] (X0,X1) = 1*X0 + 2*X1 + 0; [ ok ] (X0) = 0; [ active ] (X0) = 2 + 1*X0 + 0; [ nil ] () = 1 + 0; [ Marked_and ] (X0,X1) = 3*X0 + 0; [ if ] (X0,X1,X2) = 1*X0 + 1*X1 + 1*X2 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 2 + 0; [ top ] (X0) = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 1; [ s ] (X0) = 0; [ Marked_if ] (X0,X1,X2) = 1*X0; [ false ] () = 0; [ from ] (X0) = 2*X0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ first ] (X0,X1) = 1*X1 + 1*X0; [ add ] (X0,X1) = 3*X1 + 1*X0; [ ok ] (X0) = 2*X0; [ active ] (X0) = 2*X0 + 2; [ nil ] () = 0; [ if ] (X0,X1,X2) = 2*X2 + 2*X1 + 1*X0; [ proper ] (X0) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 2*X0; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 1*X0 + 0; [ Marked_if ] (X0,X1,X2) = 1*X0 + 0; [ false ] () = 2 + 0; [ from ] (X0) = 1*X0 + 0; [ and ] (X0,X1) = 2*X0 + 2*X1 + 0; [ first ] (X0,X1) = 2*X0 + 0; [ add ] (X0,X1) = 1*X0 + 0; [ ok ] (X0) = 1 + 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ nil ] () = 1 + 0; [ if ] (X0,X1,X2) = 2*X0 + 3*X1 + 3*X2 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 2*X0 + 0; [ 0 ] () = 1 + 0; [ top ] (X0) = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 2; [ false ] () = 2; [ from ] (X0) = 2*X0 + 2; [ and ] (X0,X1) = 1*X1 + 2; [ first ] (X0,X1) = 2*X0; [ add ] (X0,X1) = 3*X0 + 1; [ ok ] (X0) = 1*X0 + 1; [ active ] (X0) = 1*X0; [ nil ] () = 1; [ if ] (X0,X1,X2) = 3*X2 + 1*X1 + 2*X0 + 2; [ proper ] (X0) = 2*X0; [ true ] () = 1; [ cons ] (X0,X1) = 3*X1 + 3*X0 + 2; [ 0 ] () = 1; [ Marked_add ] (X0,X1) = 1*X1; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 1 + 1*X0 + 0; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 2*X0 + 0; [ and ] (X0,X1) = 1*X0 + 1*X1 + 0; [ first ] (X0,X1) = 1*X0 + 1*X1 + 0; [ add ] (X0,X1) = 1*X0 + 2*X1 + 0; [ ok ] (X0) = 0; [ active ] (X0) = 1 + 1*X0 + 0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X0 + 1*X1 + 1*X2 + 0; [ proper ] (X0) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ Marked_add ] (X0,X1) = 3*X0 + 0; [ top ] (X0) = 0; ]} ]} ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 2; [ s ] (X0) = 0; [ false ] () = 0; [ from ] (X0) = 0; [ and ] (X0,X1) = 1*X1 + 1*X0; [ first ] (X0,X1) = 1*X1 + 1*X0; [ add ] (X0,X1) = 2*X1 + 1*X0; [ ok ] (X0) = 2*X0; [ active ] (X0) = 1*X0 + 2; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0; [ Marked_first ] (X0,X1) = 1*X0; [ proper ] (X0) = 0; [ true ] () = 0; [ cons ] (X0,X1) = 0; [ 0 ] () = 0; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 1*X0 + 2; [ s ] (X0) = 2*X0 + 2; [ false ] () = 0; [ from ] (X0) = 2; [ and ] (X0,X1) = 2*X1 + 2*X0 + 1; [ first ] (X0,X1) = 2*X1 + 2*X0; [ add ] (X0,X1) = 1*X1 + 2*X0; [ ok ] (X0) = 1*X0; [ active ] (X0) = 2*X0; [ nil ] () = 0; [ if ] (X0,X1,X2) = 1*X2 + 1*X1 + 1*X0 + 1; [ Marked_first ] (X0,X1) = 2*X1; [ proper ] (X0) = 1*X0; [ true ] () = 0; [ cons ] (X0,X1) = 1*X1; [ 0 ] () = 1; [ top ] (X0) = 0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 0; [ s ] (X0) = 2*X0 + 0; [ false ] () = 2 + 0; [ from ] (X0) = 1 + 3*X0 + 0; [ and ] (X0,X1) = 2*X1 + 0; [ first ] (X0,X1) = 2*X0 + 0; [ add ] (X0,X1) = 3 + 2*X0 + 2*X1 + 0; [ ok ] (X0) = 1 + 2*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ nil ] () = 1 + 0; [ if ] (X0,X1,X2) = 2*X1 + 0; [ Marked_first ] (X0,X1) = 1*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ true ] () = 2 + 0; [ cons ] (X0,X1) = 1*X1 + 0; [ 0 ] () = 3 + 0; [ top ] (X0) = 0; ]} ]} ]} ]} ]} ]} ]} Cime worked for 4.110170 seconds (real time) Cime Exit Status: 0