- : 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(and(tt,X)) -> mark(X)
[5] active(isList(V)) -> mark(isNeList(V))
[6] active(isList(nil)) -> mark(tt)
[7] active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2)))
[8] active(isNeList(V)) -> mark(isQid(V))
[9] active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2)))
[10] active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2)))
[11] active(isNePal(V)) -> mark(isQid(V))
[12] active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P)))
[13] active(isPal(V)) -> mark(isNePal(V))
[14] active(isPal(nil)) -> mark(tt)
[15] active(isQid(a)) -> mark(tt)
[16] active(isQid(e)) -> mark(tt)
[17] active(isQid(i)) -> mark(tt)
[18] active(isQid(o)) -> mark(tt)
[19] active(isQid(u)) -> mark(tt)
[20] active(__(X1,X2)) -> __(active(X1),X2)
[21] active(__(X1,X2)) -> __(X1,active(X2))
[22] active(and(X1,X2)) -> and(active(X1),X2)
[23] __(mark(X1),X2) -> mark(__(X1,X2))
[24] __(X1,mark(X2)) -> mark(__(X1,X2))
[25] and(mark(X1),X2) -> mark(and(X1,X2))
[26] proper(__(X1,X2)) -> __(proper(X1),proper(X2))
[27] proper(nil) -> ok(nil)
[28] proper(and(X1,X2)) -> and(proper(X1),proper(X2))
[29] proper(tt) -> ok(tt)
[30] proper(isList(X)) -> isList(proper(X))
[31] proper(isNeList(X)) -> isNeList(proper(X))
[32] proper(isQid(X)) -> isQid(proper(X))
[33] proper(isNePal(X)) -> isNePal(proper(X))
[34] proper(isPal(X)) -> isPal(proper(X))
[35] proper(a) -> ok(a)
[36] proper(e) -> ok(e)
[37] proper(i) -> ok(i)
[38] proper(o) -> ok(o)
[39] proper(u) -> ok(u)
[40] __(ok(X1),ok(X2)) -> ok(__(X1,X2))
[41] and(ok(X1),ok(X2)) -> ok(and(X1,X2))
[42] isList(ok(X)) -> ok(isList(X))
[43] isNeList(ok(X)) -> ok(isNeList(X))
[44] isQid(ok(X)) -> ok(isQid(X))
[45] isNePal(ok(X)) -> ok(isNePal(X))
[46] isPal(ok(X)) -> ok(isPal(X))
[47] top(mark(X)) -> top(proper(X))
[48] top(ok(X)) -> top(active(X))


Sub problem: 
guided: 

