Problem Zantema 05 jw05

Tool Bounds

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

stdout:

YES(?,O(n^1))

We consider the following Problem:

  Strict Trs: {f(f(a(), x), a()) -> f(f(x, 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() -> 4
   , a_1() -> 6
   , a_1() -> 7
   , f_0(1, 1) -> 2
   , f_0(1, 2) -> 2
   , f_0(2, 1) -> 2
   , f_0(2, 2) -> 2
   , f_1(1, 5) -> 3
   , f_1(2, 5) -> 3
   , f_1(3, 4) -> 2
   , f_1(5, 5) -> 3
   , f_1(6, 7) -> 5}

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

Tool CDI

Execution Time	34.86997ms
Answer	MAYBE
Input	Zantema 05 jw05

stdout:

MAYBE

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

Tool EDA

Execution Time	60.029747ms
Answer	TIMEOUT
Input	Zantema 05 jw05

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs: {f(f(a(), x), a()) -> f(f(x, 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.02855ms
Answer	TIMEOUT
Input	Zantema 05 jw05

stdout:

Tool TRI

Execution Time	60.025772ms
Answer	TIMEOUT
Input	Zantema 05 jw05

stdout:

Tool TRI2

Execution Time	0.22133517ms
Answer	MAYBE
Input	Zantema 05 jw05

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..