- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] intlist(nil) -> nil [2] int(s(x),0) -> nil [3] int(x,x) -> cons(x,nil) [4] intlist(cons(x,y)) -> cons(s(x),intlist(y)) [5] int(s(x),s(y)) -> intlist(int(x,y)) [6] int(0,s(y)) -> cons(0,int(s(0),s(y))) [7] intlist(cons(x,nil)) -> cons(s(x),nil) 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: { intlist(nil) >= nil ; intlist(cons(x,nil)) >= cons(s(x),nil) ; intlist(cons(x,y)) >= cons(s(x),intlist(y)) ; int(s(x),s(y)) >= intlist(int(x,y)) ; int(s(x),0) >= nil ; int(0,s(y)) >= cons(0,int(s(0),s(y))) ; int(x,x) >= cons(x,nil) ; Marked_int(s(x),s(y)) >= Marked_int(x,y) ; Marked_int(0,s(y)) >= Marked_int(s(0),s(y)) ; } + Disjunctions:{ { Marked_int(s(x),s(y)) > Marked_int(x,y) ; } { Marked_int(0,s(y)) > Marked_int(s(0),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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: intlist(nil) >= nil constraint: intlist(cons(x,nil)) >= cons(s(x),nil) constraint: intlist(cons(x,y)) >= cons(s(x),intlist(y)) constraint: int(s(x),s(y)) >= intlist(int(x,y)) constraint: int(s(x),0) >= nil constraint: int(0,s(y)) >= cons(0,int(s(0),s(y))) constraint: int(x,x) >= cons(x,nil) constraint: Marked_int(s(x),s(y)) >= Marked_int(x,y) constraint: Marked_int(0,s(y)) >= Marked_int(s(0),s(y)) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { intlist(nil) >= nil ; intlist(cons(x,nil)) >= cons(s(x),nil) ; intlist(cons(x,y)) >= cons(s(x),intlist(y)) ; int(s(x),s(y)) >= intlist(int(x,y)) ; int(s(x),0) >= nil ; int(0,s(y)) >= cons(0,int(s(0),s(y))) ; int(x,x) >= cons(x,nil) ; Marked_intlist(cons(x,y)) >= Marked_intlist(y) ; } + Disjunctions:{ { Marked_intlist(cons(x,y)) > Marked_intlist(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 (ID_CRIT) NOT SOLVED No proof found Cime worked for 50.593992 seconds (real time) Cime Exit Status: 0