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

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


Sub problem: 
guided: 

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

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

{  <Marked_p(a(x0),p(x1,p(x2,x3))) , Marked_p(x1,p(x0,p(a(x3),x3)))> 
      --> <Marked_p(a(x0),p(x1,p(x2,x3))) , Marked_p(x1,p(x0,p(a(x3),x3)))>
}
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  p(a(x0),p(x1,p(x2,x3))) >= p(x1,p(x0,p(a(x3),x3))) ;
  Marked_p(a(x0),p(x1,p(x2,x3))) >= Marked_p(x1,p(x0,p(a(x3),x3))) ;
 }
 + Disjunctions:{ 
{
  Marked_p(a(x0),p(x1,p(x2,x3))) > Marked_p(x1,p(x0,p(a(x3),x3))) ;
 }
 } 
=== 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.668556 seconds (real time)
Cime Exit Status: 0