LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
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:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
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:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
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:
{ sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
, sum(cons(0(), x), y) -> sum(x, y)
, sum(nil(), y) -> y
, weight(cons(n, cons(m, x))) ->
weight(sum(cons(n, cons(m, x)), cons(0(), x)))
, weight(cons(n, nil())) -> n}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..