- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(f(X,g(X),Y)) -> mark(f(Y,Y,Y)) [2] active(g(b)) -> mark(c) [3] active(b) -> mark(c) [4] active(g(X)) -> g(active(X)) [5] g(mark(X)) -> mark(g(X)) [6] proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3)) [7] proper(g(X)) -> g(proper(X)) [8] proper(b) -> ok(b) [9] proper(c) -> ok(c) [10] f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3)) [11] g(ok(X)) -> ok(g(X)) [12] top(mark(X)) -> top(proper(X)) [13] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 5 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> } { --> } { --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { f(ok(X1),ok(X2),ok(X3)) >= ok(f(X1,X2,X3)) ; active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ; active(g(b)) >= mark(c) ; active(g(X)) >= g(active(X)) ; active(b) >= mark(c) ; g(mark(X)) >= mark(g(X)) ; g(ok(X)) >= ok(g(X)) ; proper(f(X1,X2,X3)) >= f(proper(X1),proper(X2),proper(X3)) ; proper(g(X)) >= g(proper(X)) ; proper(c) >= ok(c) ; proper(b) >= ok(b) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) >= Marked_top(proper(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { Marked_top(mark(X)) > Marked_top(proper(X)) ; } { Marked_top(ok(X)) > Marked_top(active(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 : 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 timeout reached === STOPING TIMER virtual === No solution found for these parameters. No solution found for these constraints. APPLY CRITERIA (Simple graph) Found the following constraints: { f(ok(X1),ok(X2),ok(X3)) >= ok(f(X1,X2,X3)) ; active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ; active(g(b)) >= mark(c) ; active(g(X)) >= g(active(X)) ; active(b) >= mark(c) ; g(mark(X)) >= mark(g(X)) ; g(ok(X)) >= ok(g(X)) ; proper(f(X1,X2,X3)) >= f(proper(X1),proper(X2),proper(X3)) ; proper(g(X)) >= g(proper(X)) ; proper(c) >= ok(c) ; proper(b) >= ok(b) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) > Marked_top(proper(X)) ; Marked_top(ok(X)) > Marked_top(active(X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { f(ok(X1),ok(X2),ok(X3)) >= ok(f(X1,X2,X3)) ; active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ; active(g(b)) >= mark(c) ; active(g(X)) >= g(active(X)) ; active(b) >= mark(c) ; g(mark(X)) >= mark(g(X)) ; g(ok(X)) >= ok(g(X)) ; proper(f(X1,X2,X3)) >= f(proper(X1),proper(X2),proper(X3)) ; proper(g(X)) >= g(proper(X)) ; proper(c) >= ok(c) ; proper(b) >= ok(b) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(mark(X)) > Marked_top(proper(X)) ; Marked_top(ok(X)) > Marked_top(active(X)) ; } + Disjunctions:{ } === 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 === No solution found for these parameters.(922 bt (1108) [125]) === 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 timeout reached === 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 101.218009 seconds (real time) Cime Exit Status: 0