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

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


Sub problem: 
guided: 

DP termination of:
<Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_active(zeros) , Marked_cons(0,zeros)>
<Marked_active(tail(cons(X,XS))) , Marked_mark(XS)>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
<Marked_mark(cons(X1,X2)) , Marked_cons(mark(X1),X2)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(0) , Marked_active(0)>
<Marked_mark(tail(X)) , Marked_active(tail(mark(X)))>
<Marked_mark(tail(X)) , Marked_tail(mark(X))>
<Marked_mark(tail(X)) , Marked_mark(X)>
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
<Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
<Marked_tail(mark(X)) , Marked_tail(X)>
<Marked_tail(active(X)) , Marked_tail(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <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_active(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(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_mark(tail(X)) , Marked_mark(X)> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
  <Marked_mark(tail(X)) , Marked_active(tail(mark(X)))> 
     --> <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)>
  <Marked_mark(tail(X)) , Marked_active(tail(mark(X)))> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <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_active(tail(mark(X)))>
  <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(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
  <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))> 
     --> <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)>
  <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <Marked_mark(zeros) , Marked_active(zeros)> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)> 
     --> <Marked_mark(tail(X)) , Marked_mark(X)>
  <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)> 
     --> <Marked_mark(tail(X)) , Marked_active(tail(mark(X)))>
  <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_active(tail(cons(X,XS))) , Marked_mark(XS)> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(tail(X)) , Marked_mark(X)>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(tail(X)) , Marked_active(tail(mark(X)))>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
}

{  <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)> 
      --> <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
}

{  <Marked_tail(active(X)) , Marked_tail(X)> 
      --> <Marked_tail(active(X)) , Marked_tail(X)>
  <Marked_tail(active(X)) , Marked_tail(X)> 
     --> <Marked_tail(mark(X)) , Marked_tail(X)>
  <Marked_tail(mark(X)) , Marked_tail(X)> 
     --> <Marked_tail(active(X)) , Marked_tail(X)>
  <Marked_tail(mark(X)) , Marked_tail(X)> 
     --> <Marked_tail(mark(X)) , Marked_tail(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ;
  Marked_mark(zeros) >= Marked_active(zeros) ;
  Marked_mark(tail(X)) >= Marked_mark(X) ;
  Marked_mark(tail(X)) >= Marked_active(tail(mark(X))) ;
  Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ;
  Marked_active(tail(cons(X,XS))) >= Marked_mark(XS) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ;
 }
{
  Marked_mark(zeros) > Marked_active(zeros) ;
 }
{
  Marked_mark(tail(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(tail(X)) > Marked_active(tail(mark(X))) ;
 }
{
  Marked_active(zeros) > Marked_mark(cons(0,zeros)) ;
 }
{
  Marked_active(tail(cons(X,XS))) > Marked_mark(XS) ;
 }
 } 
=== 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(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2))
constraint: Marked_mark(zeros) >= Marked_active(zeros)
constraint: Marked_mark(tail(X)) >= Marked_mark(X)
constraint: Marked_mark(tail(X)) >= Marked_active(tail(mark(X)))
constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros))
constraint: Marked_active(tail(cons(X,XS))) >= Marked_mark(XS)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ;
  Marked_cons(active(X1),X2) >= Marked_cons(X1,X2) ;
  Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2) ;
  Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ;
 }
{
  Marked_cons(active(X1),X2) > Marked_cons(X1,X2) ;
 }
{
  Marked_cons(X1,mark(X2)) > Marked_cons(X1,X2) ;
 }
{
  Marked_cons(X1,active(X2)) > Marked_cons(X1,X2) ;
 }
 } 
=== 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(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2)
constraint: Marked_cons(active(X1),X2) >= Marked_cons(X1,X2)
constraint: Marked_cons(X1,mark(X2)) >= Marked_cons(X1,X2)
constraint: Marked_cons(X1,active(X2)) >= Marked_cons(X1,X2)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_tail(mark(X)) >= Marked_tail(X) ;
  Marked_tail(active(X)) >= Marked_tail(X) ;
 }
 + Disjunctions:{ 
{
  Marked_tail(mark(X)) > Marked_tail(X) ;
 }
{
  Marked_tail(active(X)) > Marked_tail(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(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_tail(mark(X)) >= Marked_tail(X)
constraint: Marked_tail(active(X)) >= Marked_tail(X)
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(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
  <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <Marked_mark(zeros) , Marked_active(zeros)> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2)) ;
  Marked_mark(zeros) >= Marked_active(zeros) ;
  Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_active(cons(mark(X1),X2)) ;
 }
{
  Marked_mark(zeros) > Marked_active(zeros) ;
 }
{
  Marked_active(zeros) > Marked_mark(cons(0,zeros)) ;
 }
 } 
=== 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(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(cons(X1,X2)) >= Marked_active(cons(mark(X1),X2))
constraint: Marked_mark(zeros) >= Marked_active(zeros)
constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros))
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(zeros) , Marked_active(zeros)>
  <Marked_mark(zeros) , Marked_active(zeros)> 
     --> <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_active(zeros) , Marked_mark(cons(0,zeros))> 
     --> <Marked_mark(zeros) , Marked_active(zeros)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(zeros) >= Marked_active(zeros) ;
  Marked_active(zeros) >= Marked_mark(cons(0,zeros)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(zeros) > Marked_active(zeros) ;
 }
{
  Marked_active(zeros) > Marked_mark(cons(0,zeros)) ;
 }
 } 
