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

TRS termination of:
[1] a(b(x)) -> b(a(a(x)))
[2] b(c(x)) -> c(b(b(x)))
[3] c(a(x)) -> a(c(c(x)))
[4] u(a(x)) -> x
[5] v(b(x)) -> x
[6] w(c(x)) -> x
[7] a(u(x)) -> x
[8] b(v(x)) -> x
[9] c(w(x)) -> x


Sub problem: 
guided: 

DP termination of:
<Marked_a(b(x)) , Marked_b(a(a(x)))>
<Marked_a(b(x)) , Marked_a(a(x))>
<Marked_a(b(x)) , Marked_a(x)>
<Marked_b(c(x)) , Marked_c(b(b(x)))>
<Marked_b(c(x)) , Marked_b(b(x))>
<Marked_b(c(x)) , Marked_b(x)>
<Marked_c(a(x)) , Marked_a(c(c(x)))>
<Marked_c(a(x)) , Marked_c(c(x))>
<Marked_c(a(x)) , Marked_c(x)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_c(a(x)) , Marked_c(x)> --> <Marked_c(a(x)) , Marked_c(x)>
  <Marked_c(a(x)) , Marked_c(x)> --> <Marked_c(a(x)) , Marked_c(c(x))>
  <Marked_c(a(x)) , Marked_c(x)> --> <Marked_c(a(x)) , Marked_a(c(c(x)))>
  <Marked_c(a(x)) , Marked_c(c(x))> --> <Marked_c(a(x)) , Marked_c(x)>
  <Marked_c(a(x)) , Marked_c(c(x))> --> <Marked_c(a(x)) , Marked_c(c(x))>
  <Marked_c(a(x)) , Marked_c(c(x))> --> <Marked_c(a(x)) , Marked_a(c(c(x)))>
  <Marked_c(a(x)) , Marked_a(c(c(x)))> --> <Marked_a(b(x)) , Marked_a(x)>
  <Marked_c(a(x)) , Marked_a(c(c(x)))> --> <Marked_a(b(x)) , Marked_a(a(x))>
  <Marked_c(a(x)) , Marked_a(c(c(x)))> --> <Marked_a(b(x)) , Marked_b(a(a(x)))>
  <Marked_b(c(x)) , Marked_b(x)> --> <Marked_b(c(x)) , Marked_b(x)>
  <Marked_b(c(x)) , Marked_b(x)> --> <Marked_b(c(x)) , Marked_b(b(x))>
  <Marked_b(c(x)) , Marked_b(x)> --> <Marked_b(c(x)) , Marked_c(b(b(x)))>
  <Marked_b(c(x)) , Marked_b(b(x))> --> <Marked_b(c(x)) , Marked_b(x)>
  <Marked_b(c(x)) , Marked_b(b(x))> --> <Marked_b(c(x)) , Marked_b(b(x))>
  <Marked_b(c(x)) , Marked_b(b(x))> --> <Marked_b(c(x)) , Marked_c(b(b(x)))>
  <Marked_b(c(x)) , Marked_c(b(b(x)))> --> <Marked_c(a(x)) , Marked_c(x)>
  <Marked_b(c(x)) , Marked_c(b(b(x)))> --> <Marked_c(a(x)) , Marked_c(c(x))>
  <Marked_b(c(x)) , Marked_c(b(b(x)))> --> <Marked_c(a(x)) , Marked_a(c(c(x)))>
  <Marked_a(b(x)) , Marked_a(x)> --> <Marked_a(b(x)) , Marked_a(x)>
  <Marked_a(b(x)) , Marked_a(x)> --> <Marked_a(b(x)) , Marked_a(a(x))>
  <Marked_a(b(x)) , Marked_a(x)> --> <Marked_a(b(x)) , Marked_b(a(a(x)))>
  <Marked_a(b(x)) , Marked_a(a(x))> --> <Marked_a(b(x)) , Marked_a(x)>
  <Marked_a(b(x)) , Marked_a(a(x))> --> <Marked_a(b(x)) , Marked_a(a(x))>
  <Marked_a(b(x)) , Marked_a(a(x))> --> <Marked_a(b(x)) , Marked_b(a(a(x)))>
  <Marked_a(b(x)) , Marked_b(a(a(x)))> --> <Marked_b(c(x)) , Marked_b(x)>
  <Marked_a(b(x)) , Marked_b(a(a(x)))> --> <Marked_b(c(x)) , Marked_b(b(x))>
  <Marked_a(b(x)) , Marked_b(a(a(x)))> --> <Marked_b(c(x)) , Marked_c(b(b(x)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  b(c(x)) >= c(b(b(x))) ;
  b(v(x)) >= x ;
  a(b(x)) >= b(a(a(x))) ;
  a(u(x)) >= x ;
  c(a(x)) >= a(c(c(x))) ;
  c(w(x)) >= x ;
  u(a(x)) >= x ;
  v(b(x)) >= x ;
  w(c(x)) >= x ;
  Marked_c(a(x)) >= Marked_c(c(x)) ;
  Marked_c(a(x)) >= Marked_c(x) ;
  Marked_c(a(x)) >= Marked_a(c(c(x))) ;
  Marked_b(c(x)) >= Marked_c(b(b(x))) ;
  Marked_b(c(x)) >= Marked_b(b(x)) ;
  Marked_b(c(x)) >= Marked_b(x) ;
  Marked_a(b(x)) >= Marked_b(a(a(x))) ;
  Marked_a(b(x)) >= Marked_a(a(x)) ;
  Marked_a(b(x)) >= Marked_a(x) ;
 }
 + Disjunctions:{ 
{
  Marked_c(a(x)) > Marked_c(c(x)) ;
 }
{
  Marked_c(a(x)) > Marked_c(x) ;
 }
{
  Marked_c(a(x)) > Marked_a(c(c(x))) ;
 }
{
  Marked_b(c(x)) > Marked_c(b(b(x))) ;
 }
{
  Marked_b(c(x)) > Marked_b(b(x)) ;
 }
{
  Marked_b(c(x)) > Marked_b(x) ;
 }
{
  Marked_a(b(x)) > Marked_b(a(a(x))) ;
 }
{
  Marked_a(b(x)) > Marked_a(a(x)) ;
 }
{
  Marked_a(b(x)) > Marked_a(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 : 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 : 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 (Simple graph)
Found the following constraints:
{
  b(c(x)) >= c(b(b(x))) ;
  b(v(x)) >= x ;
  a(b(x)) >= b(a(a(x))) ;
  a(u(x)) >= x ;
  c(a(x)) >= a(c(c(x))) ;
  c(w(x)) >= x ;
  u(a(x)) >= x ;
  v(b(x)) >= x ;
  w(c(x)) >= x ;
  Marked_c(a(x)) > Marked_c(c(x)) ;
  Marked_c(a(x)) > Marked_c(x) ;
  Marked_c(a(x)) >= Marked_a(c(c(x))) ;
  Marked_b(c(x)) > Marked_c(b(b(x))) ;
  Marked_b(c(x)) > Marked_b(b(x)) ;
  Marked_b(c(x)) > Marked_b(x) ;
  Marked_a(b(x)) >= Marked_b(a(a(x))) ;
  Marked_a(b(x)) > Marked_a(a(x)) ;
  Marked_a(b(x)) > Marked_a(x) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  b(c(x)) >= c(b(b(x))) ;
  b(v(x)) >= x ;
  a(b(x)) >= b(a(a(x))) ;
  a(u(x)) >= x ;
  c(a(x)) >= a(c(c(x))) ;
  c(w(x)) >= x ;
  u(a(x)) >= x ;
  v(b(x)) >= x ;
  w(c(x)) >= x ;
  Marked_c(a(x)) > Marked_c(c(x)) ;
  Marked_c(a(x)) > Marked_c(x) ;
  Marked_c(a(x)) >= Marked_a(c(c(x))) ;
  Marked_b(c(x)) > Marked_c(b(b(x))) ;
  Marked_b(c(x)) > Marked_b(b(x)) ;
  Marked_b(c(x)) > Marked_b(x) ;
  Marked_a(b(x)) >= Marked_b(a(a(x))) ;
  Marked_a(b(x)) > Marked_a(a(x)) ;
  Marked_a(b(x)) > Marked_a(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.(28 bt (35) [18])
=== 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.521769 seconds (real time)
Cime Exit Status: 0