- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] times(x,plus(y,1)) -> plus(times(x,plus(y,times(1,0))),x) [2] times(x,1) -> x [3] times(x,0) -> 0 [4] plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) [5] plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) [6] plus(zero,y) -> y [7] plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) [8] id(x) -> x [9] if(true,x,y) -> x [10] if(false,x,y) -> y [11] not(x) -> if(x,false,true) [12] gt(s(x),zero) -> true [13] gt(zero,y) -> false [14] gt(s(x),s(y)) -> gt(x,y) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 3 components: { --> } { --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { plus(s(x),s(y)) >= s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) ; plus(s(x),x) >= plus(if(gt(x,x),id(x),id(x)),s(x)) ; plus(id(x),s(y)) >= s(plus(x,if(gt(s(y),y),y,s(y)))) ; plus(zero,y) >= y ; times(x,plus(y,1)) >= plus(times(x,plus(y,times(1,0))),x) ; times(x,1) >= x ; times(x,0) >= 0 ; if(true,x,y) >= x ; if(false,x,y) >= y ; gt(s(x),s(y)) >= gt(x,y) ; gt(s(x),zero) >= true ; gt(zero,y) >= false ; not(x) >= if(x,false,true) ; id(x) >= x ; Marked_times(x,plus(y,1)) >= Marked_times(x,plus(y,times(1,0))) ; } + Disjunctions:{ { Marked_times(x,plus(y,1)) > Marked_times(x,plus(y,times(1,0))) ; } } === 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 : 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: plus(s(x),s(y)) >= s(s(plus(if(gt(x,y),x,y), if(not(gt(x,y)),id(x),id(y))))) constraint: plus(s(x),x) >= plus(if(gt(x,x),id(x),id(x)),s(x)) constraint: plus(id(x),s(y)) >= s(plus(x,if(gt(s(y),y),y,s(y)))) constraint: plus(zero,y) >= y constraint: times(x,plus(y,1)) >= plus(times(x,plus(y,times(1,0))),x) constraint: times(x,1) >= x constraint: times(x,0) >= 0 constraint: if(true,x,y) >= x constraint: if(false,x,y) >= y constraint: gt(s(x),s(y)) >= gt(x,y) constraint: gt(s(x),zero) >= true constraint: gt(zero,y) >= false constraint: not(x) >= if(x,false,true) constraint: id(x) >= x constraint: Marked_times(x,plus(y,1)) >= Marked_times(x,plus(y,times(1,0))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { plus(s(x),s(y)) >= s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) ; plus(s(x),x) >= plus(if(gt(x,x),id(x),id(x)),s(x)) ; plus(id(x),s(y)) >= s(plus(x,if(gt(s(y),y),y,s(y)))) ; plus(zero,y) >= y ; times(x,plus(y,1)) >= plus(times(x,plus(y,times(1,0))),x) ; times(x,1) >= x ; times(x,0) >= 0 ; if(true,x,y) >= x ; if(false,x,y) >= y ; gt(s(x),s(y)) >= gt(x,y) ; gt(s(x),zero) >= true ; gt(zero,y) >= false ; not(x) >= if(x,false,true) ; id(x) >= x ; Marked_plus(s(x),s(y)) >= Marked_plus(if(gt(x,y),x,y), if(not(gt(x,y)),id(x),id(y))) ; Marked_plus(s(x),x) >= Marked_plus(if(gt(x,x),id(x),id(x)),s(x)) ; Marked_plus(id(x),s(y)) >= Marked_plus(x,if(gt(s(y),y),y,s(y))) ; } + Disjunctions:{ { Marked_plus(s(x),s(y)) > Marked_plus(if(gt(x,y),x,y), if(not(gt(x,y)),id(x),id(y))) ; } { Marked_plus(s(x),x) > Marked_plus(if(gt(x,x),id(x),id(x)),s(x)) ; } { Marked_plus(id(x),s(y)) > Marked_plus(x,if(gt(s(y),y),y,s(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 : 15.000000 === Entering poly_solver Starting Sat solver initialization Calling Sat solver... === STOPING TIMER virtual === === TIMER real : 15.000000 === === STOPING TIMER real === Sat timeout reached === STOPING TIMER virtual === Time out 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 80.664862 seconds (real time) Cime Exit Status: 0