- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] le(0,y) -> true [2] le(s(x),0) -> false [3] le(s(x),s(y)) -> le(x,y) [4] eq(0,0) -> true [5] eq(0,s(y)) -> false [6] eq(s(x),0) -> false [7] eq(s(x),s(y)) -> eq(x,y) [8] if(true,x,y) -> x [9] if(false,x,y) -> y [10] minsort(nil) -> nil [11] minsort(cons(x,y)) -> cons(min(x,y),minsort(del(min(x,y),cons(x,y)))) [12] min(x,nil) -> x [13] min(x,cons(y,z)) -> if(le(x,y),min(x,z),min(y,z)) [14] del(x,nil) -> nil [15] del(x,cons(y,z)) -> if(eq(x,y),z,cons(y,del(x,z))) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> } { --> --> --> --> } { --> } { --> } { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { le(0,y) >= true ; le(s(x),0) >= false ; le(s(x),s(y)) >= le(x,y) ; eq(0,0) >= true ; eq(0,s(y)) >= false ; eq(s(x),0) >= false ; eq(s(x),s(y)) >= eq(x,y) ; if(true,x,y) >= x ; if(false,x,y) >= y ; minsort(nil) >= nil ; minsort(cons(x,y)) >= cons(min(x,y),minsort(del(min(x,y),cons(x,y)))) ; min(x,nil) >= x ; min(x,cons(y,z)) >= if(le(x,y),min(x,z),min(y,z)) ; del(x,nil) >= nil ; del(x,cons(y,z)) >= if(eq(x,y),z,cons(y,del(x,z))) ; Marked_minsort(cons(x,y)) >= Marked_minsort(del(min(x,y),cons(x,y))) ; } + Disjunctions:{ { Marked_minsort(cons(x,y)) > Marked_minsort(del(min(x,y),cons(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 : 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 4.251612 seconds (real time) Cime Exit Status: 0