Problem Strategy outermost added 08 Ex14 AEGL02 L

LMPO

Execution Time (secs)
0.023
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.024
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP*

Execution Time (secs)
0.018
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.021
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.033
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.027
Answer
MAYBE
InputStrategy outermost added 08 Ex14 AEGL02 L
MAYBE

We consider the following Problem:

  Strict Trs:
    {  from(X) -> cons(X)
     , length() -> 0()
     , length() -> s(length1())
     , length1() -> length()}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..