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