- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] f(X) -> cons(X,f(g(X))) [2] g(0) -> s(0) [3] g(s(X)) -> s(s(g(X))) [4] sel(0,cons(X,Y)) -> X [5] sel(s(X),cons(Y,Z)) -> sel(X,Z) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 3 components: { --> } { --> } { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(X) >= cons(X,f(g(X))) ; g(s(X)) >= s(s(g(X))) ; g(0) >= s(0) ; sel(s(X),cons(Y,Z)) >= sel(X,Z) ; sel(0,cons(X,Y)) >= X ; Marked_f(X) >= Marked_f(g(X)) ; } + Disjunctions:{ { Marked_f(X) > Marked_f(g(X)) ; } } === 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 (Simple graph) Found the following constraints: { f(X) >= cons(X,f(g(X))) ; g(s(X)) >= s(s(g(X))) ; g(0) >= s(0) ; sel(s(X),cons(Y,Z)) >= sel(X,Z) ; sel(0,cons(X,Y)) >= X ; Marked_f(X) > Marked_f(g(X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { f(X) >= cons(X,f(g(X))) ; g(s(X)) >= s(s(g(X))) ; g(0) >= s(0) ; sel(s(X),cons(Y,Z)) >= sel(X,Z) ; sel(0,cons(X,Y)) >= X ; Marked_f(X) > Marked_f(g(X)) ; } + Disjunctions:{ } === TIMER virtual : 10.000000 === Entering poly_solver === 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.(15 bt (22) [3]) === TIMER virtual : 15.000000 === Entering poly_solver === 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 === 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 0.168906 seconds (real time) Cime Exit Status: 0