Problem Zantema 05 jw19

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs:
    {f(x, f(a(), a())) -> f(f(f(a(), a()), a()), f(a(), x))}
  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() -> 4
   , a_1() -> 6
   , a_1() -> 7
   , a_1() -> 8
   , a_2() -> 12
   , a_2() -> 14
   , a_2() -> 15
   , a_2() -> 16
   , f_0(1, 1) -> 1
   , f_1(2, 3) -> 1
   , f_1(2, 9) -> 3
   , f_1(4, 1) -> 3
   , f_1(5, 6) -> 2
   , f_1(7, 8) -> 5
   , f_1(8, 2) -> 3
   , f_1(8, 4) -> 9
   , f_2(10, 11) -> 3
   , f_2(12, 2) -> 11
   , f_2(13, 14) -> 10
   , f_2(15, 16) -> 13}

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

Tool CDI

Execution Time	60.04193ms
Answer	TIMEOUT
Input	Zantema 05 jw19

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.03407ms
Answer	TIMEOUT
Input	Zantema 05 jw19

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.03066ms
Answer	TIMEOUT
Input	Zantema 05 jw19

stdout:

Tool TRI

Execution Time	60.027176ms
Answer	TIMEOUT
Input	Zantema 05 jw19

stdout:

Tool TRI2

Execution Time	0.23176908ms
Answer	MAYBE
Input	Zantema 05 jw19

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..