Problem TCT 09 expantiinn

LMPO

Execution Time (secs)
0.030
Answer
MAYBE
InputTCT 09 expantiinn
MAYBE

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

MPO

Execution Time (secs)
0.038
Answer
YES(?,PRIMREC)
InputTCT 09 expantiinn
YES(?,PRIMREC)

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: YES(?,PRIMREC)

Proof:
  The input was oriented with the instance of
  'multiset path orders' as induced by the precedence
  
   d > s, e > s, r > d, r > e .

Hurray, we answered YES(?,PRIMREC)

POP*

Execution Time (secs)
0.030
Answer
MAYBE
InputTCT 09 expantiinn
MAYBE

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

POP* (PS)

Execution Time (secs)
0.027
Answer
MAYBE
InputTCT 09 expantiinn
MAYBE

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP*

Execution Time (secs)
0.052
Answer
MAYBE
InputTCT 09 expantiinn
MAYBE

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..

Small POP* (PS)

Execution Time (secs)
0.024
Answer
MAYBE
InputTCT 09 expantiinn
MAYBE

We consider the following Problem:

  Strict Trs:
    {  d(0()) -> 0()
     , d(s(x)) -> s(s(d(x)))
     , e(0()) -> s(0())
     , e(r(x)) -> d(e(x))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..