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

TRS termination of:
[1] empty(nil) -> true
[2] empty(cons(x,l)) -> false
[3] head(cons(x,l)) -> x
[4] tail(nil) -> nil
[5] tail(cons(x,l)) -> l
[6] rev(nil) -> nil
[7] rev(cons(x,l)) -> cons(rev1(x,l),rev2(x,l))
[8] last(x,l) -> if(empty(l),x,l)
[9] if(true,x,l) -> x
[10] if(false,x,l) -> last(head(l),tail(l))
[11] rev2(x,nil) -> nil
[12] rev2(x,cons(y,l)) -> rev(cons(x,rev2(y,l)))


Sub problem: 
guided: 

DP termination of:
<Marked_rev(cons(x,l)) , Marked_rev2(x,l)>
<Marked_last(x,l) , Marked_if(empty(l),x,l)>
<Marked_last(x,l) , Marked_empty(l)>
<Marked_if(false,x,l) , Marked_last(head(l),tail(l))>
<Marked_if(false,x,l) , Marked_head(l)>
<Marked_if(false,x,l) , Marked_tail(l)>
<Marked_rev2(x,cons(y,l)) , Marked_rev(cons(x,rev2(y,l)))>
<Marked_rev2(x,cons(y,l)) , Marked_rev2(y,l)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_if(false,x,l) , Marked_last(head(l),tail(l))> 
      --> <Marked_last(x,l) , Marked_if(empty(l),x,l)>
  <Marked_last(x,l) , Marked_if(empty(l),x,l)> 
     --> <Marked_if(false,x,l) , Marked_last(head(l),tail(l))>
}

{  <Marked_rev2(x,cons(y,l)) , Marked_rev2(y,l)> 
      --> <Marked_rev2(x,cons(y,l)) , Marked_rev2(y,l)>
  <Marked_rev2(x,cons(y,l)) , Marked_rev2(y,l)> 
     --> <Marked_rev2(x,cons(y,l)) , Marked_rev(cons(x,rev2(y,l)))>
  <Marked_rev2(x,cons(y,l)) , Marked_rev(cons(x,rev2(y,l)))> 
     --> <Marked_rev(cons(x,l)) , Marked_rev2(x,l)>
  <Marked_rev(cons(x,l)) , Marked_rev2(x,l)> 
     --> <Marked_rev2(x,cons(y,l)) , Marked_rev2(y,l)>
  <Marked_rev(cons(x,l)) , Marked_rev2(x,l)> 
     --> <Marked_rev2(x,cons(y,l)) , Marked_rev(cons(x,rev2(y,l)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  empty(nil) >= true ;
  empty(cons(x,l)) >= false ;
  head(cons(x,l)) >= x ;
  tail(nil) >= nil ;
  tail(cons(x,l)) >= l ;
  rev(nil) >= nil ;
  rev(cons(x,l)) >= cons(rev1(x,l),rev2(x,l)) ;
  rev2(x,nil) >= nil ;
  rev2(x,cons(y,l)) >= rev(cons(x,rev2(y,l))) ;
  if(true,x,l) >= x ;
  if(false,x,l) >= last(head(l),tail(l)) ;
  last(x,l) >= if(empty(l),x,l) ;
  Marked_if(false,x,l) >= Marked_last(head(l),tail(l)) ;
  Marked_last(x,l) >= Marked_if(empty(l),x,l) ;
 }
 + Disjunctions:{ 
{
  Marked_if(false,x,l) > Marked_last(head(l),tail(l)) ;
 }
{
  Marked_last(x,l) > Marked_if(empty(l),x,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.715697 seconds (real time)
Cime Exit Status: 0