- : unit = ()
h : heuristic = <heuristic>
- : unit = ()
APPLY CRITERIA (Marked dependency pairs)

TRS termination of:
[1] a__zeros -> cons(0,zeros)
[2] a__tail(cons(X,XS)) -> mark(XS)
[3] mark(zeros) -> a__zeros
[4] mark(tail(X)) -> a__tail(mark(X))
[5] mark(cons(X1,X2)) -> cons(mark(X1),X2)
[6] mark(0) -> 0
[7] a__zeros -> zeros
[8] a__tail(X) -> tail(X)


Sub problem: 
guided: 

DP termination of:
<Marked_a__tail(cons(X,XS)) , Marked_mark(XS)>
<Marked_mark(zeros) , Marked_a__zeros>
<Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
<Marked_mark(tail(X)) , Marked_mark(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
      --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(tail(X)) , Marked_mark(X)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
  <Marked_mark(tail(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(tail(X)) , Marked_mark(X)> 
     --> <Marked_mark(tail(X)) , Marked_mark(X)>
  <Marked_mark(tail(X)) , Marked_mark(X)> 
     --> <Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
  <Marked_mark(tail(X)) , Marked_a__tail(mark(X))> 
     --> <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)>
  <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)> 
     --> <Marked_mark(tail(X)) , Marked_mark(X)>
  <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)> 
     --> <Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__zeros >= cons(0,zeros) ;
  a__zeros >= zeros ;
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(0) >= 0 ;
  mark(zeros) >= a__zeros ;
  mark(tail(X)) >= a__tail(mark(X)) ;
  a__tail(cons(X,XS)) >= mark(XS) ;
  a__tail(X) >= tail(X) ;
  Marked_a__tail(cons(X,XS)) >= Marked_mark(XS) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(tail(X)) >= Marked_a__tail(mark(X)) ;
  Marked_mark(tail(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_a__tail(cons(X,XS)) > Marked_mark(XS) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(tail(X)) > Marked_a__tail(mark(X)) ;
 }
{
  Marked_mark(tail(X)) > Marked_mark(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: a__zeros >= cons(0,zeros)
constraint: a__zeros >= zeros
constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(0) >= 0
constraint: mark(zeros) >= a__zeros
constraint: mark(tail(X)) >= a__tail(mark(X))
constraint: a__tail(cons(X,XS)) >= mark(XS)
constraint: a__tail(X) >= tail(X)
constraint: Marked_a__tail(cons(X,XS)) >= Marked_mark(XS)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(tail(X)) >= Marked_a__tail(mark(X))
constraint: Marked_mark(tail(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] a__zeros -> cons(0,zeros)
[2] a__tail(cons(X,XS)) -> mark(XS)
[3] mark(zeros) -> a__zeros
[4] mark(tail(X)) -> a__tail(mark(X))
[5] mark(cons(X1,X2)) -> cons(mark(X1),X2)
[6] mark(0) -> 0
[7] a__zeros -> zeros
[8] a__tail(X) -> tail(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)>
<Marked_mark(zeros) , Marked_a__zeros>
<Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
<Marked_mark(tail(X)) , Marked_mark(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_a__tail(cons(X,XS)) , Marked_mark(XS)>
<Marked_mark(tail(X)) , Marked_a__tail(mark(X))>
<Marked_mark(tail(X)) , Marked_mark(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ cons ] (X0,X1) = 1 + 1*X0 + 2*X1 + 0; 
 [ mark ] (X0) = 2 + 2*X0 + 0; 
 [ zeros ] () = 0; 
 [ tail ] (X0) = 3 + 2*X0 + 0; 
 [ 0 ] () = 0; 
 [ Marked_mark ] (X0) = 1 + 3*X0 + 0; 
 [ a__tail ] (X0) = 3 + 2*X0 + 0; 
 [ a__zeros ] () = 2 + 0; 
 [ Marked_a__tail ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.029525 seconds (real time)
Cime Exit Status: 0