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

TRS termination of:
[1] a__f(f(X)) -> a__c(f(g(f(X))))
[2] a__c(X) -> d(X)
[3] a__h(X) -> a__c(d(X))
[4] mark(f(X)) -> a__f(mark(X))
[5] mark(c(X)) -> a__c(X)
[6] mark(h(X)) -> a__h(mark(X))
[7] mark(g(X)) -> g(X)
[8] mark(d(X)) -> d(X)
[9] a__f(X) -> f(X)
[10] a__c(X) -> c(X)
[11] a__h(X) -> h(X)


Sub problem: 
guided: 

DP termination of:
<Marked_a__f(f(X)) , Marked_a__c(f(g(f(X))))>
<Marked_a__h(X) , Marked_a__c(d(X))>
<Marked_mark(f(X)) , Marked_a__f(mark(X))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(c(X)) , Marked_a__c(X)>
<Marked_mark(h(X)) , Marked_a__h(mark(X))>
<Marked_mark(h(X)) , Marked_mark(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(h(X)) , Marked_mark(X)> 
      --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_mark(h(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_mark(f(X)) , Marked_mark(X)> --> <Marked_mark(f(X)) , Marked_mark(X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__c(X) >= d(X) ;
  a__c(X) >= c(X) ;
  a__f(f(X)) >= a__c(f(g(f(X)))) ;
  a__f(X) >= f(X) ;
  a__h(X) >= a__c(d(X)) ;
  a__h(X) >= h(X) ;
  mark(f(X)) >= a__f(mark(X)) ;
  mark(g(X)) >= g(X) ;
  mark(d(X)) >= d(X) ;
  mark(c(X)) >= a__c(X) ;
  mark(h(X)) >= a__h(mark(X)) ;
  Marked_mark(f(X)) >= Marked_mark(X) ;
  Marked_mark(h(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(f(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(h(X)) > Marked_mark(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: a__c(X) >= d(X)
constraint: a__c(X) >= c(X)
constraint: a__f(f(X)) >= a__c(f(g(f(X))))
constraint: a__f(X) >= f(X)
constraint: a__h(X) >= a__c(d(X))
constraint: a__h(X) >= h(X)
constraint: mark(f(X)) >= a__f(mark(X))
constraint: mark(g(X)) >= g(X)
constraint: mark(d(X)) >= d(X)
constraint: mark(c(X)) >= a__c(X)
constraint: mark(h(X)) >= a__h(mark(X))
constraint: Marked_mark(f(X)) >= Marked_mark(X)
constraint: Marked_mark(h(X)) >= Marked_mark(X)
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] a__f(f(X)) -> a__c(f(g(f(X))))
[2] a__c(X) -> d(X)
[3] a__h(X) -> a__c(d(X))
[4] mark(f(X)) -> a__f(mark(X))
[5] mark(c(X)) -> a__c(X)
[6] mark(h(X)) -> a__h(mark(X))
[7] mark(g(X)) -> g(X)
[8] mark(d(X)) -> d(X)
[9] a__f(X) -> f(X)
[10] a__c(X) -> c(X)
[11] a__h(X) -> h(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_a__f(f(X)) , Marked_a__c(f(g(f(X))))>
<Marked_a__h(X) , Marked_a__c(d(X))>
<Marked_mark(f(X)) , Marked_a__f(mark(X))>
<Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(c(X)) , Marked_a__c(X)>
<Marked_mark(h(X)) , Marked_a__h(mark(X))>
<Marked_mark(h(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_mark(f(X)) , Marked_mark(X)>
<Marked_mark(h(X)) , Marked_mark(X)>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ a__c ] (X0) = 0; 
 [ h ] (X0) = 2 + 2*X0 + 0; 
 [ d ] (X0) = 0; 
 [ Marked_mark ] (X0) = 3*X0 + 0; 
 [ g ] (X0) = 0; 
 [ mark ] (X0) = 2*X0 + 0; 
 [ f ] (X0) = 2 + 1*X0 + 0; 
 [ a__h ] (X0) = 2 + 2*X0 + 0; 
 [ a__f ] (X0) = 2 + 1*X0 + 0; 
 [ c ] (X0) = 0; 
 ]} 
 ]} 
 ]} 

Cime worked for 0.036158 seconds (real time)
Cime Exit Status: 0