Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
Execution Time | 0.053 |
---|
Answer | YES(?,PRIMREC) |
---|
Input | AG01 3.16 |
---|
stdout:
YES(?,PRIMREC)
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,PRIMREC)
Proof:
The input was oriented with the instance of
'multiset path orders' as induced by the precedence
times > plus, plus > s .
Hurray, we answered YES(?,PRIMREC)
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ times(x, 0()) -> 0()
, times(x, s(y)) -> plus(times(x, y), x)
, plus(x, 0()) -> x
, plus(0(), x) -> x
, plus(x, s(y)) -> s(plus(x, y))
, plus(s(x), y) -> s(plus(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..