Problem Zantema 04 z077

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(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

YES(?,PRIMREC)

We consider the following Problem:

  Strict Trs:
    {  f(0(x1)) -> s(0(x1))
     , d(0(x1)) -> 0(x1)
     , d(s(x1)) -> s(s(d(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: YES(?,PRIMREC)

Proof:
  The input was oriented with the instance of
  'multiset path orders' as induced by the precedence
  
   f > s, f > d, d > s .

Hurray, we answered YES(?,PRIMREC)

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(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

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(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

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(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

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(x1)))
     , f(s(x1)) -> d(f(x1))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..