- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(h(X)) -> mark(g(X,X)) [2] active(g(a,X)) -> mark(f(b,X)) [3] active(f(X,X)) -> mark(h(a)) [4] active(a) -> mark(b) [5] active(h(X)) -> h(active(X)) [6] active(g(X1,X2)) -> g(active(X1),X2) [7] active(f(X1,X2)) -> f(active(X1),X2) [8] h(mark(X)) -> mark(h(X)) [9] g(mark(X1),X2) -> mark(g(X1,X2)) [10] f(mark(X1),X2) -> mark(f(X1,X2)) [11] proper(h(X)) -> h(proper(X)) [12] proper(g(X1,X2)) -> g(proper(X1),proper(X2)) [13] proper(a) -> ok(a) [14] proper(f(X1,X2)) -> f(proper(X1),proper(X2)) [15] proper(b) -> ok(b) [16] h(ok(X)) -> ok(h(X)) [17] g(ok(X1),ok(X2)) -> ok(g(X1,X2)) [18] f(ok(X1),ok(X2)) -> ok(f(X1,X2)) [19] top(mark(X)) -> top(proper(X)) [20] top(ok(X)) -> top(active(X)) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 6 components: { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> } { --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { g(mark(X1),X2) >= mark(g(X1,X2)) ; g(ok(X1),ok(X2)) >= ok(g(X1,X2)) ; active(g(a,X)) >= mark(f(b,X)) ; active(g(X1,X2)) >= g(active(X1),X2) ; active(h(X)) >= mark(g(X,X)) ; active(h(X)) >= h(active(X)) ; active(f(X,X)) >= mark(h(a)) ; active(f(X1,X2)) >= f(active(X1),X2) ; active(a) >= mark(b) ; h(mark(X)) >= mark(h(X)) ; h(ok(X)) >= ok(h(X)) ; f(mark(X1),X2) >= mark(f(X1,X2)) ; f(ok(X1),ok(X2)) >= ok(f(X1,X2)) ; proper(g(X1,X2)) >= g(proper(X1),proper(X2)) ; proper(h(X)) >= h(proper(X)) ; proper(f(X1,X2)) >= f(proper(X1),proper(X2)) ; proper(b) >= ok(b) ; proper(a) >= ok(a) ; 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: { g(mark(X1),X2) >= mark(g(X1,X2)) ; g(ok(X1),ok(X2)) >= ok(g(X1,X2)) ; active(g(a,X)) >= mark(f(b,X)) ; active(g(X1,X2)) >= g(active(X1),X2) ; active(h(X)) >= mark(g(X,X)) ; active(h(X)) >= h(active(X)) ; active(f(X,X)) >= mark(h(a)) ; active(f(X1,X2)) >= f(active(X1),X2) ; active(a) >= mark(b) ; h(mark(X)) >= mark(h(X)) ; h(ok(X)) >= ok(h(X)) ; f(mark(X1),X2) >= mark(f(X1,X2)) ; f(ok(X1),ok(X2)) >= ok(f(X1,X2)) ; proper(g(X1,X2)) >= g(proper(X1),proper(X2)) ; proper(h(X)) >= h(proper(X)) ; proper(f(X1,X2)) >= f(proper(X1),proper(X2)) ; proper(b) >= ok(b) ; proper(a) >= ok(a) ; 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: { g(mark(X1),X2) >= mark(g(X1,X2)) ; g(ok(X1),ok(X2)) >= ok(g(X1,X2)) ; active(g(a,X)) >= mark(f(b,X)) ; active(g(X1,X2)) >= g(active(X1),X2) ; active(h(X)) >= mark(g(X,X)) ; active(h(X)) >= h(active(X)) ; active(f(X,X)) >= mark(h(a)) ; active(f(X1,X2)) >= f(active(X1),X2) ; active(a) >= mark(b) ; h(mark(X)) >= mark(h(X)) ; h(ok(X)) >= ok(h(X)) ; f(mark(X1),X2) >= mark(f(X1,X2)) ; f(ok(X1),ok(X2)) >= ok(f(X1,X2)) ; proper(g(X1,X2)) >= g(proper(X1),proper(X2)) ; proper(h(X)) >= h(proper(X)) ; proper(f(X1,X2)) >= f(proper(X1),proper(X2)) ; proper(b) >= ok(b) ; proper(a) >= ok(a) ; 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.(1351 bt (1754) [79]) === 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.511025 seconds (real time) Cime Exit Status: 0