Problem Der95 09

Tool Bounds

Execution Time	7.5690017ms
Answer	MAYBE
Input	Der95 09

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {.(.(x, y), z) -> .(x, .(y, z))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	8.331609e-2ms
Answer	MAYBE
Input	Der95 09

stdout:

MAYBE

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

Tool EDA

Execution Time	0.2556951ms
Answer	YES(?,O(n^2))
Input	Der95 09

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs: {.(.(x, y), z) -> .(x, .(y, z))}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.34768605ms
Answer	YES(?,O(n^2))
Input	Der95 09

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs: {.(.(x, y), z) -> .(x, .(y, z))}
  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:
   .(x1, x2) = [1 1] x1 + [1 0] x2 + [1]
               [0 1]      [0 1]      [2]

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

Tool TRI

Execution Time	0.1083951ms
Answer	YES(?,O(n^2))
Input	Der95 09

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs: {.(.(x, y), z) -> .(x, .(y, z))}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	5.5103064e-2ms
Answer	YES(?,O(n^2))
Input	Der95 09

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs: {.(.(x, y), z) -> .(x, .(y, z))}
  StartTerms: all
  Strategy: none

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

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

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