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

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


Sub problem: 
guided: 

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

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