Problem Zantema 05 jw30

Tool Bounds

Execution Time	5.798602e-2ms
Answer	YES(?,O(n^1))
Input	Zantema 05 jw30

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  The problem is match-bounded by 2.
  The enriched problem is compatible with the following automaton:
  {  a_0() -> 1
   , a_1() -> 5
   , a_1() -> 7
   , a_1() -> 8
   , a_1() -> 9
   , a_2() -> 13
   , a_2() -> 15
   , a_2() -> 16
   , a_2() -> 17
   , f_0(1, 1) -> 2
   , f_0(1, 2) -> 2
   , f_0(2, 1) -> 2
   , f_0(2, 2) -> 2
   , f_1(1, 9) -> 3
   , f_1(2, 9) -> 3
   , f_1(3, 4) -> 2
   , f_1(4, 9) -> 3
   , f_1(5, 6) -> 4
   , f_1(7, 8) -> 6
   , f_1(9, 9) -> 10
   , f_1(10, 4) -> 3
   , f_2(4, 17) -> 11
   , f_2(11, 12) -> 3
   , f_2(13, 14) -> 12
   , f_2(15, 16) -> 14}

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

Tool CDI

Execution Time	60.039715ms
Answer	TIMEOUT
Input	Zantema 05 jw30

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.033257ms
Answer	TIMEOUT
Input	Zantema 05 jw30

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.0308ms
Answer	TIMEOUT
Input	Zantema 05 jw30

stdout:

Tool TRI

Execution Time	60.02545ms
Answer	TIMEOUT
Input	Zantema 05 jw30

stdout:

Tool TRI2

Execution Time	0.24287415ms
Answer	MAYBE
Input	Zantema 05 jw30

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..