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

TRS termination of:
[1] h(z,e(x)) -> h(c(z),d(z,x))
[2] d(z,g(0,0)) -> e(0)
[3] d(z,g(x,y)) -> g(e(x),d(z,y))
[4] d(c(z),g(g(x,y),0)) -> g(d(c(z),g(x,y)),d(z,g(x,y)))
[5] g(e(x),e(y)) -> e(g(x,y))


Sub problem: 
guided: 

DP termination of:
<Marked_h(z,e(x)) , Marked_h(c(z),d(z,x))>
<Marked_h(z,e(x)) , Marked_d(z,x)>
<Marked_d(z,g(x,y)) , Marked_g(e(x),d(z,y))>
<Marked_d(z,g(x,y)) , Marked_d(z,y)>
<Marked_d(c(z),g(g(x,y),0)) , Marked_g(d(c(z),g(x,y)),d(z,g(x,y)))>
<Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))>
<Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))>
<Marked_g(e(x),e(y)) , Marked_g(x,y)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_h(z,e(x)) , Marked_h(c(z),d(z,x))> 
      --> <Marked_h(z,e(x)) , Marked_h(c(z),d(z,x))>
}

{  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))> 
      --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))>
  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))> 
     --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))>
  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))> 
     --> <Marked_d(z,g(x,y)) , Marked_d(z,y)>
  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))> 
     --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))>
  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))> 
     --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))>
  <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))> 
     --> <Marked_d(z,g(x,y)) , Marked_d(z,y)>
  <Marked_d(z,g(x,y)) , Marked_d(z,y)> 
     --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(z,g(x,y))>
  <Marked_d(z,g(x,y)) , Marked_d(z,y)> 
     --> <Marked_d(c(z),g(g(x,y),0)) , Marked_d(c(z),g(x,y))>
  <Marked_d(z,g(x,y)) , Marked_d(z,y)> --> <Marked_d(z,g(x,y)) , Marked_d(z,y)>
}

{  <Marked_g(e(x),e(y)) , Marked_g(x,y)> 
      --> <Marked_g(e(x),e(y)) , Marked_g(x,y)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  h(z,e(x)) >= h(c(z),d(z,x)) ;
  d(c(z),g(g(x,y),0)) >= g(d(c(z),g(x,y)),d(z,g(x,y))) ;
  d(z,g(0,0)) >= e(0) ;
  d(z,g(x,y)) >= g(e(x),d(z,y)) ;
  g(e(x),e(y)) >= e(g(x,y)) ;
  Marked_h(z,e(x)) >= Marked_h(c(z),d(z,x)) ;
 }
 + Disjunctions:{ 
{
  Marked_h(z,e(x)) > Marked_h(c(z),d(z,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 : 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 (Simple graph)
Found the following constraints:
{
  h(z,e(x)) >= h(c(z),d(z,x)) ;
  d(c(z),g(g(x,y),0)) >= g(d(c(z),g(x,y)),d(z,g(x,y))) ;
  d(z,g(0,0)) >= e(0) ;
  d(z,g(x,y)) >= g(e(x),d(z,y)) ;
  g(e(x),e(y)) >= e(g(x,y)) ;
  Marked_h(z,e(x)) > Marked_h(c(z),d(z,x)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  h(z,e(x)) >= h(c(z),d(z,x)) ;
  d(c(z),g(g(x,y),0)) >= g(d(c(z),g(x,y)),d(z,g(x,y))) ;
  d(z,g(0,0)) >= e(0) ;
  d(z,g(x,y)) >= g(e(x),d(z,y)) ;
  g(e(x),e(y)) >= e(g(x,y)) ;
  Marked_h(z,e(x)) > Marked_h(c(z),d(z,x)) ;
 }
 + Disjunctions:{ 
 } 
=== 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 ===
No solution found for these parameters.(370 bt (394) [56])
=== 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 28.431784 seconds (real time)
Cime Exit Status: 0