LMPO

Execution Time (secs)	0.095
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)	0.105
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)	0.076
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)	0.099
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)	0.062
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)	0.125
Answer	MAYBE
Input	Transformed CSR 04 PALINDROME nosorts noand GM

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a____(__(X, Y), Z) -> a____(mark(X), a____(mark(Y), mark(Z)))
     , a____(X, nil()) -> mark(X)
     , a____(nil(), X) -> mark(X)
     , a__U11(tt()) -> a__U12(tt())
     , a__U12(tt()) -> tt()
     , a__isNePal(__(I, __(P, I))) -> a__U11(tt())
     , mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
     , mark(U11(X)) -> a__U11(mark(X))
     , mark(U12(X)) -> a__U12(mark(X))
     , mark(isNePal(X)) -> a__isNePal(mark(X))
     , mark(nil()) -> nil()
     , mark(tt()) -> tt()
     , a____(X1, X2) -> __(X1, X2)
     , a__U11(X) -> U11(X)
     , a__U12(X) -> U12(X)
     , a__isNePal(X) -> isNePal(X)}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Problem Transformed CSR 04 PALINDROME nosorts noand GM

LMPO

MPO

POP*

POP* (PS)

Small POP*

Small POP* (PS)