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