Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
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:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
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:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
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:
{ from(X) -> cons(X)
, length() -> 0()
, length() -> s(length1())
, length1() -> length()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..