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