Problem AG01 innermost 4.23

LMPO

Execution Time (secs)
0.050
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.063
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.051
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.050
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.054
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.059
Answer
MAYBE
InputAG01 innermost 4.23
MAYBE

We consider the following Problem:

  Strict Trs:
    {  quot(0(), s(y), s(z)) -> 0()
     , quot(s(x), s(y), z) -> quot(x, y, z)
     , plus(0(), y) -> y
     , plus(s(x), y) -> s(plus(x, y))
     , quot(x, 0(), s(z)) -> s(quot(x, plus(z, s(0())), s(z)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..