=== 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 : 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: mark(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(zeros) >= Marked_active(zeros)
constraint: Marked_active(zeros) >= Marked_mark(cons(0,zeros))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
      --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(cons(X1,X2)) >= active(cons(mark(X1),X2)) ;
  mark(0) >= active(0) ;
  mark(zeros) >= active(zeros) ;
  mark(tail(X)) >= active(tail(mark(X))) ;
  cons(mark(X1),X2) >= cons(X1,X2) ;
  cons(active(X1),X2) >= cons(X1,X2) ;
  cons(X1,mark(X2)) >= cons(X1,X2) ;
  cons(X1,active(X2)) >= cons(X1,X2) ;
  active(zeros) >= mark(cons(0,zeros)) ;
  active(tail(cons(X,XS))) >= mark(XS) ;
  tail(mark(X)) >= tail(X) ;
  tail(active(X)) >= tail(X) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
 } 
=== 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: mark(cons(X1,X2)) >= active(cons(mark(X1),X2))
constraint: mark(0) >= active(0)
constraint: mark(zeros) >= active(zeros)
constraint: mark(tail(X)) >= active(tail(mark(X)))
constraint: cons(mark(X1),X2) >= cons(X1,X2)
constraint: cons(active(X1),X2) >= cons(X1,X2)
constraint: cons(X1,mark(X2)) >= cons(X1,X2)
constraint: cons(X1,active(X2)) >= cons(X1,X2)
constraint: active(zeros) >= mark(cons(0,zeros))
constraint: active(tail(cons(X,XS))) >= mark(XS)
constraint: tail(mark(X)) >= tail(X)
constraint: tail(active(X)) >= tail(X)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
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(zeros) -> mark(cons(0,zeros))
[2] active(tail(cons(X,XS))) -> mark(XS)
[3] mark(zeros) -> active(zeros)
[4] mark(cons(X1,X2)) -> active(cons(mark(X1),X2))
[5] mark(0) -> active(0)
[6] mark(tail(X)) -> active(tail(mark(X)))
[7] cons(mark(X1),X2) -> cons(X1,X2)
[8] cons(X1,mark(X2)) -> cons(X1,X2)
[9] cons(active(X1),X2) -> cons(X1,X2)
[10] cons(X1,active(X2)) -> cons(X1,X2)
[11] tail(mark(X)) -> tail(X)
[12] tail(active(X)) -> tail(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_active(zeros) , Marked_cons(0,zeros)>
<Marked_active(tail(cons(X,XS))) , Marked_mark(XS)>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
<Marked_mark(cons(X1,X2)) , Marked_cons(mark(X1),X2)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(0) , Marked_active(0)>
<Marked_mark(tail(X)) , Marked_active(tail(mark(X)))>
<Marked_mark(tail(X)) , Marked_tail(mark(X))>
<Marked_mark(tail(X)) , Marked_mark(X)>
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
<Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
<Marked_tail(mark(X)) , Marked_tail(X)>
<Marked_tail(active(X)) , Marked_tail(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_active(tail(cons(X,XS))) , Marked_mark(XS)>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(tail(X)) , Marked_active(tail(mark(X)))>
<Marked_mark(tail(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0; 
 [ Marked_mark ] (X0) = 2*X0 + 2; 
 [ active ] (X0) = 1*X0; 
 [ 0 ] () = 0; 
 [ cons ] (X0,X1) = 2*X1 + 1*X0; 
 [ Marked_active ] (X0) = 1*X0 + 2; 
 [ tail ] (X0) = 2*X0 + 3; 
 [ zeros ] () = 0; 
 removing <Marked_active(tail(cons(X,XS))),Marked_mark(XS)><Marked_mark(
                                                             tail(X)),
Marked_active(tail(mark(X)))><Marked_mark(tail(X)),Marked_mark(X)>
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_active(cons(mark(X1),X2))>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2; 
 [ active ] (X0) = 0; 
 [ 0 ] () = 0; 
 [ cons ] (X0,X1) = 0; 
 [ Marked_active ] (X0) = 1*X0; 
 [ tail ] (X0) = 0; 
 [ zeros ] () = 2; 
 removing <Marked_mark(cons(X1,X2)),Marked_active(cons(mark(X1),X2))>
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_mark(zeros) , Marked_active(zeros)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
 [ mark ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ Marked_mark ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ active ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ cons ] (X0,X1) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ Marked_active ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ tail ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ zeros ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 removing <Marked_mark(zeros),Marked_active(zeros)>
 [ {
      
     DP termination of:
     <Marked_active(zeros) , Marked_mark(cons(0,zeros))>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
      [ mark ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + 
     [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ Marked_mark ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ active ] (X0) = [ [ 1 , 0 , 1 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 1 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 1 ] ]*X0 + [ [ 1 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ tail ] (X0) = [ [ 0 , 1 , 1 ] [ 0 , 1 , 1 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ zeros ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,mark(X2)) , Marked_cons(X1,X2)>
<Marked_cons(active(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(X1,active(X2)) , Marked_cons(X1,X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 3*X0 + 0; 
 [ active ] (X0) = 2 + 1*X0 + 0; 
 [ 0 ] () = 0; 
 [ cons ] (X0,X1) = 3*X1 + 0; 
 [ tail ] (X0) = 1 + 1*X0 + 0; 
 [ zeros ] () = 0; 
 [ Marked_cons ] (X0,X1) = 3*X0 + 3*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_tail(mark(X)) , Marked_tail(X)>
<Marked_tail(active(X)) , Marked_tail(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 3*X0 + 0; 
 [ active ] (X0) = 2 + 1*X0 + 0; 
 [ 0 ] () = 0; 
 [ Marked_tail ] (X0) = 3*X0 + 0; 
 [ cons ] (X0,X1) = 3*X1 + 0; 
 [ tail ] (X0) = 3 + 2*X0 + 0; 
 [ zeros ] () = 0; 
 ]} 
 ]} 
 ]} 

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