Problem Zantema 04 z108

Tool Bounds

Execution Time60.03212ms
Answer
TIMEOUT
InputZantema 04 z108

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time2.412956ms
Answer
MAYBE
InputZantema 04 z108

stdout:

MAYBE

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

Tool EDA

Execution Time3.20508ms
Answer
YES(?,O(n^3))
InputZantema 04 z108

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time60.030514ms
Answer
TIMEOUT
InputZantema 04 z108

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time0.8844249ms
Answer
YES(?,O(n^3))
InputZantema 04 z108

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time0.11876798ms
Answer
MAYBE
InputZantema 04 z108

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..