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