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

TRS termination of:
[1] nthtail(n,l) -> cond(ge(n,length(l)),n,l)
[2] cond(true,n,l) -> l
[3] cond(false,n,l) -> tail(nthtail(s(n),l))
[4] tail(nil) -> nil
[5] tail(cons(x,l)) -> l
[6] length(nil) -> 0
[7] length(cons(x,l)) -> s(length(l))
[8] ge(u,0) -> true
[9] ge(0,s(v)) -> false
[10] ge(s(u),s(v)) -> ge(u,v)


Sub problem: 
guided: 

DP termination of:
<Marked_nthtail(n,l) , Marked_cond(ge(n,length(l)),n,l)>
<Marked_nthtail(n,l) , Marked_ge(n,length(l))>
<Marked_nthtail(n,l) , Marked_length(l)>
<Marked_cond(false,n,l) , Marked_tail(nthtail(s(n),l))>
<Marked_cond(false,n,l) , Marked_nthtail(s(n),l)>
<Marked_length(cons(x,l)) , Marked_length(l)>
<Marked_ge(s(u),s(v)) , Marked_ge(u,v)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_cond(false,n,l) , Marked_nthtail(s(n),l)> 
      --> <Marked_nthtail(n,l) , Marked_cond(ge(n,length(l)),n,l)>
  <Marked_nthtail(n,l) , Marked_cond(ge(n,length(l)),n,l)> 
     --> <Marked_cond(false,n,l) , Marked_nthtail(s(n),l)>
}

{  <Marked_length(cons(x,l)) , Marked_length(l)> 
      --> <Marked_length(cons(x,l)) , Marked_length(l)>
}

{  <Marked_ge(s(u),s(v)) , Marked_ge(u,v)> 
      --> <Marked_ge(s(u),s(v)) , Marked_ge(u,v)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cond(true,n,l) >= l ;
  cond(false,n,l) >= tail(nthtail(s(n),l)) ;
  ge(s(u),s(v)) >= ge(u,v) ;
  ge(0,s(v)) >= false ;
  ge(u,0) >= true ;
  length(nil) >= 0 ;
  length(cons(x,l)) >= s(length(l)) ;
  nthtail(n,l) >= cond(ge(n,length(l)),n,l) ;
  tail(nil) >= nil ;
  tail(cons(x,l)) >= l ;
  Marked_cond(false,n,l) >= Marked_nthtail(s(n),l) ;
  Marked_nthtail(n,l) >= Marked_cond(ge(n,length(l)),n,l) ;
 }
 + Disjunctions:{ 
{
  Marked_cond(false,n,l) > Marked_nthtail(s(n),l) ;
 }
{
  Marked_nthtail(n,l) > Marked_cond(ge(n,length(l)),n,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 : 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 0.974127 seconds (real time)
Cime Exit Status: 0