- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] p(s(x)) -> x [2] p(0) -> 0 [3] le(0,y) -> true [4] le(s(x),0) -> false [5] le(s(x),s(y)) -> le(x,y) [6] average(x,y) -> if(le(x,0),le(y,0),le(y,s(0)),le(y,s(s(0))),x,y) [7] if(true,b1,b2,b3,x,y) -> if2(b1,b2,b3,x,y) [8] if(false,b1,b2,b3,x,y) -> average(p(x),s(y)) [9] if2(true,b2,b3,x,y) -> 0 [10] if2(false,b2,b3,x,y) -> if3(b2,b3,x,y) [11] if3(true,b3,x,y) -> 0 [12] if3(false,b3,x,y) -> if4(b3,x,y) [13] if4(true,x,y) -> s(0) [14] if4(false,x,y) -> average(s(x),p(p(y))) 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: { p(s(x)) >= x ; p(0) >= 0 ; le(s(x),s(y)) >= le(x,y) ; le(s(x),0) >= false ; le(0,y) >= true ; if(true,b1,b2,b3,x,y) >= if2(b1,b2,b3,x,y) ; if(false,b1,b2,b3,x,y) >= average(p(x),s(y)) ; average(x,y) >= if(le(x,0),le(y,0),le(y,s(0)),le(y,s(s(0))),x,y) ; if2(true,b2,b3,x,y) >= 0 ; if2(false,b2,b3,x,y) >= if3(b2,b3,x,y) ; if3(true,b3,x,y) >= 0 ; if3(false,b3,x,y) >= if4(b3,x,y) ; if4(true,x,y) >= s(0) ; if4(false,x,y) >= average(s(x),p(p(y))) ; Marked_if4(false,x,y) >= Marked_average(s(x),p(p(y))) ; Marked_average(x,y) >= Marked_if(le(x,0),le(y,0),le(y,s(0)),le(y,s(s(0))), x,y) ; Marked_if3(false,b3,x,y) >= Marked_if4(b3,x,y) ; Marked_if2(false,b2,b3,x,y) >= Marked_if3(b2,b3,x,y) ; Marked_if(true,b1,b2,b3,x,y) >= Marked_if2(b1,b2,b3,x,y) ; Marked_if(false,b1,b2,b3,x,y) >= Marked_average(p(x),s(y)) ; } + Disjunctions:{ { Marked_if4(false,x,y) > Marked_average(s(x),p(p(y))) ; } { Marked_average(x,y) > Marked_if(le(x,0),le(y,0),le(y,s(0)),le(y,s(s(0))),x,y) ; } { Marked_if3(false,b3,x,y) > Marked_if4(b3,x,y) ; } { Marked_if2(false,b2,b3,x,y) > Marked_if3(b2,b3,x,y) ; } { Marked_if(true,b1,b2,b3,x,y) > Marked_if2(b1,b2,b3,x,y) ; } { Marked_if(false,b1,b2,b3,x,y) > Marked_average(p(x),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 === Time out for these parameters. === TIMER virtual : 15.000000 === Entering poly_solver Starting Sat solver initialization === 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 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 92.600200 seconds (real time) Cime Exit Status: 0