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

TRS termination of:
[1] half(0) -> 0
[2] half(s(0)) -> 0
[3] half(s(s(x))) -> s(half(x))
[4] lastbit(0) -> 0
[5] lastbit(s(0)) -> s(0)
[6] lastbit(s(s(x))) -> lastbit(x)
[7] zero(0) -> true
[8] zero(s(x)) -> false
[9] conv(x) -> conviter(x,cons(0,nil))
[10] conviter(x,l) -> if(zero(x),x,l)
[11] if(true,x,l) -> l
[12] if(false,x,l) -> conviter(half(x),cons(lastbit(x),l))


Sub problem: 
guided: 

DP termination of:
<Marked_half(s(s(x))) , Marked_half(x)>
<Marked_lastbit(s(s(x))) , Marked_lastbit(x)>
<Marked_conv(x) , Marked_conviter(x,cons(0,nil))>
<Marked_conviter(x,l) , Marked_if(zero(x),x,l)>
<Marked_conviter(x,l) , Marked_zero(x)>
<Marked_if(false,x,l) , Marked_conviter(half(x),cons(lastbit(x),l))>
<Marked_if(false,x,l) , Marked_half(x)>
<Marked_if(false,x,l) , Marked_lastbit(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_if(false,x,l) , Marked_conviter(half(x),cons(lastbit(x),l))> 
      --> <Marked_conviter(x,l) , Marked_if(zero(x),x,l)>
  <Marked_conviter(x,l) , Marked_if(zero(x),x,l)> 
     --> <Marked_if(false,x,l) , Marked_conviter(half(x),cons(lastbit(x),l))>
}

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

{  <Marked_lastbit(s(s(x))) , Marked_lastbit(x)> 
      --> <Marked_lastbit(s(s(x))) , Marked_lastbit(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  half(0) >= 0 ;
  half(s(0)) >= 0 ;
  half(s(s(x))) >= s(half(x)) ;
  lastbit(0) >= 0 ;
  lastbit(s(0)) >= s(0) ;
  lastbit(s(s(x))) >= lastbit(x) ;
  zero(0) >= true ;
  zero(s(x)) >= false ;
  conviter(x,l) >= if(zero(x),x,l) ;
  conv(x) >= conviter(x,cons(0,nil)) ;
  if(true,x,l) >= l ;
  if(false,x,l) >= conviter(half(x),cons(lastbit(x),l)) ;
  Marked_if(false,x,l) >= Marked_conviter(half(x),cons(lastbit(x),l)) ;
  Marked_conviter(x,l) >= Marked_if(zero(x),x,l) ;
 }
 + Disjunctions:{ 
{
  Marked_if(false,x,l) > Marked_conviter(half(x),cons(lastbit(x),l)) ;
 }
{
  Marked_conviter(x,l) > Marked_if(zero(x),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 4.823081 seconds (real time)
Cime Exit Status: 0