- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] cond1(true,x,y) -> cond2(gr(x,y),x,y) [2] cond2(true,x,y) -> cond3(gr(x,0),x,y) [3] cond2(false,x,y) -> cond4(gr(y,0),x,y) [4] cond3(true,x,y) -> cond3(gr(x,0),p(x),y) [5] cond3(false,x,y) -> cond1(and(gr(x,0),gr(y,0)),x,y) [6] cond4(true,x,y) -> cond4(gr(y,0),x,p(y)) [7] cond4(false,x,y) -> cond1(and(gr(x,0),gr(y,0)),x,y) [8] gr(0,x) -> false [9] gr(s(x),0) -> true [10] gr(s(x),s(y)) -> gr(x,y) [11] and(true,true) -> true [12] and(false,x) -> false [13] and(x,false) -> false [14] p(0) -> 0 [15] p(s(x)) -> x Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { cond2(true,x,y) >= cond3(gr(x,0),x,y) ; cond2(false,x,y) >= cond4(gr(y,0),x,y) ; gr(0,x) >= false ; gr(s(x),0) >= true ; gr(s(x),s(y)) >= gr(x,y) ; cond1(true,x,y) >= cond2(gr(x,y),x,y) ; cond3(true,x,y) >= cond3(gr(x,0),p(x),y) ; cond3(false,x,y) >= cond1(and(gr(x,0),gr(y,0)),x,y) ; cond4(true,x,y) >= cond4(gr(y,0),x,p(y)) ; cond4(false,x,y) >= cond1(and(gr(x,0),gr(y,0)),x,y) ; p(0) >= 0 ; p(s(x)) >= x ; and(true,true) >= true ; and(false,x) >= false ; and(x,false) >= false ; Marked_cond4(true,x,y) >= Marked_cond4(gr(y,0),x,p(y)) ; Marked_cond4(false,x,y) >= Marked_cond1(and(gr(x,0),gr(y,0)),x,y) ; Marked_cond1(true,x,y) >= Marked_cond2(gr(x,y),x,y) ; Marked_cond3(true,x,y) >= Marked_cond3(gr(x,0),p(x),y) ; Marked_cond3(false,x,y) >= Marked_cond1(and(gr(x,0),gr(y,0)),x,y) ; Marked_cond2(true,x,y) >= Marked_cond3(gr(x,0),x,y) ; Marked_cond2(false,x,y) >= Marked_cond4(gr(y,0),x,y) ; } + Disjunctions:{ { Marked_cond4(true,x,y) > Marked_cond4(gr(y,0),x,p(y)) ; } { Marked_cond4(false,x,y) > Marked_cond1(and(gr(x,0),gr(y,0)),x,y) ; } { Marked_cond1(true,x,y) > Marked_cond2(gr(x,y),x,y) ; } { Marked_cond3(true,x,y) > Marked_cond3(gr(x,0),p(x),y) ; } { Marked_cond3(false,x,y) > Marked_cond1(and(gr(x,0),gr(y,0)),x,y) ; } { Marked_cond2(true,x,y) > Marked_cond3(gr(x,0),x,y) ; } { Marked_cond2(false,x,y) > Marked_cond4(gr(y,0),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 === Time out for these parameters. === 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) NOT SOLVED No proof found Cime worked for 47.649360 seconds (real time) Cime Exit Status: 0