- : unit = () h : heuristic = - : unit = () APPLY CRITERIA (Marked dependency pairs) TRS termination of: [1] top(sent(x)) -> top(check(rest(x))) [2] rest(nil) -> sent(nil) [3] rest(cons(x,y)) -> sent(y) [4] check(sent(x)) -> sent(check(x)) [5] check(rest(x)) -> rest(check(x)) [6] check(cons(x,y)) -> cons(check(x),y) [7] check(cons(x,y)) -> cons(x,check(y)) [8] check(cons(x,y)) -> cons(x,y) Sub problem: guided: DP termination of: END GUIDED APPLY CRITERIA (Graph splitting) Found 2 components: { --> } { --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { top(sent(x)) >= top(check(rest(x))) ; check(rest(x)) >= rest(check(x)) ; check(sent(x)) >= sent(check(x)) ; check(cons(x,y)) >= cons(check(x),y) ; check(cons(x,y)) >= cons(x,check(y)) ; check(cons(x,y)) >= cons(x,y) ; rest(nil) >= sent(nil) ; rest(cons(x,y)) >= sent(y) ; Marked_top(sent(x)) >= Marked_top(check(rest(x))) ; } + Disjunctions:{ { Marked_top(sent(x)) > Marked_top(check(rest(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 : 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: top(sent(x)) >= top(check(rest(x))) constraint: check(rest(x)) >= rest(check(x)) constraint: check(sent(x)) >= sent(check(x)) constraint: check(cons(x,y)) >= cons(check(x),y) constraint: check(cons(x,y)) >= cons(x,check(y)) constraint: check(cons(x,y)) >= cons(x,y) constraint: rest(nil) >= sent(nil) constraint: rest(cons(x,y)) >= sent(y) constraint: Marked_top(sent(x)) >= Marked_top(check(rest(x))) APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { top(sent(x)) >= top(check(rest(x))) ; check(rest(x)) >= rest(check(x)) ; check(sent(x)) >= sent(check(x)) ; check(cons(x,y)) >= cons(check(x),y) ; check(cons(x,y)) >= cons(x,check(y)) ; check(cons(x,y)) >= cons(x,y) ; rest(nil) >= sent(nil) ; rest(cons(x,y)) >= sent(y) ; Marked_check(rest(x)) >= Marked_check(x) ; Marked_check(sent(x)) >= Marked_check(x) ; Marked_check(cons(x,y)) >= Marked_check(x) ; Marked_check(cons(x,y)) >= Marked_check(y) ; } + Disjunctions:{ { Marked_check(rest(x)) > Marked_check(x) ; } { Marked_check(sent(x)) > Marked_check(x) ; } { Marked_check(cons(x,y)) > Marked_check(x) ; } { Marked_check(cons(x,y)) > Marked_check(y) ; } } === 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: top(sent(x)) >= top(check(rest(x))) constraint: check(rest(x)) >= rest(check(x)) constraint: check(sent(x)) >= sent(check(x)) constraint: check(cons(x,y)) >= cons(check(x),y) constraint: check(cons(x,y)) >= cons(x,check(y)) constraint: check(cons(x,y)) >= cons(x,y) constraint: rest(nil) >= sent(nil) constraint: rest(cons(x,y)) >= sent(y) constraint: Marked_check(rest(x)) >= Marked_check(x) constraint: Marked_check(sent(x)) >= Marked_check(x) constraint: Marked_check(cons(x,y)) >= Marked_check(x) constraint: Marked_check(cons(x,y)) >= Marked_check(y) APPLY CRITERIA (Graph splitting) Found 0 components: APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> --> --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { top(sent(x)) >= top(check(rest(x))) ; check(rest(x)) >= rest(check(x)) ; check(sent(x)) >= sent(check(x)) ; check(cons(x,y)) >= cons(check(x),y) ; check(cons(x,y)) >= cons(x,check(y)) ; check(cons(x,y)) >= cons(x,y) ; rest(nil) >= sent(nil) ; rest(cons(x,y)) >= sent(y) ; Marked_check(sent(x)) >= Marked_check(x) ; Marked_check(cons(x,y)) >= Marked_check(x) ; Marked_check(cons(x,y)) >= Marked_check(y) ; } + Disjunctions:{ { Marked_check(sent(x)) > Marked_check(x) ; } { Marked_check(cons(x,y)) > Marked_check(x) ; } { Marked_check(cons(x,y)) > Marked_check(y) ; } } === 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: top(sent(x)) >= top(check(rest(x))) constraint: check(rest(x)) >= rest(check(x)) constraint: check(sent(x)) >= sent(check(x)) constraint: check(cons(x,y)) >= cons(check(x),y) constraint: check(cons(x,y)) >= cons(x,check(y)) constraint: check(cons(x,y)) >= cons(x,y) constraint: rest(nil) >= sent(nil) constraint: rest(cons(x,y)) >= sent(y) constraint: Marked_check(sent(x)) >= Marked_check(x) constraint: Marked_check(cons(x,y)) >= Marked_check(x) constraint: Marked_check(cons(x,y)) >= Marked_check(y) APPLY CRITERIA (Graph splitting) Found 1 components: { --> --> --> --> } APPLY CRITERIA (Choosing graph) Trying to solve the following constraints: { top(sent(x)) >= top(check(rest(x))) ; check(rest(x)) >= rest(check(x)) ; check(sent(x)) >= sent(check(x)) ; check(cons(x,y)) >= cons(check(x),y) ; check(cons(x,y)) >= cons(x,check(y)) ; check(cons(x,y)) >= cons(x,y) ; rest(nil) >= sent(nil) ; rest(cons(x,y)) >= sent(y) ; Marked_check(cons(x,y)) >= Marked_check(x) ; Marked_check(cons(x,y)) >= Marked_check(y) ; } + Disjunctions:{ { Marked_check(cons(x,y)) > Marked_check(x) ; } { Marked_check(cons(x,y)) > Marked_check(y) ; } } === 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: top(sent(x)) >= top(check(rest(x))) constraint: check(rest(x)) >= rest(check(x)) constraint: check(sent(x)) >= sent(check(x)) constraint: check(cons(x,y)) >= cons(check(x),y) constraint: check(cons(x,y)) >= cons(x,check(y)) constraint: check(cons(x,y)) >= cons(x,y) constraint: rest(nil) >= sent(nil) constraint: rest(cons(x,y)) >= sent(y) constraint: Marked_check(cons(x,y)) >= Marked_check(x) constraint: Marked_check(cons(x,y)) >= Marked_check(y) APPLY CRITERIA (Graph splitting) Found 0 components: SOLVED { TRS termination of: [1] top(sent(x)) -> top(check(rest(x))) [2] rest(nil) -> sent(nil) [3] rest(cons(x,y)) -> sent(y) [4] check(sent(x)) -> sent(check(x)) [5] check(rest(x)) -> rest(check(x)) [6] check(cons(x,y)) -> cons(check(x),y) [7] check(cons(x,y)) -> cons(x,check(y)) [8] check(cons(x,y)) -> cons(x,y) , CRITERION: MDP [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: Matrix polynomial interpretation (strict sub matrices size: 1x1) = [ top ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 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 ] ]; [ nil ] () = [ [ 0 , 0 , 1 ] [ 1 , 0 , 1 ] [ 1 , 0 , 1 ] ]; [ rest ] (X0) = [ [ 1 , 1 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ check ] (X0) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; [ cons ] (X0,X1) = [ [ 1 , 1 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 0 ] ]*X1 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; [ sent ] (X0) = [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 1 , 0 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; ]} { DP termination of: , CRITERION: CG using polynomial interpretation = [ top ] (X0) = 0; [ nil ] () = 1; [ rest ] (X0) = 2*X0 + 1; [ Marked_check ] (X0) = 3*X0; [ check ] (X0) = 2*X0; [ cons ] (X0,X1) = 2*X1 + 2*X0; [ sent ] (X0) = 3*X0; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: CG using polynomial interpretation = [ top ] (X0) = 0; [ nil ] () = 1; [ rest ] (X0) = 1*X0 + 3; [ Marked_check ] (X0) = 3*X0; [ check ] (X0) = 2*X0; [ cons ] (X0,X1) = 1*X1 + 1*X0; [ sent ] (X0) = 1*X0 + 2; removing [ { DP termination of: , CRITERION: SG [ { DP termination of: , CRITERION: ORD [ Solution found: polynomial interpretation = [ top ] (X0) = 0; [ nil ] () = 0; [ rest ] (X0) = 2 + 0; [ Marked_check ] (X0) = 3*X0 + 0; [ check ] (X0) = 2 + 3*X0 + 0; [ cons ] (X0,X1) = 2 + 2*X0 + 2*X1 + 0; [ sent ] (X0) = 0; ]} ]} ]} ]} ]} ]} ]} Cime worked for 0.427806 seconds (real time) Cime Exit Status: 0