Problem Zantema 06 09

Tool Bounds

Execution Time60.062813ms
Answer
TIMEOUT
InputZantema 06 09

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a(b(a(a(x1)))) -> b(a(b(a(x1))))
     , c(s(x1)) -> a(b(a(b(x1))))
     , b(a(b(b(x1)))) -> c(s(x1))
     , b(a(b(s(x1)))) -> a(b(s(a(x1))))
     , a(s(x1)) -> s(a(x1))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.038944ms
Answer
TIMEOUT
InputZantema 06 09

stdout:

TIMEOUT

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

Tool EDA

Execution Time60.038704ms
Answer
TIMEOUT
InputZantema 06 09

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a(b(a(a(x1)))) -> b(a(b(a(x1))))
     , c(s(x1)) -> a(b(a(b(x1))))
     , b(a(b(b(x1)))) -> c(s(x1))
     , b(a(b(s(x1)))) -> a(b(s(a(x1))))
     , a(s(x1)) -> s(a(x1))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.04867ms
Answer
TIMEOUT
InputZantema 06 09

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a(b(a(a(x1)))) -> b(a(b(a(x1))))
     , c(s(x1)) -> a(b(a(b(x1))))
     , b(a(b(b(x1)))) -> c(s(x1))
     , b(a(b(s(x1)))) -> a(b(s(a(x1))))
     , a(s(x1)) -> s(a(x1))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.03367ms
Answer
TIMEOUT
InputZantema 06 09

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  a(b(a(a(x1)))) -> b(a(b(a(x1))))
     , c(s(x1)) -> a(b(a(b(x1))))
     , b(a(b(b(x1)))) -> c(s(x1))
     , b(a(b(s(x1)))) -> a(b(s(a(x1))))
     , a(s(x1)) -> s(a(x1))}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.48557806ms
Answer
MAYBE
InputZantema 06 09

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  a(b(a(a(x1)))) -> b(a(b(a(x1))))
     , c(s(x1)) -> a(b(a(b(x1))))
     , b(a(b(b(x1)))) -> c(s(x1))
     , b(a(b(s(x1)))) -> a(b(s(a(x1))))
     , a(s(x1)) -> s(a(x1))}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..