- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] div(x,y) -> div2(x,y,0) [2] div2(x,y,i) -> if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) [3] if1(true,b,x,y,i,j) -> divZeroError [4] if1(false,b,x,y,i,j) -> if2(b,x,y,i,j) [5] if2(true,x,y,i,j) -> div2(minus(x,y),y,j) [6] if2(false,x,y,i,j) -> i [7] inc(0) -> 0 [8] inc(s(i)) -> s(inc(i)) [9] le(s(x),0) -> false [10] le(0,y) -> true [11] le(s(x),s(y)) -> le(x,y) [12] minus(x,0) -> x [13] minus(0,y) -> 0 [14] minus(s(x),s(y)) -> minus(x,y) [15] plus(x,y) -> plusIter(x,y,0) [16] plusIter(x,y,z) -> ifPlus(le(x,z),x,y,z) [17] ifPlus(true,x,y,z) -> y [18] ifPlus(false,x,y,z) -> plusIter(x,s(y),s(z)) [19] a -> c [20] a -> d Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> --> --> } { --> } { --> } { --> --> } { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { div2(x,y,i) >= if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; div(x,y) >= div2(x,y,0) ; if1(true,b,x,y,i,j) >= divZeroError ; if1(false,b,x,y,i,j) >= if2(b,x,y,i,j) ; le(0,y) >= true ; le(s(x),0) >= false ; le(s(x),s(y)) >= le(x,y) ; plus(x,y) >= plusIter(x,y,0) ; inc(0) >= 0 ; inc(s(i)) >= s(inc(i)) ; if2(true,x,y,i,j) >= div2(minus(x,y),y,j) ; if2(false,x,y,i,j) >= i ; minus(0,y) >= 0 ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; plusIter(x,y,z) >= ifPlus(le(x,z),x,y,z) ; ifPlus(true,x,y,z) >= y ; ifPlus(false,x,y,z) >= plusIter(x,s(y),s(z)) ; a >= c ; a >= d ; Marked_if2(true,x,y,i,j) >= Marked_div2(minus(x,y),y,j) ; Marked_div2(x,y,i) >= Marked_if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; Marked_if1(false,b,x,y,i,j) >= Marked_if2(b,x,y,i,j) ; } + Disjunctions:{ { Marked_if2(true,x,y,i,j) > Marked_div2(minus(x,y),y,j) ; } { Marked_div2(x,y,i) > Marked_if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; } { Marked_if1(false,b,x,y,i,j) > Marked_if2(b,x,y,i,j) ; } } === 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 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 (Simple graph) Found the following constraints: { div2(x,y,i) >= if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; div(x,y) >= div2(x,y,0) ; if1(true,b,x,y,i,j) >= divZeroError ; if1(false,b,x,y,i,j) >= if2(b,x,y,i,j) ; le(0,y) >= true ; le(s(x),0) >= false ; le(s(x),s(y)) >= le(x,y) ; plus(x,y) >= plusIter(x,y,0) ; inc(0) >= 0 ; inc(s(i)) >= s(inc(i)) ; if2(true,x,y,i,j) >= div2(minus(x,y),y,j) ; if2(false,x,y,i,j) >= i ; minus(0,y) >= 0 ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; plusIter(x,y,z) >= ifPlus(le(x,z),x,y,z) ; ifPlus(true,x,y,z) >= y ; ifPlus(false,x,y,z) >= plusIter(x,s(y),s(z)) ; a >= c ; a >= d ; Marked_if2(true,x,y,i,j) >= Marked_div2(minus(x,y),y,j) ; Marked_div2(x,y,i) >= Marked_if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; Marked_if1(false,b,x,y,i,j) > Marked_if2(b,x,y,i,j) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { div2(x,y,i) >= if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; div(x,y) >= div2(x,y,0) ; if1(true,b,x,y,i,j) >= divZeroError ; if1(false,b,x,y,i,j) >= if2(b,x,y,i,j) ; le(0,y) >= true ; le(s(x),0) >= false ; le(s(x),s(y)) >= le(x,y) ; plus(x,y) >= plusIter(x,y,0) ; inc(0) >= 0 ; inc(s(i)) >= s(inc(i)) ; if2(true,x,y,i,j) >= div2(minus(x,y),y,j) ; if2(false,x,y,i,j) >= i ; minus(0,y) >= 0 ; minus(s(x),s(y)) >= minus(x,y) ; minus(x,0) >= x ; plusIter(x,y,z) >= ifPlus(le(x,z),x,y,z) ; ifPlus(true,x,y,z) >= y ; ifPlus(false,x,y,z) >= plusIter(x,s(y),s(z)) ; a >= c ; a >= d ; Marked_if2(true,x,y,i,j) >= Marked_div2(minus(x,y),y,j) ; Marked_div2(x,y,i) >= Marked_if1(le(y,0),le(y,x),x,y,plus(i,0),inc(i)) ; Marked_if1(false,b,x,y,i,j) > Marked_if2(b,x,y,i,j) ; } + 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 === 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 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 98.451974 seconds (real time) Cime Exit Status: 0