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

TRS termination of:
[1] active(f(x)) -> mark(f(f(x)))
[2] chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)))
[3] mat(f(x),f(y)) -> f(mat(x,y))
[4] chk(no(c)) -> active(c)
[5] mat(f(x),c) -> no(c)
[6] f(active(x)) -> active(f(x))
[7] f(no(x)) -> no(f(x))
[8] f(mark(x)) -> mark(f(x))
[9] tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)))


Sub problem: 
guided: 

DP termination of:
<Marked_active(f(x)) , Marked_f(f(x))>
<Marked_chk(no(f(x))) , Marked_f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)))>
<Marked_chk(no(f(x))) , Marked_chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))>
<Marked_chk(no(f(x))) , Marked_mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(f(f(f(f(f(X))))))))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(f(f(f(f(X)))))))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(f(f(f(X))))))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(f(f(X)))))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(f(X))))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(f(X)))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(f(X))))>
<Marked_chk(no(f(x))) , Marked_f(f(f(X)))>
<Marked_chk(no(f(x))) , Marked_f(f(X))>
<Marked_chk(no(f(x))) , Marked_f(X)>
<Marked_mat(f(x),f(y)) , Marked_f(mat(x,y))>
<Marked_mat(f(x),f(y)) , Marked_mat(x,y)>
<Marked_chk(no(c)) , Marked_active(c)>
<Marked_f(active(x)) , Marked_active(f(x))>
<Marked_f(active(x)) , Marked_f(x)>
<Marked_f(no(x)) , Marked_f(x)>
<Marked_f(mark(x)) , Marked_f(x)>
<Marked_tp(mark(x)) , Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)))>
<Marked_tp(mark(x)) , Marked_chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))>
<Marked_tp(mark(x)) , Marked_mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(f(f(f(f(f(X))))))))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(f(f(f(f(X)))))))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(f(f(f(X))))))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(f(f(X)))))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(f(X))))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(f(X)))))>
<Marked_tp(mark(x)) , Marked_f(f(f(f(X))))>
<Marked_tp(mark(x)) , Marked_f(f(f(X)))>
<Marked_tp(mark(x)) , Marked_f(f(X))>
<Marked_tp(mark(x)) , Marked_f(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 3 components:

{  <Marked_tp(mark(x)) , Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x)))> 
      --> <Marked_tp(mark(x)) , Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X))))))))))
                                                   ,x)))>
}

{  <Marked_chk(no(f(x))) , Marked_chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))> 
      --> <Marked_chk(no(f(x))) , Marked_chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),
                                              x))>
}

{  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(no(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> --> <Marked_f(active(x)) , Marked_f(x)>
  <Marked_f(mark(x)) , Marked_f(x)> 
     --> <Marked_f(active(x)) , Marked_active(f(x))>
  <Marked_f(no(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(no(x)) , Marked_f(x)> --> <Marked_f(no(x)) , Marked_f(x)>
  <Marked_f(no(x)) , Marked_f(x)> --> <Marked_f(active(x)) , Marked_f(x)>
  <Marked_f(no(x)) , Marked_f(x)> 
     --> <Marked_f(active(x)) , Marked_active(f(x))>
  <Marked_f(active(x)) , Marked_f(x)> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_f(active(x)) , Marked_f(x)> --> <Marked_f(no(x)) , Marked_f(x)>
  <Marked_f(active(x)) , Marked_f(x)> --> <Marked_f(active(x)) , Marked_f(x)>
  <Marked_f(active(x)) , Marked_f(x)> 
     --> <Marked_f(active(x)) , Marked_active(f(x))>
  <Marked_f(active(x)) , Marked_active(f(x))> 
     --> <Marked_active(f(x)) , Marked_f(f(x))>
  <Marked_active(f(x)) , Marked_f(f(x))> --> <Marked_f(mark(x)) , Marked_f(x)>
  <Marked_active(f(x)) , Marked_f(f(x))> --> <Marked_f(no(x)) , Marked_f(x)>
  <Marked_active(f(x)) , Marked_f(f(x))> 
     --> <Marked_f(active(x)) , Marked_f(x)>
  <Marked_active(f(x)) , Marked_f(f(x))> 
     --> <Marked_f(active(x)) , Marked_active(f(x))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  f(mark(x)) >= mark(f(x)) ;
  f(active(x)) >= active(f(x)) ;
  f(no(x)) >= no(f(x)) ;
  active(f(x)) >= mark(f(f(x))) ;
  chk(no(f(x))) >= f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  chk(no(c)) >= active(c) ;
  mat(f(x),f(y)) >= f(mat(x,y)) ;
  mat(f(x),c) >= no(c) ;
  tp(mark(x)) >= tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  Marked_tp(mark(x)) >= Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
 }
 + Disjunctions:{ 
{
  Marked_tp(mark(x)) > Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),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
=== STOPING TIMER virtual ===
No solution found for these parameters.
No solution found for these constraints.
APPLY CRITERIA (Simple graph)
Found the following constraints:
{
  f(mark(x)) >= mark(f(x)) ;
  f(active(x)) >= active(f(x)) ;
  f(no(x)) >= no(f(x)) ;
  active(f(x)) >= mark(f(f(x))) ;
  chk(no(f(x))) >= f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  chk(no(c)) >= active(c) ;
  mat(f(x),f(y)) >= f(mat(x,y)) ;
  mat(f(x),c) >= no(c) ;
  tp(mark(x)) >= tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  Marked_tp(mark(x)) > Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
 }

APPLY CRITERIA (SOLVE_ORD)
Trying to solve the following constraints:
{
  f(mark(x)) >= mark(f(x)) ;
  f(active(x)) >= active(f(x)) ;
  f(no(x)) >= no(f(x)) ;
  active(f(x)) >= mark(f(f(x))) ;
  chk(no(f(x))) >= f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  chk(no(c)) >= active(c) ;
  mat(f(x),f(y)) >= f(mat(x,y)) ;
  mat(f(x),c) >= no(c) ;
  tp(mark(x)) >= tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),x))) ;
  Marked_tp(mark(x)) > Marked_tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))),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.(1397 bt (1304) [87])
=== 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
=== 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 116.142792 seconds (real time)
Cime Exit Status: 0