LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ a__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
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__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
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__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
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__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
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__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
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__and(tt(), X) -> mark(X)
, a__plus(N, 0()) -> mark(N)
, a__plus(N, s(M)) -> s(a__plus(mark(N), mark(M)))
, mark(and(X1, X2)) -> a__and(mark(X1), X2)
, mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2))
, mark(tt()) -> tt()
, mark(0()) -> 0()
, mark(s(X)) -> s(mark(X))
, a__and(X1, X2) -> and(X1, X2)
, a__plus(X1, X2) -> plus(X1, X2)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..