Problem Transformed CSR 04 PALINDROME nokinds C

Tool Bounds

Execution Time	19.140522ms
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nokinds C

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , isPal(ok(X)) -> ok(isPal(X))
     , isNePal(ok(X)) -> ok(isNePal(X))
     , isQid(ok(X)) -> ok(isQid(X))
     , isNeList(ok(X)) -> ok(isNeList(X))
     , isList(ok(X)) -> ok(isList(X))
     , and(ok(X1), ok(X2)) -> ok(and(X1, X2))
     , __(ok(X1), ok(X2)) -> ok(__(X1, X2))
     , proper(u()) -> ok(u())
     , proper(o()) -> ok(o())
     , proper(i()) -> ok(i())
     , proper(e()) -> ok(e())
     , proper(a()) -> ok(a())
     , proper(isPal(X)) -> isPal(proper(X))
     , proper(isNePal(X)) -> isNePal(proper(X))
     , proper(isQid(X)) -> isQid(proper(X))
     , proper(isNeList(X)) -> isNeList(proper(X))
     , proper(isList(X)) -> isList(proper(X))
     , proper(tt()) -> ok(tt())
     , proper(and(X1, X2)) -> and(proper(X1), proper(X2))
     , proper(nil()) -> ok(nil())
     , proper(__(X1, X2)) -> __(proper(X1), proper(X2))
     , and(mark(X1), X2) -> mark(and(X1, X2))
     , __(X1, mark(X2)) -> mark(__(X1, X2))
     , __(mark(X1), X2) -> mark(__(X1, X2))
     , active(and(X1, X2)) -> and(active(X1), X2)
     , active(__(X1, X2)) -> __(X1, active(X2))
     , active(__(X1, X2)) -> __(active(X1), 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:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	60.04751ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds C

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.062637ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds C

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  top(ok(X)) -> top(active(X))
     , top(mark(X)) -> top(proper(X))
     , isPal(ok(X)) -> ok(isPal(X))
     , isNePal(ok(X)) -> ok(isNePal(X))
     , isQid(ok(X)) -> ok(isQid(X))
     , isNeList(ok(X)) -> ok(isNeList(X))
     , isList(ok(X)) -> ok(isList(X))
     , and(ok(X1), ok(X2)) -> ok(and(X1, X2))
     , __(ok(X1), ok(X2)) -> ok(__(X1, X2))
     , proper(u()) -> ok(u())
     , proper(o()) -> ok(o())
     , proper(i()) -> ok(i())
     , proper(e()) -> ok(e())
     , proper(a()) -> ok(a())
     , proper(isPal(X)) -> isPal(proper(X))
     , proper(isNePal(X)) -> isNePal(proper(X))
     , proper(isQid(X)) -> isQid(proper(X))
     , proper(isNeList(X)) -> isNeList(proper(X))
     , proper(isList(X)) -> isList(proper(X))
     , proper(tt()) -> ok(tt())
     , proper(and(X1, X2)) -> and(proper(X1), proper(X2))
     , proper(nil()) -> ok(nil())
     , proper(__(X1, X2)) -> __(proper(X1), proper(X2))
     , and(mark(X1), X2) -> mark(and(X1, X2))
     , __(X1, mark(X2)) -> mark(__(X1, X2))
     , __(mark(X1), X2) -> mark(__(X1, X2))
     , active(and(X1, X2)) -> and(active(X1), X2)
     , active(__(X1, X2)) -> __(X1, active(X2))
     , active(__(X1, X2)) -> __(active(X1), 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 IDA

Execution Time	60.064762ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds C

stdout:

Tool TRI

Execution Time	60.062603ms
Answer	TIMEOUT
Input	Transformed CSR 04 PALINDROME nokinds C

stdout:

Tool TRI2

Execution Time	1.3187642ms
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nokinds C