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

TRS termination of:
[1] active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
[2] active(__(X,nil)) -> mark(X)
[3] active(__(nil,X)) -> mark(X)
[4] active(U11(tt)) -> mark(U12(tt))
[5] active(U12(tt)) -> mark(tt)
[6] active(isNePal(__(I,__(P,I)))) -> mark(U11(tt))
[7] mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
[8] mark(nil) -> active(nil)
[9] mark(U11(X)) -> active(U11(mark(X)))
[10] mark(tt) -> active(tt)
[11] mark(U12(X)) -> active(U12(mark(X)))
[12] mark(isNePal(X)) -> active(isNePal(mark(X)))
[13] __(mark(X1),X2) -> __(X1,X2)
[14] __(X1,mark(X2)) -> __(X1,X2)
[15] __(active(X1),X2) -> __(X1,X2)
[16] __(X1,active(X2)) -> __(X1,X2)
[17] U11(mark(X)) -> U11(X)
[18] U11(active(X)) -> U11(X)
[19] U12(mark(X)) -> U12(X)
[20] U12(active(X)) -> U12(X)
[21] isNePal(mark(X)) -> isNePal(X)
[22] isNePal(active(X)) -> isNePal(X)


Sub problem: 
guided: 

DP termination of:
<Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(__(X,nil)) , Marked_mark(X)>
<Marked_active(__(nil,X)) , Marked_mark(X)>
<Marked_active(U11(tt)) , Marked_mark(U12(tt))>
<Marked_active(U11(tt)) , Marked_U12(tt)>
<Marked_active(U12(tt)) , Marked_mark(tt)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_U11(tt)>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(__(X1,X2)) , Marked___(mark(X1),mark(X2))>
<Marked_mark(__(X1,X2)) , Marked_mark(X1)>
<Marked_mark(__(X1,X2)) , Marked_mark(X2)>
<Marked_mark(nil) , Marked_active(nil)>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(U11(X)) , Marked_U11(mark(X))>
<Marked_mark(U11(X)) , Marked_mark(X)>
<Marked_mark(tt) , Marked_active(tt)>
<Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
<Marked_mark(U12(X)) , Marked_U12(mark(X))>
<Marked_mark(U12(X)) , Marked_mark(X)>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_isNePal(mark(X))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked___(active(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,active(X2)) , Marked___(X1,X2)>
<Marked_U11(mark(X)) , Marked_U11(X)>
<Marked_U11(active(X)) , Marked_U11(X)>
<Marked_U12(mark(X)) , Marked_U12(X)>
<Marked_U12(active(X)) , Marked_U12(X)>
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_isNePal(active(X)) , Marked_isNePal(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 5 components:

{  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
      --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
}

{  <Marked___(X1,active(X2)) , Marked___(X1,X2)> 
      --> <Marked___(X1,active(X2)) , Marked___(X1,X2)>
  <Marked___(X1,active(X2)) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
  <Marked___(X1,active(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(X1,active(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(X1,active(X2)) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,active(X2)) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(X1,active(X2)) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
}

{  <Marked_U11(active(X)) , Marked_U11(X)> 
      --> <Marked_U11(active(X)) , Marked_U11(X)>
  <Marked_U11(active(X)) , Marked_U11(X)> 
     --> <Marked_U11(mark(X)) , Marked_U11(X)>
  <Marked_U11(mark(X)) , Marked_U11(X)> 
     --> <Marked_U11(active(X)) , Marked_U11(X)>
  <Marked_U11(mark(X)) , Marked_U11(X)> 
     --> <Marked_U11(mark(X)) , Marked_U11(X)>
}

{  <Marked_U12(active(X)) , Marked_U12(X)> 
      --> <Marked_U12(active(X)) , Marked_U12(X)>
  <Marked_U12(active(X)) , Marked_U12(X)> 
     --> <Marked_U12(mark(X)) , Marked_U12(X)>
  <Marked_U12(mark(X)) , Marked_U12(X)> 
     --> <Marked_U12(active(X)) , Marked_U12(X)>
  <Marked_U12(mark(X)) , Marked_U12(X)> 
     --> <Marked_U12(mark(X)) , Marked_U12(X)>
}

{  <Marked_isNePal(active(X)) , Marked_isNePal(X)> 
      --> <Marked_isNePal(active(X)) , Marked_isNePal(X)>
  <Marked_isNePal(active(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(mark(X)) , Marked_isNePal(X)>
  <Marked_isNePal(mark(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(active(X)) , Marked_isNePal(X)>
  <Marked_isNePal(mark(X)) , Marked_isNePal(X)> 
     --> <Marked_isNePal(mark(X)) , Marked_isNePal(X)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(__(X1,X2)) >= active(__(mark(X1),mark(X2))) ;
  mark(nil) >= active(nil) ;
  mark(U12(X)) >= active(U12(mark(X))) ;
  mark(tt) >= active(tt) ;
  mark(U11(X)) >= active(U11(mark(X))) ;
  mark(isNePal(X)) >= active(isNePal(mark(X))) ;
  __(mark(X1),X2) >= __(X1,X2) ;
  __(active(X1),X2) >= __(X1,X2) ;
  __(X1,mark(X2)) >= __(X1,X2) ;
  __(X1,active(X2)) >= __(X1,X2) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(U12(tt)) >= mark(tt) ;
  active(U11(tt)) >= mark(U12(tt)) ;
  active(isNePal(__(I,__(P,I)))) >= mark(U11(tt)) ;
  U12(mark(X)) >= U12(X) ;
  U12(active(X)) >= U12(X) ;
  U11(mark(X)) >= U11(X) ;
  U11(active(X)) >= U11(X) ;
  isNePal(mark(X)) >= isNePal(X) ;
  isNePal(active(X)) >= isNePal(X) ;
  Marked_mark(__(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(__(X1,X2)) >= Marked_mark(X2) ;
  Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2))) ;
  Marked_mark(U12(X)) >= Marked_mark(X) ;
  Marked_mark(U12(X)) >= Marked_active(U12(mark(X))) ;
  Marked_mark(U11(X)) >= Marked_mark(X) ;
  Marked_mark(U11(X)) >= Marked_active(U11(mark(X))) ;
  Marked_mark(isNePal(X)) >= Marked_mark(X) ;
  Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X))) ;
  Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z))) ;
  Marked_active(__(nil,X)) >= Marked_mark(X) ;
  Marked_active(__(X,nil)) >= Marked_mark(X) ;
  Marked_active(U11(tt)) >= Marked_mark(U12(tt)) ;
  Marked_active(isNePal(__(I,__(P,I)))) >= Marked_mark(U11(tt)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(__(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(__(X1,X2)) > Marked_mark(X2) ;
 }
{
  Marked_mark(__(X1,X2)) > Marked_active(__(mark(X1),mark(X2))) ;
 }
{
  Marked_mark(U12(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U12(X)) > Marked_active(U12(mark(X))) ;
 }
{
  Marked_mark(U11(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U11(X)) > Marked_active(U11(mark(X))) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_active(isNePal(mark(X))) ;
 }
{
  Marked_active(__(__(X,Y),Z)) > Marked_mark(__(X,__(Y,Z))) ;
 }
{
  Marked_active(__(nil,X)) > Marked_mark(X) ;
 }
{
  Marked_active(__(X,nil)) > Marked_mark(X) ;
 }
{
  Marked_active(U11(tt)) > Marked_mark(U12(tt)) ;
 }
{
  Marked_active(isNePal(__(I,__(P,I)))) > Marked_mark(U11(tt)) ;
 }
 } 
=== 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: mark(__(X1,X2)) >= active(__(mark(X1),mark(X2)))
constraint: mark(nil) >= active(nil)
constraint: mark(U12(X)) >= active(U12(mark(X)))
constraint: mark(tt) >= active(tt)
constraint: mark(U11(X)) >= active(U11(mark(X)))
constraint: mark(isNePal(X)) >= active(isNePal(mark(X)))
constraint: __(mark(X1),X2) >= __(X1,X2)
constraint: __(active(X1),X2) >= __(X1,X2)
constraint: __(X1,mark(X2)) >= __(X1,X2)
constraint: __(X1,active(X2)) >= __(X1,X2)
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(U12(tt)) >= mark(tt)
constraint: active(U11(tt)) >= mark(U12(tt))
constraint: active(isNePal(__(I,__(P,I)))) >= mark(U11(tt))
constraint: U12(mark(X)) >= U12(X)
constraint: U12(active(X)) >= U12(X)
constraint: U11(mark(X)) >= U11(X)
constraint: U11(active(X)) >= U11(X)
constraint: isNePal(mark(X)) >= isNePal(X)
constraint: isNePal(active(X)) >= isNePal(X)
constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X2)
constraint: Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2)))
constraint: Marked_mark(U12(X)) >= Marked_mark(X)
constraint: Marked_mark(U12(X)) >= Marked_active(U12(mark(X)))
constraint: Marked_mark(U11(X)) >= Marked_mark(X)
constraint: Marked_mark(U11(X)) >= Marked_active(U11(mark(X)))
constraint: Marked_mark(isNePal(X)) >= Marked_mark(X)
constraint: Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X)))
constraint: Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z)))
constraint: Marked_active(__(nil,X)) >= Marked_mark(X)
constraint: Marked_active(__(X,nil)) >= Marked_mark(X)
constraint: Marked_active(U11(tt)) >= Marked_mark(U12(tt))
constraint: Marked_active(isNePal(__(I,__(P,I)))) >= Marked_mark(U11(tt))
APPLY CRITERIA (Subterm criterion)

