Problem AProVE 10 halfdouble

LMPO

Execution Time (secs)
0.050
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.046
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.113
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.051
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.060
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.045
Answer
MAYBE
InputAProVE 10 halfdouble
MAYBE

We consider the following Problem:

  Strict Trs:
    {  f(tt(), x) -> f(eq(x, half(double(x))), s(x))
     , eq(s(x), s(y)) -> eq(x, y)
     , eq(0(), 0()) -> tt()
     , double(s(x)) -> s(s(double(x)))
     , double(0()) -> 0()
     , half(s(s(x))) -> s(half(x))
     , half(0()) -> 0()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..