Problem AG01 3.31

Tool CaT

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

Problem:
 f(g(x)) -> f(a(g(g(f(x))),g(f(x))))

Proof:
 Open

Tool IRC1

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

Tool IRC2

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    innermost runtime-complexity with respect to
  Rules: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}

Proof Output:    
  None of the processors succeeded.
  
  Details of failed attempt(s):
  -----------------------------
    1) 'wdg' failed due to the following reason:
         Transformation Details:
         -----------------------
           We have computed the following set of weak (innermost) dependency pairs:
           
             {1: f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))}
           
           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)
           
             ->{1}                                                       [       MAYBE        ]
             
           
         
         Sub-problems:
         -------------
           * Path {1}: MAYBE
             ---------------
             
             The usable rules for this path are:
             
               {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             The weight gap principle does not apply:
               The input cannot be shown compatible
             Complexity induced by the adequate RMI: MAYBE
             
             We apply the sub-processor on the resulting sub-problem:
             
             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    innermost runtime-complexity with respect to
               Rules:
                 {  f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))
                  , f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             Proof Output:    
               The input cannot be shown compatible
    
    2) 'wdg' failed due to the following reason:
         Transformation Details:
         -----------------------
           We have computed the following set of weak (innermost) dependency pairs:
           
             {1: f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))}
           
           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)
           
             ->{1}                                                       [       MAYBE        ]
             
           
         
         Sub-problems:
         -------------
           * Path {1}: MAYBE
             ---------------
             
             The usable rules for this path are:
             
               {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             The weight gap principle does not apply:
               The input cannot be shown compatible
             Complexity induced by the adequate RMI: MAYBE
             
             We apply the sub-processor on the resulting sub-problem:
             
             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    innermost runtime-complexity with respect to
               Rules:
                 {  f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))
                  , f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             Proof Output:    
               The input cannot be shown compatible
    
    3) 'matrix-interpretation of dimension 1' failed due to the following reason:
         The input cannot be shown compatible
    
    4) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.
    
    5) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.
    

Tool RC1

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

Tool RC2

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

'Fastest (timeout of 60.0 seconds)'
-----------------------------------
Answer:           MAYBE
Input Problem:    runtime-complexity with respect to
  Rules: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}

Proof Output:    
  None of the processors succeeded.
  
  Details of failed attempt(s):
  -----------------------------
    1) 'wdg' failed due to the following reason:
         Transformation Details:
         -----------------------
           We have computed the following set of weak (innermost) dependency pairs:
           
             {1: f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))}
           
           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)
           
             ->{1}                                                       [       MAYBE        ]
             
           
         
         Sub-problems:
         -------------
           * Path {1}: MAYBE
             ---------------
             
             The usable rules for this path are:
             
               {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             The weight gap principle does not apply:
               The input cannot be shown compatible
             Complexity induced by the adequate RMI: MAYBE
             
             We apply the sub-processor on the resulting sub-problem:
             
             'matrix-interpretation of dimension 2'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    runtime-complexity with respect to
               Rules:
                 {  f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))
                  , f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             Proof Output:    
               The input cannot be shown compatible
    
    2) 'wdg' failed due to the following reason:
         Transformation Details:
         -----------------------
           We have computed the following set of weak (innermost) dependency pairs:
           
             {1: f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))}
           
           Following Dependency Graph (modulo SCCs) was computed. (Answers to
           subproofs are indicated to the right.)
           
             ->{1}                                                       [       MAYBE        ]
             
           
         
         Sub-problems:
         -------------
           * Path {1}: MAYBE
             ---------------
             
             The usable rules for this path are:
             
               {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             The weight gap principle does not apply:
               The input cannot be shown compatible
             Complexity induced by the adequate RMI: MAYBE
             
             We apply the sub-processor on the resulting sub-problem:
             
             'matrix-interpretation of dimension 1'
             --------------------------------------
             Answer:           MAYBE
             Input Problem:    runtime-complexity with respect to
               Rules:
                 {  f^#(g(x)) -> c_0(f^#(a(g(g(f(x))), g(f(x)))))
                  , f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
             
             Proof Output:    
               The input cannot be shown compatible
    
    3) 'matrix-interpretation of dimension 1' failed due to the following reason:
         The input cannot be shown compatible
    
    4) 'Bounds with perSymbol-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.
    
    5) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
         match-boundness of the problem could not be verified.
    

Tool pair1rc

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none

Certificate: MAYBE

