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