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

TRS termination of:
[1] active(f(b,c,x)) -> mark(f(x,x,x))
[2] active(f(x,y,z)) -> f(x,y,active(z))
[3] active(d) -> m(b)
[4] f(x,y,mark(z)) -> mark(f(x,y,z))
[5] active(d) -> mark(c)
[6] proper(b) -> ok(b)
[7] proper(c) -> ok(c)
[8] proper(d) -> ok(d)
[9] proper(f(x,y,z)) -> f(proper(x),proper(y),proper(z))
[10] f(ok(x),ok(y),ok(z)) -> ok(f(x,y,z))
[11] top(mark(x)) -> top(proper(x))
[12] top(ok(x)) -> top(active(x))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(b,c,x)) , Marked_f(x,x,x)>
<Marked_active(f(x,y,z)) , Marked_f(x,y,active(z))>
<Marked_active(f(x,y,z)) , Marked_active(z)>
<Marked_f(x,y,mark(z)) , Marked_f(x,y,z)>
<Marked_proper(f(x,y,z)) , Marked_f(proper(x),proper(y),proper(z))>
<Marked_proper(f(x,y,z)) , Marked_proper(x)>
<Marked_proper(f(x,y,z)) , Marked_proper(y)>
<Marked_proper(f(x,y,z)) , Marked_proper(z)>
<Marked_f(ok(x),ok(y),ok(z)) , Marked_f(x,y,z)>
<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 4 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(f(x,y,z)) , Marked_proper(z)> 
      --> <Marked_proper(f(x,y,z)) , Marked_proper(z)>
  <Marked_proper(f(x,y,z)) , Marked_proper(z)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(y)>
  <Marked_proper(f(x,y,z)) , Marked_proper(z)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(x)>
  <Marked_proper(f(x,y,z)) , Marked_proper(y)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(z)>
  <Marked_proper(f(x,y,z)) , Marked_proper(y)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(y)>
  <Marked_proper(f(x,y,z)) , Marked_proper(y)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(x)>
  <Marked_proper(f(x,y,z)) , Marked_proper(x)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(z)>
  <Marked_proper(f(x,y,z)) , Marked_proper(x)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(y)>
  <Marked_proper(f(x,y,z)) , Marked_proper(x)> 
     --> <Marked_proper(f(x,y,z)) , Marked_proper(x)>
}

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

{  <Marked_f(ok(x),ok(y),ok(z)) , Marked_f(x,y,z)> 
      --> <Marked_f(ok(x),ok(y),ok(z)) , Marked_f(x,y,z)>
  <Marked_f(ok(x),ok(y),ok(z)) , Marked_f(x,y,z)> 
     --> <Marked_f(x,y,mark(z)) , Marked_f(x,y,z)>
  <Marked_f(x,y,mark(z)) , Marked_f(x,y,z)> 
     --> <Marked_f(ok(x),ok(y),ok(z)) , Marked_f(x,y,z)>
  <Marked_f(x,y,mark(z)) , Marked_f(x,y,z)> 
     --> <Marked_f(x,y,mark(z)) , Marked_f(x,y,z)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(ok(x),ok(y),ok(z)) >= ok(f(x,y,z)) ;
  f(x,y,mark(z)) >= mark(f(x,y,z)) ;
  active(f(b,c,x)) >= mark(f(x,x,x)) ;
  active(f(x,y,z)) >= f(x,y,active(z)) ;
  active(d) >= mark(c) ;
  active(d) >= m(b) ;
  proper(f(x,y,z)) >= f(proper(x),proper(y),proper(z)) ;
  proper(b) >= ok(b) ;
  proper(c) >= ok(c) ;
  proper(d) >= ok(d) ;
  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 timeout reached
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (Simple graph)
Found the following constraints:
{
  f(ok(x),ok(y),ok(z)) >= ok(f(x,y,z)) ;
  f(x,y,mark(z)) >= mark(f(x,y,z)) ;
  active(f(b,c,x)) >= mark(f(x,x,x)) ;
  active(f(x,y,z)) >= f(x,y,active(z)) ;
  active(d) >= mark(c) ;
  active(d) >= m(b) ;
  proper(f(x,y,z)) >= f(proper(x),proper(y),proper(z)) ;
  proper(b) >= ok(b) ;
  proper(c) >= ok(c) ;
  proper(d) >= ok(d) ;
  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)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  f(ok(x),ok(y),ok(z)) >= ok(f(x,y,z)) ;
  f(x,y,mark(z)) >= mark(f(x,y,z)) ;
  active(f(b,c,x)) >= mark(f(x,x,x)) ;
  active(f(x,y,z)) >= f(x,y,active(z)) ;
  active(d) >= mark(c) ;
  active(d) >= m(b) ;
  proper(f(x,y,z)) >= f(proper(x),proper(y),proper(z)) ;
  proper(b) >= ok(b) ;
  proper(c) >= ok(c) ;
  proper(d) >= ok(d) ;
  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:{ 
 } 
=== TIMER virtual : 10.000000 ===
Entering poly_solver
Starting Sat solver initialization
Calling Sat solver...
=== STOPING TIMER virtual ===
=== TIMER real : 10.000000 ===
=== STOPING TIMER real ===
Sat solver returned
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
No solution found for these parameters.
Entering rpo_solver
=== TIMER virtual : 25.000000 ===
Search parameters: AFS type: 2 ; time limit: 25.. 
=== STOPING TIMER virtual ===
No solution found for these parameters.(1230 bt (1424) [101])
=== 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 timeout reached
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (ID_CRIT)
NOT SOLVED
No proof found
Cime worked for 101.402342 seconds (real time)
Cime Exit Status: 0