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

TRS termination of:
[1] g(X) -> h(activate(X))
[2] c -> d
[3] h(n__d) -> g(n__c)
[4] d -> n__d
[5] c -> n__c
[6] activate(n__d) -> d
[7] activate(n__c) -> c
[8] activate(X) -> X


Sub problem: 
guided: 

DP termination of:
<Marked_g(X) , Marked_h(activate(X))>
<Marked_g(X) , Marked_activate(X)>
<Marked_c , Marked_d>
<Marked_h(n__d) , Marked_g(n__c)>
<Marked_activate(n__d) , Marked_d>
<Marked_activate(n__c) , Marked_c>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_h(n__d) , Marked_g(n__c)> --> <Marked_g(X) , Marked_h(activate(X))>
  <Marked_g(X) , Marked_h(activate(X))> --> <Marked_h(n__d) , Marked_g(n__c)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  h(n__d) >= g(n__c) ;
  activate(n__c) >= c ;
  activate(n__d) >= d ;
  activate(X) >= X ;
  g(X) >= h(activate(X)) ;
  d >= n__d ;
  c >= d ;
  c >= n__c ;
  Marked_h(n__d) >= Marked_g(n__c) ;
  Marked_g(X) >= Marked_h(activate(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_h(n__d) > Marked_g(n__c) ;
 }
{
  Marked_g(X) > Marked_h(activate(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 (Simple graph)
Found the following constraints:
{
  h(n__d) >= g(n__c) ;
  activate(n__c) >= c ;
  activate(n__d) >= d ;
  activate(X) >= X ;
  g(X) >= h(activate(X)) ;
  d >= n__d ;
  c >= d ;
  c >= n__c ;
  Marked_h(n__d) >= Marked_g(n__c) ;
  Marked_g(X) > Marked_h(activate(X)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  h(n__d) >= g(n__c) ;
  activate(n__c) >= c ;
  activate(n__d) >= d ;
  activate(X) >= X ;
  g(X) >= h(activate(X)) ;
  d >= n__d ;
  c >= d ;
  c >= n__c ;
  Marked_h(n__d) >= Marked_g(n__c) ;
  Marked_g(X) > Marked_h(activate(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.(75 bt (107) [5])
=== 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.244003 seconds (real time)
Cime Exit Status: 0