- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(p(0)) -> mark(0) [2] active(p(s(X))) -> mark(X) [3] active(leq(0,Y)) -> mark(true) [4] active(leq(s(X),0)) -> mark(false) [5] active(leq(s(X),s(Y))) -> mark(leq(X,Y)) [6] active(if(true,X,Y)) -> mark(X) [7] active(if(false,X,Y)) -> mark(Y) [8] active(diff(X,Y)) -> mark(if(leq(X,Y),0,s(diff(p(X),Y)))) [9] mark(p(X)) -> active(p(mark(X))) [10] mark(0) -> active(0) [11] mark(s(X)) -> active(s(mark(X))) [12] mark(leq(X1,X2)) -> active(leq(mark(X1),mark(X2))) [13] mark(true) -> active(true) [14] mark(false) -> active(false) [15] mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) [16] mark(diff(X1,X2)) -> active(diff(mark(X1),mark(X2))) [17] p(mark(X)) -> p(X) [18] p(active(X)) -> p(X) [19] s(mark(X)) -> s(X) [20] s(active(X)) -> s(X) [21] leq(mark(X1),X2) -> leq(X1,X2) [22] leq(X1,mark(X2)) -> leq(X1,X2) [23] leq(active(X1),X2) -> leq(X1,X2) [24] leq(X1,active(X2)) -> leq(X1,X2) [25] if(mark(X1),X2,X3) -> if(X1,X2,X3) [26] if(X1,mark(X2),X3) -> if(X1,X2,X3) [27] if(X1,X2,mark(X3)) -> if(X1,X2,X3) [28] if(active(X1),X2,X3) -> if(X1,X2,X3) [29] if(X1,active(X2),X3) -> if(X1,X2,X3) [30] if(X1,X2,active(X3)) -> if(X1,X2,X3) [31] diff(mark(X1),X2) -> diff(X1,X2) [32] diff(X1,mark(X2)) -> diff(X1,X2) [33] diff(active(X1),X2) -> diff(X1,X2) [34] diff(X1,active(X2)) -> diff(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 6 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_mark(p(X)) >= Marked_mark(X) ; Marked_mark(p(X)) >= Marked_active(p(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(s(X)) >= Marked_active(s(mark(X))) ; Marked_mark(leq(X1,X2)) >= Marked_mark(X1) ; Marked_mark(leq(X1,X2)) >= Marked_mark(X2) ; Marked_mark(leq(X1,X2)) >= Marked_active(leq(mark(X1),mark(X2))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) ; Marked_mark(diff(X1,X2)) >= Marked_mark(X1) ; Marked_mark(diff(X1,X2)) >= Marked_mark(X2) ; Marked_mark(diff(X1,X2)) >= Marked_active(diff(mark(X1),mark(X2))) ; Marked_active(p(s(X))) >= Marked_mark(X) ; Marked_active(leq(s(X),s(Y))) >= Marked_mark(leq(X,Y)) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(if(false,X,Y)) >= Marked_mark(Y) ; Marked_active(diff(X,Y)) >= Marked_mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; } + Disjunctions:{ { Marked_mark(p(X)) > Marked_mark(X) ; } { Marked_mark(p(X)) > Marked_active(p(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(s(X)) > Marked_active(s(mark(X))) ; } { Marked_mark(leq(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(leq(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(leq(X1,X2)) > Marked_active(leq(mark(X1),mark(X2))) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),X2,X3)) ; } { Marked_mark(diff(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(diff(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(diff(X1,X2)) > Marked_active(diff(mark(X1),mark(X2))) ; } { Marked_active(p(s(X))) > Marked_mark(X) ; } { Marked_active(leq(s(X),s(Y))) > Marked_mark(leq(X,Y)) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(if(false,X,Y)) > Marked_mark(Y) ; } { Marked_active(diff(X,Y)) > Marked_mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_mark(p(X)) >= Marked_mark(X) constraint: Marked_mark(p(X)) >= Marked_active(p(mark(X))) constraint: Marked_mark(s(X)) >= Marked_mark(X) constraint: Marked_mark(s(X)) >= Marked_active(s(mark(X))) constraint: Marked_mark(leq(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(leq(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(leq(X1,X2)) >= Marked_active(leq(mark(X1),mark(X2))) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) constraint: Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) constraint: Marked_mark(diff(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(diff(X1,X2)) >= Marked_mark(X2) constraint: Marked_mark(diff(X1,X2)) >= Marked_active(diff(mark(X1),mark(X2))) constraint: Marked_active(p(s(X))) >= Marked_mark(X) constraint: Marked_active(leq(s(X),s(Y))) >= Marked_mark(leq(X,Y)) constraint: Marked_active(if(true,X,Y)) >= Marked_mark(X) constraint: Marked_active(if(false,X,Y)) >= Marked_mark(Y) constraint: Marked_active(diff(X,Y)) >= Marked_mark(if(leq(X,Y),0, s(diff(p(X),Y)))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_p(mark(X)) >= Marked_p(X) ; Marked_p(active(X)) >= Marked_p(X) ; } + Disjunctions:{ { Marked_p(mark(X)) > Marked_p(X) ; } { Marked_p(active(X)) > Marked_p(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_p(mark(X)) >= Marked_p(X) constraint: Marked_p(active(X)) >= Marked_p(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_s(mark(X)) >= Marked_s(X) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(mark(X)) > Marked_s(X) ; } { Marked_s(active(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_s(mark(X)) >= Marked_s(X) constraint: Marked_s(active(X)) >= Marked_s(X) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) ; Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) ; Marked_leq(X1,mark(X2)) >= Marked_leq(X1,X2) ; Marked_leq(X1,active(X2)) >= Marked_leq(X1,X2) ; } + Disjunctions:{ { Marked_leq(mark(X1),X2) > Marked_leq(X1,X2) ; } { Marked_leq(active(X1),X2) > Marked_leq(X1,X2) ; } { Marked_leq(X1,mark(X2)) > Marked_leq(X1,X2) ; } { Marked_leq(X1,active(X2)) > Marked_leq(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) constraint: Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) constraint: Marked_leq(X1,mark(X2)) >= Marked_leq(X1,X2) constraint: Marked_leq(X1,active(X2)) >= Marked_leq(X1,X2) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(mark(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(active(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,mark(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(mark(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) ; Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) ; Marked_diff(X1,mark(X2)) >= Marked_diff(X1,X2) ; Marked_diff(X1,active(X2)) >= Marked_diff(X1,X2) ; } + Disjunctions:{ { Marked_diff(mark(X1),X2) > Marked_diff(X1,X2) ; } { Marked_diff(active(X1),X2) > Marked_diff(X1,X2) ; } { Marked_diff(X1,mark(X2)) > Marked_diff(X1,X2) ; } { Marked_diff(X1,active(X2)) > Marked_diff(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) constraint: Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) constraint: Marked_diff(X1,mark(X2)) >= Marked_diff(X1,X2) constraint: Marked_diff(X1,active(X2)) >= Marked_diff(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_mark(p(X)) >= Marked_mark(X) ; Marked_mark(p(X)) >= Marked_active(p(mark(X))) ; Marked_mark(s(X)) >= Marked_mark(X) ; Marked_mark(leq(X1,X2)) >= Marked_mark(X1) ; Marked_mark(leq(X1,X2)) >= Marked_mark(X2) ; Marked_mark(leq(X1,X2)) >= Marked_active(leq(mark(X1),mark(X2))) ; Marked_mark(if(X1,X2,X3)) >= Marked_mark(X1) ; Marked_mark(if(X1,X2,X3)) >= Marked_active(if(mark(X1),X2,X3)) ; Marked_mark(diff(X1,X2)) >= Marked_mark(X1) ; Marked_mark(diff(X1,X2)) >= Marked_mark(X2) ; Marked_mark(diff(X1,X2)) >= Marked_active(diff(mark(X1),mark(X2))) ; Marked_active(p(s(X))) >= Marked_mark(X) ; Marked_active(leq(s(X),s(Y))) >= Marked_mark(leq(X,Y)) ; Marked_active(if(true,X,Y)) >= Marked_mark(X) ; Marked_active(if(false,X,Y)) >= Marked_mark(Y) ; Marked_active(diff(X,Y)) >= Marked_mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; } + Disjunctions:{ { Marked_mark(p(X)) > Marked_mark(X) ; } { Marked_mark(p(X)) > Marked_active(p(mark(X))) ; } { Marked_mark(s(X)) > Marked_mark(X) ; } { Marked_mark(leq(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(leq(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(leq(X1,X2)) > Marked_active(leq(mark(X1),mark(X2))) ; } { Marked_mark(if(X1,X2,X3)) > Marked_mark(X1) ; } { Marked_mark(if(X1,X2,X3)) > Marked_active(if(mark(X1),X2,X3)) ; } { Marked_mark(diff(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(diff(X1,X2)) > Marked_mark(X2) ; } { Marked_mark(diff(X1,X2)) > Marked_active(diff(mark(X1),mark(X2))) ; } { Marked_active(p(s(X))) > Marked_mark(X) ; } { Marked_active(leq(s(X),s(Y))) > Marked_mark(leq(X,Y)) ; } { Marked_active(if(true,X,Y)) > Marked_mark(X) ; } { Marked_active(if(false,X,Y)) > Marked_mark(Y) ; } { Marked_active(diff(X,Y)) > Marked_mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (ID_CRIT) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_p(active(X)) >= Marked_p(X) ; } + Disjunctions:{ { Marked_p(active(X)) > Marked_p(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_p(active(X)) >= Marked_p(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_s(active(X)) >= Marked_s(X) ; } + Disjunctions:{ { Marked_s(active(X)) > Marked_s(X) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_s(active(X)) >= Marked_s(X) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) ; Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) ; Marked_leq(X1,active(X2)) >= Marked_leq(X1,X2) ; } + Disjunctions:{ { Marked_leq(mark(X1),X2) > Marked_leq(X1,X2) ; } { Marked_leq(active(X1),X2) > Marked_leq(X1,X2) ; } { Marked_leq(X1,active(X2)) > Marked_leq(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) constraint: Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) constraint: Marked_leq(X1,active(X2)) >= Marked_leq(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) ; Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) ; } + Disjunctions:{ { Marked_leq(mark(X1),X2) > Marked_leq(X1,X2) ; } { Marked_leq(active(X1),X2) > Marked_leq(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_leq(mark(X1),X2) >= Marked_leq(X1,X2) constraint: Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) ; } + Disjunctions:{ { Marked_leq(active(X1),X2) > Marked_leq(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_leq(active(X1),X2) >= Marked_leq(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(active(X1),X2,X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,mark(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(active(X1),X2,X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(X1,mark(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(X1,mark(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(X1,active(X2),X3) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(X1,active(X2),X3) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(X1,X2,mark(X3)) > Marked_if(X1,X2,X3) ; } { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(X1,X2,mark(X3)) >= Marked_if(X1,X2,X3) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) ; } + Disjunctions:{ { Marked_if(X1,X2,active(X3)) > Marked_if(X1,X2,X3) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_if(X1,X2,active(X3)) >= Marked_if(X1,X2,X3) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) ; Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) ; Marked_diff(X1,active(X2)) >= Marked_diff(X1,X2) ; } + Disjunctions:{ { Marked_diff(mark(X1),X2) > Marked_diff(X1,X2) ; } { Marked_diff(active(X1),X2) > Marked_diff(X1,X2) ; } { Marked_diff(X1,active(X2)) > Marked_diff(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) constraint: Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) constraint: Marked_diff(X1,active(X2)) >= Marked_diff(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) ; Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) ; } + Disjunctions:{ { Marked_diff(mark(X1),X2) > Marked_diff(X1,X2) ; } { Marked_diff(active(X1),X2) > Marked_diff(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. Entering rpo_solver === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat solver returned === STOPING TIMER real === === STOPING TIMER virtual === No solution found for these parameters. === TIMER virtual : 50.000000 === trying sub matrices of size: 1 Matrix interpretation constraints generated. Search parameters: LINEAR MATRIX 3x3 (strict=1x1) ; time limit: 50.. Termination constraints generated. Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 50.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_diff(mark(X1),X2) >= Marked_diff(X1,X2) constraint: Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(0) >= active(0) ; mark(p(X)) >= active(p(mark(X))) ; mark(s(X)) >= active(s(mark(X))) ; mark(true) >= active(true) ; mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) ; mark(false) >= active(false) ; mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) ; mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) ; active(p(0)) >= mark(0) ; active(p(s(X))) >= mark(X) ; active(leq(0,Y)) >= mark(true) ; active(leq(s(X),0)) >= mark(false) ; active(leq(s(X),s(Y))) >= mark(leq(X,Y)) ; active(if(true,X,Y)) >= mark(X) ; active(if(false,X,Y)) >= mark(Y) ; active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) ; p(mark(X)) >= p(X) ; p(active(X)) >= p(X) ; s(mark(X)) >= s(X) ; s(active(X)) >= s(X) ; leq(mark(X1),X2) >= leq(X1,X2) ; leq(active(X1),X2) >= leq(X1,X2) ; leq(X1,mark(X2)) >= leq(X1,X2) ; leq(X1,active(X2)) >= leq(X1,X2) ; if(mark(X1),X2,X3) >= if(X1,X2,X3) ; if(active(X1),X2,X3) >= if(X1,X2,X3) ; if(X1,mark(X2),X3) >= if(X1,X2,X3) ; if(X1,active(X2),X3) >= if(X1,X2,X3) ; if(X1,X2,mark(X3)) >= if(X1,X2,X3) ; if(X1,X2,active(X3)) >= if(X1,X2,X3) ; diff(mark(X1),X2) >= diff(X1,X2) ; diff(active(X1),X2) >= diff(X1,X2) ; diff(X1,mark(X2)) >= diff(X1,X2) ; diff(X1,active(X2)) >= diff(X1,X2) ; Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) ; } + Disjunctions:{ { Marked_diff(active(X1),X2) > Marked_diff(X1,X2) ; } } === TIMER virtual : 10.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 10.000000 === === STOPING TIMER real === Sat solver returned Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: mark(0) >= active(0) constraint: mark(p(X)) >= active(p(mark(X))) constraint: mark(s(X)) >= active(s(mark(X))) constraint: mark(true) >= active(true) constraint: mark(leq(X1,X2)) >= active(leq(mark(X1),mark(X2))) constraint: mark(false) >= active(false) constraint: mark(if(X1,X2,X3)) >= active(if(mark(X1),X2,X3)) constraint: mark(diff(X1,X2)) >= active(diff(mark(X1),mark(X2))) constraint: active(p(0)) >= mark(0) constraint: active(p(s(X))) >= mark(X) constraint: active(leq(0,Y)) >= mark(true) constraint: active(leq(s(X),0)) >= mark(false) constraint: active(leq(s(X),s(Y))) >= mark(leq(X,Y)) constraint: active(if(true,X,Y)) >= mark(X) constraint: active(if(false,X,Y)) >= mark(Y) constraint: active(diff(X,Y)) >= mark(if(leq(X,Y),0,s(diff(p(X),Y)))) constraint: p(mark(X)) >= p(X) constraint: p(active(X)) >= p(X) constraint: s(mark(X)) >= s(X) constraint: s(active(X)) >= s(X) constraint: leq(mark(X1),X2) >= leq(X1,X2) constraint: leq(active(X1),X2) >= leq(X1,X2) constraint: leq(X1,mark(X2)) >= leq(X1,X2) constraint: leq(X1,active(X2)) >= leq(X1,X2) constraint: if(mark(X1),X2,X3) >= if(X1,X2,X3) constraint: if(active(X1),X2,X3) >= if(X1,X2,X3) constraint: if(X1,mark(X2),X3) >= if(X1,X2,X3) constraint: if(X1,active(X2),X3) >= if(X1,X2,X3) constraint: if(X1,X2,mark(X3)) >= if(X1,X2,X3) constraint: if(X1,X2,active(X3)) >= if(X1,X2,X3) constraint: diff(mark(X1),X2) >= diff(X1,X2) constraint: diff(active(X1),X2) >= diff(X1,X2) constraint: diff(X1,mark(X2)) >= diff(X1,X2) constraint: diff(X1,active(X2)) >= diff(X1,X2) constraint: Marked_diff(active(X1),X2) >= Marked_diff(X1,X2) APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 74.447725 seconds (real time) Cime Exit Status: 0