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

TRS termination of:
[1] active(f(0)) -> mark(cons(0,f(s(0))))
[2] active(f(s(0))) -> mark(f(p(s(0))))
[3] active(p(s(0))) -> mark(0)
[4] active(f(X)) -> f(active(X))
[5] active(cons(X1,X2)) -> cons(active(X1),X2)
[6] active(s(X)) -> s(active(X))
[7] active(p(X)) -> p(active(X))
[8] f(mark(X)) -> mark(f(X))
[9] cons(mark(X1),X2) -> mark(cons(X1,X2))
[10] s(mark(X)) -> mark(s(X))
[11] p(mark(X)) -> mark(p(X))
[12] proper(f(X)) -> f(proper(X))
[13] proper(0) -> ok(0)
[14] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
[15] proper(s(X)) -> s(proper(X))
[16] proper(p(X)) -> p(proper(X))
[17] f(ok(X)) -> ok(f(X))
[18] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
[19] s(ok(X)) -> ok(s(X))
[20] p(ok(X)) -> ok(p(X))
[21] top(mark(X)) -> top(proper(X))
[22] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(0)) , Marked_cons(0,f(s(0)))>
<Marked_active(f(0)) , Marked_f(s(0))>
<Marked_active(f(0)) , Marked_s(0)>
<Marked_active(f(s(0))) , Marked_f(p(s(0)))>
<Marked_active(f(s(0))) , Marked_p(s(0))>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(cons(X1,X2)) , Marked_cons(active(X1),X2)>
<Marked_active(cons(X1,X2)) , Marked_active(X1)>
<Marked_active(s(X)) , Marked_s(active(X))>
<Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_p(active(X))>
<Marked_active(p(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_s(mark(X)) , Marked_s(X)>
<Marked_p(mark(X)) , Marked_p(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(cons(X1,X2)) , Marked_cons(proper(X1),proper(X2))>
<Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
<Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
<Marked_proper(s(X)) , Marked_s(proper(X))>
<Marked_proper(s(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_p(proper(X))>
<Marked_proper(p(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)>
<Marked_s(ok(X)) , Marked_s(X)>
<Marked_p(ok(X)) , Marked_p(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 7 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(ok(X)) , Marked_top(active(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}

{  <Marked_proper(p(X)) , Marked_proper(X)> 
      --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(cons(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
}

{  <Marked_active(p(X)) , Marked_active(X)> 
      --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(cons(X1,X2)) , Marked_active(X1)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(cons(X1,X2)) , Marked_active(X1)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(cons(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(cons(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(cons(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(cons(X1,X2)) , Marked_active(X1)>
  <Marked_active(cons(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(cons(X1,X2)) , Marked_active(X1)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
}

{  <Marked_f(ok(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(mark(X)) , Marked_f(X)> --> <Marked_f(ok(X)) , Marked_f(X)>
  <Marked_f(mark(X)) , Marked_f(X)> --> <Marked_f(mark(X)) , Marked_f(X)>
}

{  <Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)> 
      --> <Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)>
  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
     --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
}

{  <Marked_s(ok(X)) , Marked_s(X)> --> <Marked_s(ok(X)) , Marked_s(X)>
  <Marked_s(ok(X)) , Marked_s(X)> --> <Marked_s(mark(X)) , Marked_s(X)>
  <Marked_s(mark(X)) , Marked_s(X)> --> <Marked_s(ok(X)) , Marked_s(X)>
  <Marked_s(mark(X)) , Marked_s(X)> --> <Marked_s(mark(X)) , Marked_s(X)>
}

{  <Marked_p(ok(X)) , Marked_p(X)> --> <Marked_p(ok(X)) , Marked_p(X)>
  <Marked_p(ok(X)) , Marked_p(X)> --> <Marked_p(mark(X)) , Marked_p(X)>
  <Marked_p(mark(X)) , Marked_p(X)> --> <Marked_p(ok(X)) , Marked_p(X)>
  <Marked_p(mark(X)) , Marked_p(X)> --> <Marked_p(mark(X)) , Marked_p(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(mark(X)) >= Marked_top(proper(X)) ;
  Marked_top(ok(X)) >= Marked_top(active(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(X)) > Marked_top(proper(X)) ;
 }
{
  Marked_top(ok(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
=== 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 : 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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(mark(X)) >= Marked_top(proper(X))
constraint: Marked_top(ok(X)) >= Marked_top(active(X))
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(cons(X1,X2)) >= Marked_proper(X1) ;
  Marked_proper(cons(X1,X2)) >= Marked_proper(X2) ;
  Marked_proper(f(X)) >= Marked_proper(X) ;
  Marked_proper(s(X)) >= Marked_proper(X) ;
  Marked_proper(p(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(cons(X1,X2)) > Marked_proper(X1) ;
 }
{
  Marked_proper(cons(X1,X2)) > Marked_proper(X2) ;
 }
{
  Marked_proper(f(X)) > Marked_proper(X) ;
 }
{
  Marked_proper(s(X)) > Marked_proper(X) ;
 }
{
  Marked_proper(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X1)
constraint: Marked_proper(cons(X1,X2)) >= Marked_proper(X2)
constraint: Marked_proper(f(X)) >= Marked_proper(X)
constraint: Marked_proper(s(X)) >= Marked_proper(X)
constraint: Marked_proper(p(X)) >= Marked_proper(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(cons(X1,X2)) >= Marked_active(X1) ;
  Marked_active(f(X)) >= Marked_active(X) ;
  Marked_active(s(X)) >= Marked_active(X) ;
  Marked_active(p(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(cons(X1,X2)) > Marked_active(X1) ;
 }
{
  Marked_active(f(X)) > Marked_active(X) ;
 }
{
  Marked_active(s(X)) > Marked_active(X) ;
 }
{
  Marked_active(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(cons(X1,X2)) >= Marked_active(X1)
constraint: Marked_active(f(X)) >= Marked_active(X)
constraint: Marked_active(s(X)) >= Marked_active(X)
constraint: Marked_active(p(X)) >= Marked_active(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_f(mark(X)) >= Marked_f(X)
constraint: Marked_f(ok(X)) >= Marked_f(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ;
  Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ;
 }
{
  Marked_cons(ok(X1),ok(X2)) > Marked_cons(X1,X2) ;
 }
 } 
=== 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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2)
constraint: Marked_cons(ok(X1),ok(X2)) >= Marked_cons(X1,X2)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_s(mark(X)) >= Marked_s(X) ;
  Marked_s(ok(X)) >= Marked_s(X) ;
 }
 + Disjunctions:{ 
{
  Marked_s(mark(X)) > Marked_s(X) ;
 }
{
  Marked_s(ok(X)) > Marked_s(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_s(mark(X)) >= Marked_s(X)
constraint: Marked_s(ok(X)) >= Marked_s(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_p(mark(X)) >= Marked_p(X) ;
  Marked_p(ok(X)) >= Marked_p(X) ;
 }
 + Disjunctions:{ 
{
  Marked_p(mark(X)) > Marked_p(X) ;
 }
{
  Marked_p(ok(X)) > Marked_p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_p(mark(X)) >= Marked_p(X)
constraint: Marked_p(ok(X)) >= Marked_p(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(ok(X)) >= Marked_top(active(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(ok(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(ok(X)) >= Marked_top(active(X))
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_proper(p(X)) , Marked_proper(X)> 
      --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(s(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(s(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(f(X)) >= Marked_proper(X) ;
  Marked_proper(s(X)) >= Marked_proper(X) ;
  Marked_proper(p(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(f(X)) > Marked_proper(X) ;
 }
{
  Marked_proper(s(X)) > Marked_proper(X) ;
 }
{
  Marked_proper(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(f(X)) >= Marked_proper(X)
constraint: Marked_proper(s(X)) >= Marked_proper(X)
constraint: Marked_proper(p(X)) >= Marked_proper(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_proper(p(X)) , Marked_proper(X)> 
      --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(p(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(p(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(f(X)) >= Marked_proper(X) ;
  Marked_proper(p(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(f(X)) > Marked_proper(X) ;
 }
{
  Marked_proper(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(f(X)) >= Marked_proper(X)
constraint: Marked_proper(p(X)) >= Marked_proper(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_proper(p(X)) , Marked_proper(X)> 
      --> <Marked_proper(p(X)) , Marked_proper(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_proper(p(X)) >= Marked_proper(X) ;
 }
 + Disjunctions:{ 
{
  Marked_proper(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_proper(p(X)) >= Marked_proper(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_active(p(X)) , Marked_active(X)> 
      --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(f(X)) >= Marked_active(X) ;
  Marked_active(s(X)) >= Marked_active(X) ;
  Marked_active(p(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(f(X)) > Marked_active(X) ;
 }
{
  Marked_active(s(X)) > Marked_active(X) ;
 }
{
  Marked_active(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(f(X)) >= Marked_active(X)
constraint: Marked_active(s(X)) >= Marked_active(X)
constraint: Marked_active(p(X)) >= Marked_active(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_active(p(X)) , Marked_active(X)> 
      --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(p(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(p(X)) , Marked_active(X)>
  <Marked_active(s(X)) , Marked_active(X)> 
     --> <Marked_active(s(X)) , Marked_active(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(s(X)) >= Marked_active(X) ;
  Marked_active(p(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(s(X)) > Marked_active(X) ;
 }
{
  Marked_active(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(s(X)) >= Marked_active(X)
constraint: Marked_active(p(X)) >= Marked_active(X)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_active(p(X)) , Marked_active(X)> 
      --> <Marked_active(p(X)) , Marked_active(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_active(p(X)) >= Marked_active(X) ;
 }
 + Disjunctions:{ 
{
  Marked_active(p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_active(p(X)) >= Marked_active(X)
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)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_f(mark(X)) >= Marked_f(X) ;
 }
 + Disjunctions:{ 
{
  Marked_f(mark(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_f(mark(X)) >= Marked_f(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)> 
      --> <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2) ;
 }
 + Disjunctions:{ 
{
  Marked_cons(mark(X1),X2) > Marked_cons(X1,X2) ;
 }
 } 
=== 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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_cons(mark(X1),X2) >= Marked_cons(X1,X2)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_s(mark(X)) , Marked_s(X)> --> <Marked_s(mark(X)) , Marked_s(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_s(mark(X)) >= Marked_s(X) ;
 }
 + Disjunctions:{ 
{
  Marked_s(mark(X)) > Marked_s(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_s(mark(X)) >= Marked_s(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_p(mark(X)) , Marked_p(X)> --> <Marked_p(mark(X)) , Marked_p(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  cons(mark(X1),X2) >= mark(cons(X1,X2)) ;
  cons(ok(X1),ok(X2)) >= ok(cons(X1,X2)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  s(mark(X)) >= mark(s(X)) ;
  s(ok(X)) >= ok(s(X)) ;
  active(cons(X1,X2)) >= cons(active(X1),X2) ;
  active(f(0)) >= mark(cons(0,f(s(0)))) ;
  active(f(s(0))) >= mark(f(p(s(0)))) ;
  active(f(X)) >= f(active(X)) ;
  active(s(X)) >= s(active(X)) ;
  active(p(s(0))) >= mark(0) ;
  active(p(X)) >= p(active(X)) ;
  p(mark(X)) >= mark(p(X)) ;
  p(ok(X)) >= ok(p(X)) ;
  proper(cons(X1,X2)) >= cons(proper(X1),proper(X2)) ;
  proper(0) >= ok(0) ;
  proper(f(X)) >= f(proper(X)) ;
  proper(s(X)) >= s(proper(X)) ;
  proper(p(X)) >= p(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_p(mark(X)) >= Marked_p(X) ;
 }
 + Disjunctions:{ 
{
  Marked_p(mark(X)) > Marked_p(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: cons(mark(X1),X2) >= mark(cons(X1,X2))
constraint: cons(ok(X1),ok(X2)) >= ok(cons(X1,X2))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: s(mark(X)) >= mark(s(X))
constraint: s(ok(X)) >= ok(s(X))
constraint: active(cons(X1,X2)) >= cons(active(X1),X2)
constraint: active(f(0)) >= mark(cons(0,f(s(0))))
constraint: active(f(s(0))) >= mark(f(p(s(0))))
constraint: active(f(X)) >= f(active(X))
constraint: active(s(X)) >= s(active(X))
constraint: active(p(s(0))) >= mark(0)
constraint: active(p(X)) >= p(active(X))
constraint: p(mark(X)) >= mark(p(X))
constraint: p(ok(X)) >= ok(p(X))
constraint: proper(cons(X1,X2)) >= cons(proper(X1),proper(X2))
constraint: proper(0) >= ok(0)
constraint: proper(f(X)) >= f(proper(X))
constraint: proper(s(X)) >= s(proper(X))
constraint: proper(p(X)) >= p(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_p(mark(X)) >= Marked_p(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(f(0)) -> mark(cons(0,f(s(0))))
[2] active(f(s(0))) -> mark(f(p(s(0))))
[3] active(p(s(0))) -> mark(0)
[4] active(f(X)) -> f(active(X))
[5] active(cons(X1,X2)) -> cons(active(X1),X2)
[6] active(s(X)) -> s(active(X))
[7] active(p(X)) -> p(active(X))
[8] f(mark(X)) -> mark(f(X))
[9] cons(mark(X1),X2) -> mark(cons(X1,X2))
[10] s(mark(X)) -> mark(s(X))
[11] p(mark(X)) -> mark(p(X))
[12] proper(f(X)) -> f(proper(X))
[13] proper(0) -> ok(0)
[14] proper(cons(X1,X2)) -> cons(proper(X1),proper(X2))
[15] proper(s(X)) -> s(proper(X))
[16] proper(p(X)) -> p(proper(X))
[17] f(ok(X)) -> ok(f(X))
[18] cons(ok(X1),ok(X2)) -> ok(cons(X1,X2))
[19] s(ok(X)) -> ok(s(X))
[20] p(ok(X)) -> ok(p(X))
[21] top(mark(X)) -> top(proper(X))
[22] top(ok(X)) -> top(active(X))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(f(0)) , Marked_cons(0,f(s(0)))>
<Marked_active(f(0)) , Marked_f(s(0))>
<Marked_active(f(0)) , Marked_s(0)>
<Marked_active(f(s(0))) , Marked_f(p(s(0)))>
<Marked_active(f(s(0))) , Marked_p(s(0))>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(cons(X1,X2)) , Marked_cons(active(X1),X2)>
<Marked_active(cons(X1,X2)) , Marked_active(X1)>
<Marked_active(s(X)) , Marked_s(active(X))>
<Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_p(active(X))>
<Marked_active(p(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_s(mark(X)) , Marked_s(X)>
<Marked_p(mark(X)) , Marked_p(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(cons(X1,X2)) , Marked_cons(proper(X1),proper(X2))>
<Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
<Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
<Marked_proper(s(X)) , Marked_s(proper(X))>
<Marked_proper(s(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_p(proper(X))>
<Marked_proper(p(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)>
<Marked_s(ok(X)) , Marked_s(X)>
<Marked_p(ok(X)) , Marked_p(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: CG using Matrix polynomial interpretation (strict sub matrices size: 1x1) = 
 [ mark ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 [ ok ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ s ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 [ 0 ] () = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ Marked_top ] (X0) = [ [ 0 , 0 , 1 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ p ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ cons ] (X0,X1) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X1 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ top ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ active ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 [ f ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 1 , 1 ] ]*X0 + [ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 1 , 0 , 0 ] ]; 
 [ proper ] (X0) = [ [ 0 , 0 , 0 ] [ 0 , 1 , 0 ] [ 0 , 0 , 1 ] ]*X0 + 
[ [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] [ 0 , 0 , 0 ] ]; 
 removing <Marked_top(mark(X)),Marked_top(proper(X))>
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 0; 
 [ ok ] (X0) = 3 + 2*X0 + 0; 
 [ s ] (X0) = 2*X0 + 0; 
 [ 0 ] () = 3 + 0; 
 [ Marked_top ] (X0) = 2*X0 + 0; 
 [ p ] (X0) = 2*X0 + 0; 
 [ cons ] (X0,X1) = 2 + 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ f ] (X0) = 2 + 3*X0 + 0; 
 [ proper ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(cons(X1,X2)) , Marked_proper(X1)>
<Marked_proper(cons(X1,X2)) , Marked_proper(X2)>
<Marked_proper(s(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 2*X0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 1*X0; 
 [ cons ] (X0,X1) = 1*X1 + 1*X0 + 1; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0; 
 [ f ] (X0) = 2*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(cons(X1,X2)),Marked_proper(X1)><Marked_proper(
                                                          cons(X1,X2)),
Marked_proper(X2)>
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(s(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(s(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 2*X0 + 2; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 1*X0; 
 [ cons ] (X0,X1) = 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 1*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_proper(s(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 0; 
 [ Marked_proper ] (X0) = 3*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 1*X0; 
 [ cons ] (X0,X1) = 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0; 
 [ f ] (X0) = 2*X0 + 1; 
 [ proper ] (X0) = 2*X0; 
 removing <Marked_proper(f(X)),Marked_proper(X)>
 [ {
      
     DP termination of:
     <Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_proper(p(X)) , Marked_proper(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 0; 
 [ ok ] (X0) = 3 + 0; 
 [ s ] (X0) = 3 + 0; 
 [ Marked_proper ] (X0) = 3*X0 + 0; 
 [ 0 ] () = 2 + 0; 
 [ p ] (X0) = 2 + 1*X0 + 0; 
 [ cons ] (X0,X1) = 2*X0 + 2*X1 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 1*X0 + 0; 
 [ f ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(cons(X1,X2)) , Marked_active(X1)>
<Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 2*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 2*X0; 
 [ cons ] (X0,X1) = 2*X0 + 1; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 2*X0; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(cons(X1,X2)),Marked_active(X1)>
 [ {
      
     DP termination of:
     <Marked_active(f(X)) , Marked_active(X)>
<Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(f(X)) , Marked_active(X)>
<Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 1*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 2*X0; 
 [ cons ] (X0,X1) = 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0; 
 [ f ] (X0) = 2*X0 + 2; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(f(X)),Marked_active(X)>
 [ {
      
     DP termination of:
     <Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(s(X)) , Marked_active(X)>
<Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 0; 
 [ s ] (X0) = 2*X0 + 1; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 2*X0; 
 [ cons ] (X0,X1) = 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 2; 
 [ Marked_active ] (X0) = 3*X0; 
 [ proper ] (X0) = 1*X0; 
 removing <Marked_active(s(X)),Marked_active(X)>
 [ {
      
     DP termination of:
     <Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(p(X)) , Marked_active(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 0; 
 [ ok ] (X0) = 3 + 2*X0 + 0; 
 [ s ] (X0) = 2*X0 + 0; 
 [ 0 ] () = 3 + 0; 
 [ p ] (X0) = 2 + 3*X0 + 0; 
 [ cons ] (X0,X1) = 2 + 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ f ] (X0) = 1*X0 + 0; 
 [ Marked_active ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(ok(X)) , Marked_f(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ Marked_f ] (X0) = 3*X0; 
 [ ok ] (X0) = 2*X0 + 1; 
 [ s ] (X0) = 1*X0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 1*X0; 
 [ cons ] (X0,X1) = 1*X0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 0; 
 [ f ] (X0) = 1*X0; 
 [ proper ] (X0) = 2; 
 removing <Marked_f(ok(X)),Marked_f(X)>
 [ {
      
     DP termination of:
     <Marked_f(mark(X)) , Marked_f(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_f(mark(X)) , Marked_f(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 2*X0 + 0; 
 [ Marked_f ] (X0) = 3*X0 + 0; 
 [ ok ] (X0) = 1*X0 + 0; 
 [ s ] (X0) = 1 + 3*X0 + 0; 
 [ 0 ] () = 0; 
 [ p ] (X0) = 1*X0 + 0; 
 [ cons ] (X0,X1) = 1*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 1 + 3*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
<Marked_cons(ok(X1),ok(X2)) , Marked_cons(X1,X2)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ ok ] (X0) = 1*X0 + 1; 
 [ s ] (X0) = 2*X0; 
 [ 0 ] () = 2; 
 [ p ] (X0) = 2*X0; 
 [ cons ] (X0,X1) = 2*X0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 0; 
 [ f ] (X0) = 2*X0; 
 [ proper ] (X0) = 2*X0; 
 [ Marked_cons ] (X0,X1) = 1*X1; 
 removing <Marked_cons(ok(X1),ok(X2)),Marked_cons(X1,X2)>
 [ {
      
     DP termination of:
     <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_cons(mark(X1),X2) , Marked_cons(X1,X2)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 2*X0 + 0; 
 [ ok ] (X0) = 2 + 0; 
 [ s ] (X0) = 2*X0 + 0; 
 [ 0 ] () = 1 + 0; 
 [ p ] (X0) = 1*X0 + 0; 
 [ cons ] (X0,X1) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 2*X0 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 [ Marked_cons ] (X0,X1) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_s(mark(X)) , Marked_s(X)>
<Marked_s(ok(X)) , Marked_s(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ ok ] (X0) = 2*X0 + 1; 
 [ s ] (X0) = 1*X0; 
 [ 0 ] () = 2; 
 [ p ] (X0) = 1*X0; 
 [ Marked_s ] (X0) = 3*X0; 
 [ cons ] (X0,X1) = 2*X0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 1*X0; 
 [ f ] (X0) = 2*X0; 
 [ proper ] (X0) = 3*X0; 
 removing <Marked_s(ok(X)),Marked_s(X)>
 [ {
      
     DP termination of:
     <Marked_s(mark(X)) , Marked_s(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_s(mark(X)) , Marked_s(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 2*X0 + 0; 
 [ ok ] (X0) = 3 + 0; 
 [ s ] (X0) = 3*X0 + 0; 
 [ 0 ] () = 1 + 0; 
 [ p ] (X0) = 1*X0 + 0; 
 [ Marked_s ] (X0) = 3*X0 + 0; 
 [ cons ] (X0,X1) = 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_p(mark(X)) , Marked_p(X)>
<Marked_p(ok(X)) , Marked_p(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 2*X0; 
 [ ok ] (X0) = 2*X0 + 2; 
 [ s ] (X0) = 2*X0; 
 [ 0 ] () = 2; 
 [ p ] (X0) = 1*X0; 
 [ cons ] (X0,X1) = 1*X0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 2*X0; 
 [ Marked_p ] (X0) = 3*X0; 
 [ f ] (X0) = 2*X0; 
 [ proper ] (X0) = 3*X0; 
 removing <Marked_p(ok(X)),Marked_p(X)>
 [ {
      
     DP termination of:
     <Marked_p(mark(X)) , Marked_p(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_p(mark(X)) , Marked_p(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 2 + 2*X0 + 0; 
 [ ok ] (X0) = 3 + 0; 
 [ s ] (X0) = 2*X0 + 0; 
 [ 0 ] () = 1 + 0; 
 [ p ] (X0) = 1*X0 + 0; 
 [ cons ] (X0,X1) = 3*X0 + 0; 
 [ top ] (X0) = 0; 
 [ active ] (X0) = 3*X0 + 0; 
 [ Marked_p ] (X0) = 3*X0 + 0; 
 [ f ] (X0) = 3*X0 + 0; 
 [ proper ] (X0) = 3*X0 + 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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