ST: Marked___ -> 2

APPLY CRITERIA (Subterm criterion)

ST: Marked_U11 -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_U12 -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isNePal -> 1

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
      --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U12(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(U11(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X2)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_mark(__(X1,X2)) , Marked_mark(X1)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(U11(tt)) , Marked_mark(U12(tt))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(nil,X)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(X,nil)) , Marked_mark(X)>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(U11(tt)) , Marked_mark(U12(tt))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(nil,X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(X,nil)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U12(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U11(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X2)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_mark(X1)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(__(X1,X2)) >= active(__(mark(X1),mark(X2))) ;
  mark(nil) >= active(nil) ;
  mark(U12(X)) >= active(U12(mark(X))) ;
  mark(tt) >= active(tt) ;
  mark(U11(X)) >= active(U11(mark(X))) ;
  mark(isNePal(X)) >= active(isNePal(mark(X))) ;
  __(mark(X1),X2) >= __(X1,X2) ;
  __(active(X1),X2) >= __(X1,X2) ;
  __(X1,mark(X2)) >= __(X1,X2) ;
  __(X1,active(X2)) >= __(X1,X2) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(U12(tt)) >= mark(tt) ;
  active(U11(tt)) >= mark(U12(tt)) ;
  active(isNePal(__(I,__(P,I)))) >= mark(U11(tt)) ;
  U12(mark(X)) >= U12(X) ;
  U12(active(X)) >= U12(X) ;
  U11(mark(X)) >= U11(X) ;
  U11(active(X)) >= U11(X) ;
  isNePal(mark(X)) >= isNePal(X) ;
  isNePal(active(X)) >= isNePal(X) ;
  Marked_mark(__(X1,X2)) >= Marked_mark(X1) ;
  Marked_mark(__(X1,X2)) >= Marked_mark(X2) ;
  Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2))) ;
  Marked_mark(U12(X)) >= Marked_mark(X) ;
  Marked_mark(U11(X)) >= Marked_mark(X) ;
  Marked_mark(U11(X)) >= Marked_active(U11(mark(X))) ;
  Marked_mark(isNePal(X)) >= Marked_mark(X) ;
  Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X))) ;
  Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z))) ;
  Marked_active(__(nil,X)) >= Marked_mark(X) ;
  Marked_active(__(X,nil)) >= Marked_mark(X) ;
  Marked_active(U11(tt)) >= Marked_mark(U12(tt)) ;
  Marked_active(isNePal(__(I,__(P,I)))) >= Marked_mark(U11(tt)) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(__(X1,X2)) > Marked_mark(X1) ;
 }
{
  Marked_mark(__(X1,X2)) > Marked_mark(X2) ;
 }
{
  Marked_mark(__(X1,X2)) > Marked_active(__(mark(X1),mark(X2))) ;
 }
{
  Marked_mark(U12(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U11(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(U11(X)) > Marked_active(U11(mark(X))) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_active(isNePal(mark(X))) ;
 }
{
  Marked_active(__(__(X,Y),Z)) > Marked_mark(__(X,__(Y,Z))) ;
 }
{
  Marked_active(__(nil,X)) > Marked_mark(X) ;
 }
{
  Marked_active(__(X,nil)) > Marked_mark(X) ;
 }
{
  Marked_active(U11(tt)) > Marked_mark(U12(tt)) ;
 }
{
  Marked_active(isNePal(__(I,__(P,I)))) > Marked_mark(U11(tt)) ;
 }
 } 
=== 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: mark(__(X1,X2)) >= active(__(mark(X1),mark(X2)))
constraint: mark(nil) >= active(nil)
constraint: mark(U12(X)) >= active(U12(mark(X)))
constraint: mark(tt) >= active(tt)
constraint: mark(U11(X)) >= active(U11(mark(X)))
constraint: mark(isNePal(X)) >= active(isNePal(mark(X)))
constraint: __(mark(X1),X2) >= __(X1,X2)
constraint: __(active(X1),X2) >= __(X1,X2)
constraint: __(X1,mark(X2)) >= __(X1,X2)
constraint: __(X1,active(X2)) >= __(X1,X2)
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(U12(tt)) >= mark(tt)
constraint: active(U11(tt)) >= mark(U12(tt))
constraint: active(isNePal(__(I,__(P,I)))) >= mark(U11(tt))
constraint: U12(mark(X)) >= U12(X)
constraint: U12(active(X)) >= U12(X)
constraint: U11(mark(X)) >= U11(X)
constraint: U11(active(X)) >= U11(X)
constraint: isNePal(mark(X)) >= isNePal(X)
constraint: isNePal(active(X)) >= isNePal(X)
constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X1)
constraint: Marked_mark(__(X1,X2)) >= Marked_mark(X2)
constraint: Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2)))
constraint: Marked_mark(U12(X)) >= Marked_mark(X)
constraint: Marked_mark(U11(X)) >= Marked_mark(X)
constraint: Marked_mark(U11(X)) >= Marked_active(U11(mark(X)))
constraint: Marked_mark(isNePal(X)) >= Marked_mark(X)
constraint: Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X)))
constraint: Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z)))
constraint: Marked_active(__(nil,X)) >= Marked_mark(X)
constraint: Marked_active(__(X,nil)) >= Marked_mark(X)
constraint: Marked_active(U11(tt)) >= Marked_mark(U12(tt))
constraint: Marked_active(isNePal(__(I,__(P,I)))) >= Marked_mark(U11(tt))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
      --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(__(X1,X2)) >= active(__(mark(X1),mark(X2))) ;
  mark(nil) >= active(nil) ;
  mark(U12(X)) >= active(U12(mark(X))) ;
  mark(tt) >= active(tt) ;
  mark(U11(X)) >= active(U11(mark(X))) ;
  mark(isNePal(X)) >= active(isNePal(mark(X))) ;
  __(mark(X1),X2) >= __(X1,X2) ;
  __(active(X1),X2) >= __(X1,X2) ;
  __(X1,mark(X2)) >= __(X1,X2) ;
  __(X1,active(X2)) >= __(X1,X2) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(U12(tt)) >= mark(tt) ;
  active(U11(tt)) >= mark(U12(tt)) ;
  active(isNePal(__(I,__(P,I)))) >= mark(U11(tt)) ;
  U12(mark(X)) >= U12(X) ;
  U12(active(X)) >= U12(X) ;
  U11(mark(X)) >= U11(X) ;
  U11(active(X)) >= U11(X) ;
  isNePal(mark(X)) >= isNePal(X) ;
  isNePal(active(X)) >= isNePal(X) ;
  Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2))) ;
  Marked_mark(U11(X)) >= Marked_active(U11(mark(X))) ;
  Marked_mark(isNePal(X)) >= Marked_mark(X) ;
  Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X))) ;
  Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(__(X1,X2)) > Marked_active(__(mark(X1),mark(X2))) ;
 }
{
  Marked_mark(U11(X)) > Marked_active(U11(mark(X))) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_mark(X) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_active(isNePal(mark(X))) ;
 }
{
  Marked_active(__(__(X,Y),Z)) > Marked_mark(__(X,__(Y,Z))) ;
 }
 } 
