Problem Zantema 06 beans1

Tool Bounds

Execution Time60.041958ms
Answer
TIMEOUT
InputZantema 06 beans1

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  0(2(R(x1))) -> 1(0(1(R(x1))))
     , L(2(0(x1))) -> L(1(0(1(x1))))
     , 0(2(0(x1))) -> 1(0(1(x1)))
     , 1(2(R(x1))) -> 2(0(1(R(x1))))
     , 1(2(0(x1))) -> 2(0(1(x1)))
     , L(2(1(x1))) -> L(1(0(2(x1))))
     , 0(2(1(x1))) -> 1(0(2(x1)))
     , 1(2(1(x1))) -> 2(0(2(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.039574ms
Answer
TIMEOUT
InputZantema 06 beans1

stdout:

TIMEOUT

Statistics:
Number of monomials: 4746
Last formula building started for bound 3
Last SAT solving started for bound 3

Tool EDA

Execution Time32.000313ms
Answer
YES(?,O(n^3))
InputZantema 06 beans1

stdout:

YES(?,O(n^3))

We consider the following Problem:

  Strict Trs:
    {  0(2(R(x1))) -> 1(0(1(R(x1))))
     , L(2(0(x1))) -> L(1(0(1(x1))))
     , 0(2(0(x1))) -> 1(0(1(x1)))
     , 1(2(R(x1))) -> 2(0(1(R(x1))))
     , 1(2(0(x1))) -> 2(0(1(x1)))
     , L(2(1(x1))) -> L(1(0(2(x1))))
     , 0(2(1(x1))) -> 1(0(2(x1)))
     , 1(2(1(x1))) -> 2(0(2(x1)))}
  StartTerms: all
  Strategy: none

Certificate: YES(?,O(n^3))

Proof:
  We have the following EDA-non-satisfying matrix interpretation:
  Interpretation Functions:
   1(x1) = [1 0 1] x1 + [0]
           [0 1 0]      [2]
           [0 0 1]      [0]
   2(x1) = [1 1 0] x1 + [0]
           [0 0 0]      [0]
           [0 1 1]      [1]
   0(x1) = [1 0 0] x1 + [2]
           [0 0 1]      [0]
           [0 0 0]      [1]
   L(x1) = [1 0 2] x1 + [0]
           [0 0 0]      [0]
           [0 0 0]      [0]
   R(x1) = [1 0 0] x1 + [0]
           [0 0 0]      [2]
           [0 0 0]      [0]

Hurray, we answered YES(?,O(n^3))

Tool IDA

Execution Time60.04982ms
Answer
TIMEOUT
InputZantema 06 beans1

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  0(2(R(x1))) -> 1(0(1(R(x1))))
     , L(2(0(x1))) -> L(1(0(1(x1))))
     , 0(2(0(x1))) -> 1(0(1(x1)))
     , 1(2(R(x1))) -> 2(0(1(R(x1))))
     , 1(2(0(x1))) -> 2(0(1(x1)))
     , L(2(1(x1))) -> L(1(0(2(x1))))
     , 0(2(1(x1))) -> 1(0(2(x1)))
     , 1(2(1(x1))) -> 2(0(2(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.034634ms
Answer
TIMEOUT
InputZantema 06 beans1

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  0(2(R(x1))) -> 1(0(1(R(x1))))
     , L(2(0(x1))) -> L(1(0(1(x1))))
     , 0(2(0(x1))) -> 1(0(1(x1)))
     , 1(2(R(x1))) -> 2(0(1(R(x1))))
     , 1(2(0(x1))) -> 2(0(1(x1)))
     , L(2(1(x1))) -> L(1(0(2(x1))))
     , 0(2(1(x1))) -> 1(0(2(x1)))
     , 1(2(1(x1))) -> 2(0(2(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time1.346729ms
Answer
MAYBE
InputZantema 06 beans1

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  0(2(R(x1))) -> 1(0(1(R(x1))))
     , L(2(0(x1))) -> L(1(0(1(x1))))
     , 0(2(0(x1))) -> 1(0(1(x1)))
     , 1(2(R(x1))) -> 2(0(1(R(x1))))
     , 1(2(0(x1))) -> 2(0(1(x1)))
     , L(2(1(x1))) -> L(1(0(2(x1))))
     , 0(2(1(x1))) -> 1(0(2(x1)))
     , 1(2(1(x1))) -> 2(0(2(x1)))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..