LMPO
MAYBE
We consider the following Problem:
  Strict Trs:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
  Strict Trs:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
  Strict Trs:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  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:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  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:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  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:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(p(s(x1)))))
     , f(s(x1)) -> d(f(p(s(x1))))
     , p(s(x1)) -> x1}
  StartTerms: basic terms
  Strategy: innermost
Certificate: MAYBE
Proof:
  The input cannot be shown compatible
Arrrr..