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

TRS termination of:
[1] w(r(x)) -> r(w(x))
[2] b(r(x)) -> r(b(x))
[3] b(w(x)) -> w(b(x))


Sub problem: 
guided: 

DP termination of:
<Marked_w(r(x)) , Marked_w(x)>
<Marked_b(r(x)) , Marked_b(x)>
<Marked_b(w(x)) , Marked_w(b(x))>
<Marked_b(w(x)) , Marked_b(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_b(w(x)) , Marked_b(x)> --> <Marked_b(w(x)) , Marked_b(x)>
  <Marked_b(w(x)) , Marked_b(x)> --> <Marked_b(r(x)) , Marked_b(x)>
  <Marked_b(r(x)) , Marked_b(x)> --> <Marked_b(w(x)) , Marked_b(x)>
  <Marked_b(r(x)) , Marked_b(x)> --> <Marked_b(r(x)) , Marked_b(x)>
}

{  <Marked_w(r(x)) , Marked_w(x)> --> <Marked_w(r(x)) , Marked_w(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  w(r(x)) >= r(w(x)) ;
  b(r(x)) >= r(b(x)) ;
  b(w(x)) >= w(b(x)) ;
  Marked_b(r(x)) >= Marked_b(x) ;
  Marked_b(w(x)) >= Marked_b(x) ;
 }
 + Disjunctions:{ 
{
  Marked_b(r(x)) > Marked_b(x) ;
 }
{
  Marked_b(w(x)) > Marked_b(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: w(r(x)) >= r(w(x))
constraint: b(r(x)) >= r(b(x))
constraint: b(w(x)) >= w(b(x))
constraint: Marked_b(r(x)) >= Marked_b(x)
constraint: Marked_b(w(x)) >= Marked_b(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  w(r(x)) >= r(w(x)) ;
  b(r(x)) >= r(b(x)) ;
  b(w(x)) >= w(b(x)) ;
  Marked_w(r(x)) >= Marked_w(x) ;
 }
 + Disjunctions:{ 
{
  Marked_w(r(x)) > Marked_w(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: w(r(x)) >= r(w(x))
constraint: b(r(x)) >= r(b(x))
constraint: b(w(x)) >= w(b(x))
constraint: Marked_w(r(x)) >= Marked_w(x)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] w(r(x)) -> r(w(x))
[2] b(r(x)) -> r(b(x))
[3] b(w(x)) -> w(b(x))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_w(r(x)) , Marked_w(x)>
<Marked_b(r(x)) , Marked_b(x)>
<Marked_b(w(x)) , Marked_w(b(x))>
<Marked_b(w(x)) , Marked_b(x)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_b(r(x)) , Marked_b(x)>
<Marked_b(w(x)) , Marked_b(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ r ] (X0) = 2 + 1*X0 + 0; 
 [ b ] (X0) = 2*X0 + 0; 
 [ w ] (X0) = 2 + 2*X0 + 0; 
 [ Marked_b ] (X0) = 3*X0 + 0; 
 ]} 
{
 
DP termination of:
<Marked_w(r(x)) , Marked_w(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ r ] (X0) = 2 + 1*X0 + 0; 
 [ Marked_w ] (X0) = 3*X0 + 0; 
 [ b ] (X0) = 2*X0 + 0; 
 [ w ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.026281 seconds (real time)
Cime Exit Status: 0