Problem AProVE 06 nonterm

Tool Bounds

Execution Time	2.7956009e-2ms
Answer	MAYBE
Input	AProVE 06 nonterm

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  id(0()) -> 0()
     , id(s(x)) -> s(id(x))
     , f(s(s(s(s(s(s(s(s(x)))))))), y, y) ->
       f(id(s(s(s(s(s(s(s(s(x))))))))), y, y)}
  StartTerms: all
  Strategy: none

Certificate: MAYBE

Proof:
  None of the processors succeeded.

  Details of failed attempt(s):
  -----------------------------
    1) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.

    2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.


Arrrr..

Tool CDI

Execution Time	60.0405ms
Answer	TIMEOUT
Input	AProVE 06 nonterm

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	61.37551ms
Answer	TIMEOUT
Input	AProVE 06 nonterm

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  id(0()) -> 0()
     , id(s(x)) -> s(id(x))
     , f(s(s(s(s(s(s(s(s(x)))))))), y, y) ->
       f(id(s(s(s(s(s(s(s(s(x))))))))), y, y)}
  StartTerms: all
  Strategy: none

Certificate: TIMEOUT

Proof:
  Computation stopped due to timeout after 60.0 seconds.

Arrrr..

Tool IDA

Execution Time	60.071846ms
Answer	TIMEOUT
Input	AProVE 06 nonterm

stdout:

Tool TRI

Execution Time	60.032116ms
Answer	TIMEOUT
Input	AProVE 06 nonterm

stdout:

Tool TRI2

Execution Time	0.7861831ms
Answer	MAYBE
Input	AProVE 06 nonterm