- : unit = () - : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] active(f(f(a))) -> mark(c(f(g(f(a))))) [2] active(f(X)) -> f(active(X)) [3] active(g(X)) -> g(active(X)) [4] f(mark(X)) -> mark(f(X)) [5] g(mark(X)) -> mark(g(X)) [6] proper(f(X)) -> f(proper(X)) [7] proper(a) -> ok(a) [8] proper(c(X)) -> c(proper(X)) [9] proper(g(X)) -> g(proper(X)) [10] f(ok(X)) -> ok(f(X)) [11] c(ok(X)) -> ok(c(X)) [12] g(ok(X)) -> ok(g(X)) [13] top(mark(X)) -> top(proper(X)) [14] 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: { c(ok(X)) >= ok(c(X)) ; f(mark(X)) >= mark(f(X)) ; f(ok(X)) >= ok(f(X)) ; g(mark(X)) >= mark(g(X)) ; g(ok(X)) >= ok(g(X)) ; active(f(f(a))) >= mark(c(f(g(f(a))))) ; active(f(X)) >= f(active(X)) ; active(g(X)) >= g(active(X)) ; proper(c(X)) >= c(proper(X)) ; proper(f(X)) >= f(proper(X)) ; proper(g(X)) >= g(proper(X)) ; 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: c(ok(X)) >= ok(c(X)) constraint: f(mark(X)) >= mark(f(X)) constraint: f(ok(X)) >= ok(f(X)) constraint: g(mark(X)) >= mark(g(X)) constraint: g(ok(X)) >= ok(g(X)) constraint: active(f(f(a))) >= mark(c(f(g(f(a))))) constraint: active(f(X)) >= f(active(X)) constraint: active(g(X)) >= g(active(X)) constraint: proper(c(X)) >= c(proper(X)) constraint: proper(f(X)) >= f(proper(X)) constraint: proper(g(X)) >= g(proper(X)) constraint: proper(a) >= ok(a) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(mark(X)) >= Marked_top(proper(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Subterm criterion) ST: Marked_proper -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_active -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_c -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_f -> 1 APPLY CRITERIA (Subterm criterion) ST: Marked_g -> 1 APPLY CRITERIA (Graph splitting) Found 1 components: { --> } APPLY CRITERIA (Subterm criterion) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { c(ok(X)) >= ok(c(X)) ; f(mark(X)) >= mark(f(X)) ; f(ok(X)) >= ok(f(X)) ; g(mark(X)) >= mark(g(X)) ; g(ok(X)) >= ok(g(X)) ; active(f(f(a))) >= mark(c(f(g(f(a))))) ; active(f(X)) >= f(active(X)) ; active(g(X)) >= g(active(X)) ; proper(c(X)) >= c(proper(X)) ; proper(f(X)) >= f(proper(X)) ; proper(g(X)) >= g(proper(X)) ; proper(a) >= ok(a) ; top(mark(X)) >= top(proper(X)) ; top(ok(X)) >= top(active(X)) ; Marked_top(ok(X)) >= Marked_top(active(X)) ; } + Disjunctions:{ { 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 Sat solver result read === STOPING TIMER real === === STOPING TIMER virtual === constraint: c(ok(X)) >= ok(c(X)) constraint: f(mark(X)) >= mark(f(X)) constraint: f(ok(X)) >= ok(f(X)) constraint: g(mark(X)) >= mark(g(X)) constraint: g(ok(X)) >= ok(g(X)) constraint: active(f(f(a))) >= mark(c(f(g(f(a))))) constraint: active(f(X)) >= f(active(X)) constraint: active(g(X)) >= g(active(X)) constraint: proper(c(X)) >= c(proper(X)) constraint: proper(f(X)) >= f(proper(X)) constraint: proper(g(X)) >= g(proper(X)) constraint: proper(a) >= ok(a) constraint: top(mark(X)) >= top(proper(X)) constraint: top(ok(X)) >= top(active(X)) constraint: Marked_top(ok(X)) >= Marked_top(active(X)) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] active(f(f(a))) -> mark(c(f(g(f(a))))) [2] active(f(X)) -> f(active(X)) [3] active(g(X)) -> g(active(X)) [4] f(mark(X)) -> mark(f(X)) [5] g(mark(X)) -> mark(g(X)) [6] proper(f(X)) -> f(proper(X)) [7] proper(a) -> ok(a) [8] proper(c(X)) -> c(proper(X)) [9] proper(g(X)) -> g(proper(X)) [10] f(ok(X)) -> ok(f(X)) [11] c(ok(X)) -> ok(c(X)) [12] g(ok(X)) -> ok(g(X)) [13] top(mark(X)) -> top(proper(X)) [14] top(ok(X)) -> top(active(X)) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ mark ] (X0) = 2*X0 + 2; [ top ] (X0) = 0; [ a ] () = 1; [ f ] (X0) = 2*X0; [ proper ] (X0) = 2*X0; [ c ] (X0) = 0; [ Marked_top ] (X0) = 1*X0; [ active ] (X0) = 2*X0; [ g ] (X0) = 1*X0; [ ok ] (X0) = 2*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ mark ] (X0) = 2 + 0; [ top ] (X0) = 0; [ a ] () = 2 + 0; [ f ] (X0) = 2*X0 + 0; [ proper ] (X0) = 3*X0 + 0; [ c ] (X0) = 2*X0 + 0; [ Marked_top ] (X0) = 3*X0 + 0; [ active ] (X0) = 2*X0 + 0; [ g ] (X0) = 2*X0 + 0; [ ok ] (X0) = 2 + 2*X0 + 0; ]} ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} { DP termination of: , CRITERION: ST [ { DP termination of: , CRITERION: SG [ ]} ]} ]} ]} Cime worked for 0.191571 seconds (real time) Cime Exit Status: 0