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