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