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

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


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))>
<Marked_active(f(X,g(X),Y)) , Marked_f(Y,Y,Y)>
<Marked_active(g(b)) , Marked_mark(c)>
<Marked_active(b) , Marked_mark(c)>
<Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
<Marked_mark(g(X)) , Marked_active(g(mark(X)))>
<Marked_mark(g(X)) , Marked_g(mark(X))>
<Marked_mark(g(X)) , Marked_mark(X)>
<Marked_mark(b) , Marked_active(b)>
<Marked_mark(c) , Marked_active(c)>
<Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
<Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
<Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
<Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
<Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
<Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
<Marked_g(mark(X)) , Marked_g(X)>
<Marked_g(active(X)) , Marked_g(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
  <Marked_mark(g(X)) , Marked_active(g(mark(X)))> 
     --> <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))>
  <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))> 
     --> <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(g(X)) , Marked_active(g(mark(X)))>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
}

{  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
      --> <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,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(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,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(X1,mark(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(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,X2,mark(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),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(X1,X2,active(X3)) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,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(X1,mark(X2),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_g(active(X)) , Marked_g(X)> --> <Marked_g(active(X)) , Marked_g(X)>
  <Marked_g(active(X)) , Marked_g(X)> --> <Marked_g(mark(X)) , Marked_g(X)>
  <Marked_g(mark(X)) , Marked_g(X)> --> <Marked_g(active(X)) , Marked_g(X)>
  <Marked_g(mark(X)) , Marked_g(X)> --> <Marked_g(mark(X)) , Marked_g(X)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(f(X1,X2,X3)) >= active(f(X1,X2,X3)) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(c) >= active(c) ;
  mark(b) >= active(b) ;
  f(mark(X1),X2,X3) >= f(X1,X2,X3) ;
  f(active(X1),X2,X3) >= f(X1,X2,X3) ;
  f(X1,mark(X2),X3) >= f(X1,X2,X3) ;
  f(X1,active(X2),X3) >= f(X1,X2,X3) ;
  f(X1,X2,mark(X3)) >= f(X1,X2,X3) ;
  f(X1,X2,active(X3)) >= f(X1,X2,X3) ;
  active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ;
  active(g(b)) >= mark(c) ;
  active(b) >= mark(c) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3)) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
  Marked_mark(g(X)) >= Marked_active(g(mark(X))) ;
  Marked_active(f(X,g(X),Y)) >= Marked_mark(f(Y,Y,Y)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X1,X2,X3)) > Marked_active(f(X1,X2,X3)) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(g(X)) > Marked_active(g(mark(X))) ;
 }
{
  Marked_active(f(X,g(X),Y)) > Marked_mark(f(Y,Y,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: mark(f(X1,X2,X3)) >= active(f(X1,X2,X3))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(c) >= active(c)
constraint: mark(b) >= active(b)
constraint: f(mark(X1),X2,X3) >= f(X1,X2,X3)
constraint: f(active(X1),X2,X3) >= f(X1,X2,X3)
constraint: f(X1,mark(X2),X3) >= f(X1,X2,X3)
constraint: f(X1,active(X2),X3) >= f(X1,X2,X3)
constraint: f(X1,X2,mark(X3)) >= f(X1,X2,X3)
constraint: f(X1,X2,active(X3)) >= f(X1,X2,X3)
constraint: active(f(X,g(X),Y)) >= mark(f(Y,Y,Y))
constraint: active(g(b)) >= mark(c)
constraint: active(b) >= mark(c)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3))
constraint: Marked_mark(g(X)) >= Marked_mark(X)
constraint: Marked_mark(g(X)) >= Marked_active(g(mark(X)))
constraint: Marked_active(f(X,g(X),Y)) >= Marked_mark(f(Y,Y,Y))
APPLY CRITERIA (Subterm criterion)

ST: Marked_f -> 3

APPLY CRITERIA (Subterm criterion)

ST: Marked_g -> 1

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_mark(g(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
  <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))> 
     --> <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(g(X)) , Marked_mark(X)>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(f(X1,X2,X3)) >= active(f(X1,X2,X3)) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(c) >= active(c) ;
  mark(b) >= active(b) ;
  f(mark(X1),X2,X3) >= f(X1,X2,X3) ;
  f(active(X1),X2,X3) >= f(X1,X2,X3) ;
  f(X1,mark(X2),X3) >= f(X1,X2,X3) ;
  f(X1,active(X2),X3) >= f(X1,X2,X3) ;
  f(X1,X2,mark(X3)) >= f(X1,X2,X3) ;
  f(X1,X2,active(X3)) >= f(X1,X2,X3) ;
  active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ;
  active(g(b)) >= mark(c) ;
  active(b) >= mark(c) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3)) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
  Marked_active(f(X,g(X),Y)) >= Marked_mark(f(Y,Y,Y)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X1,X2,X3)) > Marked_active(f(X1,X2,X3)) ;
 }
{
  Marked_mark(g(X)) > Marked_mark(X) ;
 }
{
  Marked_active(f(X,g(X),Y)) > Marked_mark(f(Y,Y,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: mark(f(X1,X2,X3)) >= active(f(X1,X2,X3))
constraint: mark(g(X)) >= active(g(mark(X)))
constraint: mark(c) >= active(c)
constraint: mark(b) >= active(b)
constraint: f(mark(X1),X2,X3) >= f(X1,X2,X3)
constraint: f(active(X1),X2,X3) >= f(X1,X2,X3)
constraint: f(X1,mark(X2),X3) >= f(X1,X2,X3)
constraint: f(X1,active(X2),X3) >= f(X1,X2,X3)
constraint: f(X1,X2,mark(X3)) >= f(X1,X2,X3)
constraint: f(X1,X2,active(X3)) >= f(X1,X2,X3)
constraint: active(f(X,g(X),Y)) >= mark(f(Y,Y,Y))
constraint: active(g(b)) >= mark(c)
constraint: active(b) >= mark(c)
constraint: g(mark(X)) >= g(X)
constraint: g(active(X)) >= g(X)
constraint: Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3))
constraint: Marked_mark(g(X)) >= Marked_mark(X)
constraint: Marked_active(f(X,g(X),Y)) >= Marked_mark(f(Y,Y,Y))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))> 
      --> <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))>
  <Marked_active(f(X,g(X),Y)) , Marked_mark(f(Y,Y,Y))> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_active(f(X1,X2,X3))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(f(X1,X2,X3)) >= active(f(X1,X2,X3)) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(c) >= active(c) ;
  mark(b) >= active(b) ;
  f(mark(X1),X2,X3) >= f(X1,X2,X3) ;
  f(active(X1),X2,X3) >= f(X1,X2,X3) ;
  f(X1,mark(X2),X3) >= f(X1,X2,X3) ;
  f(X1,active(X2),X3) >= f(X1,X2,X3) ;
  f(X1,X2,mark(X3)) >= f(X1,X2,X3) ;
  f(X1,X2,active(X3)) >= f(X1,X2,X3) ;
  active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ;
  active(g(b)) >= mark(c) ;
  active(b) >= mark(c) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3)) ;
  Marked_active(f(X,g(X),Y)) >= Marked_mark(f(Y,Y,Y)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X1,X2,X3)) > Marked_active(f(X1,X2,X3)) ;
 }
{
  Marked_active(f(X,g(X),Y)) > Marked_mark(f(Y,Y,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
=== 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 (Simple graph)
Found the following constraints:
{
  mark(f(X1,X2,X3)) >= active(f(X1,X2,X3)) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(c) >= active(c) ;
  mark(b) >= active(b) ;
  f(mark(X1),X2,X3) >= f(X1,X2,X3) ;
  f(active(X1),X2,X3) >= f(X1,X2,X3) ;
  f(X1,mark(X2),X3) >= f(X1,X2,X3) ;
  f(X1,active(X2),X3) >= f(X1,X2,X3) ;
  f(X1,X2,mark(X3)) >= f(X1,X2,X3) ;
  f(X1,X2,active(X3)) >= f(X1,X2,X3) ;
  active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ;
  active(g(b)) >= mark(c) ;
  active(b) >= mark(c) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3)) ;
  Marked_active(f(X,g(X),Y)) > Marked_mark(f(Y,Y,Y)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  mark(f(X1,X2,X3)) >= active(f(X1,X2,X3)) ;
  mark(g(X)) >= active(g(mark(X))) ;
  mark(c) >= active(c) ;
  mark(b) >= active(b) ;
  f(mark(X1),X2,X3) >= f(X1,X2,X3) ;
  f(active(X1),X2,X3) >= f(X1,X2,X3) ;
  f(X1,mark(X2),X3) >= f(X1,X2,X3) ;
  f(X1,active(X2),X3) >= f(X1,X2,X3) ;
  f(X1,X2,mark(X3)) >= f(X1,X2,X3) ;
  f(X1,X2,active(X3)) >= f(X1,X2,X3) ;
  active(f(X,g(X),Y)) >= mark(f(Y,Y,Y)) ;
  active(g(b)) >= mark(c) ;
  active(b) >= mark(c) ;
  g(mark(X)) >= g(X) ;
  g(active(X)) >= g(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_active(f(X1,X2,X3)) ;
  Marked_active(f(X,g(X),Y)) > Marked_mark(f(Y,Y,Y)) ;
 }
 + 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.(544 bt (621) [36])
=== 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)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(mark(X1),X2,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(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(mark(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,mark(X2),X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)> 
     --> <Marked_f(X1,active(X2),X3) , Marked_f(X1,X2,X3)>
}
APPLY CRITERIA (Subterm criterion)

ST: Marked_f -> 2

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)> 
      --> <Marked_f(active(X1),X2,X3) , Marked_f(X1,X2,X3)>
  <Marked_f(active(X1),X2,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(active(X1),X2,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 (Subterm criterion)

ST: Marked_f -> 1

APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
NOT SOLVED
No proof found
Cime worked for 1.165871 seconds (real time)
Cime Exit Status: 0