Problem Zantema 05 jw34

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

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

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

Proof:
  The problem is match-bounded by 1.
  The enriched problem is compatible with the following automaton:
  {  a_0() -> 1
   , a_1() -> 3
   , a_1() -> 5
   , a_1() -> 7
   , a_1() -> 8
   , f_0(1, 1) -> 1
   , f_1(1, 4) -> 2
   , f_1(2, 3) -> 1
   , f_1(4, 4) -> 9
   , f_1(5, 6) -> 4
   , f_1(7, 8) -> 6
   , f_1(9, 8) -> 2}

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

Tool CDI

Execution Time	60.04181ms
Answer	TIMEOUT
Input	Zantema 05 jw34

stdout:

TIMEOUT

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

Tool EDA

Execution Time	60.032486ms
Answer	TIMEOUT
Input	Zantema 05 jw34

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.065468ms
Answer	TIMEOUT
Input	Zantema 05 jw34

stdout:

Tool TRI

Execution Time	60.0262ms
Answer	TIMEOUT
Input	Zantema 05 jw34

stdout:

Tool TRI2

Execution Time	0.3258469ms
Answer	MAYBE
Input	Zantema 05 jw34

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..