Problem Mixed SRS 3

Tool Bounds

Execution Time60.058407ms
Answer
TIMEOUT
InputMixed SRS 3

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(b(x1))) -> a(c(a(x1)))
     , a(a(x1)) -> a(b(a(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time5.224922ms
Answer
MAYBE
InputMixed SRS 3

stdout:

MAYBE

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

Tool EDA

Execution Time8.129961ms
Answer
YES(?,O(n^4))
InputMixed SRS 3

stdout:

YES(?,O(n^4))

We consider the following Problem:

  Strict Trs:
    {  b(a(b(x1))) -> a(c(a(x1)))
     , a(a(x1)) -> a(b(a(x1)))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time60.028828ms
Answer
TIMEOUT
InputMixed SRS 3

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  b(a(b(x1))) -> a(c(a(x1)))
     , a(a(x1)) -> a(b(a(x1)))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time3.112773ms
Answer
YES(?,O(n^2))
InputMixed SRS 3

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  b(a(b(x1))) -> a(c(a(x1)))
     , a(a(x1)) -> a(b(a(x1)))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   a(x1) = [1 1 2 2 1] x1 + [0]
           [0 1 1 1 0]      [0]
           [0 0 0 0 0]      [2]
           [0 0 0 0 2]      [0]
           [0 0 0 0 0]      [1]
   b(x1) = [1 1 0 0 1] x1 + [0]
           [0 0 1 0 0]      [0]
           [0 0 0 1 0]      [0]
           [0 0 0 0 0]      [0]
           [0 0 0 0 0]      [1]
   c(x1) = [1 0 0 0 0] x1 + [0]
           [0 0 0 0 0]      [0]
           [0 0 0 0 0]      [0]
           [0 0 0 0 0]      [0]
           [0 0 0 0 0]      [0]

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

Tool TRI2

Execution Time0.14728498ms
Answer
MAYBE
InputMixed SRS 3

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  b(a(b(x1))) -> a(c(a(x1)))
     , a(a(x1)) -> a(b(a(x1)))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..