Application of 'pair1 (timeout of 60.0 seconds)':
-------------------------------------------------
  The processor is not applicable, reason is:
   Input problem is not restricted to innermost rewriting
  
  We abort the transformation and continue with the subprocessor on the problem
  
  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none
  
  1) None of the processors succeeded.
     
     Details of failed attempt(s):
     -----------------------------
       1) 'dp' failed due to the following reason:
            We have computed the following dependency pairs
            
            Strict Dependency Pairs:
              {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
            
            We consider the following Problem:
            
              Strict DPs: {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
              Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
              StartTerms: basic terms
              Strategy: none
            
            Certificate: MAYBE
            
            Application of 'Fastest':
            -------------------------
              None of the processors succeeded.
              
              Details of failed attempt(s):
              -----------------------------
                '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) '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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                                 The input cannot be shown compatible
                            
                            2) '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 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 pair2rc

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none

Certificate: MAYBE

Application of 'pair2 (timeout of 60.0 seconds)':
-------------------------------------------------
  The processor is not applicable, reason is:
   Input problem is not restricted to innermost rewriting
  
  We abort the transformation and continue with the subprocessor on the problem
  
  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none
  
  1) None of the processors succeeded.
     
     Details of failed attempt(s):
     -----------------------------
       1) 'dp' failed due to the following reason:
            We have computed the following dependency pairs
            
            Strict Dependency Pairs:
              {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
            
            We consider the following Problem:
            
              Strict DPs: {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
              Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
              StartTerms: basic terms
              Strategy: none
            
            Certificate: MAYBE
            
            Application of 'Fastest':
            -------------------------
              None of the processors succeeded.
              
              Details of failed attempt(s):
              -----------------------------
                '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) '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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                                 The input cannot be shown compatible
                            
                            2) '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 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 pair3irc

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
  The input problem contains no overlaps that give rise to inapplicable rules.
  
  We abort the transformation and continue with the subprocessor on the problem
  
  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: innermost
  
  1) None of the processors succeeded.
     
     Details of failed attempt(s):
     -----------------------------
       1) 'dp' failed due to the following reason:
            We have computed the following dependency pairs
            
            Strict Dependency Pairs:
              {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
            
            We consider the following Problem:
            
              Strict DPs: {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
              Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
              StartTerms: basic terms
              Strategy: innermost
            
            Certificate: MAYBE
            
            Application of 'Fastest':
            -------------------------
              None of the processors succeeded.
              
              Details of failed attempt(s):
              -----------------------------
                '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) '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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                                 The input cannot be shown compatible
                            
                            2) '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'' failed due to the following reason:
                          match-boundness of the problem could not be verified.
                     
                     2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
                          match-boundness of the problem could not be verified.
                     
              
       
  

Arrrr..

Tool pair3rc

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none

Certificate: MAYBE

Application of 'pair3 (timeout of 60.0 seconds)':
-------------------------------------------------
  The processor is not applicable, reason is:
   Input problem is not restricted to innermost rewriting
  
  We abort the transformation and continue with the subprocessor on the problem
  
  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: none
  
  1) None of the processors succeeded.
     
     Details of failed attempt(s):
     -----------------------------
       1) 'dp' failed due to the following reason:
            We have computed the following dependency pairs
            
            Strict Dependency Pairs:
              {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
            
            We consider the following Problem:
            
              Strict DPs: {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
              Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
              StartTerms: basic terms
              Strategy: none
            
            Certificate: MAYBE
            
            Application of 'Fastest':
            -------------------------
              None of the processors succeeded.
              
              Details of failed attempt(s):
              -----------------------------
                '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) '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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                                 The input cannot be shown compatible
                            
                            2) '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'' failed due to the following reason:
                          match-boundness of the problem could not be verified.
                     
                     2) 'Bounds with minimal-enrichment and initial automaton 'match'' failed due to the following reason:
                          match-boundness of the problem could not be verified.
                     
              
       
  

Arrrr..

Tool rc

Execution TimeUnknown
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                              The input cannot be shown compatible
                         
                         2) '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 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) '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) 'dp' failed due to the following reason:
         We have computed the following dependency pairs
         
         Strict Dependency Pairs:
           {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
         
         We consider the following Problem:
         
           Strict DPs: {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))))}
           Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
           StartTerms: basic terms
           Strategy: none
         
         Certificate: MAYBE
         
         Application of 'usablerules':
         -----------------------------
           All rules are usable.
           
           No subproblems were generated.
    

Arrrr..

Tool tup3irc

Execution Time45.929325ms
Answer
MAYBE
InputAG01 3.31

stdout:

MAYBE

We consider the following Problem:

  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: innermost

Certificate: MAYBE

Application of 'tup3 (timeout of 60.0 seconds)':
------------------------------------------------
  The input problem contains no overlaps that give rise to inapplicable rules.
  
  We abort the transformation and continue with the subprocessor on the problem
  
  Strict Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
  StartTerms: basic terms
  Strategy: innermost
  
  1) None of the processors succeeded.
     
     Details of failed attempt(s):
     -----------------------------
       1) 'dp' failed due to the following reason:
            We have computed the following dependency pairs
            
            Strict Dependency Pairs:
              {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))), f^#(x), f^#(x))}
            
            We consider the following Problem:
            
              Strict DPs:
                {f^#(g(x)) -> c_1(f^#(a(g(g(f(x))), g(f(x)))), f^#(x), f^#(x))}
              Weak Trs: {f(g(x)) -> f(a(g(g(f(x))), g(f(x))))}
              StartTerms: basic terms
              Strategy: innermost
            
            Certificate: MAYBE
            
            Application of 'Fastest':
            -------------------------
              None of the processors succeeded.
              
              Details of failed attempt(s):
              -----------------------------
                '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) '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 3 (timeout of 100.0 seconds)' failed due to the following reason:
                                 The input cannot be shown compatible
                            
                            2) '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 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..