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

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


Sub problem: 
guided: 

DP termination of:
<Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))>
<Marked_a__f(a,b,X) , Marked_mark(X)>
<Marked_a__f(a,b,X) , Marked_mark(X)>
<Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))>
<Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)>
<Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)>
<Marked_mark(c) , Marked_a__c>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)> 
      --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)>
  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)>
  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))>
  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)>
  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)>
  <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))>
  <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))> 
     --> <Marked_a__f(a,b,X) , Marked_mark(X)>
  <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))> 
     --> <Marked_a__f(a,b,X) , Marked_mark(X)>
  <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))> 
     --> <Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X3)>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_mark(X1)>
  <Marked_a__f(a,b,X) , Marked_mark(X)> 
     --> <Marked_mark(f(X1,X2,X3)) , Marked_a__f(mark(X1),X2,mark(X3))>
  <Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))> 
     --> <Marked_a__f(a,b,X) , Marked_mark(X)>
  <Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))> 
     --> <Marked_a__f(a,b,X) , Marked_mark(X)>
  <Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))> 
     --> <Marked_a__f(a,b,X) , Marked_a__f(mark(X),X,mark(X))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  a__f(a,b,X) >= a__f(mark(X),X,mark(X)) ;
  a__f(X1,X2,X3) >= f(X1,X2,X3) ;
  mark(a) >= a ;
  mark(b) >= b ;
  mark(f(X1,X2,X3)) >= a__f(mark(X1),X2,mark(X3)) ;
  mark(c) >= a__c ;
  a__c >= a ;
  a__c >= b ;
  a__c >= c ;
  Marked_a__f(a,b,X) >= Marked_a__f(mark(X),X,mark(X)) ;
  Marked_a__f(a,b,X) >= Marked_mark(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_a__f(mark(X1),X2,mark(X3)) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_mark(X1) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_mark(X3) ;
 }
 + Disjunctions:{ 
{
  Marked_a__f(a,b,X) > Marked_a__f(mark(X),X,mark(X)) ;
 }
{
  Marked_a__f(a,b,X) > Marked_mark(X) ;
 }
{
  Marked_mark(f(X1,X2,X3)) > Marked_a__f(mark(X1),X2,mark(X3)) ;
 }
{
  Marked_mark(f(X1,X2,X3)) > Marked_mark(X1) ;
 }
{
  Marked_mark(f(X1,X2,X3)) > Marked_mark(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 : 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:
{
  a__f(a,b,X) >= a__f(mark(X),X,mark(X)) ;
  a__f(X1,X2,X3) >= f(X1,X2,X3) ;
  mark(a) >= a ;
  mark(b) >= b ;
  mark(f(X1,X2,X3)) >= a__f(mark(X1),X2,mark(X3)) ;
  mark(c) >= a__c ;
  a__c >= a ;
  a__c >= b ;
  a__c >= c ;
  Marked_a__f(a,b,X) > Marked_a__f(mark(X),X,mark(X)) ;
  Marked_a__f(a,b,X) > Marked_mark(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_a__f(mark(X1),X2,mark(X3)) ;
  Marked_mark(f(X1,X2,X3)) > Marked_mark(X1) ;
  Marked_mark(f(X1,X2,X3)) > Marked_mark(X3) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  a__f(a,b,X) >= a__f(mark(X),X,mark(X)) ;
  a__f(X1,X2,X3) >= f(X1,X2,X3) ;
  mark(a) >= a ;
  mark(b) >= b ;
  mark(f(X1,X2,X3)) >= a__f(mark(X1),X2,mark(X3)) ;
  mark(c) >= a__c ;
  a__c >= a ;
  a__c >= b ;
  a__c >= c ;
  Marked_a__f(a,b,X) > Marked_a__f(mark(X),X,mark(X)) ;
  Marked_a__f(a,b,X) > Marked_mark(X) ;
  Marked_mark(f(X1,X2,X3)) >= Marked_a__f(mark(X1),X2,mark(X3)) ;
  Marked_mark(f(X1,X2,X3)) > Marked_mark(X1) ;
  Marked_mark(f(X1,X2,X3)) > Marked_mark(X3) ;
 }
 + 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.(298 bt (153) [180])
=== 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.752341 seconds (real time)
Cime Exit Status: 0