Problem AG01 3.38

Tool CaT

Execution Time	Unknown
Answer	MAYBE
Input	AG01 3.38

stdout:

MAYBE

Problem:
rev(nil()) -> nil()
rev(cons(x,l)) -> cons(rev1(x,l),rev2(x,l))
rev1(0(),nil()) -> 0()
rev1(s(x),nil()) -> s(x)
rev1(x,cons(y,l)) -> rev1(y,l)
rev2(x,nil()) -> nil()
rev2(x,cons(y,l)) -> rev(cons(x,rev2(y,l)))

Proof:
Open

Tool IRC1

Execution Time	Unknown
Answer	MAYBE
Input	AG01 3.38

stdout:

MAYBE

Tool IRC2

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution Time	Unknown
Answer	MAYBE
Input	AG01 3.38

stdout:

MAYBE

Tool RC2

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}

Proof Output:
  Computation stopped due to timeout after 60.0 seconds

Tool pair1rc

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: none

Certificate: TIMEOUT

Application of 'pair1 (timeout of 60.0 seconds)':
-------------------------------------------------
  Computation stopped due to timeout after 60.0 seconds

Arrrr..

Tool pair2rc

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: none

Certificate: TIMEOUT

Application of 'pair2 (timeout of 60.0 seconds)':
-------------------------------------------------
  Computation stopped due to timeout after 60.0 seconds

Arrrr..

Tool pair3irc

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: TIMEOUT

Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
  Computation stopped due to timeout after 60.0 seconds

Arrrr..

Tool pair3rc

Execution Time	Unknown
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: none

Certificate: TIMEOUT

Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
  Computation stopped due to timeout after 60.0 seconds

Arrrr..

Tool rc

Execution Time	Unknown
Answer	MAYBE
Input	AG01 3.38

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: none

Certificate: MAYBE

Application of 'rc (timeout of 60.0 seconds)':
----------------------------------------------
  None of the processors succeeded.

  Details of failed attempt(s):
  -----------------------------
    1) 'Fastest' failed due to the following reason:
         None of the processors succeeded.

         Details of failed attempt(s):
         -----------------------------
           1) 'Sequentially' failed due to the following reason:
                None of the processors succeeded.

                Details of failed attempt(s):
                -----------------------------
                  1) 'empty' failed due to the following reason:
                       Empty strict component of the problem is NOT empty.

                  2) 'Fastest' failed due to the following reason:
                       None of the processors succeeded.

                       Details of failed attempt(s):
                       -----------------------------
                         1) 'matrix-interpretation of dimension 4 (timeout of 100.0 seconds)' failed due to the following reason:
                              The input cannot be shown compatible

                         2) 'matrix-interpretation of dimension 3 (timeout of 100.0 seconds)' failed due to the following reason:
                              The input cannot be shown compatible

                         3) 'matrix-interpretation of dimension 2 (timeout of 100.0 seconds)' failed due to the following reason:
                              The input cannot be shown compatible



           2) 'Fastest' failed due to the following reason:
                None of the processors succeeded.

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

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



    2) 'dp' failed due to the following reason:
         We have computed the following dependency pairs

         Strict Dependency Pairs:
           {  rev^#(nil()) -> c_1()
            , rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
            , rev1^#(0(), nil()) -> c_3()
            , rev1^#(s(x), nil()) -> c_4(x)
            , rev1^#(x, cons(y, l)) -> c_5(rev1^#(y, l))
            , rev2^#(x, nil()) -> c_6()
            , rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l))))}

         We consider the following Problem:

           Strict DPs:
             {  rev^#(nil()) -> c_1()
              , rev^#(cons(x, l)) -> c_2(rev1^#(x, l), rev2^#(x, l))
              , rev1^#(0(), nil()) -> c_3()
              , rev1^#(s(x), nil()) -> c_4(x)
              , rev1^#(x, cons(y, l)) -> c_5(rev1^#(y, l))
              , rev2^#(x, nil()) -> c_6()
              , rev2^#(x, cons(y, l)) -> c_7(rev^#(cons(x, rev2(y, l))))}
           Strict Trs:
             {  rev(nil()) -> nil()
              , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
              , rev1(0(), nil()) -> 0()
              , rev1(s(x), nil()) -> s(x)
              , rev1(x, cons(y, l)) -> rev1(y, l)
              , rev2(x, nil()) -> nil()
              , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
           StartTerms: basic terms
           Strategy: none

         Certificate: MAYBE

         Application of 'usablerules':
         -----------------------------
           All rules are usable.

           No subproblems were generated.


Arrrr..

Tool tup3irc

Execution Time	60.071354ms
Answer	TIMEOUT
Input	AG01 3.38

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  rev(nil()) -> nil()
     , rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
     , rev1(0(), nil()) -> 0()
     , rev1(s(x), nil()) -> s(x)
     , rev1(x, cons(y, l)) -> rev1(y, l)
     , rev2(x, nil()) -> nil()
     , rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: TIMEOUT

Application of 'tup3 (timeout of 60.0 seconds)':
------------------------------------------------
  Computation stopped due to timeout after 60.0 seconds

Arrrr..