Problem AG01 3.22

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.22

stdout:

MAYBE

Problem:
 times(x,plus(y,s(z))) -> plus(times(x,plus(y,times(s(z),0()))),times(x,s(z)))
 times(x,0()) -> 0()
 times(x,s(y)) -> plus(times(x,y),x)
 plus(x,0()) -> x
 plus(x,s(y)) -> s(plus(x,y))

Proof:
 Open

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.22

stdout:

MAYBE

Tool IRC2

Execution TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.22

stdout:

MAYBE

Tool RC2

Execution TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           TIMEOUT
Input Problem:    runtime-complexity with respect to
  Rules:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}

Proof Output:    
  Computation stopped due to timeout after 60.0 seconds

Tool pair1rc

Execution TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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 TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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 TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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 TimeUnknown
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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 TimeUnknown
Answer
MAYBE
InputAG01 3.22

stdout:

MAYBE

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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):
                       -----------------------------
                         '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:
           {  times^#(x, plus(y, s(z))) ->
              c_1(plus^#(times(x, plus(y, times(s(z), 0()))), times(x, s(z))))
            , times^#(x, 0()) -> c_2()
            , times^#(x, s(y)) -> c_3(plus^#(times(x, y), x))
            , plus^#(x, 0()) -> c_4(x)
            , plus^#(x, s(y)) -> c_5(plus^#(x, y))}
         
         We consider the following Problem:
         
           Strict DPs:
             {  times^#(x, plus(y, s(z))) ->
                c_1(plus^#(times(x, plus(y, times(s(z), 0()))), times(x, s(z))))
              , times^#(x, 0()) -> c_2()
              , times^#(x, s(y)) -> c_3(plus^#(times(x, y), x))
              , plus^#(x, 0()) -> c_4(x)
              , plus^#(x, s(y)) -> c_5(plus^#(x, y))}
           Strict Trs:
             {  times(x, plus(y, s(z))) ->
                plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
              , times(x, 0()) -> 0()
              , times(x, s(y)) -> plus(times(x, y), x)
              , plus(x, 0()) -> x
              , plus(x, s(y)) -> s(plus(x, y))}
           StartTerms: basic terms
           Strategy: none
         
         Certificate: MAYBE
         
         Application of 'usablerules':
         -----------------------------
           All rules are usable.
           
           No subproblems were generated.
    

Arrrr..

Tool tup3irc

Execution Time60.07954ms
Answer
TIMEOUT
InputAG01 3.22

stdout:

TIMEOUT

We consider the following Problem:

  Strict Trs:
    {  times(x, plus(y, s(z))) ->
       plus(times(x, plus(y, times(s(z), 0()))), times(x, s(z)))
     , times(x, 0()) -> 0()
     , times(x, s(y)) -> plus(times(x, y), x)
     , plus(x, 0()) -> x
     , plus(x, s(y)) -> s(plus(x, y))}
  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..