- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] fac(s(x)) -> *(fac(p(s(x))),s(x)) [2] p(s(0)) -> 0 [3] p(s(s(x))) -> s(p(s(x))) 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: { fac(s(x)) >= *(fac(p(s(x))),s(x)) ; p(s(s(x))) >= s(p(s(x))) ; p(s(0)) >= 0 ; Marked_fac(s(x)) >= Marked_fac(p(s(x))) ; } + Disjunctions:{ { Marked_fac(s(x)) > Marked_fac(p(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: fac(s(x)) >= *(fac(p(s(x))),s(x)) constraint: p(s(s(x))) >= s(p(s(x))) constraint: p(s(0)) >= 0 constraint: Marked_fac(s(x)) >= Marked_fac(p(s(x))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { fac(s(x)) >= *(fac(p(s(x))),s(x)) ; p(s(s(x))) >= s(p(s(x))) ; p(s(0)) >= 0 ; Marked_p(s(s(x))) >= Marked_p(s(x)) ; } + Disjunctions:{ { Marked_p(s(s(x))) > Marked_p(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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: fac(s(x)) >= *(fac(p(s(x))),s(x)) constraint: p(s(s(x))) >= s(p(s(x))) constraint: p(s(0)) >= 0 constraint: Marked_p(s(s(x))) >= Marked_p(s(x)) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] fac(s(x)) -> *(fac(p(s(x))),s(x)) [2] p(s(0)) -> 0 [3] p(s(s(x))) -> s(p(s(x))) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ * ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ p ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 1 ] [ 1 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_fac ] (X0) = [ [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ fac ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ s ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 1 ] [ 0 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] ]; ]} { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ * ] (X0,X1) = 0; [ 0 ] () = 0; [ p ] (X0) = 2*X0 + 0; [ fac ] (X0) = 0; [ Marked_p ] (X0) = 1*X0 + 0; [ s ] (X0) = 2 + 2*X0 + 0; ]} ]} ]} Cime worked for 0.590359 seconds (real time) Cime Exit Status: 0