- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] c(z,x,a) -> f(b(b(f(z),z),x)) [2] b(y,b(z,a)) -> f(b(c(f(a),y,z),z)) [3] f(c(c(z,a,a),x,a)) -> z Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(c(c(z,a,a),x,a)) >= z ; b(y,b(z,a)) >= f(b(c(f(a),y,z),z)) ; c(z,x,a) >= f(b(b(f(z),z),x)) ; Marked_b(y,b(z,a)) >= Marked_b(c(f(a),y,z),z) ; Marked_b(y,b(z,a)) >= Marked_c(f(a),y,z) ; Marked_c(z,x,a) >= Marked_b(f(z),z) ; Marked_c(z,x,a) >= Marked_b(b(f(z),z),x) ; } + Disjunctions:{ { Marked_b(y,b(z,a)) > Marked_b(c(f(a),y,z),z) ; } { Marked_b(y,b(z,a)) > Marked_c(f(a),y,z) ; } { Marked_c(z,x,a) > Marked_b(f(z),z) ; } { Marked_c(z,x,a) > Marked_b(b(f(z),z),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 : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === TIMER virtual : 25.000000 === Search parameters: AFS type: 2 ; time limit: 25.. === STOPING TIMER virtual === === 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: f(c(c(z,a,a),x,a)) >= z constraint: b(y,b(z,a)) >= f(b(c(f(a),y,z),z)) constraint: c(z,x,a) >= f(b(b(f(z),z),x)) constraint: Marked_b(y,b(z,a)) >= Marked_b(c(f(a),y,z),z) constraint: Marked_b(y,b(z,a)) >= Marked_c(f(a),y,z) constraint: Marked_c(z,x,a) >= Marked_b(f(z),z) constraint: Marked_c(z,x,a) >= Marked_b(b(f(z),z),x) APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(c(c(z,a,a),x,a)) >= z ; b(y,b(z,a)) >= f(b(c(f(a),y,z),z)) ; c(z,x,a) >= f(b(b(f(z),z),x)) ; Marked_b(y,b(z,a)) >= Marked_b(c(f(a),y,z),z) ; } + Disjunctions:{ { Marked_b(y,b(z,a)) > Marked_b(c(f(a),y,z),z) ; } } === 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: f(c(c(z,a,a),x,a)) >= z constraint: b(y,b(z,a)) >= f(b(c(f(a),y,z),z)) constraint: c(z,x,a) >= f(b(b(f(z),z),x)) constraint: Marked_b(y,b(z,a)) >= Marked_b(c(f(a),y,z),z) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] c(z,x,a) -> f(b(b(f(z),z),x)) [2] b(y,b(z,a)) -> f(b(c(f(a),y,z),z)) [3] f(c(c(z,a,a),x,a)) -> z , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ f ] (X0) = [ [ 0 , 1 , 0 ] [ 0 , 1 , 0 ] [ 1 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ c ] (X0,X1,X2) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X2 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] [ 1 , 1 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_c ] (X0,X1,X2) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X2 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 1 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ b ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ Marked_b ] (X0,X1) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ a ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ f ] (X0) = [ [ 1 , 0 , 0 ] [ 1 , 0 , 0 ] [ 1 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ c ] (X0,X1,X2) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] ]*X2 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]; [ b ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ Marked_b ] (X0,X1) = [ [ 0 , 0 , 1 ] [ 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 ] ]; [ a ] () = [ [ 0 , 0 , 1 ] [ 0 , 0 , 1 ] [ 0 , 0 , 1 ] ]; ]} ]} ]} ]} ]} Cime worked for 4.629031 seconds (real time) Cime Exit Status: 0