/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


YES
Input TRS:
    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: mark(__(X1,X2)) -> active(__(mark(X1),mark(X2)))
    21: mark(nil()) -> active(nil())
    22: mark(and(X1,X2)) -> active(and(mark(X1),X2))
    23: mark(tt()) -> active(tt())
    24: mark(isList(X)) -> active(isList(X))
    25: mark(isNeList(X)) -> active(isNeList(X))
    26: mark(isQid(X)) -> active(isQid(X))
    27: mark(isNePal(X)) -> active(isNePal(X))
    28: mark(isPal(X)) -> active(isPal(X))
    29: mark(a()) -> active(a())
    30: mark(e()) -> active(e())
    31: mark(i()) -> active(i())
    32: mark(o()) -> active(o())
    33: mark(u()) -> active(u())
    34: __(mark(X1),X2) -> __(X1,X2)
    35: __(X1,mark(X2)) -> __(X1,X2)
    36: __(active(X1),X2) -> __(X1,X2)
    37: __(X1,active(X2)) -> __(X1,X2)
    38: and(mark(X1),X2) -> and(X1,X2)
    39: and(X1,mark(X2)) -> and(X1,X2)
    40: and(active(X1),X2) -> and(X1,X2)
    41: and(X1,active(X2)) -> and(X1,X2)
    42: isList(mark(X)) -> isList(X)
    43: isList(active(X)) -> isList(X)
    44: isNeList(mark(X)) -> isNeList(X)
    45: isNeList(active(X)) -> isNeList(X)
    46: isQid(mark(X)) -> isQid(X)
    47: isQid(active(X)) -> isQid(X)
    48: isNePal(mark(X)) -> isNePal(X)
    49: isNePal(active(X)) -> isNePal(X)
    50: isPal(mark(X)) -> isPal(X)
    51: isPal(active(X)) -> isPal(X)
Number of strict rules: 51
Direct POLO(bPol) ... removes: 18 4 15 8 3 16 19 17 5 10 7 14 12 11 9 13 6 2
      a 	w: 1
      isNeList	w: x1 + 2
      isPal	w: x1 + 4
      u 	w: 1
      and	w: x1 + x2 + 1
      isNePal	w: x1 + 2
      isQid	w: x1 + 1
      o 	w: 1
      isList	w: x1 + 3
      nil	w: 3
      mark	w: x1
      i 	w: 1
      e 	w: 1
      active	w: x1
      tt	w: 1
      __	w: x1 + x2 + 5
Number of strict rules: 33
Direct POLO(bPol) ... removes: 1
      a 	w: 2
      isNeList	w: x1 + 2
      isPal	w: x1 + 5
      u 	w: 1
      and	w: x1 + x2 + 1
      isNePal	w: x1 + 2
      isQid	w: x1 + 1
      o 	w: 2
      isList	w: x1 + 3
      nil	w: 3
      mark	w: x1
      i 	w: 1
      e 	w: 2
      active	w: x1
      tt	w: 1
      __	w: 2 * x1 + x2 + 5
Number of strict rules: 32
Direct POLO(bPol) ... removes: 36 20 49 45 51 40 47 37 41 43
      a 	w: 1
      isNeList	w: 2 * x1 + 1
      isPal	w: 2 * x1 + 1
      u 	w: 1
      and	w: x1 + 2 * x2 + 1
      isNePal	w: 2 * x1 + 1
      isQid	w: x1 + 1
      o 	w: 1
      isList	w: x1 + 1
      nil	w: 1
      mark	w: 2 * x1
      i 	w: 1
      e 	w: 1
      active	w: x1 + 1
      tt	w: 1
      __	w: 2 * x1 + 2 * x2 + 9
Number of strict rules: 22
Direct POLO(bPol) ... removes: 50 21 26 32 27 34 22 28 44 33 39 25 30 31 23 24 38 48 42 46 35 29
      a 	w: 2
      isNeList	w: x1 + 1
      isPal	w: x1 + 36
      u 	w: 2
      and	w: x1 + 2 * x2 + 22
      isNePal	w: 2 * x1 + 38
      isQid	w: x1 + 1
      o 	w: 2
      isList	w: 2 * x1 + 4
      nil	w: 4
      mark	w: 2 * x1 + 37
      i 	w: 2
      e 	w: 2
      active	w: x1 + 1
      tt	w: 14
      __	w: x1 + x2 + 28
Number of strict rules: 0