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

TRS termination of:
[1] f(X,n__g(X),Y) -> f(activate(Y),activate(Y),activate(Y))
[2] g(b) -> c
[3] b -> c
[4] g(X) -> n__g(X)
[5] activate(n__g(X)) -> g(activate(X))
[6] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_f(X,n__g(X),Y) , Marked_f(activate(Y),activate(Y),activate(Y))>
<Marked_f(X,n__g(X),Y) , Marked_activate(Y)>
<Marked_f(X,n__g(X),Y) , Marked_activate(Y)>
<Marked_f(X,n__g(X),Y) , Marked_activate(Y)>
<Marked_activate(n__g(X)) , Marked_g(activate(X))>
<Marked_activate(n__g(X)) , Marked_activate(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_f(X,n__g(X),Y) , Marked_f(activate(Y),activate(Y),activate(Y))> 
      --> <Marked_f(X,n__g(X),Y) , Marked_f(activate(Y),activate(Y),
                                    activate(Y))>
}

{  <Marked_activate(n__g(X)) , Marked_activate(X)> 
      --> <Marked_activate(n__g(X)) , Marked_activate(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(X,n__g(X),Y) >= f(activate(Y),activate(Y),activate(Y)) ;
  activate(n__g(X)) >= g(activate(X)) ;
  activate(X) >= X ;
  g(b) >= c ;
  g(X) >= n__g(X) ;
  b >= c ;
  Marked_f(X,n__g(X),Y) >= Marked_f(activate(Y),activate(Y),activate(Y)) ;
 }
 + Disjunctions:{ 
{
  Marked_f(X,n__g(X),Y) > Marked_f(activate(Y),activate(Y),activate(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 : 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 0.244049 seconds (real time)
Cime Exit Status: 0