Problem AG01 innermost 4.21

Tool Bounds

Execution Time	60.028637ms
Answer	TIMEOUT
Input	AG01 innermost 4.21

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time	0.3097601ms
Answer	MAYBE
Input	AG01 innermost 4.21

stdout:

MAYBE

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

Tool EDA

Execution Time	1.0960059ms
Answer	YES(?,O(n^3))
Input	AG01 innermost 4.21

stdout:

YES(?,O(n^3))

We consider the following Problem:

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

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

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

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

Tool IDA

Execution Time	1.738585ms
Answer	YES(?,O(n^1))
Input	AG01 innermost 4.21

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI

Execution Time	0.34199095ms
Answer	YES(?,O(n^1))
Input	AG01 innermost 4.21

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

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

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

Tool TRI2

Execution Time	0.13215804ms
Answer	MAYBE
Input	AG01 innermost 4.21

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..