LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(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(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(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(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(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(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(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(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(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(true(), x, y) ->
f(and(gt(x, y), gt(y, s(s(0())))), plus(s(0()), x), double(y))
, gt(0(), v) -> false()
, gt(s(u), 0()) -> true()
, gt(s(u), s(v)) -> gt(u, v)
, and(x, true()) -> x
, and(x, false()) -> false()
, plus(n, 0()) -> n
, plus(n, s(m)) -> s(plus(n, m))
, double(0()) -> 0()
, double(s(x)) -> s(s(double(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..