Problem AProVE 06 nonterm

LMPO

Execution Time (secs)
0.068
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.089
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.088
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.075
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.074
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.061
Answer
MAYBE
InputAProVE 06 nonterm
MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..