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

TRS termination of:
[1] top(free(x)) -> top(check(new(x)))
[2] new(free(x)) -> free(new(x))
[3] old(free(x)) -> free(old(x))
[4] new(serve) -> free(serve)
[5] old(serve) -> free(serve)
[6] check(free(x)) -> free(check(x))
[7] check(new(x)) -> new(check(x))
[8] check(old(x)) -> old(check(x))
[9] check(old(x)) -> old(x)


Sub problem: 
guided: 

DP termination of:
<Marked_top(free(x)) , Marked_top(check(new(x)))>
<Marked_top(free(x)) , Marked_check(new(x))>
<Marked_top(free(x)) , Marked_new(x)>
<Marked_new(free(x)) , Marked_new(x)>
<Marked_old(free(x)) , Marked_old(x)>
<Marked_check(free(x)) , Marked_check(x)>
<Marked_check(new(x)) , Marked_new(check(x))>
<Marked_check(new(x)) , Marked_check(x)>
<Marked_check(old(x)) , Marked_old(check(x))>
<Marked_check(old(x)) , Marked_check(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 4 components:

{  <Marked_top(free(x)) , Marked_top(check(new(x)))> 
      --> <Marked_top(free(x)) , Marked_top(check(new(x)))>
}

{  <Marked_check(old(x)) , Marked_check(x)> 
      --> <Marked_check(old(x)) , Marked_check(x)>
  <Marked_check(old(x)) , Marked_check(x)> 
     --> <Marked_check(new(x)) , Marked_check(x)>
  <Marked_check(old(x)) , Marked_check(x)> 
     --> <Marked_check(free(x)) , Marked_check(x)>
  <Marked_check(new(x)) , Marked_check(x)> 
     --> <Marked_check(old(x)) , Marked_check(x)>
  <Marked_check(new(x)) , Marked_check(x)> 
     --> <Marked_check(new(x)) , Marked_check(x)>
  <Marked_check(new(x)) , Marked_check(x)> 
     --> <Marked_check(free(x)) , Marked_check(x)>
  <Marked_check(free(x)) , Marked_check(x)> 
     --> <Marked_check(old(x)) , Marked_check(x)>
  <Marked_check(free(x)) , Marked_check(x)> 
     --> <Marked_check(new(x)) , Marked_check(x)>
  <Marked_check(free(x)) , Marked_check(x)> 
     --> <Marked_check(free(x)) , Marked_check(x)>
}

{  <Marked_new(free(x)) , Marked_new(x)> 
      --> <Marked_new(free(x)) , Marked_new(x)>
}

{  <Marked_old(free(x)) , Marked_old(x)> 
      --> <Marked_old(free(x)) , Marked_old(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  top(free(x)) >= top(check(new(x))) ;
  check(new(x)) >= new(check(x)) ;
  check(free(x)) >= free(check(x)) ;
  check(old(x)) >= old(check(x)) ;
  check(old(x)) >= old(x) ;
  new(free(x)) >= free(new(x)) ;
  new(serve) >= free(serve) ;
  old(free(x)) >= free(old(x)) ;
  old(serve) >= free(serve) ;
  Marked_top(free(x)) >= Marked_top(check(new(x))) ;
 }
 + Disjunctions:{ 
{
  Marked_top(free(x)) > Marked_top(check(new(x))) ;
 }
 } 
=== 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 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 1.810546 seconds (real time)
Cime Exit Status: 0