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

TRS termination of:
[1] a__f(X,g(X),Y) -> a__f(Y,Y,Y)
[2] a__g(b) -> c
[3] a__b -> c
[4] mark(f(X1,X2,X3)) -> a__f(X1,X2,X3)
[5] mark(g(X)) -> a__g(mark(X))
[6] mark(b) -> a__b
[7] mark(c) -> c
[8] a__f(X1,X2,X3) -> f(X1,X2,X3)
[9] a__g(X) -> g(X)
[10] a__b -> b


Sub problem: 
guided: 

DP termination of:
<Marked_a__f(X,g(X),Y) , Marked_a__f(Y,Y,Y)>
<Marked_mark(f(X1,X2,X3)) , Marked_a__f(X1,X2,X3)>
<Marked_mark(g(X)) , Marked_a__g(mark(X))>
<Marked_mark(g(X)) , Marked_mark(X)>
<Marked_mark(b) , Marked_a__b>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 2 components:

{  <Marked_mark(g(X)) , Marked_mark(X)> 
      --> <Marked_mark(g(X)) , Marked_mark(X)>
}

{  <Marked_a__f(X,g(X),Y) , Marked_a__f(Y,Y,Y)> 
      --> <Marked_a__f(X,g(X),Y) , Marked_a__f(Y,Y,Y)>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__f(X,g(X),Y) >= a__f(Y,Y,Y) ;
  a__f(X1,X2,X3) >= f(X1,X2,X3) ;
  a__g(b) >= c ;
  a__g(X) >= g(X) ;
  a__b >= c ;
  a__b >= b ;
  mark(g(X)) >= a__g(mark(X)) ;
  mark(c) >= c ;
  mark(b) >= a__b ;
  mark(f(X1,X2,X3)) >= a__f(X1,X2,X3) ;
  Marked_mark(g(X)) >= Marked_mark(X) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(g(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__f(X,g(X),Y) >= a__f(Y,Y,Y)
constraint: a__f(X1,X2,X3) >= f(X1,X2,X3)
constraint: a__g(b) >= c
constraint: a__g(X) >= g(X)
constraint: a__b >= c
constraint: a__b >= b
constraint: mark(g(X)) >= a__g(mark(X))
constraint: mark(c) >= c
constraint: mark(b) >= a__b
constraint: mark(f(X1,X2,X3)) >= a__f(X1,X2,X3)
constraint: Marked_mark(g(X)) >= Marked_mark(X)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__f(X,g(X),Y) >= a__f(Y,Y,Y) ;
  a__f(X1,X2,X3) >= f(X1,X2,X3) ;
  a__g(b) >= c ;
  a__g(X) >= g(X) ;
  a__b >= c ;
  a__b >= b ;
  mark(g(X)) >= a__g(mark(X)) ;
  mark(c) >= c ;
  mark(b) >= a__b ;
  mark(f(X1,X2,X3)) >= a__f(X1,X2,X3) ;
  Marked_a__f(X,g(X),Y) >= Marked_a__f(Y,Y,Y) ;
 }
 + Disjunctions:{ 
{
  Marked_a__f(X,g(X),Y) > Marked_a__f(Y,Y,Y) ;
 }
 } 
=== 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 : 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.136616 seconds (real time)
Cime Exit Status: 0