Problem Maude 06 MYNAT nosorts-peanoSimple

Tool IRC1

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Maude 06 MYNAT nosorts-peanoSimple

stdout:

YES(?,O(n^1))

Tool IRC2

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Maude 06 MYNAT nosorts-peanoSimple

stdout:

YES(?,O(n^1))

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           YES(?,O(n^1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  and(tt(), X) -> X
     , plus(N, 0()) -> N
     , plus(N, s(M)) -> s(plus(N, M))}

Proof Output:
  'Bounds with minimal-enrichment and initial automaton 'match'' proved the best result:

  Details:
  --------
    'Bounds with minimal-enrichment and initial automaton 'match'' succeeded with the following output:
     'Bounds with minimal-enrichment and initial automaton 'match''
     --------------------------------------------------------------
     Answer:           YES(?,O(n^1))
     Input Problem:    innermost runtime-complexity with respect to
       Rules:
         {  and(tt(), X) -> X
          , plus(N, 0()) -> N
          , plus(N, s(M)) -> s(plus(N, M))}

     Proof Output:
       The problem is match-bounded by 1.
       The enriched problem is compatible with the following automaton:
       {  and_0(2, 2) -> 1
        , tt_0() -> 1
        , tt_0() -> 2
        , tt_0() -> 3
        , plus_0(2, 2) -> 1
        , plus_1(2, 2) -> 3
        , 0_0() -> 1
        , 0_0() -> 2
        , 0_0() -> 3
        , s_0(2) -> 1
        , s_0(2) -> 2
        , s_0(2) -> 3
        , s_1(3) -> 1
        , s_1(3) -> 3}

Tool RC1

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Maude 06 MYNAT nosorts-peanoSimple

stdout:

YES(?,O(n^1))

Tool RC2

Execution Time	Unknown
Answer	YES(?,O(n^1))
Input	Maude 06 MYNAT nosorts-peanoSimple

stdout:

YES(?,O(n^1))

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           YES(?,O(n^1))
Input Problem:    runtime-complexity with respect to
  Rules:
    {  and(tt(), X) -> X
     , plus(N, 0()) -> N
     , plus(N, s(M)) -> s(plus(N, M))}

Proof Output:
  'Bounds with minimal-enrichment and initial automaton 'match'' proved the best result:

  Details:
  --------
    'Bounds with minimal-enrichment and initial automaton 'match'' succeeded with the following output:
     'Bounds with minimal-enrichment and initial automaton 'match''
     --------------------------------------------------------------
     Answer:           YES(?,O(n^1))
     Input Problem:    runtime-complexity with respect to
       Rules:
         {  and(tt(), X) -> X
          , plus(N, 0()) -> N
          , plus(N, s(M)) -> s(plus(N, M))}

     Proof Output:
       The problem is match-bounded by 1.
       The enriched problem is compatible with the following automaton:
       {  and_0(2, 2) -> 1
        , tt_0() -> 1
        , tt_0() -> 2
        , tt_0() -> 3
        , plus_0(2, 2) -> 1
        , plus_1(2, 2) -> 3
        , 0_0() -> 1
        , 0_0() -> 2
        , 0_0() -> 3
        , s_0(2) -> 1
        , s_0(2) -> 2
        , s_0(2) -> 3
        , s_1(3) -> 1
        , s_1(3) -> 3}