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

TRS termination of:
[1] active(f(a,b,X)) -> mark(f(X,X,X))
[2] active(c) -> mark(a)
[3] active(c) -> mark(b)
[4] active(f(X1,X2,X3)) -> f(active(X1),X2,X3)
[5] active(f(X1,X2,X3)) -> f(X1,X2,active(X3))
[6] f(mark(X1),X2,X3) -> mark(f(X1,X2,X3))
[7] f(X1,X2,mark(X3)) -> mark(f(X1,X2,X3))
[8] proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
[9] proper(a) -> ok(a)
[10] proper(b) -> ok(b)
[11] proper(c) -> ok(c)
[12] f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
[13] top(mark(X)) -> top(proper(X))
[14] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(a,b,X)) , Marked_f(X,X,X)>
<Marked_active(f(X1,X2,X3)) , Marked_f(active(X1),X2,X3)>
<Marked_active(f(X1,X2,X3)) , Marked_active(X1)>
<Marked_active(f(X1,X2,X3)) , Marked_f(X1,X2,active(X3))>
<Marked_active(f(X1,X2,X3)) , Marked_active(X3)>
<Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
<Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
<Marked_proper(f(X1,X2,X3)) , Marked_f(proper(X1),proper(X2),proper(X3))>
<Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)>
<Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)>
<Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)>
<Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)>
<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(X1,X2,X3)) , Marked_proper(X3)> 
      --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X3)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X2)>
  <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)> 
     --> <Marked_proper(f(X1,X2,X3)) , Marked_proper(X1)>
}

{  <Marked_active(f(X1,X2,X3)) , Marked_active(X3)> 
      --> <Marked_active(f(X1,X2,X3)) , Marked_active(X3)>
  <Marked_active(f(X1,X2,X3)) , Marked_active(X3)> 
     --> <Marked_active(f(X1,X2,X3)) , Marked_active(X1)>
  <Marked_active(f(X1,X2,X3)) , Marked_active(X1)> 
     --> <Marked_active(f(X1,X2,X3)) , Marked_active(X3)>
  <Marked_active(f(X1,X2,X3)) , Marked_active(X1)> 
     --> <Marked_active(f(X1,X2,X3)) , Marked_active(X1)>
}

{  <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)> 
      --> <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(ok(X1),ok(X2),ok(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(mark(X1),X2,X3) >= mark(f(X1,X2,X3)) ;
  f(ok(X1),ok(X2),ok(X3)) >= ok(f(X1,X2,X3)) ;
  f(X1,X2,mark(X3)) >= mark(f(X1,X2,X3)) ;
  active(f(a,b,X)) >= mark(f(X,X,X)) ;
  active(f(X1,X2,X3)) >= f(active(X1),X2,X3) ;
  active(f(X1,X2,X3)) >= f(X1,X2,active(X3)) ;
  active(c) >= mark(a) ;
  active(c) >= mark(b) ;
  proper(f(X1,X2,X3)) >= f(proper(X1),proper(X2),proper(X3)) ;
  proper(a) >= ok(a) ;
  proper(b) >= ok(b) ;
  proper(c) >= ok(c) ;
  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
=== STOPING TIMER real ===
=== 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 18.739938 seconds (real time)
Cime Exit Status: 0