- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] h(x,x) -> h(a,b) [2] g(g(x,a),y) -> g(g(a,y),g(a,x)) [3] f(g(x,y)) -> g(g(f(f(y)),h(a,a)),x) [4] h(h(f(f(x)),y),h(z,v)) -> h(h(f(z),f(f(f(y)))),h(v,x)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 4 components: { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> } { --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { h(h(f(f(x)),y),h(z,v)) >= h(h(f(z),f(f(f(y)))),h(v,x)) ; h(x,x) >= h(a,b) ; g(g(x,a),y) >= g(g(a,y),g(a,x)) ; f(g(x,y)) >= g(g(f(f(y)),h(a,a)),x) ; Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(h(f(z),f(f(f(y)))),h(v,x)) ; Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(f(z),f(f(f(y)))) ; Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(v,x) ; } + Disjunctions:{ { Marked_h(h(f(f(x)),y),h(z,v)) > Marked_h(h(f(z),f(f(f(y)))),h(v,x)) ; } { Marked_h(h(f(f(x)),y),h(z,v)) > Marked_h(f(z),f(f(f(y)))) ; } { Marked_h(h(f(f(x)),y),h(z,v)) > Marked_h(v,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: h(h(f(f(x)),y),h(z,v)) >= h(h(f(z),f(f(f(y)))),h(v,x)) constraint: h(x,x) >= h(a,b) constraint: g(g(x,a),y) >= g(g(a,y),g(a,x)) constraint: f(g(x,y)) >= g(g(f(f(y)),h(a,a)),x) constraint: Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(h(f(z),f(f(f(y)))), h(v,x)) constraint: Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(f(z),f(f(f(y)))) constraint: Marked_h(h(f(f(x)),y),h(z,v)) >= Marked_h(v,x) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { h(h(f(f(x)),y),h(z,v)) >= h(h(f(z),f(f(f(y)))),h(v,x)) ; h(x,x) >= h(a,b) ; g(g(x,a),y) >= g(g(a,y),g(a,x)) ; f(g(x,y)) >= g(g(f(f(y)),h(a,a)),x) ; Marked_f(g(x,y)) >= Marked_f(f(y)) ; Marked_f(g(x,y)) >= Marked_f(y) ; } + Disjunctions:{ { Marked_f(g(x,y)) > Marked_f(f(y)) ; } { Marked_f(g(x,y)) > Marked_f(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 : 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 (ID_CRIT) NOT SOLVED No proof found Cime worked for 4.327319 seconds (real time) Cime Exit Status: 0