Problem AG01 innermost 4.33

LMPO

Execution Time (secs)
0.070
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.100
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.068
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.062
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.067
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.076
Answer
MAYBE
InputAG01 innermost 4.33
MAYBE

We consider the following Problem:

  Strict Trs:
    {  sum(cons(s(n), x), cons(m, y)) -> sum(cons(n, x), cons(s(m), y))
     , sum(cons(0(), x), y) -> sum(x, y)
     , sum(nil(), y) -> y
     , weight(cons(n, cons(m, x))) ->
       weight(sum(cons(n, cons(m, x)), cons(0(), x)))
     , weight(cons(n, nil())) -> n}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..