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

TRS termination of:
[1] a__h(X) -> a__g(mark(X),X)
[2] a__g(a,X) -> a__f(b,X)
[3] a__f(X,X) -> a__h(a__a)
[4] a__a -> b
[5] mark(h(X)) -> a__h(mark(X))
[6] mark(g(X1,X2)) -> a__g(mark(X1),X2)
[7] mark(a) -> a__a
[8] mark(f(X1,X2)) -> a__f(mark(X1),X2)
[9] mark(b) -> b
[10] a__h(X) -> h(X)
[11] a__g(X1,X2) -> g(X1,X2)
[12] a__a -> a
[13] a__f(X1,X2) -> f(X1,X2)


Sub problem: 
guided: 

DP termination of:
<Marked_a__h(X) , Marked_a__g(mark(X),X)>
<Marked_a__h(X) , Marked_mark(X)>
<Marked_a__g(a,X) , Marked_a__f(b,X)>
<Marked_a__f(X,X) , Marked_a__h(a__a)>
<Marked_a__f(X,X) , Marked_a__a>
<Marked_mark(h(X)) , Marked_a__h(mark(X))>
<Marked_mark(h(X)) , Marked_mark(X)>
<Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)>
<Marked_mark(g(X1,X2)) , Marked_mark(X1)>
<Marked_mark(a) , Marked_a__a>
<Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)>
<Marked_mark(f(X1,X2)) , Marked_mark(X1)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
      --> <Marked_mark(f(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)>
  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(g(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)>
  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_mark(f(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(h(X)) , Marked_a__h(mark(X))>
  <Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)> 
     --> <Marked_a__f(X,X) , Marked_a__h(a__a)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(g(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_mark(g(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(h(X)) , Marked_a__h(mark(X))>
  <Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)> 
     --> <Marked_a__g(a,X) , Marked_a__f(b,X)>
  <Marked_mark(h(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(h(X)) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)>
  <Marked_mark(h(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(h(X)) , Marked_mark(X)> 
     --> <Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)>
  <Marked_mark(h(X)) , Marked_mark(X)> --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_mark(h(X)) , Marked_mark(X)> 
     --> <Marked_mark(h(X)) , Marked_a__h(mark(X))>
  <Marked_mark(h(X)) , Marked_a__h(mark(X))> 
     --> <Marked_a__h(X) , Marked_mark(X)>
  <Marked_mark(h(X)) , Marked_a__h(mark(X))> 
     --> <Marked_a__h(X) , Marked_a__g(mark(X),X)>
  <Marked_a__f(X,X) , Marked_a__h(a__a)> --> <Marked_a__h(X) , Marked_mark(X)>
  <Marked_a__f(X,X) , Marked_a__h(a__a)> 
     --> <Marked_a__h(X) , Marked_a__g(mark(X),X)>
  <Marked_a__g(a,X) , Marked_a__f(b,X)> 
     --> <Marked_a__f(X,X) , Marked_a__h(a__a)>
  <Marked_a__h(X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2)) , Marked_mark(X1)>
  <Marked_a__h(X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2)) , Marked_a__f(mark(X1),X2)>
  <Marked_a__h(X) , Marked_mark(X)> 
     --> <Marked_mark(g(X1,X2)) , Marked_mark(X1)>
  <Marked_a__h(X) , Marked_mark(X)> 
     --> <Marked_mark(g(X1,X2)) , Marked_a__g(mark(X1),X2)>
  <Marked_a__h(X) , Marked_mark(X)> --> <Marked_mark(h(X)) , Marked_mark(X)>
  <Marked_a__h(X) , Marked_mark(X)> 
     --> <Marked_mark(h(X)) , Marked_a__h(mark(X))>
  <Marked_a__h(X) , Marked_a__g(mark(X),X)> 
     --> <Marked_a__g(a,X) , Marked_a__f(b,X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__g(a,X) >= a__f(b,X) ;
  a__g(X1,X2) >= g(X1,X2) ;
  mark(b) >= b ;
  mark(a) >= a__a ;
  mark(h(X)) >= a__h(mark(X)) ;
  mark(g(X1,X2)) >= a__g(mark(X1),X2) ;
  mark(f(X1,X2)) >= a__f(mark(X1),X2) ;
  a__h(X) >= a__g(mark(X),X) ;
  a__h(X) >= h(X) ;
  a__f(X,X) >= a__h(a__a) ;
  a__f(X1,X2) >= f(X1,X2) ;
  a__a >= b ;
  a__a >= a ;
  Marked_a__f(X,X) >= Marked_a__h(a__a) ;
  Marked_a__g(a,X) >= Marked_a__f(b,X) ;
  Marked_a__h(X) >= Marked_a__g(mark(X),X) ;
  Marked_a__h(X) >= Marked_mark(X) ;
  Marked_mark(h(X)) >= Marked_a__h(mark(X)) ;
  Marked_mark(h(X)) >= Marked_mark(X) ;
  Marked_mark(g(X1,X2)) >= Marked_a__g(mark(X1),X2) ;
  Marked_mark(g(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(f(X1,X2)) >= Marked_a__f(mark(X1),X2) ;
  Marked_mark(f(X1,X2)) >= Marked_mark(X1) ;
 }
 + Disjunctions:{ 
{
  Marked_a__f(X,X) > Marked_a__h(a__a) ;
 }
{
  Marked_a__g(a,X) > Marked_a__f(b,X) ;
 }
{
  Marked_a__h(X) > Marked_a__g(mark(X),X) ;
 }
{
  Marked_a__h(X) > Marked_mark(X) ;
 }
{
  Marked_mark(h(X)) > Marked_a__h(mark(X)) ;
 }
{
  Marked_mark(h(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(g(X1,X2)) > Marked_a__g(mark(X1),X2) ;
 }
{
  Marked_mark(g(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(f(X1,X2)) > Marked_a__f(mark(X1),X2) ;
 }
{
  Marked_mark(f(X1,X2)) > Marked_mark(X1) ;
 }
 } 
=== 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__g(a,X) >= a__f(b,X)
constraint: a__g(X1,X2) >= g(X1,X2)
constraint: mark(b) >= b
constraint: mark(a) >= a__a
constraint: mark(h(X)) >= a__h(mark(X))
constraint: mark(g(X1,X2)) >= a__g(mark(X1),X2)
constraint: mark(f(X1,X2)) >= a__f(mark(X1),X2)
constraint: a__h(X) >= a__g(mark(X),X)
constraint: a__h(X) >= h(X)
constraint: a__f(X,X) >= a__h(a__a)
constraint: a__f(X1,X2) >= f(X1,X2)
constraint: a__a >= b
constraint: a__a >= a
constraint: Marked_a__f(X,X) >= Marked_a__h(a__a)
constraint: Marked_a__g(a,X) >= Marked_a__f(b,X)
constraint: Marked_a__h(X) >= Marked_a__g(mark(X),X)
constraint: Marked_a__h(X) >= Marked_mark(X)
constraint: Marked_mark(h(X)) >= Marked_a__h(mark(X))
constraint: Marked_mark(h(X)) >= Marked_mark(X)
constraint: Marked_mark(g(X1,X2)) >= Marked_a__g(mark(X1),X2)
constraint: Marked_mark(g(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(f(X1,X2)) >= Marked_a__f(mark(X1),X2)
constraint: Marked_mark(f(X1,X2)) >= Marked_mark(X1)
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_a__f(X,X) , Marked_a__h(a__a)> 
      --> <Marked_a__h(X) , Marked_a__g(mark(X),X)>
  <Marked_a__g(a,X) , Marked_a__f(b,X)> 
     --> <Marked_a__f(X,X) , Marked_a__h(a__a)>
  <Marked_a__h(X) , Marked_a__g(mark(X),X)> 
     --> <Marked_a__g(a,X) , Marked_a__f(b,X)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__g(a,X) >= a__f(b,X) ;
  a__g(X1,X2) >= g(X1,X2) ;
  mark(b) >= b ;
  mark(a) >= a__a ;
  mark(h(X)) >= a__h(mark(X)) ;
  mark(g(X1,X2)) >= a__g(mark(X1),X2) ;
  mark(f(X1,X2)) >= a__f(mark(X1),X2) ;
  a__h(X) >= a__g(mark(X),X) ;
  a__h(X) >= h(X) ;
  a__f(X,X) >= a__h(a__a) ;
  a__f(X1,X2) >= f(X1,X2) ;
  a__a >= b ;
  a__a >= a ;
  Marked_a__f(X,X) >= Marked_a__h(a__a) ;
  Marked_a__g(a,X) >= Marked_a__f(b,X) ;
  Marked_a__h(X) >= Marked_a__g(mark(X),X) ;
 }
 + Disjunctions:{ 
{
  Marked_a__f(X,X) > Marked_a__h(a__a) ;
 }
{
  Marked_a__g(a,X) > Marked_a__f(b,X) ;
 }
{
  Marked_a__h(X) > Marked_a__g(mark(X),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 : 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 1.072276 seconds (real time)
Cime Exit Status: 0