- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] minus(x,0) -> x [2] minus(s(x),s(y)) -> minus(x,y) [3] quot(0,s(y)) -> 0 [4] quot(s(x),s(y)) -> s(quot(minus(x,y),s(y))) [5] minus(minus(x,y),z) -> minus(x,plus(y,z)) [6] plus(s(x),s(y)) -> s(s(plus(if(gt(x,y),x,y),if(not(gt(x,y)),id(x),id(y))))) [7] plus(s(x),x) -> plus(if(gt(x,x),id(x),id(x)),s(x)) [8] plus(zero,y) -> y [9] plus(id(x),s(y)) -> s(plus(x,if(gt(s(y),y),y,s(y)))) [10] id(x) -> x [11] if(true,x,y) -> x [12] if(false,x,y) -> y [13] not(x) -> if(x,false,true) [14] gt(s(x),zero) -> true [15] gt(zero,y) -> false [16] gt(s(x),s(y)) -> gt(x,y) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 4 components: { --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { minus(minus(x,y),z) >= minus(x,plus(y,z)) ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; quot(0,s(y)) >= 0 ; quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ; 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 ; 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_quot(s(x),s(y)) >= Marked_quot(minus(x,y),s(y)) ; } + Disjunctions:{ { Marked_quot(s(x),s(y)) > Marked_quot(minus(x,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 : 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 timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { minus(minus(x,y),z) >= minus(x,plus(y,z)) ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; quot(0,s(y)) >= 0 ; quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ; 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 ; 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_quot(s(x),s(y)) > Marked_quot(minus(x,y),s(y)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { minus(minus(x,y),z) >= minus(x,plus(y,z)) ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; quot(0,s(y)) >= 0 ; quot(s(x),s(y)) >= s(quot(minus(x,y),s(y))) ; 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 ; 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_quot(s(x),s(y)) > Marked_quot(minus(x,y),s(y)) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(1206 bt (1372) [126]) === 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 timeout reached === 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 160.050542 seconds (real time) Cime Exit Status: 0