- : 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] mark(h(X)) -> active(h(mark(X))) [6] mark(g(X1,X2)) -> active(g(mark(X1),X2)) [7] mark(a) -> active(a) [8] mark(f(X1,X2)) -> active(f(mark(X1),X2)) [9] mark(b) -> active(b) [10] h(mark(X)) -> h(X) [11] h(active(X)) -> h(X) [12] g(mark(X1),X2) -> g(X1,X2) [13] g(X1,mark(X2)) -> g(X1,X2) [14] g(active(X1),X2) -> g(X1,X2) [15] g(X1,active(X2)) -> g(X1,X2) [16] f(mark(X1),X2) -> f(X1,X2) [17] f(X1,mark(X2)) -> f(X1,X2) [18] f(active(X1),X2) -> f(X1,X2) [19] f(X1,active(X2)) -> f(X1,X2) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 4 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(g(X1,X2)) >= active(g(mark(X1),X2)) ; mark(h(X)) >= active(h(mark(X))) ; mark(f(X1,X2)) >= active(f(mark(X1),X2)) ; mark(b) >= active(b) ; mark(a) >= active(a) ; g(mark(X1),X2) >= g(X1,X2) ; g(active(X1),X2) >= g(X1,X2) ; g(X1,mark(X2)) >= g(X1,X2) ; g(X1,active(X2)) >= g(X1,X2) ; active(g(a,X)) >= mark(f(b,X)) ; active(h(X)) >= mark(g(X,X)) ; active(f(X,X)) >= mark(h(a)) ; active(a) >= mark(b) ; h(mark(X)) >= h(X) ; h(active(X)) >= h(X) ; f(mark(X1),X2) >= f(X1,X2) ; f(active(X1),X2) >= f(X1,X2) ; f(X1,mark(X2)) >= f(X1,X2) ; f(X1,active(X2)) >= f(X1,X2) ; Marked_mark(g(X1,X2)) >= Marked_mark(X1) ; Marked_mark(g(X1,X2)) >= Marked_active(g(mark(X1),X2)) ; Marked_mark(h(X)) >= Marked_mark(X) ; Marked_mark(h(X)) >= Marked_active(h(mark(X))) ; Marked_mark(f(X1,X2)) >= Marked_mark(X1) ; Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) ; Marked_active(g(a,X)) >= Marked_mark(f(b,X)) ; Marked_active(h(X)) >= Marked_mark(g(X,X)) ; Marked_active(f(X,X)) >= Marked_mark(h(a)) ; } + Disjunctions:{ { Marked_mark(g(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(g(X1,X2)) > Marked_active(g(mark(X1),X2)) ; } { Marked_mark(h(X)) > Marked_mark(X) ; } { Marked_mark(h(X)) > Marked_active(h(mark(X))) ; } { Marked_mark(f(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(f(X1,X2)) > Marked_active(f(mark(X1),X2)) ; } { Marked_active(g(a,X)) > Marked_mark(f(b,X)) ; } { Marked_active(h(X)) > Marked_mark(g(X,X)) ; } { Marked_active(f(X,X)) > Marked_mark(h(a)) ; } } === 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: mark(g(X1,X2)) >= active(g(mark(X1),X2)) constraint: mark(h(X)) >= active(h(mark(X))) constraint: mark(f(X1,X2)) >= active(f(mark(X1),X2)) constraint: mark(b) >= active(b) constraint: mark(a) >= active(a) constraint: g(mark(X1),X2) >= g(X1,X2) constraint: g(active(X1),X2) >= g(X1,X2) constraint: g(X1,mark(X2)) >= g(X1,X2) constraint: g(X1,active(X2)) >= g(X1,X2) constraint: active(g(a,X)) >= mark(f(b,X)) constraint: active(h(X)) >= mark(g(X,X)) constraint: active(f(X,X)) >= mark(h(a)) constraint: active(a) >= mark(b) constraint: h(mark(X)) >= h(X) constraint: h(active(X)) >= h(X) constraint: f(mark(X1),X2) >= f(X1,X2) constraint: f(active(X1),X2) >= f(X1,X2) constraint: f(X1,mark(X2)) >= f(X1,X2) constraint: f(X1,active(X2)) >= f(X1,X2) constraint: Marked_mark(g(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(g(X1,X2)) >= Marked_active(g(mark(X1),X2)) constraint: Marked_mark(h(X)) >= Marked_mark(X) constraint: Marked_mark(h(X)) >= Marked_active(h(mark(X))) constraint: Marked_mark(f(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) constraint: Marked_active(g(a,X)) >= Marked_mark(f(b,X)) constraint: Marked_active(h(X)) >= Marked_mark(g(X,X)) constraint: Marked_active(f(X,X)) >= Marked_mark(h(a)) APPLY CRITERIA (Subterm criterion) ST: Marked_h -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_g -> 2 APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 2 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(g(X1,X2)) >= active(g(mark(X1),X2)) ; mark(h(X)) >= active(h(mark(X))) ; mark(f(X1,X2)) >= active(f(mark(X1),X2)) ; mark(b) >= active(b) ; mark(a) >= active(a) ; g(mark(X1),X2) >= g(X1,X2) ; g(active(X1),X2) >= g(X1,X2) ; g(X1,mark(X2)) >= g(X1,X2) ; g(X1,active(X2)) >= g(X1,X2) ; active(g(a,X)) >= mark(f(b,X)) ; active(h(X)) >= mark(g(X,X)) ; active(f(X,X)) >= mark(h(a)) ; active(a) >= mark(b) ; h(mark(X)) >= h(X) ; h(active(X)) >= h(X) ; f(mark(X1),X2) >= f(X1,X2) ; f(active(X1),X2) >= f(X1,X2) ; f(X1,mark(X2)) >= f(X1,X2) ; f(X1,active(X2)) >= f(X1,X2) ; Marked_mark(g(X1,X2)) >= Marked_mark(X1) ; Marked_mark(g(X1,X2)) >= Marked_active(g(mark(X1),X2)) ; Marked_mark(h(X)) >= Marked_mark(X) ; Marked_mark(h(X)) >= Marked_active(h(mark(X))) ; Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) ; Marked_active(g(a,X)) >= Marked_mark(f(b,X)) ; Marked_active(h(X)) >= Marked_mark(g(X,X)) ; Marked_active(f(X,X)) >= Marked_mark(h(a)) ; } + Disjunctions:{ { Marked_mark(g(X1,X2)) > Marked_mark(X1) ; } { Marked_mark(g(X1,X2)) > Marked_active(g(mark(X1),X2)) ; } { Marked_mark(h(X)) > Marked_mark(X) ; } { Marked_mark(h(X)) > Marked_active(h(mark(X))) ; } { Marked_mark(f(X1,X2)) > Marked_active(f(mark(X1),X2)) ; } { Marked_active(g(a,X)) > Marked_mark(f(b,X)) ; } { Marked_active(h(X)) > Marked_mark(g(X,X)) ; } { Marked_active(f(X,X)) > Marked_mark(h(a)) ; } } === 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: mark(g(X1,X2)) >= active(g(mark(X1),X2)) constraint: mark(h(X)) >= active(h(mark(X))) constraint: mark(f(X1,X2)) >= active(f(mark(X1),X2)) constraint: mark(b) >= active(b) constraint: mark(a) >= active(a) constraint: g(mark(X1),X2) >= g(X1,X2) constraint: g(active(X1),X2) >= g(X1,X2) constraint: g(X1,mark(X2)) >= g(X1,X2) constraint: g(X1,active(X2)) >= g(X1,X2) constraint: active(g(a,X)) >= mark(f(b,X)) constraint: active(h(X)) >= mark(g(X,X)) constraint: active(f(X,X)) >= mark(h(a)) constraint: active(a) >= mark(b) constraint: h(mark(X)) >= h(X) constraint: h(active(X)) >= h(X) constraint: f(mark(X1),X2) >= f(X1,X2) constraint: f(active(X1),X2) >= f(X1,X2) constraint: f(X1,mark(X2)) >= f(X1,X2) constraint: f(X1,active(X2)) >= f(X1,X2) constraint: Marked_mark(g(X1,X2)) >= Marked_mark(X1) constraint: Marked_mark(g(X1,X2)) >= Marked_active(g(mark(X1),X2)) constraint: Marked_mark(h(X)) >= Marked_mark(X) constraint: Marked_mark(h(X)) >= Marked_active(h(mark(X))) constraint: Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) constraint: Marked_active(g(a,X)) >= Marked_mark(f(b,X)) constraint: Marked_active(h(X)) >= Marked_mark(g(X,X)) constraint: Marked_active(f(X,X)) >= Marked_mark(h(a)) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(g(X1,X2)) >= active(g(mark(X1),X2)) ; mark(h(X)) >= active(h(mark(X))) ; mark(f(X1,X2)) >= active(f(mark(X1),X2)) ; mark(b) >= active(b) ; mark(a) >= active(a) ; g(mark(X1),X2) >= g(X1,X2) ; g(active(X1),X2) >= g(X1,X2) ; g(X1,mark(X2)) >= g(X1,X2) ; g(X1,active(X2)) >= g(X1,X2) ; active(g(a,X)) >= mark(f(b,X)) ; active(h(X)) >= mark(g(X,X)) ; active(f(X,X)) >= mark(h(a)) ; active(a) >= mark(b) ; h(mark(X)) >= h(X) ; h(active(X)) >= h(X) ; f(mark(X1),X2) >= f(X1,X2) ; f(active(X1),X2) >= f(X1,X2) ; f(X1,mark(X2)) >= f(X1,X2) ; f(X1,active(X2)) >= f(X1,X2) ; Marked_mark(g(X1,X2)) >= Marked_active(g(mark(X1),X2)) ; Marked_mark(h(X)) >= Marked_active(h(mark(X))) ; Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) ; Marked_active(g(a,X)) >= Marked_mark(f(b,X)) ; Marked_active(h(X)) >= Marked_mark(g(X,X)) ; Marked_active(f(X,X)) >= Marked_mark(h(a)) ; } + Disjunctions:{ { Marked_mark(g(X1,X2)) > Marked_active(g(mark(X1),X2)) ; } { Marked_mark(h(X)) > Marked_active(h(mark(X))) ; } { Marked_mark(f(X1,X2)) > Marked_active(f(mark(X1),X2)) ; } { Marked_active(g(a,X)) > Marked_mark(f(b,X)) ; } { Marked_active(h(X)) > Marked_mark(g(X,X)) ; } { Marked_active(f(X,X)) > Marked_mark(h(a)) ; } } === 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 : 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 (Simple graph) Found the following constraints: { mark(g(X1,X2)) >= active(g(mark(X1),X2)) ; mark(h(X)) >= active(h(mark(X))) ; mark(f(X1,X2)) >= active(f(mark(X1),X2)) ; mark(b) >= active(b) ; mark(a) >= active(a) ; g(mark(X1),X2) >= g(X1,X2) ; g(active(X1),X2) >= g(X1,X2) ; g(X1,mark(X2)) >= g(X1,X2) ; g(X1,active(X2)) >= g(X1,X2) ; active(g(a,X)) >= mark(f(b,X)) ; active(h(X)) >= mark(g(X,X)) ; active(f(X,X)) >= mark(h(a)) ; active(a) >= mark(b) ; h(mark(X)) >= h(X) ; h(active(X)) >= h(X) ; f(mark(X1),X2) >= f(X1,X2) ; f(active(X1),X2) >= f(X1,X2) ; f(X1,mark(X2)) >= f(X1,X2) ; f(X1,active(X2)) >= f(X1,X2) ; Marked_mark(g(X1,X2)) > Marked_active(g(mark(X1),X2)) ; Marked_mark(h(X)) > Marked_active(h(mark(X))) ; Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) ; Marked_active(g(a,X)) > Marked_mark(f(b,X)) ; Marked_active(h(X)) > Marked_mark(g(X,X)) ; Marked_active(f(X,X)) > Marked_mark(h(a)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(g(X1,X2)) >= active(g(mark(X1),X2)) ; mark(h(X)) >= active(h(mark(X))) ; mark(f(X1,X2)) >= active(f(mark(X1),X2)) ; mark(b) >= active(b) ; mark(a) >= active(a) ; g(mark(X1),X2) >= g(X1,X2) ; g(active(X1),X2) >= g(X1,X2) ; g(X1,mark(X2)) >= g(X1,X2) ; g(X1,active(X2)) >= g(X1,X2) ; active(g(a,X)) >= mark(f(b,X)) ; active(h(X)) >= mark(g(X,X)) ; active(f(X,X)) >= mark(h(a)) ; active(a) >= mark(b) ; h(mark(X)) >= h(X) ; h(active(X)) >= h(X) ; f(mark(X1),X2) >= f(X1,X2) ; f(active(X1),X2) >= f(X1,X2) ; f(X1,mark(X2)) >= f(X1,X2) ; f(X1,active(X2)) >= f(X1,X2) ; Marked_mark(g(X1,X2)) > Marked_active(g(mark(X1),X2)) ; Marked_mark(h(X)) > Marked_active(h(mark(X))) ; Marked_mark(f(X1,X2)) >= Marked_active(f(mark(X1),X2)) ; Marked_active(g(a,X)) > Marked_mark(f(b,X)) ; Marked_active(h(X)) > Marked_mark(g(X,X)) ; Marked_active(f(X,X)) > Marked_mark(h(a)) ; } + 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.(451 bt (583) [10]) === 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) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_g -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 1 APPLY CRITERIA (Graph splitting) Found 0 components: NOT SOLVED No proof found Cime worked for 4.764305 seconds (real time) Cime Exit Status: 0