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

TRS termination of:
[1] p(a(x0),p(a(a(a(x1))),x2)) -> p(a(x2),p(a(a(b(x0))),x2))


Sub problem: 
guided: 

DP termination of:
<Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))>
<Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(a(b(x0))),x2)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(a(b(x0))),x2)> 
      --> <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(a(b(x0))),x2)>
  <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(a(b(x0))),x2)> 
     --> <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))>
  <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))> 
     --> <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(a(b(x0))),x2)>
  <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))> 
     --> <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  p(a(x0),p(a(a(a(x1))),x2)) >= p(a(x2),p(a(a(b(x0))),x2)) ;
  Marked_p(a(x0),p(a(a(a(x1))),x2)) >= Marked_p(a(a(b(x0))),x2) ;
  Marked_p(a(x0),p(a(a(a(x1))),x2)) >= Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }
 + Disjunctions:{ 
{
  Marked_p(a(x0),p(a(a(a(x1))),x2)) > Marked_p(a(a(b(x0))),x2) ;
 }
{
  Marked_p(a(x0),p(a(a(a(x1))),x2)) > Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }
 } 
=== 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: p(a(x0),p(a(a(a(x1))),x2)) >= p(a(x2),p(a(a(b(x0))),x2))
constraint: Marked_p(a(x0),p(a(a(a(x1))),x2)) >= Marked_p(a(a(b(x0))),x2)
constraint: Marked_p(a(x0),p(a(a(a(x1))),x2)) >= Marked_p(a(x2),
                                                  p(a(a(b(x0))),x2))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),p(a(a(b(x0))),x2))> 
      --> <Marked_p(a(x0),p(a(a(a(x1))),x2)) , Marked_p(a(x2),
                                                p(a(a(b(x0))),x2))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  p(a(x0),p(a(a(a(x1))),x2)) >= p(a(x2),p(a(a(b(x0))),x2)) ;
  Marked_p(a(x0),p(a(a(a(x1))),x2)) >= Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }
 + Disjunctions:{ 
{
  Marked_p(a(x0),p(a(a(a(x1))),x2)) > Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }
 } 
=== 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:
{
  p(a(x0),p(a(a(a(x1))),x2)) >= p(a(x2),p(a(a(b(x0))),x2)) ;
  Marked_p(a(x0),p(a(a(a(x1))),x2)) > Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  p(a(x0),p(a(a(a(x1))),x2)) >= p(a(x2),p(a(a(b(x0))),x2)) ;
  Marked_p(a(x0),p(a(a(a(x1))),x2)) > Marked_p(a(x2),p(a(a(b(x0))),x2)) ;
 }
 + 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.(52 bt (30) [33])
=== 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 10.766032 seconds (real time)
Cime Exit Status: 0