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

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


Sub problem: 
guided: 

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

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

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