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

TRS termination of:
[1] rec(rec(x)) -> sent(rec(x))
[2] rec(sent(x)) -> sent(rec(x))
[3] rec(no(x)) -> sent(rec(x))
[4] rec(bot) -> up(sent(bot))
[5] rec(up(x)) -> up(rec(x))
[6] sent(up(x)) -> up(sent(x))
[7] no(up(x)) -> up(no(x))
[8] top(rec(up(x))) -> top(check(rec(x)))
[9] top(sent(up(x))) -> top(check(rec(x)))
[10] top(no(up(x))) -> top(check(rec(x)))
[11] check(up(x)) -> up(check(x))
[12] check(sent(x)) -> sent(check(x))
[13] check(rec(x)) -> rec(check(x))
[14] check(no(x)) -> no(check(x))
[15] check(no(x)) -> no(x)


Sub problem: 
guided: 

DP termination of:
<Marked_rec(rec(x)) , Marked_sent(rec(x))>
<Marked_rec(sent(x)) , Marked_sent(rec(x))>
<Marked_rec(sent(x)) , Marked_rec(x)>
<Marked_rec(no(x)) , Marked_sent(rec(x))>
<Marked_rec(no(x)) , Marked_rec(x)>
<Marked_rec(bot) , Marked_sent(bot)>
<Marked_rec(up(x)) , Marked_rec(x)>
<Marked_sent(up(x)) , Marked_sent(x)>
<Marked_no(up(x)) , Marked_no(x)>
<Marked_top(rec(up(x))) , Marked_top(check(rec(x)))>
<Marked_top(rec(up(x))) , Marked_check(rec(x))>
<Marked_top(rec(up(x))) , Marked_rec(x)>
<Marked_top(sent(up(x))) , Marked_top(check(rec(x)))>
<Marked_top(sent(up(x))) , Marked_check(rec(x))>
<Marked_top(sent(up(x))) , Marked_rec(x)>
<Marked_top(no(up(x))) , Marked_top(check(rec(x)))>
<Marked_top(no(up(x))) , Marked_check(rec(x))>
<Marked_top(no(up(x))) , Marked_rec(x)>
<Marked_check(up(x)) , Marked_check(x)>
<Marked_check(sent(x)) , Marked_sent(check(x))>
<Marked_check(sent(x)) , Marked_check(x)>
<Marked_check(rec(x)) , Marked_rec(check(x))>
<Marked_check(rec(x)) , Marked_check(x)>
<Marked_check(no(x)) , Marked_no(check(x))>
<Marked_check(no(x)) , Marked_check(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_top(no(up(x))) , Marked_top(check(rec(x)))> 
      --> <Marked_top(no(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(no(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(no(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(no(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(no(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))>
  <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))> 
     --> <Marked_top(rec(up(x))) , Marked_top(check(rec(x)))>
}

{  <Marked_check(no(x)) , Marked_check(x)> 
      --> <Marked_check(no(x)) , Marked_check(x)>
  <Marked_check(no(x)) , Marked_check(x)> 
     --> <Marked_check(rec(x)) , Marked_check(x)>
  <Marked_check(no(x)) , Marked_check(x)> 
     --> <Marked_check(sent(x)) , Marked_check(x)>
  <Marked_check(no(x)) , Marked_check(x)> 
     --> <Marked_check(up(x)) , Marked_check(x)>
  <Marked_check(rec(x)) , Marked_check(x)> 
     --> <Marked_check(no(x)) , Marked_check(x)>
  <Marked_check(rec(x)) , Marked_check(x)> 
     --> <Marked_check(rec(x)) , Marked_check(x)>
  <Marked_check(rec(x)) , Marked_check(x)> 
     --> <Marked_check(sent(x)) , Marked_check(x)>
  <Marked_check(rec(x)) , Marked_check(x)> 
     --> <Marked_check(up(x)) , Marked_check(x)>
  <Marked_check(sent(x)) , Marked_check(x)> 
     --> <Marked_check(no(x)) , Marked_check(x)>
  <Marked_check(sent(x)) , Marked_check(x)> 
     --> <Marked_check(rec(x)) , Marked_check(x)>
  <Marked_check(sent(x)) , Marked_check(x)> 
     --> <Marked_check(sent(x)) , Marked_check(x)>
  <Marked_check(sent(x)) , Marked_check(x)> 
     --> <Marked_check(up(x)) , Marked_check(x)>
  <Marked_check(up(x)) , Marked_check(x)> 
     --> <Marked_check(no(x)) , Marked_check(x)>
  <Marked_check(up(x)) , Marked_check(x)> 
     --> <Marked_check(rec(x)) , Marked_check(x)>
  <Marked_check(up(x)) , Marked_check(x)> 
     --> <Marked_check(sent(x)) , Marked_check(x)>
  <Marked_check(up(x)) , Marked_check(x)> 
     --> <Marked_check(up(x)) , Marked_check(x)>
}

{  <Marked_rec(up(x)) , Marked_rec(x)> --> <Marked_rec(up(x)) , Marked_rec(x)>
  <Marked_rec(up(x)) , Marked_rec(x)> --> <Marked_rec(no(x)) , Marked_rec(x)>
  <Marked_rec(up(x)) , Marked_rec(x)> --> <Marked_rec(sent(x)) , Marked_rec(x)>
  <Marked_rec(no(x)) , Marked_rec(x)> --> <Marked_rec(up(x)) , Marked_rec(x)>
  <Marked_rec(no(x)) , Marked_rec(x)> --> <Marked_rec(no(x)) , Marked_rec(x)>
  <Marked_rec(no(x)) , Marked_rec(x)> --> <Marked_rec(sent(x)) , Marked_rec(x)>
  <Marked_rec(sent(x)) , Marked_rec(x)> --> <Marked_rec(up(x)) , Marked_rec(x)>
  <Marked_rec(sent(x)) , Marked_rec(x)> --> <Marked_rec(no(x)) , Marked_rec(x)>
  <Marked_rec(sent(x)) , Marked_rec(x)> 
     --> <Marked_rec(sent(x)) , Marked_rec(x)>
}

{  <Marked_sent(up(x)) , Marked_sent(x)> 
      --> <Marked_sent(up(x)) , Marked_sent(x)>
}

{  <Marked_no(up(x)) , Marked_no(x)> --> <Marked_no(up(x)) , Marked_no(x)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sent(up(x)) >= up(sent(x)) ;
  rec(sent(x)) >= sent(rec(x)) ;
  rec(rec(x)) >= sent(rec(x)) ;
  rec(no(x)) >= sent(rec(x)) ;
  rec(up(x)) >= up(rec(x)) ;
  rec(bot) >= up(sent(bot)) ;
  no(up(x)) >= up(no(x)) ;
  top(sent(up(x))) >= top(check(rec(x))) ;
  top(rec(up(x))) >= top(check(rec(x))) ;
  top(no(up(x))) >= top(check(rec(x))) ;
  check(sent(x)) >= sent(check(x)) ;
  check(rec(x)) >= rec(check(x)) ;
  check(no(x)) >= no(check(x)) ;
  check(no(x)) >= no(x) ;
  check(up(x)) >= up(check(x)) ;
  Marked_top(sent(up(x))) >= Marked_top(check(rec(x))) ;
  Marked_top(rec(up(x))) >= Marked_top(check(rec(x))) ;
  Marked_top(no(up(x))) >= Marked_top(check(rec(x))) ;
 }
 + Disjunctions:{ 
{
  Marked_top(sent(up(x))) > Marked_top(check(rec(x))) ;
 }
{
  Marked_top(rec(up(x))) > Marked_top(check(rec(x))) ;
 }
{
  Marked_top(no(up(x))) > Marked_top(check(rec(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: sent(up(x)) >= up(sent(x))
constraint: rec(sent(x)) >= sent(rec(x))
constraint: rec(rec(x)) >= sent(rec(x))
constraint: rec(no(x)) >= sent(rec(x))
constraint: rec(up(x)) >= up(rec(x))
constraint: rec(bot) >= up(sent(bot))
constraint: no(up(x)) >= up(no(x))
constraint: top(sent(up(x))) >= top(check(rec(x)))
constraint: top(rec(up(x))) >= top(check(rec(x)))
constraint: top(no(up(x))) >= top(check(rec(x)))
constraint: check(sent(x)) >= sent(check(x))
constraint: check(rec(x)) >= rec(check(x))
constraint: check(no(x)) >= no(check(x))
constraint: check(no(x)) >= no(x)
constraint: check(up(x)) >= up(check(x))
constraint: Marked_top(sent(up(x))) >= Marked_top(check(rec(x)))
constraint: Marked_top(rec(up(x))) >= Marked_top(check(rec(x)))
constraint: Marked_top(no(up(x))) >= Marked_top(check(rec(x)))
APPLY CRITERIA (Subterm criterion)

ST: Marked_check -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_rec -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_sent -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_no -> 1

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))> 
      --> <Marked_top(sent(up(x))) , Marked_top(check(rec(x)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  sent(up(x)) >= up(sent(x)) ;
  rec(sent(x)) >= sent(rec(x)) ;
  rec(rec(x)) >= sent(rec(x)) ;
  rec(no(x)) >= sent(rec(x)) ;
  rec(up(x)) >= up(rec(x)) ;
  rec(bot) >= up(sent(bot)) ;
  no(up(x)) >= up(no(x)) ;
  top(sent(up(x))) >= top(check(rec(x))) ;
  top(rec(up(x))) >= top(check(rec(x))) ;
  top(no(up(x))) >= top(check(rec(x))) ;
  check(sent(x)) >= sent(check(x)) ;
  check(rec(x)) >= rec(check(x)) ;
  check(no(x)) >= no(check(x)) ;
  check(no(x)) >= no(x) ;
  check(up(x)) >= up(check(x)) ;
  Marked_top(sent(up(x))) >= Marked_top(check(rec(x))) ;
 }
 + Disjunctions:{ 
{
  Marked_top(sent(up(x))) > Marked_top(check(rec(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 (Simple graph)
Found the following constraints:
{
  sent(up(x)) >= up(sent(x)) ;
  rec(sent(x)) >= sent(rec(x)) ;
  rec(rec(x)) >= sent(rec(x)) ;
  rec(no(x)) >= sent(rec(x)) ;
  rec(up(x)) >= up(rec(x)) ;
  rec(bot) >= up(sent(bot)) ;
  no(up(x)) >= up(no(x)) ;
  top(sent(up(x))) >= top(check(rec(x))) ;
  top(rec(up(x))) >= top(check(rec(x))) ;
  top(no(up(x))) >= top(check(rec(x))) ;
  check(sent(x)) >= sent(check(x)) ;
  check(rec(x)) >= rec(check(x)) ;
  check(no(x)) >= no(check(x)) ;
  check(no(x)) >= no(x) ;
  check(up(x)) >= up(check(x)) ;
  Marked_top(sent(up(x))) > Marked_top(check(rec(x))) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  sent(up(x)) >= up(sent(x)) ;
  rec(sent(x)) >= sent(rec(x)) ;
  rec(rec(x)) >= sent(rec(x)) ;
  rec(no(x)) >= sent(rec(x)) ;
  rec(up(x)) >= up(rec(x)) ;
  rec(bot) >= up(sent(bot)) ;
  no(up(x)) >= up(no(x)) ;
  top(sent(up(x))) >= top(check(rec(x))) ;
  top(rec(up(x))) >= top(check(rec(x))) ;
  top(no(up(x))) >= top(check(rec(x))) ;
  check(sent(x)) >= sent(check(x)) ;
  check(rec(x)) >= rec(check(x)) ;
  check(no(x)) >= no(check(x)) ;
  check(no(x)) >= no(x) ;
  check(up(x)) >= up(check(x)) ;
  Marked_top(sent(up(x))) > Marked_top(check(rec(x))) ;
 }
 + Disjunctions:{ 
 } 
=== 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 ===
No solution found for these parameters.(313 bt (300) [162])
=== 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)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
NOT SOLVED
No proof found
Cime worked for 77.239302 seconds (real time)
Cime Exit Status: 0