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

TRS termination of:
[1] b(b(0,y),x) -> y
[2] c(c(c(y))) -> c(c(a(a(c(b(0,y)),0),0)))
[3] a(y,0) -> b(y,0)


Sub problem: 
guided: 

DP termination of:
<Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))>
<Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))>
<Marked_c(c(c(y))) , Marked_a(a(c(b(0,y)),0),0)>
<Marked_c(c(c(y))) , Marked_a(c(b(0,y)),0)>
<Marked_c(c(c(y))) , Marked_c(b(0,y))>
<Marked_c(c(c(y))) , Marked_b(0,y)>
<Marked_a(y,0) , Marked_b(y,0)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_c(c(c(y))) , Marked_c(b(0,y))> 
      --> <Marked_c(c(c(y))) , Marked_c(b(0,y))>
  <Marked_c(c(c(y))) , Marked_c(b(0,y))> 
     --> <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))>
  <Marked_c(c(c(y))) , Marked_c(b(0,y))> 
     --> <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))>
  <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))> 
     --> <Marked_c(c(c(y))) , Marked_c(b(0,y))>
  <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))> 
     --> <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))>
  <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))> 
     --> <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))>
  <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))> 
     --> <Marked_c(c(c(y))) , Marked_c(b(0,y))>
  <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))> 
     --> <Marked_c(c(c(y))) , Marked_c(a(a(c(b(0,y)),0),0))>
  <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))> 
     --> <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  b(b(0,y),x) >= y ;
  c(c(c(y))) >= c(c(a(a(c(b(0,y)),0),0))) ;
  a(y,0) >= b(y,0) ;
  Marked_c(c(c(y))) >= Marked_c(b(0,y)) ;
  Marked_c(c(c(y))) >= Marked_c(c(a(a(c(b(0,y)),0),0))) ;
  Marked_c(c(c(y))) >= Marked_c(a(a(c(b(0,y)),0),0)) ;
 }
 + Disjunctions:{ 
{
  Marked_c(c(c(y))) > Marked_c(b(0,y)) ;
 }
{
  Marked_c(c(c(y))) > Marked_c(c(a(a(c(b(0,y)),0),0))) ;
 }
{
  Marked_c(c(c(y))) > Marked_c(a(a(c(b(0,y)),0),0)) ;
 }
 } 
=== 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: b(b(0,y),x) >= y
constraint: c(c(c(y))) >= c(c(a(a(c(b(0,y)),0),0)))
constraint: a(y,0) >= b(y,0)
constraint: Marked_c(c(c(y))) >= Marked_c(b(0,y))
constraint: Marked_c(c(c(y))) >= Marked_c(c(a(a(c(b(0,y)),0),0)))
constraint: Marked_c(c(c(y))) >= Marked_c(a(a(c(b(0,y)),0),0))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))> 
      --> <Marked_c(c(c(y))) , Marked_c(c(a(a(c(b(0,y)),0),0)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  b(b(0,y),x) >= y ;
  c(c(c(y))) >= c(c(a(a(c(b(0,y)),0),0))) ;
  a(y,0) >= b(y,0) ;
  Marked_c(c(c(y))) >= Marked_c(c(a(a(c(b(0,y)),0),0))) ;
 }
 + Disjunctions:{ 
{
  Marked_c(c(c(y))) > Marked_c(c(a(a(c(b(0,y)),0),0))) ;
 }
 } 
=== 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 : 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 timeout reached
=== 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 84.035039 seconds (real time)
Cime Exit Status: 0