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

TRS termination of:
[1] active(f(x)) -> mark(x)
[2] top(active(c)) -> top(mark(c))
[3] top(mark(x)) -> top(check(x))
[4] check(f(x)) -> f(check(x))
[5] check(x) -> start(match(f(X),x))
[6] match(f(x),f(y)) -> f(match(x,y))
[7] match(X,x) -> proper(x)
[8] proper(c) -> ok(c)
[9] proper(f(x)) -> f(proper(x))
[10] f(ok(x)) -> ok(f(x))
[11] start(ok(x)) -> found(x)
[12] f(found(x)) -> found(f(x))
[13] top(found(x)) -> top(active(x))
[14] active(f(x)) -> f(active(x))
[15] f(mark(x)) -> mark(f(x))


Sub problem: 
guided: 

DP termination of:
<Marked_top(active(c)) , Marked_top(mark(c))>
<Marked_top(mark(x)) , Marked_top(check(x))>
<Marked_top(mark(x)) , Marked_check(x)>
<Marked_check(f(x)) , Marked_f(check(x))>
<Marked_check(f(x)) , Marked_check(x)>
<Marked_check(x) , Marked_start(match(f(X),x))>
<Marked_check(x) , Marked_match(f(X),x)>
<Marked_check(x) , Marked_f(X)>
<Marked_match(f(x),f(y)) , Marked_f(match(x,y))>
<Marked_match(f(x),f(y)) , Marked_match(x,y)>
<Marked_match(X,x) , Marked_proper(x)>
<Marked_proper(f(x)) , Marked_f(proper(x))>
<Marked_proper(f(x)) , Marked_proper(x)>
<Marked_f(ok(x)) , Marked_f(x)>
<Marked_f(found(x)) , Marked_f(x)>
<Marked_top(found(x)) , Marked_top(active(x))>
<Marked_top(found(x)) , Marked_active(x)>
<Marked_active(f(x)) , Marked_f(active(x))>
<Marked_active(f(x)) , Marked_active(x)>
<Marked_f(mark(x)) , Marked_f(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 6 components:

{  <Marked_top(found(x)) , Marked_top(active(x))> 
      --> <Marked_top(found(x)) , Marked_top(active(x))>
  <Marked_top(found(x)) , Marked_top(active(x))> 
     --> <Marked_top(mark(x)) , Marked_top(check(x))>
  <Marked_top(found(x)) , Marked_top(active(x))> 
     --> <Marked_top(active(c)) , Marked_top(mark(c))>
  <Marked_top(mark(x)) , Marked_top(check(x))> 
     --> <Marked_top(found(x)) , Marked_top(active(x))>
  <Marked_top(mark(x)) , Marked_top(check(x))> 
     --> <Marked_top(mark(x)) , Marked_top(check(x))>
  <Marked_top(mark(x)) , Marked_top(check(x))> 
     --> <Marked_top(active(c)) , Marked_top(mark(c))>
  <Marked_top(active(c)) , Marked_top(mark(c))> 
     --> <Marked_top(mark(x)) , Marked_top(check(x))>
}

{  <Marked_check(f(x)) , Marked_check(x)> 
      --> <Marked_check(f(x)) , Marked_check(x)>
}

{  <Marked_match(f(x),f(y)) , Marked_match(x,y)> 
      --> <Marked_match(f(x),f(y)) , Marked_match(x,y)>
}

{  <Marked_proper(f(x)) , Marked_proper(x)> 
      --> <Marked_proper(f(x)) , Marked_proper(x)>
}

{  <Marked_active(f(x)) , Marked_active(x)> 
      --> <Marked_active(f(x)) , Marked_active(x)>
}

{  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(found(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
  <Marked_f(found(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(found(x)) , Marked_f(x)> --> <Marked_f(found(x)) , Marked_f(x)>
  <Marked_f(found(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(found(x)) , Marked_f(x)>
  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_top(mark(x)) >= Marked_top(check(x)) ;
  Marked_top(active(c)) >= Marked_top(mark(c)) ;
  Marked_top(found(x)) >= Marked_top(active(x)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(x)) > Marked_top(check(x)) ;
 }
{
  Marked_top(active(c)) > Marked_top(mark(c)) ;
 }
{
  Marked_top(found(x)) > Marked_top(active(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_top(mark(x)) >= Marked_top(check(x))
constraint: Marked_top(active(c)) >= Marked_top(mark(c))
constraint: Marked_top(found(x)) >= Marked_top(active(x))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_check(f(x)) >= Marked_check(x) ;
 }
 + Disjunctions:{ 
{
  Marked_check(f(x)) > Marked_check(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_check(f(x)) >= Marked_check(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_match(f(x),f(y)) >= Marked_match(x,y) ;
 }
 + Disjunctions:{ 
{
  Marked_match(f(x),f(y)) > Marked_match(x,y) ;
 }
 } 
=== 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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_match(f(x),f(y)) >= Marked_match(x,y)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_proper(f(x)) >= Marked_proper(x) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(f(x)) > Marked_proper(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_proper(f(x)) >= Marked_proper(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_active(f(x)) >= Marked_active(x) ;
 }
 + Disjunctions:{ 
{
  Marked_active(f(x)) > Marked_active(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_active(f(x)) >= Marked_active(x)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_f(mark(x)) >= Marked_f(x) ;
  Marked_f(ok(x)) >= Marked_f(x) ;
  Marked_f(found(x)) >= Marked_f(x) ;
 }
 + Disjunctions:{ 
{
  Marked_f(mark(x)) > Marked_f(x) ;
 }
{
  Marked_f(ok(x)) > Marked_f(x) ;
 }
{
  Marked_f(found(x)) > Marked_f(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_f(mark(x)) >= Marked_f(x)
constraint: Marked_f(ok(x)) >= Marked_f(x)
constraint: Marked_f(found(x)) >= Marked_f(x)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(found(x)) , Marked_top(active(x))> 
      --> <Marked_top(found(x)) , Marked_top(active(x))>
  <Marked_top(found(x)) , Marked_top(active(x))> 
     --> <Marked_top(mark(x)) , Marked_top(check(x))>
  <Marked_top(mark(x)) , Marked_top(check(x))> 
     --> <Marked_top(found(x)) , Marked_top(active(x))>
  <Marked_top(mark(x)) , Marked_top(check(x))> 
     --> <Marked_top(mark(x)) , Marked_top(check(x))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_top(mark(x)) >= Marked_top(check(x)) ;
  Marked_top(found(x)) >= Marked_top(active(x)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(x)) > Marked_top(check(x)) ;
 }
{
  Marked_top(found(x)) > Marked_top(active(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_top(mark(x)) >= Marked_top(check(x))
constraint: Marked_top(found(x)) >= Marked_top(active(x))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(mark(x)) , Marked_top(check(x))> 
      --> <Marked_top(mark(x)) , Marked_top(check(x))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_top(mark(x)) >= Marked_top(check(x)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(x)) > Marked_top(check(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_top(mark(x)) >= Marked_top(check(x))
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:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_f(mark(x)) >= Marked_f(x) ;
  Marked_f(ok(x)) >= Marked_f(x) ;
 }
 + Disjunctions:{ 
{
  Marked_f(mark(x)) > Marked_f(x) ;
 }
{
  Marked_f(ok(x)) > Marked_f(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_f(mark(x)) >= Marked_f(x)
constraint: Marked_f(ok(x)) >= Marked_f(x)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(ok(x)) , Marked_f(x)> --> <Marked_f(ok(x)) , Marked_f(x)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  active(f(x)) >= mark(x) ;
  active(f(x)) >= f(active(x)) ;
  f(mark(x)) >= mark(f(x)) ;
  f(ok(x)) >= ok(f(x)) ;
  f(found(x)) >= found(f(x)) ;
  top(mark(x)) >= top(check(x)) ;
  top(active(c)) >= top(mark(c)) ;
  top(found(x)) >= top(active(x)) ;
  check(f(x)) >= f(check(x)) ;
  check(x) >= start(match(f(X),x)) ;
  start(ok(x)) >= found(x) ;
  match(f(x),f(y)) >= f(match(x,y)) ;
  match(X,x) >= proper(x) ;
  proper(f(x)) >= f(proper(x)) ;
  proper(c) >= ok(c) ;
  Marked_f(ok(x)) >= Marked_f(x) ;
 }
 + Disjunctions:{ 
{
  Marked_f(ok(x)) > Marked_f(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: active(f(x)) >= mark(x)
constraint: active(f(x)) >= f(active(x))
constraint: f(mark(x)) >= mark(f(x))
constraint: f(ok(x)) >= ok(f(x))
constraint: f(found(x)) >= found(f(x))
constraint: top(mark(x)) >= top(check(x))
constraint: top(active(c)) >= top(mark(c))
constraint: top(found(x)) >= top(active(x))
constraint: check(f(x)) >= f(check(x))
constraint: check(x) >= start(match(f(X),x))
constraint: start(ok(x)) >= found(x)
constraint: match(f(x),f(y)) >= f(match(x,y))
constraint: match(X,x) >= proper(x)
constraint: proper(f(x)) >= f(proper(x))
constraint: proper(c) >= ok(c)
constraint: Marked_f(ok(x)) >= Marked_f(x)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(f(x)) -> mark(x)
[2] top(active(c)) -> top(mark(c))
[3] top(mark(x)) -> top(check(x))
[4] check(f(x)) -> f(check(x))
[5] check(x) -> start(match(f(X),x))
[6] match(f(x),f(y)) -> f(match(x,y))
[7] match(X,x) -> proper(x)
[8] proper(c) -> ok(c)
[9] proper(f(x)) -> f(proper(x))
[10] f(ok(x)) -> ok(f(x))
[11] start(ok(x)) -> found(x)
[12] f(found(x)) -> found(f(x))
[13] top(found(x)) -> top(active(x))
[14] active(f(x)) -> f(active(x))
[15] f(mark(x)) -> mark(f(x))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_top(active(c)) , Marked_top(mark(c))>
<Marked_top(mark(x)) , Marked_top(check(x))>
<Marked_top(mark(x)) , Marked_check(x)>
<Marked_check(f(x)) , Marked_f(check(x))>
<Marked_check(f(x)) , Marked_check(x)>
<Marked_check(x) , Marked_start(match(f(X),x))>
<Marked_check(x) , Marked_match(f(X),x)>
<Marked_check(x) , Marked_f(X)>
<Marked_match(f(x),f(y)) , Marked_f(match(x,y))>
<Marked_match(f(x),f(y)) , Marked_match(x,y)>
<Marked_match(X,x) , Marked_proper(x)>
<Marked_proper(f(x)) , Marked_f(proper(x))>
<Marked_proper(f(x)) , Marked_proper(x)>
<Marked_f(ok(x)) , Marked_f(x)>
<Marked_f(found(x)) , Marked_f(x)>
<Marked_top(found(x)) , Marked_top(active(x))>
<Marked_top(found(x)) , Marked_active(x)>
<Marked_active(f(x)) , Marked_f(active(x))>
<Marked_active(f(x)) , Marked_active(x)>
<Marked_f(mark(x)) , Marked_f(x)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(active(c)) , Marked_top(mark(c))>
<Marked_top(mark(x)) , Marked_top(check(x))>
<Marked_top(found(x)) , Marked_top(active(x))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ X ] () = 3; 
 [ c ] () = 2; 
 [ f ] (X0) = 0; 
 [ ok ] (X0) = 1*X0; 
 [ start ] (X0) = 1*X0; 
 [ Marked_top ] (X0) = 2*X0; 
 [ active ] (X0) = 1*X0; 
 [ proper ] (X0) = 2; 
 [ check ] (X0) = 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 1*X0; 
 [ match ] (X0,X1) = 3*X0; 
 removing <Marked_top(active(c)),Marked_top(mark(c))>
 [ {
      
     DP termination of:
     <Marked_top(mark(x)) , Marked_top(check(x))>
<Marked_top(found(x)) , Marked_top(active(x))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(x)) , Marked_top(check(x))>
<Marked_top(found(x)) , Marked_top(active(x))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0 + 1; 
 [ X ] () = 0; 
 [ c ] () = 0; 
 [ f ] (X0) = 2*X0 + 1; 
 [ ok ] (X0) = 1*X0; 
 [ start ] (X0) = 2*X0 + 1; 
 [ Marked_top ] (X0) = 2*X0; 
 [ active ] (X0) = 2*X0; 
 [ proper ] (X0) = 1*X0; 
 [ check ] (X0) = 2*X0 + 1; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 2*X0 + 1; 
 [ match ] (X0,X1) = 1*X1; 
 removing <Marked_top(found(x)),Marked_top(active(x))>
 [ {
      
     DP termination of:
     <Marked_top(mark(x)) , Marked_top(check(x))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(x)) , Marked_top(check(x))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 3 + 3*X0 + 0; 
 [ X ] () = 0; 
 [ c ] () = 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ start ] (X0) = 0; 
 [ Marked_top ] (X0) = 2*X0 + 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 [ check ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 0; 
 [ match ] (X0,X1) = 1*X1 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_check(f(x)) , Marked_check(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1*X0 + 0; 
 [ X ] () = 0; 
 [ c ] () = 0; 
 [ f ] (X0) = 1 + 3*X0 + 0; 
 [ Marked_check ] (X0) = 3*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ start ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 [ check ] (X0) = 1*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 0; 
 [ match ] (X0,X1) = 1*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_match(f(x),f(y)) , Marked_match(x,y)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 0; 
 [ X ] () = 0; 
 [ c ] () = 0; 
 [ f ] (X0) = 1 + 1*X0 + 0; 
 [ ok ] (X0) = 1*X0 + 0; 
 [ start ] (X0) = 3 + 0; 
 [ active ] (X0) = 1*X0 + 0; 
 [ Marked_match ] (X0,X1) = 1*X0 + 0; 
 [ proper ] (X0) = 1*X0 + 0; 
 [ check ] (X0) = 3 + 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 3 + 0; 
 [ match ] (X0,X1) = 2 + 1*X0 + 1*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_proper(f(x)) , Marked_proper(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 0; 
 [ Marked_proper ] (X0) = 3*X0 + 0; 
 [ X ] () = 0; 
 [ c ] () = 3 + 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ ok ] (X0) = 1 + 1*X0 + 0; 
 [ start ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 3*X0 + 0; 
 [ check ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 0; 
 [ match ] (X0,X1) = 1*X0 + 3*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_active(f(x)) , Marked_active(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1*X0 + 0; 
 [ X ] () = 0; 
 [ c ] () = 0; 
 [ f ] (X0) = 3 + 3*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ start ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 [ check ] (X0) = 2*X0 + 0; 
 [ Marked_active ] (X0) = 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 0; 
 [ match ] (X0,X1) = 3*X1 + 0; 
 ]} 
{
 
DP termination of:
<Marked_f(ok(x)) , Marked_f(x)>
<Marked_f(found(x)) , Marked_f(x)>
<Marked_f(mark(x)) , Marked_f(x)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ X ] () = 0; 
 [ c ] () = 2; 
 [ Marked_f ] (X0) = 3*X0; 
 [ f ] (X0) = 2*X0 + 2; 
 [ ok ] (X0) = 1*X0; 
 [ start ] (X0) = 1*X0 + 1; 
 [ active ] (X0) = 1*X0; 
 [ proper ] (X0) = 2*X0; 
 [ check ] (X0) = 3*X0 + 3; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 1*X0 + 1; 
 [ match ] (X0,X1) = 3*X1 + 2; 
 removing <Marked_f(found(x)),Marked_f(x)>
 [ {
      
     DP termination of:
     <Marked_f(ok(x)) , Marked_f(x)>
<Marked_f(mark(x)) , Marked_f(x)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(ok(x)) , Marked_f(x)>
<Marked_f(mark(x)) , Marked_f(x)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0 + 2; 
 [ X ] () = 0; 
 [ c ] () = 2; 
 [ Marked_f ] (X0) = 3*X0; 
 [ f ] (X0) = 2*X0 + 2; 
 [ ok ] (X0) = 1*X0; 
 [ start ] (X0) = 1; 
 [ active ] (X0) = 2*X0 + 2; 
 [ proper ] (X0) = 2*X0; 
 [ check ] (X0) = 3*X0 + 1; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 1; 
 [ match ] (X0,X1) = 2*X1 + 1*X0 + 2; 
 removing <Marked_f(mark(x)),Marked_f(x)>
 [ {
      
     DP termination of:
     <Marked_f(ok(x)) , Marked_f(x)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(ok(x)) , Marked_f(x)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 3 + 1*X0 + 0; 
 [ X ] () = 1 + 0; 
 [ c ] () = 0; 
 [ Marked_f ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ ok ] (X0) = 1 + 1*X0 + 0; 
 [ start ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 1 + 2*X0 + 0; 
 [ check ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ found ] (X0) = 0; 
 [ match ] (X0,X1) = 2*X0 + 2*X1 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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