Problem Zantema 05 jw47

Tool Bounds

Execution Time60.033504ms
Answer
TIMEOUT
InputZantema 05 jw47

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {f(f(a(), f(x, a())), a()) -> f(a(), f(f(x, a()), a()))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.03973ms
Answer
TIMEOUT
InputZantema 05 jw47

stdout:

TIMEOUT

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

Tool EDA

Execution Time0.6046679ms
Answer
YES(?,O(n^2))
InputZantema 05 jw47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {f(f(a(), f(x, a())), a()) -> f(a(), f(f(x, a()), a()))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time0.83596516ms
Answer
YES(?,O(n^2))
InputZantema 05 jw47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {f(f(a(), f(x, a())), a()) -> f(a(), f(f(x, a()), a()))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following EDA-non-satisfying and IDA(2)-non-satisfying matrix interpretation:
  Interpretation Functions:
   a() = [0]
         [0]
   f(x1, x2) = [1 2] x1 + [1 0] x2 + [0]
               [0 1]      [0 1]      [2]

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

Tool TRI

Execution Time0.24433494ms
Answer
YES(?,O(n^2))
InputZantema 05 jw47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {f(f(a(), f(x, a())), a()) -> f(a(), f(f(x, a()), a()))}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time0.23424697ms
Answer
YES(?,O(n^2))
InputZantema 05 jw47

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {f(f(a(), f(x, a())), a()) -> f(a(), f(f(x, a()), a()))}
  StartTerms: all
  Strategy: none

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

Proof:
  We have the following triangular matrix interpretation:
  Interpretation Functions:
   a() = [0]
         [1]
   f(x1, x2) = [1 1] x1 + [1 0] x2 + [0]
               [0 1]      [0 1]      [0]

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