=== 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: mark(__(X1,X2)) >= active(__(mark(X1),mark(X2)))
constraint: mark(nil) >= active(nil)
constraint: mark(U12(X)) >= active(U12(mark(X)))
constraint: mark(tt) >= active(tt)
constraint: mark(U11(X)) >= active(U11(mark(X)))
constraint: mark(isNePal(X)) >= active(isNePal(mark(X)))
constraint: __(mark(X1),X2) >= __(X1,X2)
constraint: __(active(X1),X2) >= __(X1,X2)
constraint: __(X1,mark(X2)) >= __(X1,X2)
constraint: __(X1,active(X2)) >= __(X1,X2)
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(U12(tt)) >= mark(tt)
constraint: active(U11(tt)) >= mark(U12(tt))
constraint: active(isNePal(__(I,__(P,I)))) >= mark(U11(tt))
constraint: U12(mark(X)) >= U12(X)
constraint: U12(active(X)) >= U12(X)
constraint: U11(mark(X)) >= U11(X)
constraint: U11(active(X)) >= U11(X)
constraint: isNePal(mark(X)) >= isNePal(X)
constraint: isNePal(active(X)) >= isNePal(X)
constraint: Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2)))
constraint: Marked_mark(U11(X)) >= Marked_active(U11(mark(X)))
constraint: Marked_mark(isNePal(X)) >= Marked_mark(X)
constraint: Marked_mark(isNePal(X)) >= Marked_active(isNePal(mark(X)))
constraint: Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z)))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
      --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_mark(isNePal(X)) , Marked_mark(X)> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
     --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(isNePal(X)) , Marked_mark(X)>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(__(X1,X2)) >= active(__(mark(X1),mark(X2))) ;
  mark(nil) >= active(nil) ;
  mark(U12(X)) >= active(U12(mark(X))) ;
  mark(tt) >= active(tt) ;
  mark(U11(X)) >= active(U11(mark(X))) ;
  mark(isNePal(X)) >= active(isNePal(mark(X))) ;
  __(mark(X1),X2) >= __(X1,X2) ;
  __(active(X1),X2) >= __(X1,X2) ;
  __(X1,mark(X2)) >= __(X1,X2) ;
  __(X1,active(X2)) >= __(X1,X2) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(U12(tt)) >= mark(tt) ;
  active(U11(tt)) >= mark(U12(tt)) ;
  active(isNePal(__(I,__(P,I)))) >= mark(U11(tt)) ;
  U12(mark(X)) >= U12(X) ;
  U12(active(X)) >= U12(X) ;
  U11(mark(X)) >= U11(X) ;
  U11(active(X)) >= U11(X) ;
  isNePal(mark(X)) >= isNePal(X) ;
  isNePal(active(X)) >= isNePal(X) ;
  Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2))) ;
  Marked_mark(isNePal(X)) >= Marked_mark(X) ;
  Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(__(X1,X2)) > Marked_active(__(mark(X1),mark(X2))) ;
 }
{
  Marked_mark(isNePal(X)) > Marked_mark(X) ;
 }
{
  Marked_active(__(__(X,Y),Z)) > Marked_mark(__(X,__(Y,Z))) ;
 }
 } 
