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