Problem Rubio 04 lescanne

Tool Bounds

Execution Time	55.857258ms
Answer	MAYBE
Input	Rubio 04 lescanne

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  div(div(X, Y), Z) -> div(Y, div(i(X), Z))
     , i(div(X, Y)) -> div(Y, X)
     , div(X, e()) -> i(X)}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  None of the processors succeeded.


Arrrr..

Tool CDI

Execution Time	0.6213381ms
Answer	MAYBE
Input	Rubio 04 lescanne

stdout:

MAYBE

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

Tool EDA

Execution Time	0.38347697ms
Answer	YES(?,O(n^2))
Input	Rubio 04 lescanne

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  div(div(X, Y), Z) -> div(Y, div(i(X), Z))
     , i(div(X, Y)) -> div(Y, X)
     , div(X, e()) -> i(X)}
  StartTerms: all
  Strategy: none

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

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

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

Tool IDA

Execution Time	0.606663ms
Answer	YES(?,O(n^2))
Input	Rubio 04 lescanne

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  div(div(X, Y), Z) -> div(Y, div(i(X), Z))
     , i(div(X, Y)) -> div(Y, X)
     , div(X, e()) -> i(X)}
  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:
   e() = [0]
         [0]
   div(x1, x2) = [1 1] x1 + [1 0] x2 + [1]
                 [0 1]      [0 1]      [3]
   i(x1) = [1 1] x1 + [0]
           [0 1]      [0]

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

Tool TRI

Execution Time	0.15089202ms
Answer	YES(?,O(n^2))
Input	Rubio 04 lescanne

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  div(div(X, Y), Z) -> div(Y, div(i(X), Z))
     , i(div(X, Y)) -> div(Y, X)
     , div(X, e()) -> i(X)}
  StartTerms: all
  Strategy: none

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

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

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

Tool TRI2

Execution Time	0.10586095ms
Answer	YES(?,O(n^2))
Input	Rubio 04 lescanne

stdout:

YES(?,O(n^2))

We consider the following Problem:

  Strict Trs:
    {  div(div(X, Y), Z) -> div(Y, div(i(X), Z))
     , i(div(X, Y)) -> div(Y, X)
     , div(X, e()) -> i(X)}
  StartTerms: all
  Strategy: none

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

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

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