Problem SK90 2.25

LMPO

Execution Time (secs)
0.039
Answer
MAYBE
InputSK90 2.25
MAYBE

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.062
Answer
YES(?,PRIMREC)
InputSK90 2.25
YES(?,PRIMREC)

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  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
  
   fib > +, + > s .

Hurray, we answered YES(?,PRIMREC)

POP*

Execution Time (secs)
0.079
Answer
MAYBE
InputSK90 2.25
MAYBE

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.038
Answer
MAYBE
InputSK90 2.25
MAYBE

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.046
Answer
MAYBE
InputSK90 2.25
MAYBE

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.039
Answer
MAYBE
InputSK90 2.25
MAYBE

We consider the following Problem:

  Strict Trs:
    {  fib(0()) -> 0()
     , fib(s(0())) -> s(0())
     , fib(s(s(x))) -> +(fib(s(x)), fib(x))
     , +(x, 0()) -> x
     , +(x, s(y)) -> s(+(x, y))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..