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