Problem Waldmann 07 size12 size-12-alpha-3-num-11

Tool Bounds

Execution Time60.032185ms
Answer
TIMEOUT
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool CDI

Execution Time60.03919ms
Answer
TIMEOUT
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

TIMEOUT

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

Tool EDA

Execution Time60.036484ms
Answer
TIMEOUT
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time60.043007ms
Answer
TIMEOUT
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI

Execution Time60.030327ms
Answer
TIMEOUT
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

TIMEOUT

We consider the following Problem:

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

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool TRI2

Execution Time0.14717007ms
Answer
MAYBE
InputWaldmann 07 size12 size-12-alpha-3-num-11

stdout:

MAYBE

We consider the following Problem:

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

Certificate: MAYBE

Proof:
  The input cannot be shown compatible

Arrrr..