Problem Transformed CSR 04 PALINDROME nokinds iGM

Tool Bounds

Execution Time	60.062027ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  isPal(active(X)) -> isPal(X)
     , isPal(mark(X)) -> isPal(X)
     , isNePal(active(X)) -> isNePal(X)
     , isNePal(mark(X)) -> isNePal(X)
     , isQid(active(X)) -> isQid(X)
     , isQid(mark(X)) -> isQid(X)
     , isNeList(active(X)) -> isNeList(X)
     , isNeList(mark(X)) -> isNeList(X)
     , isList(active(X)) -> isList(X)
     , isList(mark(X)) -> isList(X)
     , and(X1, active(X2)) -> and(X1, X2)
     , and(active(X1), X2) -> and(X1, X2)
     , and(X1, mark(X2)) -> and(X1, X2)
     , and(mark(X1), X2) -> and(X1, X2)
     , __(X1, active(X2)) -> __(X1, X2)
     , __(active(X1), X2) -> __(X1, X2)
     , __(X1, mark(X2)) -> __(X1, X2)
     , __(mark(X1), X2) -> __(X1, X2)
     , mark(u()) -> active(u())
     , mark(o()) -> active(o())
     , mark(i()) -> active(i())
     , mark(e()) -> active(e())
     , mark(a()) -> active(a())
     , mark(isPal(X)) -> active(isPal(X))
     , mark(isNePal(X)) -> active(isNePal(X))
     , mark(isQid(X)) -> active(isQid(X))
     , mark(isNeList(X)) -> active(isNeList(X))
     , mark(isList(X)) -> active(isList(X))
     , mark(tt()) -> active(tt())
     , mark(and(X1, X2)) -> active(and(mark(X1), X2))
     , mark(nil()) -> active(nil())
     , mark(__(X1, X2)) -> active(__(mark(X1), mark(X2)))
     , active(isQid(u())) -> mark(tt())
     , active(isQid(o())) -> mark(tt())
     , active(isQid(i())) -> mark(tt())
     , active(isQid(e())) -> mark(tt())
     , active(isQid(a())) -> mark(tt())
     , active(isPal(nil())) -> mark(tt())
     , active(isPal(V)) -> mark(isNePal(V))
     , active(isNePal(__(I, __(P, I)))) -> mark(and(isQid(I), isPal(P)))
     , active(isNePal(V)) -> mark(isQid(V))
     , 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(and(tt(), X)) -> mark(X)
     , active(__(nil(), X)) -> mark(X)
     , active(__(X, nil())) -> mark(X)
     , active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	60.0521ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

TIMEOUT

Statistics:
Number of monomials: 14240
Last formula building started for bound 3
Last SAT solving started for bound 0

Tool EDA

Execution Time	60.06401ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

Tool IDA

Execution Time	60.0714ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

Tool TRI

Execution Time	60.05983ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

Tool TRI2

Execution Time	1.4291251ms
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nokinds iGM

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  isPal(active(X)) -> isPal(X)
     , isPal(mark(X)) -> isPal(X)
     , isNePal(active(X)) -> isNePal(X)
     , isNePal(mark(X)) -> isNePal(X)
     , isQid(active(X)) -> isQid(X)
     , isQid(mark(X)) -> isQid(X)
     , isNeList(active(X)) -> isNeList(X)
     , isNeList(mark(X)) -> isNeList(X)
     , isList(active(X)) -> isList(X)
     , isList(mark(X)) -> isList(X)
     , and(X1, active(X2)) -> and(X1, X2)
     , and(active(X1), X2) -> and(X1, X2)
     , and(X1, mark(X2)) -> and(X1, X2)
     , and(mark(X1), X2) -> and(X1, X2)
     , __(X1, active(X2)) -> __(X1, X2)
     , __(active(X1), X2) -> __(X1, X2)
     , __(X1, mark(X2)) -> __(X1, X2)
     , __(mark(X1), X2) -> __(X1, X2)
     , mark(u()) -> active(u())
     , mark(o()) -> active(o())
     , mark(i()) -> active(i())
     , mark(e()) -> active(e())
     , mark(a()) -> active(a())
     , mark(isPal(X)) -> active(isPal(X))
     , mark(isNePal(X)) -> active(isNePal(X))
     , mark(isQid(X)) -> active(isQid(X))
     , mark(isNeList(X)) -> active(isNeList(X))
     , mark(isList(X)) -> active(isList(X))
     , mark(tt()) -> active(tt())
     , mark(and(X1, X2)) -> active(and(mark(X1), X2))
     , mark(nil()) -> active(nil())
     , mark(__(X1, X2)) -> active(__(mark(X1), mark(X2)))
     , active(isQid(u())) -> mark(tt())
     , active(isQid(o())) -> mark(tt())
     , active(isQid(i())) -> mark(tt())
     , active(isQid(e())) -> mark(tt())
     , active(isQid(a())) -> mark(tt())
     , active(isPal(nil())) -> mark(tt())
     , active(isPal(V)) -> mark(isNePal(V))
     , active(isNePal(__(I, __(P, I)))) -> mark(and(isQid(I), isPal(P)))
     , active(isNePal(V)) -> mark(isQid(V))
     , 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(and(tt(), X)) -> mark(X)
     , active(__(nil(), X)) -> mark(X)
     , active(__(X, nil())) -> mark(X)
     , active(__(__(X, Y), Z)) -> mark(__(X, __(Y, Z)))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..