Problem Zantema 04 z116

Tool Bounds

Execution Time60.031ms
Answer
TIMEOUT
InputZantema 04 z116

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time1.2209718ms
Answer
MAYBE
InputZantema 04 z116

stdout:

MAYBE

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

Tool EDA

Execution Time60.03121ms
Answer
TIMEOUT
InputZantema 04 z116

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.034ms
Answer
TIMEOUT
InputZantema 04 z116

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time4.665681ms
Answer
YES(?,O(n^2))
InputZantema 04 z116

stdout:

YES(?,O(n^2))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time0.118728876ms
Answer
MAYBE
InputZantema 04 z116

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..