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

TRS termination of:
[1] active(f(X)) -> mark(g(h(f(X))))
[2] active(f(X)) -> f(active(X))
[3] active(h(X)) -> h(active(X))
[4] f(mark(X)) -> mark(f(X))
[5] h(mark(X)) -> mark(h(X))
[6] proper(f(X)) -> f(proper(X))
[7] proper(g(X)) -> g(proper(X))
[8] proper(h(X)) -> h(proper(X))
[9] f(ok(X)) -> ok(f(X))
[10] g(ok(X)) -> ok(g(X))
[11] h(ok(X)) -> ok(h(X))
[12] top(mark(X)) -> top(proper(X))
[13] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(X)) , Marked_g(h(f(X)))>
<Marked_active(f(X)) , Marked_h(f(X))>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_h(active(X))>
<Marked_active(h(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_g(proper(X))>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_h(proper(X))>
<Marked_proper(h(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_g(ok(X)) , Marked_g(X)>
<Marked_h(ok(X)) , Marked_h(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 6 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(ok(X)) , Marked_top(active(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}

{  <Marked_proper(h(X)) , Marked_proper(X)> 
      --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(h(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(g(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(h(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(g(X)) , Marked_proper(X)>
  <Marked_proper(f(X)) , Marked_proper(X)> 
     --> <Marked_proper(f(X)) , Marked_proper(X)>
}

{  <Marked_active(h(X)) , Marked_active(X)> 
      --> <Marked_active(h(X)) , Marked_active(X)>
  <Marked_active(h(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(h(X)) , Marked_active(X)>
  <Marked_active(f(X)) , Marked_active(X)> 
     --> <Marked_active(f(X)) , Marked_active(X)>
}

{  <Marked_g(ok(X)) , Marked_g(X)> --> <Marked_g(ok(X)) , Marked_g(X)>
}

{  <Marked_f(ok(X)) , Marked_f(X)> --> <Marked_f(ok(X)) , Marked_f(X)>
  <Marked_f(ok(X)) , Marked_f(X)> --> <Marked_f(mark(X)) , Marked_f(X)>
  <Marked_f(mark(X)) , Marked_f(X)> --> <Marked_f(ok(X)) , Marked_f(X)>
  <Marked_f(mark(X)) , Marked_f(X)> --> <Marked_f(mark(X)) , Marked_f(X)>
}

{  <Marked_h(ok(X)) , Marked_h(X)> --> <Marked_h(ok(X)) , Marked_h(X)>
  <Marked_h(ok(X)) , Marked_h(X)> --> <Marked_h(mark(X)) , Marked_h(X)>
  <Marked_h(mark(X)) , Marked_h(X)> --> <Marked_h(ok(X)) , Marked_h(X)>
  <Marked_h(mark(X)) , Marked_h(X)> --> <Marked_h(mark(X)) , Marked_h(X)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  g(ok(X)) >= ok(g(X)) ;
  h(mark(X)) >= mark(h(X)) ;
  h(ok(X)) >= ok(h(X)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  active(h(X)) >= h(active(X)) ;
  active(f(X)) >= mark(g(h(f(X)))) ;
  active(f(X)) >= f(active(X)) ;
  proper(g(X)) >= g(proper(X)) ;
  proper(h(X)) >= h(proper(X)) ;
  proper(f(X)) >= f(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(mark(X)) >= Marked_top(proper(X)) ;
  Marked_top(ok(X)) >= Marked_top(active(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(X)) > Marked_top(proper(X)) ;
 }
{
  Marked_top(ok(X)) > Marked_top(active(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: g(ok(X)) >= ok(g(X))
constraint: h(mark(X)) >= mark(h(X))
constraint: h(ok(X)) >= ok(h(X))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: active(h(X)) >= h(active(X))
constraint: active(f(X)) >= mark(g(h(f(X))))
constraint: active(f(X)) >= f(active(X))
constraint: proper(g(X)) >= g(proper(X))
constraint: proper(h(X)) >= h(proper(X))
constraint: proper(f(X)) >= f(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(mark(X)) >= Marked_top(proper(X))
constraint: Marked_top(ok(X)) >= Marked_top(active(X))
APPLY CRITERIA (Subterm criterion)

ST: Marked_proper -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_active -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_g -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_f -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_h -> 1

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(mark(X)) , Marked_top(proper(X))> 
      --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  g(ok(X)) >= ok(g(X)) ;
  h(mark(X)) >= mark(h(X)) ;
  h(ok(X)) >= ok(h(X)) ;
  f(mark(X)) >= mark(f(X)) ;
  f(ok(X)) >= ok(f(X)) ;
  active(h(X)) >= h(active(X)) ;
  active(f(X)) >= mark(g(h(f(X)))) ;
  active(f(X)) >= f(active(X)) ;
  proper(g(X)) >= g(proper(X)) ;
  proper(h(X)) >= h(proper(X)) ;
  proper(f(X)) >= f(proper(X)) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(mark(X)) >= Marked_top(proper(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(X)) > Marked_top(proper(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: g(ok(X)) >= ok(g(X))
constraint: h(mark(X)) >= mark(h(X))
constraint: h(ok(X)) >= ok(h(X))
constraint: f(mark(X)) >= mark(f(X))
constraint: f(ok(X)) >= ok(f(X))
constraint: active(h(X)) >= h(active(X))
constraint: active(f(X)) >= mark(g(h(f(X))))
constraint: active(f(X)) >= f(active(X))
constraint: proper(g(X)) >= g(proper(X))
constraint: proper(h(X)) >= h(proper(X))
constraint: proper(f(X)) >= f(proper(X))
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(mark(X)) >= Marked_top(proper(X))
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(f(X)) -> mark(g(h(f(X))))
[2] active(f(X)) -> f(active(X))
[3] active(h(X)) -> h(active(X))
[4] f(mark(X)) -> mark(f(X))
[5] h(mark(X)) -> mark(h(X))
[6] proper(f(X)) -> f(proper(X))
[7] proper(g(X)) -> g(proper(X))
[8] proper(h(X)) -> h(proper(X))
[9] f(ok(X)) -> ok(f(X))
[10] g(ok(X)) -> ok(g(X))
[11] h(ok(X)) -> ok(h(X))
[12] top(mark(X)) -> top(proper(X))
[13] top(ok(X)) -> top(active(X))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(f(X)) , Marked_g(h(f(X)))>
<Marked_active(f(X)) , Marked_h(f(X))>
<Marked_active(f(X)) , Marked_f(active(X))>
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_h(active(X))>
<Marked_active(h(X)) , Marked_active(X)>
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_proper(f(X)) , Marked_f(proper(X))>
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_g(proper(X))>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_h(proper(X))>
<Marked_proper(h(X)) , Marked_proper(X)>
<Marked_f(ok(X)) , Marked_f(X)>
<Marked_g(ok(X)) , Marked_g(X)>
<Marked_h(ok(X)) , Marked_h(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ Marked_top ] (X0) = 2*X0; 
 [ active ] (X0) = 0; 
 [ h ] (X0) = 2*X0; 
 [ ok ] (X0) = 1; 
 [ g ] (X0) = 2*X0; 
 [ proper ] (X0) = 0; 
 [ f ] (X0) = 1*X0; 
 [ top ] (X0) = 0; 
 removing <Marked_top(ok(X)),Marked_top(active(X))>
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1 + 2*X0 + 0; 
 [ Marked_top ] (X0) = 1*X0 + 0; 
 [ active ] (X0) = 3 + 0; 
 [ h ] (X0) = 1*X0 + 0; 
 [ ok ] (X0) = 0; 
 [ g ] (X0) = 1 + 0; 
 [ proper ] (X0) = 2*X0 + 0; 
 [ f ] (X0) = 1*X0 + 0; 
 [ top ] (X0) = 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_proper(f(X)) , Marked_proper(X)>
<Marked_proper(g(X)) , Marked_proper(X)>
<Marked_proper(h(X)) , Marked_proper(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_active(f(X)) , Marked_active(X)>
<Marked_active(h(X)) , Marked_active(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_g(ok(X)) , Marked_g(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_f(mark(X)) , Marked_f(X)>
<Marked_f(ok(X)) , Marked_f(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_h(mark(X)) , Marked_h(X)>
<Marked_h(ok(X)) , Marked_h(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 

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