LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ and(tt(), tt()) -> tt()
, is_nat(0()) -> tt()
, is_nat(s(x)) -> is_nat(x)
, is_natlist(nil()) -> tt()
, is_natlist(cons(x, xs)) -> and(is_nat(x), is_natlist(xs))
, from(x) -> fromCond(is_natlist(x), x)
, fromCond(tt(), cons(x, xs)) -> from(cons(s(x), cons(x, xs)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..