=== 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: mark(__(X1,X2)) >= active(__(mark(X1),mark(X2)))
constraint: mark(nil) >= active(nil)
constraint: mark(U12(X)) >= active(U12(mark(X)))
constraint: mark(tt) >= active(tt)
constraint: mark(U11(X)) >= active(U11(mark(X)))
constraint: mark(isNePal(X)) >= active(isNePal(mark(X)))
constraint: __(mark(X1),X2) >= __(X1,X2)
constraint: __(active(X1),X2) >= __(X1,X2)
constraint: __(X1,mark(X2)) >= __(X1,X2)
constraint: __(X1,active(X2)) >= __(X1,X2)
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(U12(tt)) >= mark(tt)
constraint: active(U11(tt)) >= mark(U12(tt))
constraint: active(isNePal(__(I,__(P,I)))) >= mark(U11(tt))
constraint: U12(mark(X)) >= U12(X)
constraint: U12(active(X)) >= U12(X)
constraint: U11(mark(X)) >= U11(X)
constraint: U11(active(X)) >= U11(X)
constraint: isNePal(mark(X)) >= isNePal(X)
constraint: isNePal(active(X)) >= isNePal(X)
constraint: Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2)))
constraint: Marked_mark(isNePal(X)) >= Marked_mark(X)
constraint: Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z)))
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))> 
      --> <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
  <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))> 
     --> <Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  mark(__(X1,X2)) >= active(__(mark(X1),mark(X2))) ;
  mark(nil) >= active(nil) ;
  mark(U12(X)) >= active(U12(mark(X))) ;
  mark(tt) >= active(tt) ;
  mark(U11(X)) >= active(U11(mark(X))) ;
  mark(isNePal(X)) >= active(isNePal(mark(X))) ;
  __(mark(X1),X2) >= __(X1,X2) ;
  __(active(X1),X2) >= __(X1,X2) ;
  __(X1,mark(X2)) >= __(X1,X2) ;
  __(X1,active(X2)) >= __(X1,X2) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(U12(tt)) >= mark(tt) ;
  active(U11(tt)) >= mark(U12(tt)) ;
  active(isNePal(__(I,__(P,I)))) >= mark(U11(tt)) ;
  U12(mark(X)) >= U12(X) ;
  U12(active(X)) >= U12(X) ;
  U11(mark(X)) >= U11(X) ;
  U11(active(X)) >= U11(X) ;
  isNePal(mark(X)) >= isNePal(X) ;
  isNePal(active(X)) >= isNePal(X) ;
  Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2))) ;
  Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z))) ;
 }
 + Disjunctions:{ 
{
  Marked_mark(__(X1,X2)) > Marked_active(__(mark(X1),mark(X2))) ;
 }
{
  Marked_active(__(__(X,Y),Z)) > Marked_mark(__(X,__(Y,Z))) ;
 }
 } 
