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