LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
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:
{ max(L(x)) -> x
, max(N(L(0()), L(y))) -> y
, max(N(L(s(x)), L(s(y)))) -> s(max(N(L(x), L(y))))
, max(N(L(x), N(y, z))) -> max(N(L(x), L(max(N(y, z)))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..