=== 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: mark(__(X1,X2)) >= active(__(mark(X1),mark(X2)))
constraint: mark(nil) >= active(nil)
constraint: mark(U12(X)) >= active(U12(mark(X)))
constraint: mark(tt) >= active(tt)
constraint: mark(U11(X)) >= active(U11(mark(X)))
constraint: mark(isNePal(X)) >= active(isNePal(mark(X)))
constraint: __(mark(X1),X2) >= __(X1,X2)
constraint: __(active(X1),X2) >= __(X1,X2)
constraint: __(X1,mark(X2)) >= __(X1,X2)
constraint: __(X1,active(X2)) >= __(X1,X2)
constraint: active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z)))
constraint: active(__(nil,X)) >= mark(X)
constraint: active(__(X,nil)) >= mark(X)
constraint: active(U12(tt)) >= mark(tt)
constraint: active(U11(tt)) >= mark(U12(tt))
constraint: active(isNePal(__(I,__(P,I)))) >= mark(U11(tt))
constraint: U12(mark(X)) >= U12(X)
constraint: U12(active(X)) >= U12(X)
constraint: U11(mark(X)) >= U11(X)
constraint: U11(active(X)) >= U11(X)
constraint: isNePal(mark(X)) >= isNePal(X)
constraint: isNePal(active(X)) >= isNePal(X)
constraint: Marked_mark(__(X1,X2)) >= Marked_active(__(mark(X1),mark(X2)))
constraint: Marked_active(__(__(X,Y),Z)) >= Marked_mark(__(X,__(Y,Z)))
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
      --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(mark(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(active(X1),X2) , Marked___(X1,X2)> 
     --> <Marked___(active(X1),X2) , Marked___(X1,X2)>
}
APPLY CRITERIA (Subterm criterion)

ST: Marked___ -> 1

APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 0 components:
SOLVED
{
 
TRS termination of:
[1] active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
[2] active(__(X,nil)) -> mark(X)
[3] active(__(nil,X)) -> mark(X)
[4] active(U11(tt)) -> mark(U12(tt))
[5] active(U12(tt)) -> mark(tt)
[6] active(isNePal(__(I,__(P,I)))) -> mark(U11(tt))
[7] mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
[8] mark(nil) -> active(nil)
[9] mark(U11(X)) -> active(U11(mark(X)))
[10] mark(tt) -> active(tt)
[11] mark(U12(X)) -> active(U12(mark(X)))
[12] mark(isNePal(X)) -> active(isNePal(mark(X)))
[13] __(mark(X1),X2) -> __(X1,X2)
[14] __(X1,mark(X2)) -> __(X1,X2)
[15] __(active(X1),X2) -> __(X1,X2)
[16] __(X1,active(X2)) -> __(X1,X2)
[17] U11(mark(X)) -> U11(X)
[18] U11(active(X)) -> U11(X)
[19] U12(mark(X)) -> U12(X)
[20] U12(active(X)) -> U12(X)
[21] isNePal(mark(X)) -> isNePal(X)
[22] isNePal(active(X)) -> isNePal(X)
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(__(X,nil)) , Marked_mark(X)>
<Marked_active(__(nil,X)) , Marked_mark(X)>
<Marked_active(U11(tt)) , Marked_mark(U12(tt))>
<Marked_active(U11(tt)) , Marked_U12(tt)>
<Marked_active(U12(tt)) , Marked_mark(tt)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_U11(tt)>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(__(X1,X2)) , Marked___(mark(X1),mark(X2))>
<Marked_mark(__(X1,X2)) , Marked_mark(X1)>
<Marked_mark(__(X1,X2)) , Marked_mark(X2)>
<Marked_mark(nil) , Marked_active(nil)>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(U11(X)) , Marked_U11(mark(X))>
<Marked_mark(U11(X)) , Marked_mark(X)>
<Marked_mark(tt) , Marked_active(tt)>
<Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
<Marked_mark(U12(X)) , Marked_U12(mark(X))>
<Marked_mark(U12(X)) , Marked_mark(X)>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_isNePal(mark(X))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked___(active(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,active(X2)) , Marked___(X1,X2)>
<Marked_U11(mark(X)) , Marked_U11(X)>
<Marked_U11(active(X)) , Marked_U11(X)>
<Marked_U12(mark(X)) , Marked_U12(X)>
<Marked_U12(active(X)) , Marked_U12(X)>
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_isNePal(active(X)) , Marked_isNePal(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_active(__(X,nil)) , Marked_mark(X)>
<Marked_active(__(nil,X)) , Marked_mark(X)>
<Marked_active(U11(tt)) , Marked_mark(U12(tt))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(__(X1,X2)) , Marked_mark(X1)>
<Marked_mark(__(X1,X2)) , Marked_mark(X2)>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(U11(X)) , Marked_mark(X)>
<Marked_mark(U12(X)) , Marked_active(U12(mark(X)))>
<Marked_mark(U12(X)) , Marked_mark(X)>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ U12 ] (X0) = 0; 
 [ Marked_mark ] (X0) = 1; 
 [ active ] (X0) = 0; 
 [ U11 ] (X0) = 1; 
 [ __ ] (X0,X1) = 1; 
 [ tt ] () = 0; 
 [ Marked_active ] (X0) = 1*X0; 
 [ nil ] () = 0; 
 [ isNePal ] (X0) = 1; 
 removing <Marked_mark(U12(X)),Marked_active(U12(mark(X)))>
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_active(__(X,nil)) , Marked_mark(X)>
<Marked_active(__(nil,X)) , Marked_mark(X)>
<Marked_active(U11(tt)) , Marked_mark(U12(tt))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(__(X1,X2)) , Marked_mark(X1)>
<Marked_mark(__(X1,X2)) , Marked_mark(X2)>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(U11(X)) , Marked_mark(X)>
<Marked_mark(U12(X)) , Marked_mark(X)>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_active(__(X,nil)) , Marked_mark(X)>
<Marked_active(__(nil,X)) , Marked_mark(X)>
<Marked_active(U11(tt)) , Marked_mark(U12(tt))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_mark(U11(tt))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(__(X1,X2)) , Marked_mark(X1)>
<Marked_mark(__(X1,X2)) , Marked_mark(X2)>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(U11(X)) , Marked_mark(X)>
<Marked_mark(U12(X)) , Marked_mark(X)>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ U12 ] (X0) = 3*X0 + 2; 
 [ Marked_mark ] (X0) = 3*X0 + 2; 
 [ active ] (X0) = 1*X0; 
 [ U11 ] (X0) = 3*X0 + 3; 
 [ __ ] (X0,X1) = 1*X1 + 1*X0 + 2; 
 [ tt ] () = 2; 
 [ Marked_active ] (X0) = 3*X0 + 2; 
 [ nil ] () = 0; 
 [ isNePal ] (X0) = 3*X0; 
 removing <Marked_active(__(X,nil)),Marked_mark(X)><Marked_active(__(nil,X)),
Marked_mark(X)><Marked_active(U11(tt)),Marked_mark(U12(tt))><Marked_active(
                                                              isNePal(
                                                               __(I,__(P,I)))),
Marked_mark(U11(tt))><Marked_mark(__(X1,X2)),Marked_mark(X1)><Marked_mark(
                                                               __(X1,
                                                                X2)),
Marked_mark(X2)><Marked_mark(U11(X)),Marked_mark(X)><Marked_mark(U12(X)),
Marked_mark(X)>
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(U11(X)) , Marked_active(U11(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_active(isNePal(mark(X)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 0; 
 [ U12 ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2; 
 [ active ] (X0) = 0; 
 [ U11 ] (X0) = 0; 
 [ __ ] (X0,X1) = 2; 
 [ tt ] () = 0; 
 [ Marked_active ] (X0) = 1*X0; 
 [ nil ] () = 0; 
 [ isNePal ] (X0) = 1; 
 removing <Marked_mark(U11(X)),Marked_active(U11(mark(X)))><Marked_mark(
                                                             isNePal(
                                                              X)),Marked_active(
                                                                   isNePal(
                                                                    mark(
                                                                    X)))>
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
<Marked_mark(isNePal(X)) , Marked_mark(X)>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0; 
 [ U12 ] (X0) = 0; 
 [ Marked_mark ] (X0) = 2*X0; 
 [ active ] (X0) = 1*X0; 
 [ U11 ] (X0) = 0; 
 [ __ ] (X0,X1) = 1*X1 + 2*X0; 
 [ tt ] () = 0; 
 [ Marked_active ] (X0) = 2*X0; 
 [ nil ] () = 0; 
 [ isNePal ] (X0) = 1*X0 + 1; 
 removing <Marked_mark(isNePal(X)),Marked_mark(X)>
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked_mark(__(X,__(Y,Z)))>
<Marked_mark(__(X1,X2)) , Marked_active(__(mark(X1),mark(X2)))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 1*X0 + 0; 
 [ U12 ] (X0) = 0; 
 [ Marked_mark ] (X0) = 1 + 1*X0 + 0; 
 [ active ] (X0) = 1*X0 + 0; 
 [ U11 ] (X0) = 0; 
 [ __ ] (X0,X1) = 2 + 2*X0 + 1*X1 + 0; 
 [ tt ] () = 0; 
 [ Marked_active ] (X0) = 1*X0 + 0; 
 [ nil ] () = 2 + 0; 
 [ isNePal ] (X0) = 0; 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked___(active(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,active(X2)) , Marked___(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
     <Marked___(active(X1),X2) , Marked___(X1,X2)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked___(active(X1),X2) , Marked___(X1,X2)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_U11(mark(X)) , Marked_U11(X)>
<Marked_U11(active(X)) , Marked_U11(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_U12(mark(X)) , Marked_U12(X)>
<Marked_U12(active(X)) , Marked_U12(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isNePal(mark(X)) , Marked_isNePal(X)>
<Marked_isNePal(active(X)) , Marked_isNePal(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 

Cime worked for 0.846150 seconds (real time)
Cime Exit Status: 0