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