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

TRS termination of:
[1] a__zeros -> cons(0,zeros)
[2] a__U11(tt,L) -> a__U12(tt,L)
[3] a__U12(tt,L) -> s(a__length(mark(L)))
[4] a__length(nil) -> 0
[5] a__length(cons(N,L)) -> a__U11(tt,L)
[6] mark(zeros) -> a__zeros
[7] mark(U11(X1,X2)) -> a__U11(mark(X1),X2)
[8] mark(U12(X1,X2)) -> a__U12(mark(X1),X2)
[9] mark(length(X)) -> a__length(mark(X))
[10] mark(cons(X1,X2)) -> cons(mark(X1),X2)
[11] mark(0) -> 0
[12] mark(tt) -> tt
[13] mark(s(X)) -> s(mark(X))
[14] mark(nil) -> nil
[15] a__zeros -> zeros
[16] a__U11(X1,X2) -> U11(X1,X2)
[17] a__U12(X1,X2) -> U12(X1,X2)
[18] a__length(X) -> length(X)


Sub problem: 
guided: 

DP termination of:
<Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
<Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
<Marked_a__U12(tt,L) , Marked_mark(L)>
<Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)>
<Marked_mark(zeros) , Marked_a__zeros>
<Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
<Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
<Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
<Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
<Marked_mark(length(X)) , Marked_a__length(mark(X))>
<Marked_mark(length(X)) , Marked_mark(X)>
<Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
<Marked_mark(s(X)) , Marked_mark(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(length(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_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(length(X)) , Marked_mark(X)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(length(X)) , Marked_mark(X)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(length(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(length(X)) , Marked_a__length(mark(X))> 
     --> <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(length(X)) , Marked_mark(X)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)> 
     --> <Marked_a__U12(tt,L) , Marked_mark(L)>
  <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)> 
     --> <Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(length(X)) , Marked_mark(X)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)> 
     --> <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
  <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)> 
     --> <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(length(X)) , Marked_mark(X)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(length(X)) , Marked_a__length(mark(X))>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_a__U12(tt,L) , Marked_a__length(mark(L))> 
     --> <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)>
  <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)> 
     --> <Marked_a__U12(tt,L) , Marked_mark(L)>
  <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)> 
     --> <Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__zeros >= cons(0,zeros) ;
  a__zeros >= zeros ;
  a__U12(tt,L) >= s(a__length(mark(L))) ;
  a__U12(X1,X2) >= U12(X1,X2) ;
  a__U11(tt,L) >= a__U12(tt,L) ;
  a__U11(X1,X2) >= U11(X1,X2) ;
  a__length(cons(N,L)) >= a__U11(tt,L) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(0) >= 0 ;
  mark(zeros) >= a__zeros ;
  mark(tt) >= tt ;
  mark(s(X)) >= s(mark(X)) ;
  mark(nil) >= nil ;
  mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ;
  mark(U12(X1,X2)) >= a__U12(mark(X1),X2) ;
  mark(length(X)) >= a__length(mark(X)) ;
  Marked_a__length(cons(N,L)) >= Marked_a__U11(tt,L) ;
  Marked_a__U12(tt,L) >= Marked_a__length(mark(L)) ;
  Marked_a__U12(tt,L) >= Marked_mark(L) ;
  Marked_a__U11(tt,L) >= Marked_a__U12(tt,L) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(s(X)) >= Marked_mark(X) ;
  Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ;
  Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(U12(X1,X2)) >= Marked_a__U12(mark(X1),X2) ;
  Marked_mark(U12(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(length(X)) >= Marked_a__length(mark(X)) ;
  Marked_mark(length(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_a__length(cons(N,L)) > Marked_a__U11(tt,L) ;
 }
{
  Marked_a__U12(tt,L) > Marked_a__length(mark(L)) ;
 }
{
  Marked_a__U12(tt,L) > Marked_mark(L) ;
 }
{
  Marked_a__U11(tt,L) > Marked_a__U12(tt,L) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(s(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ;
 }
{
  Marked_mark(U11(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(U12(X1,X2)) > Marked_a__U12(mark(X1),X2) ;
 }
{
  Marked_mark(U12(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(length(X)) > Marked_a__length(mark(X)) ;
 }
{
  Marked_mark(length(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: a__U12(tt,L) >= s(a__length(mark(L)))
constraint: a__U12(X1,X2) >= U12(X1,X2)
constraint: a__U11(tt,L) >= a__U12(tt,L)
constraint: a__U11(X1,X2) >= U11(X1,X2)
constraint: a__length(cons(N,L)) >= a__U11(tt,L)
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(0) >= 0
constraint: mark(zeros) >= a__zeros
constraint: mark(tt) >= tt
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(nil) >= nil
constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2)
constraint: mark(U12(X1,X2)) >= a__U12(mark(X1),X2)
constraint: mark(length(X)) >= a__length(mark(X))
constraint: Marked_a__length(cons(N,L)) >= Marked_a__U11(tt,L)
constraint: Marked_a__U12(tt,L) >= Marked_a__length(mark(L))
constraint: Marked_a__U12(tt,L) >= Marked_mark(L)
constraint: Marked_a__U11(tt,L) >= Marked_a__U12(tt,L)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(s(X)) >= Marked_mark(X)
constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2)
constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(U12(X1,X2)) >= Marked_a__U12(mark(X1),X2)
constraint: Marked_mark(U12(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(length(X)) >= Marked_a__length(mark(X))
constraint: Marked_mark(length(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(s(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_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(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(cons(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)> 
     --> <Marked_a__U12(tt,L) , Marked_mark(L)>
  <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)> 
     --> <Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)> 
     --> <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
  <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)> 
     --> <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(s(X)) , Marked_mark(X)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(cons(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U12(X1,X2)) , Marked_a__U12(mark(X1),X2)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_mark(X1)>
  <Marked_a__U12(tt,L) , Marked_mark(L)> 
     --> <Marked_mark(U11(X1,X2)) , Marked_a__U11(mark(X1),X2)>
  <Marked_a__U12(tt,L) , Marked_a__length(mark(L))> 
     --> <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)>
  <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)> 
     --> <Marked_a__U12(tt,L) , Marked_mark(L)>
  <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)> 
     --> <Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__zeros >= cons(0,zeros) ;
  a__zeros >= zeros ;
  a__U12(tt,L) >= s(a__length(mark(L))) ;
  a__U12(X1,X2) >= U12(X1,X2) ;
  a__U11(tt,L) >= a__U12(tt,L) ;
  a__U11(X1,X2) >= U11(X1,X2) ;
  a__length(cons(N,L)) >= a__U11(tt,L) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(0) >= 0 ;
  mark(zeros) >= a__zeros ;
  mark(tt) >= tt ;
  mark(s(X)) >= s(mark(X)) ;
  mark(nil) >= nil ;
  mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ;
  mark(U12(X1,X2)) >= a__U12(mark(X1),X2) ;
  mark(length(X)) >= a__length(mark(X)) ;
  Marked_a__length(cons(N,L)) >= Marked_a__U11(tt,L) ;
  Marked_a__U12(tt,L) >= Marked_a__length(mark(L)) ;
  Marked_a__U12(tt,L) >= Marked_mark(L) ;
  Marked_a__U11(tt,L) >= Marked_a__U12(tt,L) ;
  Marked_mark(cons(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(s(X)) >= Marked_mark(X) ;
  Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2) ;
  Marked_mark(U11(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(U12(X1,X2)) >= Marked_a__U12(mark(X1),X2) ;
  Marked_mark(U12(X1,X2)) >= Marked_mark(X1) ;
 }
 + Disjunctions:{ 
{
  Marked_a__length(cons(N,L)) > Marked_a__U11(tt,L) ;
 }
{
  Marked_a__U12(tt,L) > Marked_a__length(mark(L)) ;
 }
{
  Marked_a__U12(tt,L) > Marked_mark(L) ;
 }
{
  Marked_a__U11(tt,L) > Marked_a__U12(tt,L) ;
 }
{
  Marked_mark(cons(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(s(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U11(X1,X2)) > Marked_a__U11(mark(X1),X2) ;
 }
{
  Marked_mark(U11(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(U12(X1,X2)) > Marked_a__U12(mark(X1),X2) ;
 }
{
  Marked_mark(U12(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: a__zeros >= cons(0,zeros)
constraint: a__zeros >= zeros
constraint: a__U12(tt,L) >= s(a__length(mark(L)))
constraint: a__U12(X1,X2) >= U12(X1,X2)
constraint: a__U11(tt,L) >= a__U12(tt,L)
constraint: a__U11(X1,X2) >= U11(X1,X2)
constraint: a__length(cons(N,L)) >= a__U11(tt,L)
constraint: a__length(nil) >= 0
constraint: a__length(X) >= length(X)
constraint: mark(cons(X1,X2)) >= cons(mark(X1),X2)
constraint: mark(0) >= 0
constraint: mark(zeros) >= a__zeros
constraint: mark(tt) >= tt
constraint: mark(s(X)) >= s(mark(X))
constraint: mark(nil) >= nil
constraint: mark(U11(X1,X2)) >= a__U11(mark(X1),X2)
constraint: mark(U12(X1,X2)) >= a__U12(mark(X1),X2)
constraint: mark(length(X)) >= a__length(mark(X))
constraint: Marked_a__length(cons(N,L)) >= Marked_a__U11(tt,L)
constraint: Marked_a__U12(tt,L) >= Marked_a__length(mark(L))
constraint: Marked_a__U12(tt,L) >= Marked_mark(L)
constraint: Marked_a__U11(tt,L) >= Marked_a__U12(tt,L)
constraint: Marked_mark(cons(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(s(X)) >= Marked_mark(X)
constraint: Marked_mark(U11(X1,X2)) >= Marked_a__U11(mark(X1),X2)
constraint: Marked_mark(U11(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(U12(X1,X2)) >= Marked_a__U12(mark(X1),X2)
constraint: Marked_mark(U12(X1,X2)) >= Marked_mark(X1)
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)> 
      --> <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)>
  <Marked_a__U12(tt,L) , Marked_a__length(mark(L))> 
     --> <Marked_a__length(cons(N,L)) , Marked_a__U11(tt,L)>
  <Marked_a__U11(tt,L) , Marked_a__U12(tt,L)> 
     --> <Marked_a__U12(tt,L) , Marked_a__length(mark(L))>
}

{  <Marked_mark(s(X)) , Marked_mark(X)> 
      --> <Marked_mark(s(X)) , Marked_mark(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__zeros >= cons(0,zeros) ;
  a__zeros >= zeros ;
  a__U12(tt,L) >= s(a__length(mark(L))) ;
  a__U12(X1,X2) >= U12(X1,X2) ;
  a__U11(tt,L) >= a__U12(tt,L) ;
  a__U11(X1,X2) >= U11(X1,X2) ;
  a__length(cons(N,L)) >= a__U11(tt,L) ;
  a__length(nil) >= 0 ;
  a__length(X) >= length(X) ;
  mark(cons(X1,X2)) >= cons(mark(X1),X2) ;
  mark(0) >= 0 ;
  mark(zeros) >= a__zeros ;
  mark(tt) >= tt ;
  mark(s(X)) >= s(mark(X)) ;
  mark(nil) >= nil ;
  mark(U11(X1,X2)) >= a__U11(mark(X1),X2) ;
  mark(U12(X1,X2)) >= a__U12(mark(X1),X2) ;
  mark(length(X)) >= a__length(mark(X)) ;
  Marked_a__length(cons(N,L)) >= Marked_a__U11(tt,L) ;
  Marked_a__U12(tt,L) >= Marked_a__length(mark(L)) ;
  Marked_a__U11(tt,L) >= Marked_a__U12(tt,L) ;
 }
 + Disjunctions:{ 
{
  Marked_a__length(cons(N,L)) > Marked_a__U11(tt,L) ;
 }
{
  Marked_a__U12(tt,L) > Marked_a__length(mark(L)) ;
 }
{
  Marked_a__U11(tt,L) > Marked_a__U12(tt,L) ;
 }
 } 
=== 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
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 19.060158 seconds (real time)
Cime Exit Status: 0