DP termination of:
<Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(isList(V)) , Marked_isNeList(V)>
<Marked_active(isList(__(V1,V2))) , Marked_and(isList(V1),isList(V2))>
<Marked_active(isList(__(V1,V2))) , Marked_isList(V1)>
<Marked_active(isList(__(V1,V2))) , Marked_isList(V2)>
<Marked_active(isNeList(V)) , Marked_isQid(V)>
<Marked_active(isNeList(__(V1,V2))) , Marked_and(isList(V1),isNeList(V2))>
<Marked_active(isNeList(__(V1,V2))) , Marked_isList(V1)>
<Marked_active(isNeList(__(V1,V2))) , Marked_isNeList(V2)>
<Marked_active(isNeList(__(V1,V2))) , Marked_and(isNeList(V1),isList(V2))>
<Marked_active(isNeList(__(V1,V2))) , Marked_isNeList(V1)>
<Marked_active(isNeList(__(V1,V2))) , Marked_isList(V2)>
<Marked_active(isNePal(V)) , Marked_isQid(V)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_and(isQid(I),isPal(P))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_isQid(I)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_isPal(P)>
<Marked_active(isPal(V)) , Marked_isNePal(V)>
<Marked_active(__(X1,X2)) , Marked___(active(X1),X2)>
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked___(X1,active(X2))>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_and(active(X1),X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_proper(__(X1,X2)) , Marked___(proper(X1),proper(X2))>
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_and(proper(X1),proper(X2))>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isList(X)) , Marked_isList(proper(X))>
<Marked_proper(isList(X)) , Marked_proper(X)>
<Marked_proper(isNeList(X)) , Marked_isNeList(proper(X))>
<Marked_proper(isNeList(X)) , Marked_proper(X)>
<Marked_proper(isQid(X)) , Marked_isQid(proper(X))>
<Marked_proper(isQid(X)) , Marked_proper(X)>
<Marked_proper(isNePal(X)) , Marked_isNePal(proper(X))>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
<Marked_proper(isPal(X)) , Marked_isPal(proper(X))>
<Marked_proper(isPal(X)) , Marked_proper(X)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
<Marked_isList(ok(X)) , Marked_isList(X)>
<Marked_isNeList(ok(X)) , Marked_isNeList(X)>
<Marked_isQid(ok(X)) , Marked_isQid(X)>
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
<Marked_isPal(ok(X)) , Marked_isPal(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 
END GUIDED
APPLY CRITERIA (Graph splitting)
Found 10 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(ok(X)) , Marked_top(active(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(ok(X)) , Marked_top(active(X))>
  <Marked_top(mark(X)) , Marked_top(proper(X))> 
     --> <Marked_top(mark(X)) , Marked_top(proper(X))>
}

{  <Marked_proper(isPal(X)) , Marked_proper(X)> 
      --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isPal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNePal(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isQid(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isNeList(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(isList(X)) , Marked_proper(X)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(and(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X2)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isPal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNePal(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isQid(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isNeList(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(isList(X)) , Marked_proper(X)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(and(X1,X2)) , Marked_proper(X1)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X2)>
  <Marked_proper(__(X1,X2)) , Marked_proper(X1)> 
     --> <Marked_proper(__(X1,X2)) , Marked_proper(X1)>
}

{  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
      --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(and(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X2)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(and(X1,X2)) , Marked_active(X1)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X2)>
  <Marked_active(__(X1,X2)) , Marked_active(X1)> 
     --> <Marked_active(__(X1,X2)) , Marked_active(X1)>
}

{  <Marked_isNeList(ok(X)) , Marked_isNeList(X)> 
      --> <Marked_isNeList(ok(X)) , Marked_isNeList(X)>
}

{  <Marked_isList(ok(X)) , Marked_isList(X)> 
      --> <Marked_isList(ok(X)) , Marked_isList(X)>
}

{  <Marked_isQid(ok(X)) , Marked_isQid(X)> 
      --> <Marked_isQid(ok(X)) , Marked_isQid(X)>
}

{  <Marked_isPal(ok(X)) , Marked_isPal(X)> 
      --> <Marked_isPal(ok(X)) , Marked_isPal(X)>
}

{  <Marked_isNePal(ok(X)) , Marked_isNePal(X)> 
      --> <Marked_isNePal(ok(X)) , Marked_isNePal(X)>
}

{  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
      --> <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
     --> <Marked___(X1,mark(X2)) , Marked___(X1,X2)>
  <Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)> 
     --> <Marked___(mark(X1),X2) , Marked___(X1,X2)>
  <Marked___(X1,mark(X2)) , Marked___(X1,X2)> 
     --> <Marked___(ok(X1),ok(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___(ok(X1),ok(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_and(ok(X1),ok(X2)) , Marked_and(X1,X2)> 
      --> <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
  <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)> 
     --> <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
  <Marked_and(mark(X1),X2) , Marked_and(X1,X2)> 
     --> <Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
  <Marked_and(mark(X1),X2) , Marked_and(X1,X2)> 
     --> <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNeList(__(V1,V2))) >= mark(and(isNeList(V1),isList(V2))) ;
  active(isNeList(__(V1,V2))) >= mark(and(isList(V1),isNeList(V2))) ;
  active(isNeList(V)) >= mark(isQid(V)) ;
  active(isList(__(V1,V2))) >= mark(and(isList(V1),isList(V2))) ;
  active(isList(nil)) >= mark(tt) ;
  active(isList(V)) >= mark(isNeList(V)) ;
  active(isQid(a)) >= mark(tt) ;
  active(isQid(e)) >= mark(tt) ;
  active(isQid(i)) >= mark(tt) ;
  active(isQid(o)) >= mark(tt) ;
  active(isQid(u)) >= mark(tt) ;
  active(isNePal(__(I,__(P,I)))) >= mark(and(isQid(I),isPal(P))) ;
  active(isNePal(V)) >= mark(isQid(V)) ;
  active(isPal(nil)) >= mark(tt) ;
  active(isPal(V)) >= mark(isNePal(V)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNeList(ok(X)) >= ok(isNeList(X)) ;
  isList(ok(X)) >= ok(isList(X)) ;
  isQid(ok(X)) >= ok(isQid(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  isPal(ok(X)) >= ok(isPal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNeList(X)) >= isNeList(proper(X)) ;
  proper(isList(X)) >= isList(proper(X)) ;
  proper(isQid(X)) >= isQid(proper(X)) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  proper(isPal(X)) >= isPal(proper(X)) ;
  proper(a) >= ok(a) ;
  proper(e) >= ok(e) ;
  proper(i) >= ok(i) ;
  proper(o) >= ok(o) ;
  proper(u) >= ok(u) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(mark(X)) >= Marked_top(proper(X)) ;
  Marked_top(ok(X)) >= Marked_top(active(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(mark(X)) > Marked_top(proper(X)) ;
 }
{
  Marked_top(ok(X)) > Marked_top(active(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(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(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNeList(__(V1,V2))) >= mark(and(isNeList(V1),isList(V2)))
constraint: active(isNeList(__(V1,V2))) >= mark(and(isList(V1),isNeList(V2)))
constraint: active(isNeList(V)) >= mark(isQid(V))
constraint: active(isList(__(V1,V2))) >= mark(and(isList(V1),isList(V2)))
constraint: active(isList(nil)) >= mark(tt)
constraint: active(isList(V)) >= mark(isNeList(V))
constraint: active(isQid(a)) >= mark(tt)
constraint: active(isQid(e)) >= mark(tt)
constraint: active(isQid(i)) >= mark(tt)
constraint: active(isQid(o)) >= mark(tt)
constraint: active(isQid(u)) >= mark(tt)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(and(isQid(I),isPal(P)))
constraint: active(isNePal(V)) >= mark(isQid(V))
constraint: active(isPal(nil)) >= mark(tt)
constraint: active(isPal(V)) >= mark(isNePal(V))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNeList(ok(X)) >= ok(isNeList(X))
constraint: isList(ok(X)) >= ok(isList(X))
constraint: isQid(ok(X)) >= ok(isQid(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: isPal(ok(X)) >= ok(isPal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNeList(X)) >= isNeList(proper(X))
constraint: proper(isList(X)) >= isList(proper(X))
constraint: proper(isQid(X)) >= isQid(proper(X))
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: proper(isPal(X)) >= isPal(proper(X))
constraint: proper(a) >= ok(a)
constraint: proper(e) >= ok(e)
constraint: proper(i) >= ok(i)
constraint: proper(o) >= ok(o)
constraint: proper(u) >= ok(u)
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(mark(X)) >= Marked_top(proper(X))
constraint: Marked_top(ok(X)) >= Marked_top(active(X))
APPLY CRITERIA (Subterm criterion)

ST: Marked_proper -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_active -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isNeList -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isList -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isQid -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isPal -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked_isNePal -> 1

APPLY CRITERIA (Subterm criterion)

ST: Marked___ -> 2

APPLY CRITERIA (Subterm criterion)

ST: Marked_and -> 2

APPLY CRITERIA (Graph splitting)
Found 1 components:

{  <Marked_top(ok(X)) , Marked_top(active(X))> 
      --> <Marked_top(ok(X)) , Marked_top(active(X))>
}
APPLY CRITERIA (Subterm criterion)
APPLY CRITERIA (Choosing graph)
Trying to solve the following constraints:
{
  __(mark(X1),X2) >= mark(__(X1,X2)) ;
  __(ok(X1),ok(X2)) >= ok(__(X1,X2)) ;
  __(X1,mark(X2)) >= mark(__(X1,X2)) ;
  active(__(__(X,Y),Z)) >= mark(__(X,__(Y,Z))) ;
  active(__(nil,X)) >= mark(X) ;
  active(__(X,nil)) >= mark(X) ;
  active(__(X1,X2)) >= __(active(X1),X2) ;
  active(__(X1,X2)) >= __(X1,active(X2)) ;
  active(and(tt,X)) >= mark(X) ;
  active(and(X1,X2)) >= and(active(X1),X2) ;
  active(isNeList(__(V1,V2))) >= mark(and(isNeList(V1),isList(V2))) ;
  active(isNeList(__(V1,V2))) >= mark(and(isList(V1),isNeList(V2))) ;
  active(isNeList(V)) >= mark(isQid(V)) ;
  active(isList(__(V1,V2))) >= mark(and(isList(V1),isList(V2))) ;
  active(isList(nil)) >= mark(tt) ;
  active(isList(V)) >= mark(isNeList(V)) ;
  active(isQid(a)) >= mark(tt) ;
  active(isQid(e)) >= mark(tt) ;
  active(isQid(i)) >= mark(tt) ;
  active(isQid(o)) >= mark(tt) ;
  active(isQid(u)) >= mark(tt) ;
  active(isNePal(__(I,__(P,I)))) >= mark(and(isQid(I),isPal(P))) ;
  active(isNePal(V)) >= mark(isQid(V)) ;
  active(isPal(nil)) >= mark(tt) ;
  active(isPal(V)) >= mark(isNePal(V)) ;
  and(mark(X1),X2) >= mark(and(X1,X2)) ;
  and(ok(X1),ok(X2)) >= ok(and(X1,X2)) ;
  isNeList(ok(X)) >= ok(isNeList(X)) ;
  isList(ok(X)) >= ok(isList(X)) ;
  isQid(ok(X)) >= ok(isQid(X)) ;
  isNePal(ok(X)) >= ok(isNePal(X)) ;
  isPal(ok(X)) >= ok(isPal(X)) ;
  proper(__(X1,X2)) >= __(proper(X1),proper(X2)) ;
  proper(nil) >= ok(nil) ;
  proper(and(X1,X2)) >= and(proper(X1),proper(X2)) ;
  proper(tt) >= ok(tt) ;
  proper(isNeList(X)) >= isNeList(proper(X)) ;
  proper(isList(X)) >= isList(proper(X)) ;
  proper(isQid(X)) >= isQid(proper(X)) ;
  proper(isNePal(X)) >= isNePal(proper(X)) ;
  proper(isPal(X)) >= isPal(proper(X)) ;
  proper(a) >= ok(a) ;
  proper(e) >= ok(e) ;
  proper(i) >= ok(i) ;
  proper(o) >= ok(o) ;
  proper(u) >= ok(u) ;
  top(mark(X)) >= top(proper(X)) ;
  top(ok(X)) >= top(active(X)) ;
  Marked_top(ok(X)) >= Marked_top(active(X)) ;
 }
 + Disjunctions:{ 
{
  Marked_top(ok(X)) > Marked_top(active(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
Sat solver result read
=== STOPING TIMER real ===
=== STOPING TIMER virtual ===
constraint: __(mark(X1),X2) >= mark(__(X1,X2))
constraint: __(ok(X1),ok(X2)) >= ok(__(X1,X2))
constraint: __(X1,mark(X2)) >= mark(__(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(__(X1,X2)) >= __(active(X1),X2)
constraint: active(__(X1,X2)) >= __(X1,active(X2))
constraint: active(and(tt,X)) >= mark(X)
constraint: active(and(X1,X2)) >= and(active(X1),X2)
constraint: active(isNeList(__(V1,V2))) >= mark(and(isNeList(V1),isList(V2)))
constraint: active(isNeList(__(V1,V2))) >= mark(and(isList(V1),isNeList(V2)))
constraint: active(isNeList(V)) >= mark(isQid(V))
constraint: active(isList(__(V1,V2))) >= mark(and(isList(V1),isList(V2)))
constraint: active(isList(nil)) >= mark(tt)
constraint: active(isList(V)) >= mark(isNeList(V))
constraint: active(isQid(a)) >= mark(tt)
constraint: active(isQid(e)) >= mark(tt)
constraint: active(isQid(i)) >= mark(tt)
constraint: active(isQid(o)) >= mark(tt)
constraint: active(isQid(u)) >= mark(tt)
constraint: active(isNePal(__(I,__(P,I)))) >= mark(and(isQid(I),isPal(P)))
constraint: active(isNePal(V)) >= mark(isQid(V))
constraint: active(isPal(nil)) >= mark(tt)
constraint: active(isPal(V)) >= mark(isNePal(V))
constraint: and(mark(X1),X2) >= mark(and(X1,X2))
constraint: and(ok(X1),ok(X2)) >= ok(and(X1,X2))
constraint: isNeList(ok(X)) >= ok(isNeList(X))
constraint: isList(ok(X)) >= ok(isList(X))
constraint: isQid(ok(X)) >= ok(isQid(X))
constraint: isNePal(ok(X)) >= ok(isNePal(X))
constraint: isPal(ok(X)) >= ok(isPal(X))
constraint: proper(__(X1,X2)) >= __(proper(X1),proper(X2))
constraint: proper(nil) >= ok(nil)
constraint: proper(and(X1,X2)) >= and(proper(X1),proper(X2))
constraint: proper(tt) >= ok(tt)
constraint: proper(isNeList(X)) >= isNeList(proper(X))
constraint: proper(isList(X)) >= isList(proper(X))
constraint: proper(isQid(X)) >= isQid(proper(X))
constraint: proper(isNePal(X)) >= isNePal(proper(X))
constraint: proper(isPal(X)) >= isPal(proper(X))
constraint: proper(a) >= ok(a)
constraint: proper(e) >= ok(e)
constraint: proper(i) >= ok(i)
constraint: proper(o) >= ok(o)
constraint: proper(u) >= ok(u)
constraint: top(mark(X)) >= top(proper(X))
constraint: top(ok(X)) >= top(active(X))
constraint: Marked_top(ok(X)) >= Marked_top(active(X))
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:
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:
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

ST: Marked___ -> 1

APPLY CRITERIA (Graph splitting)
Found 0 components:
APPLY CRITERIA (Graph splitting)
Found 1 components:

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

ST: Marked_and -> 1

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(and(tt,X)) -> mark(X)
[5] active(isList(V)) -> mark(isNeList(V))
[6] active(isList(nil)) -> mark(tt)
[7] active(isList(__(V1,V2))) -> mark(and(isList(V1),isList(V2)))
[8] active(isNeList(V)) -> mark(isQid(V))
[9] active(isNeList(__(V1,V2))) -> mark(and(isList(V1),isNeList(V2)))
[10] active(isNeList(__(V1,V2))) -> mark(and(isNeList(V1),isList(V2)))
[11] active(isNePal(V)) -> mark(isQid(V))
[12] active(isNePal(__(I,__(P,I)))) -> mark(and(isQid(I),isPal(P)))
[13] active(isPal(V)) -> mark(isNePal(V))
[14] active(isPal(nil)) -> mark(tt)
[15] active(isQid(a)) -> mark(tt)
[16] active(isQid(e)) -> mark(tt)
[17] active(isQid(i)) -> mark(tt)
[18] active(isQid(o)) -> mark(tt)
[19] active(isQid(u)) -> mark(tt)
[20] active(__(X1,X2)) -> __(active(X1),X2)
[21] active(__(X1,X2)) -> __(X1,active(X2))
[22] active(and(X1,X2)) -> and(active(X1),X2)
[23] __(mark(X1),X2) -> mark(__(X1,X2))
[24] __(X1,mark(X2)) -> mark(__(X1,X2))
[25] and(mark(X1),X2) -> mark(and(X1,X2))
[26] proper(__(X1,X2)) -> __(proper(X1),proper(X2))
[27] proper(nil) -> ok(nil)
[28] proper(and(X1,X2)) -> and(proper(X1),proper(X2))
[29] proper(tt) -> ok(tt)
[30] proper(isList(X)) -> isList(proper(X))
[31] proper(isNeList(X)) -> isNeList(proper(X))
[32] proper(isQid(X)) -> isQid(proper(X))
[33] proper(isNePal(X)) -> isNePal(proper(X))
[34] proper(isPal(X)) -> isPal(proper(X))
[35] proper(a) -> ok(a)
[36] proper(e) -> ok(e)
[37] proper(i) -> ok(i)
[38] proper(o) -> ok(o)
[39] proper(u) -> ok(u)
[40] __(ok(X1),ok(X2)) -> ok(__(X1,X2))
[41] and(ok(X1),ok(X2)) -> ok(and(X1,X2))
[42] isList(ok(X)) -> ok(isList(X))
[43] isNeList(ok(X)) -> ok(isNeList(X))
[44] isQid(ok(X)) -> ok(isQid(X))
[45] isNePal(ok(X)) -> ok(isNePal(X))
[46] isPal(ok(X)) -> ok(isPal(X))
[47] top(mark(X)) -> top(proper(X))
[48] top(ok(X)) -> top(active(X))
 ,
 CRITERION: MDP
 [ {
      
     DP termination of:
     <Marked_active(__(__(X,Y),Z)) , Marked___(X,__(Y,Z))>
<Marked_active(__(__(X,Y),Z)) , Marked___(Y,Z)>
<Marked_active(isList(V)) , Marked_isNeList(V)>
<Marked_active(isList(__(V1,V2))) , Marked_and(isList(V1),isList(V2))>
<Marked_active(isList(__(V1,V2))) , Marked_isList(V1)>
<Marked_active(isList(__(V1,V2))) , Marked_isList(V2)>
<Marked_active(isNeList(V)) , Marked_isQid(V)>
<Marked_active(isNeList(__(V1,V2))) , Marked_and(isList(V1),isNeList(V2))>
<Marked_active(isNeList(__(V1,V2))) , Marked_isList(V1)>
<Marked_active(isNeList(__(V1,V2))) , Marked_isNeList(V2)>
<Marked_active(isNeList(__(V1,V2))) , Marked_and(isNeList(V1),isList(V2))>
<Marked_active(isNeList(__(V1,V2))) , Marked_isNeList(V1)>
<Marked_active(isNeList(__(V1,V2))) , Marked_isList(V2)>
<Marked_active(isNePal(V)) , Marked_isQid(V)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_and(isQid(I),isPal(P))>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_isQid(I)>
<Marked_active(isNePal(__(I,__(P,I)))) , Marked_isPal(P)>
<Marked_active(isPal(V)) , Marked_isNePal(V)>
<Marked_active(__(X1,X2)) , Marked___(active(X1),X2)>
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked___(X1,active(X2))>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_and(active(X1),X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_proper(__(X1,X2)) , Marked___(proper(X1),proper(X2))>
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_and(proper(X1),proper(X2))>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isList(X)) , Marked_isList(proper(X))>
<Marked_proper(isList(X)) , Marked_proper(X)>
<Marked_proper(isNeList(X)) , Marked_isNeList(proper(X))>
<Marked_proper(isNeList(X)) , Marked_proper(X)>
<Marked_proper(isQid(X)) , Marked_isQid(proper(X))>
<Marked_proper(isQid(X)) , Marked_proper(X)>
<Marked_proper(isNePal(X)) , Marked_isNePal(proper(X))>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
<Marked_proper(isPal(X)) , Marked_isPal(proper(X))>
<Marked_proper(isPal(X)) , Marked_proper(X)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
<Marked_isList(ok(X)) , Marked_isList(X)>
<Marked_isNeList(ok(X)) , Marked_isNeList(X)>
<Marked_isQid(ok(X)) , Marked_isQid(X)>
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
<Marked_isPal(ok(X)) , Marked_isPal(X)>
<Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(mark(X)) , Marked_proper(X)>
<Marked_top(ok(X)) , Marked_top(active(X))>
<Marked_top(ok(X)) , Marked_active(X)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(mark(X)) , Marked_top(proper(X))>
<Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: CG using polynomial interpretation = 
 [ mark ] (X0) = 1*X0 + 1; 
 [ proper ] (X0) = 1*X0; 
 [ isQid ] (X0) = 1*X0; 
 [ and ] (X0,X1) = 1*X1 + 1*X0 + 2; 
 [ e ] () = 2; 
 [ active ] (X0) = 1*X0; 
 [ top ] (X0) = 2*X0; 
 [ isPal ] (X0) = 1*X0 + 2; 
 [ isNeList ] (X0) = 3*X0 + 1; 
 [ o ] () = 1; 
 [ __ ] (X0,X1) = 1*X1 + 2*X0 + 2; 
 [ ok ] (X0) = 1*X0; 
 [ isNePal ] (X0) = 1*X0 + 1; 
 [ tt ] () = 0; 
 [ i ] () = 1; 
 [ nil ] () = 0; 
 [ Marked_top ] (X0) = 1*X0; 
 [ a ] () = 1; 
 [ isList ] (X0) = 3*X0 + 3; 
 [ u ] () = 1; 
 removing <Marked_top(mark(X)),Marked_top(proper(X))>
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_top(ok(X)) , Marked_top(active(X))>
 ,
 CRITERION: ORD
 [ 
     Solution found:
     polynomial interpretation = 
      [ mark ] (X0) = 3 + 1*X0 + 0; 
 [ proper ] (X0) = 3 + 3*X0 + 0; 
 [ isQid ] (X0) = 3 + 3*X0 + 0; 
 [ and ] (X0,X1) = 3 + 2*X0 + 1*X1 + 0; 
 [ e ] () = 0; 
 [ active ] (X0) = 2*X0 + 0; 
 [ top ] (X0) = 0; 
 [ isPal ] (X0) = 3 + 3*X0 + 0; 
 [ isNeList ] (X0) = 3 + 3*X0 + 0; 
 [ o ] () = 2 + 0; 
 [ __ ] (X0,X1) = 3 + 2*X0 + 1*X1 + 0; 
 [ ok ] (X0) = 3 + 3*X0 + 0; 
 [ isNePal ] (X0) = 3 + 3*X0 + 0; 
 [ tt ] () = 0; 
 [ i ] () = 0; 
 [ nil ] () = 0; 
 [ Marked_top ] (X0) = 2*X0 + 0; 
 [ a ] () = 1 + 0; 
 [ isList ] (X0) = 3 + 3*X0 + 0; 
 [ u ] () = 0; 
 ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_proper(__(X1,X2)) , Marked_proper(X1)>
<Marked_proper(__(X1,X2)) , Marked_proper(X2)>
<Marked_proper(and(X1,X2)) , Marked_proper(X1)>
<Marked_proper(and(X1,X2)) , Marked_proper(X2)>
<Marked_proper(isList(X)) , Marked_proper(X)>
<Marked_proper(isNeList(X)) , Marked_proper(X)>
<Marked_proper(isQid(X)) , Marked_proper(X)>
<Marked_proper(isNePal(X)) , Marked_proper(X)>
<Marked_proper(isPal(X)) , Marked_proper(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_active(__(X1,X2)) , Marked_active(X1)>
<Marked_active(__(X1,X2)) , Marked_active(X2)>
<Marked_active(and(X1,X2)) , Marked_active(X1)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isNeList(ok(X)) , Marked_isNeList(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isList(ok(X)) , Marked_isList(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isQid(ok(X)) , Marked_isQid(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isPal(ok(X)) , Marked_isPal(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked_isNePal(ok(X)) , Marked_isNePal(X)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
{
 
DP termination of:
<Marked___(mark(X1),X2) , Marked___(X1,X2)>
<Marked___(X1,mark(X2)) , Marked___(X1,X2)>
<Marked___(ok(X1),ok(X2)) , Marked___(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked___(mark(X1),X2) , Marked___(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 
{
 
DP termination of:
<Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
<Marked_and(ok(X1),ok(X2)) , Marked_and(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
     <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
 ,
 CRITERION: SG
 [ {
      
     DP termination of:
     <Marked_and(mark(X1),X2) , Marked_and(X1,X2)>
 ,
 CRITERION: ST
 [ {
      
     DP termination of:
      ,
      CRITERION: SG
      [  ]} 
      ]} 
 ]} 
 ]} 
 ]} 
 ]} 

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