LMPO
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
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__and(tt(), X) -> mark(X)
, a__isNePal(__(I, __(P, I))) -> tt()
, mark(__(X1, X2)) -> a____(mark(X1), mark(X2))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(isNePal(X)) -> a__isNePal(mark(X))
, mark(nil()) -> nil()
, mark(tt()) -> tt()
, a____(X1, X2) -> __(X1, X2)
, a__and(X1, X2) -> and(X1, X2)
, a__isNePal(X) -> isNePal(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..