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

TRS termination of:
[1] le(s(x),0) -> false
[2] le(0,y) -> true
[3] le(s(x),s(y)) -> le(x,y)
[4] double(0) -> 0
[5] double(s(x)) -> s(s(double(x)))
[6] log(0) -> logError
[7] log(s(x)) -> loop(s(x),s(0),0)
[8] loop(x,s(y),z) -> if(le(x,s(y)),x,s(y),z)
[9] if(true,x,y,z) -> z
[10] if(false,x,y,z) -> loop(x,double(y),s(z))
[11] maplog(xs) -> mapIter(xs,nil)
[12] mapIter(xs,ys) -> ifmap(isempty(xs),xs,ys)
[13] ifmap(true,xs,ys) -> ys
[14] ifmap(false,xs,ys) -> mapIter(droplast(xs),cons(log(last(xs)),ys))
[15] isempty(nil) -> true
[16] isempty(cons(x,xs)) -> false
[17] last(nil) -> error
[18] last(cons(x,nil)) -> x
[19] last(cons(x,cons(y,xs))) -> last(cons(y,xs))
[20] droplast(nil) -> nil
[21] droplast(cons(x,nil)) -> nil
[22] droplast(cons(x,cons(y,xs))) -> cons(x,droplast(cons(y,xs)))
[23] a -> b
[24] a -> c


Sub problem: 
guided: 

DP termination of:
<Marked_le(s(x),s(y)) , Marked_le(x,y)>
<Marked_double(s(x)) , Marked_double(x)>
<Marked_log(s(x)) , Marked_loop(s(x),s(0),0)>
<Marked_loop(x,s(y),z) , Marked_if(le(x,s(y)),x,s(y),z)>
<Marked_loop(x,s(y),z) , Marked_le(x,s(y))>
<Marked_if(false,x,y,z) , Marked_loop(x,double(y),s(z))>
<Marked_if(false,x,y,z) , Marked_double(y)>
<Marked_maplog(xs) , Marked_mapIter(xs,nil)>
<Marked_mapIter(xs,ys) , Marked_ifmap(isempty(xs),xs,ys)>
<Marked_mapIter(xs,ys) , Marked_isempty(xs)>
<Marked_ifmap(false,xs,ys) , Marked_mapIter(droplast(xs),
                              cons(log(last(xs)),ys))>
<Marked_ifmap(false,xs,ys) , Marked_droplast(xs)>
<Marked_ifmap(false,xs,ys) , Marked_log(last(xs))>
<Marked_ifmap(false,xs,ys) , Marked_last(xs)>
<Marked_last(cons(x,cons(y,xs))) , Marked_last(cons(y,xs))>
<Marked_droplast(cons(x,cons(y,xs))) , Marked_droplast(cons(y,xs))>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 6 components:

{  <Marked_ifmap(false,xs,ys) , Marked_mapIter(droplast(xs),
                                 cons(log(last(xs)),ys))> 
      --> <Marked_mapIter(xs,ys) , Marked_ifmap(isempty(xs),xs,ys)>
  <Marked_mapIter(xs,ys) , Marked_ifmap(isempty(xs),xs,ys)> 
     --> <Marked_ifmap(false,xs,ys) , Marked_mapIter(droplast(xs),
                                       cons(log(last(xs)),ys))>
}

{  <Marked_if(false,x,y,z) , Marked_loop(x,double(y),s(z))> 
      --> <Marked_loop(x,s(y),z) , Marked_if(le(x,s(y)),x,s(y),z)>
  <Marked_loop(x,s(y),z) , Marked_if(le(x,s(y)),x,s(y),z)> 
     --> <Marked_if(false,x,y,z) , Marked_loop(x,double(y),s(z))>
}

{  <Marked_double(s(x)) , Marked_double(x)> 
      --> <Marked_double(s(x)) , Marked_double(x)>
}

{  <Marked_le(s(x),s(y)) , Marked_le(x,y)> 
      --> <Marked_le(s(x),s(y)) , Marked_le(x,y)>
}

{  <Marked_last(cons(x,cons(y,xs))) , Marked_last(cons(y,xs))> 
      --> <Marked_last(cons(x,cons(y,xs))) , Marked_last(cons(y,xs))>
}

{  <Marked_droplast(cons(x,cons(y,xs))) , Marked_droplast(cons(y,xs))> 
      --> <Marked_droplast(cons(x,cons(y,xs))) , Marked_droplast(cons(y,xs))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  le(s(x),s(y)) >= le(x,y) ;
  le(s(x),0) >= false ;
  le(0,y) >= true ;
  double(s(x)) >= s(s(double(x))) ;
  double(0) >= 0 ;
  log(s(x)) >= loop(s(x),s(0),0) ;
  log(0) >= logError ;
  loop(x,s(y),z) >= if(le(x,s(y)),x,s(y),z) ;
  if(false,x,y,z) >= loop(x,double(y),s(z)) ;
  if(true,x,y,z) >= z ;
  mapIter(xs,ys) >= ifmap(isempty(xs),xs,ys) ;
  maplog(xs) >= mapIter(xs,nil) ;
  ifmap(false,xs,ys) >= mapIter(droplast(xs),cons(log(last(xs)),ys)) ;
  ifmap(true,xs,ys) >= ys ;
  isempty(nil) >= true ;
  isempty(cons(x,xs)) >= false ;
  droplast(nil) >= nil ;
  droplast(cons(x,nil)) >= nil ;
  droplast(cons(x,cons(y,xs))) >= cons(x,droplast(cons(y,xs))) ;
  last(nil) >= error ;
  last(cons(x,nil)) >= x ;
  last(cons(x,cons(y,xs))) >= last(cons(y,xs)) ;
  a >= b ;
  a >= c ;
  Marked_ifmap(false,xs,ys) >= Marked_mapIter(droplast(xs),
                                cons(log(last(xs)),ys)) ;
  Marked_mapIter(xs,ys) >= Marked_ifmap(isempty(xs),xs,ys) ;
 }
 + Disjunctions:{ 
{
  Marked_ifmap(false,xs,ys) > Marked_mapIter(droplast(xs),
                               cons(log(last(xs)),ys)) ;
 }
{
  Marked_mapIter(xs,ys) > Marked_ifmap(isempty(xs),xs,ys) ;
 }
 } 
=== 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 ===
Time out for these parameters.
=== 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 27.265238 seconds (real time)
Cime Exit Status: 0