- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(f(b,X,c)) -> mark(f(X,c,X)) [2] active(c) -> mark(b) [3] mark(f(X1,X2,X3)) -> active(f(X1,mark(X2),X3)) [4] mark(b) -> active(b) [5] mark(c) -> active(c) [6] f(mark(X1),X2,X3) -> f(X1,X2,X3) [7] f(X1,mark(X2),X3) -> f(X1,X2,X3) [8] f(X1,X2,mark(X3)) -> f(X1,X2,X3) [9] f(active(X1),X2,X3) -> f(X1,X2,X3) [10] f(X1,active(X2),X3) -> f(X1,X2,X3) [11] f(X1,X2,active(X3)) -> f(X1,X2,X3) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> --> --> --> --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(f(X1,X2,X3)) >= active(f(X1,mark(X2),X3)) ; mark(c) >= active(c) ; mark(b) >= active(b) ; f(mark(X1),X2,X3) >= f(X1,X2,X3) ; f(active(X1),X2,X3) >= f(X1,X2,X3) ; f(X1,mark(X2),X3) >= f(X1,X2,X3) ; f(X1,active(X2),X3) >= f(X1,X2,X3) ; f(X1,X2,mark(X3)) >= f(X1,X2,X3) ; f(X1,X2,active(X3)) >= f(X1,X2,X3) ; active(f(b,X,c)) >= mark(f(X,c,X)) ; active(c) >= mark(b) ; Marked_mark(f(X1,X2,X3)) >= Marked_mark(X2) ; Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,mark(X2),X3)) ; Marked_active(f(b,X,c)) >= Marked_mark(f(X,c,X)) ; } + Disjunctions:{ { Marked_mark(f(X1,X2,X3)) > Marked_mark(X2) ; } { Marked_mark(f(X1,X2,X3)) > Marked_active(f(X1,mark(X2),X3)) ; } { Marked_active(f(b,X,c)) > Marked_mark(f(X,c,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: mark(f(X1,X2,X3)) >= active(f(X1,mark(X2),X3)) constraint: mark(c) >= active(c) constraint: mark(b) >= active(b) constraint: f(mark(X1),X2,X3) >= f(X1,X2,X3) constraint: f(active(X1),X2,X3) >= f(X1,X2,X3) constraint: f(X1,mark(X2),X3) >= f(X1,X2,X3) constraint: f(X1,active(X2),X3) >= f(X1,X2,X3) constraint: f(X1,X2,mark(X3)) >= f(X1,X2,X3) constraint: f(X1,X2,active(X3)) >= f(X1,X2,X3) constraint: active(f(b,X,c)) >= mark(f(X,c,X)) constraint: active(c) >= mark(b) constraint: Marked_mark(f(X1,X2,X3)) >= Marked_mark(X2) constraint: Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,mark(X2),X3)) constraint: Marked_active(f(b,X,c)) >= Marked_mark(f(X,c,X)) APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 3 APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { mark(f(X1,X2,X3)) >= active(f(X1,mark(X2),X3)) ; mark(c) >= active(c) ; mark(b) >= active(b) ; f(mark(X1),X2,X3) >= f(X1,X2,X3) ; f(active(X1),X2,X3) >= f(X1,X2,X3) ; f(X1,mark(X2),X3) >= f(X1,X2,X3) ; f(X1,active(X2),X3) >= f(X1,X2,X3) ; f(X1,X2,mark(X3)) >= f(X1,X2,X3) ; f(X1,X2,active(X3)) >= f(X1,X2,X3) ; active(f(b,X,c)) >= mark(f(X,c,X)) ; active(c) >= mark(b) ; Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,mark(X2),X3)) ; Marked_active(f(b,X,c)) >= Marked_mark(f(X,c,X)) ; } + Disjunctions:{ { Marked_mark(f(X1,X2,X3)) > Marked_active(f(X1,mark(X2),X3)) ; } { Marked_active(f(b,X,c)) > Marked_mark(f(X,c,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 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(f(X1,X2,X3)) >= active(f(X1,mark(X2),X3)) ; mark(c) >= active(c) ; mark(b) >= active(b) ; f(mark(X1),X2,X3) >= f(X1,X2,X3) ; f(active(X1),X2,X3) >= f(X1,X2,X3) ; f(X1,mark(X2),X3) >= f(X1,X2,X3) ; f(X1,active(X2),X3) >= f(X1,X2,X3) ; f(X1,X2,mark(X3)) >= f(X1,X2,X3) ; f(X1,X2,active(X3)) >= f(X1,X2,X3) ; active(f(b,X,c)) >= mark(f(X,c,X)) ; active(c) >= mark(b) ; Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,mark(X2),X3)) ; Marked_active(f(b,X,c)) > Marked_mark(f(X,c,X)) ; } APPLY CRITERIA (SOLVE_ORD) Trying to solve the following constraints: { mark(f(X1,X2,X3)) >= active(f(X1,mark(X2),X3)) ; mark(c) >= active(c) ; mark(b) >= active(b) ; f(mark(X1),X2,X3) >= f(X1,X2,X3) ; f(active(X1),X2,X3) >= f(X1,X2,X3) ; f(X1,mark(X2),X3) >= f(X1,X2,X3) ; f(X1,active(X2),X3) >= f(X1,X2,X3) ; f(X1,X2,mark(X3)) >= f(X1,X2,X3) ; f(X1,X2,active(X3)) >= f(X1,X2,X3) ; active(f(b,X,c)) >= mark(f(X,c,X)) ; active(c) >= mark(b) ; Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,mark(X2),X3)) ; Marked_active(f(b,X,c)) > Marked_mark(f(X,c,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.(256 bt (263) [9]) === 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 1 components: { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 2 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 19.755449 seconds (real time) Cime Exit Status: 0