- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] first(0,X) -> nil [2] first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) [3] from(X) -> cons(X,from(s(X))) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> } APPLY CRITERIA (Subterm criterion) ST: Marked_first -> 1 APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { first(0,X) >= nil ; first(s(X),cons(Y,Z)) >= cons(Y,first(X,Z)) ; from(X) >= cons(X,from(s(X))) ; Marked_from(X) >= Marked_from(s(X)) ; } + Disjunctions:{ { Marked_from(X) > Marked_from(s(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: { first(0,X) >= nil ; first(s(X),cons(Y,Z)) >= cons(Y,first(X,Z)) ; from(X) >= cons(X,from(s(X))) ; Marked_from(X) > Marked_from(s(X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { first(0,X) >= nil ; first(s(X),cons(Y,Z)) >= cons(Y,first(X,Z)) ; from(X) >= cons(X,from(s(X))) ; Marked_from(X) > Marked_from(s(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.(13 bt (18) [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.161798 seconds (real time) Cime Exit Status: 0