MAYBE 730.39/297.03 MAYBE 730.39/297.03 730.39/297.03 We are left with following problem, upon which TcT provides the 730.39/297.03 certificate MAYBE. 730.39/297.03 730.39/297.03 Strict Trs: 730.39/297.03 { a__f(X1, X2, X3) -> f(X1, X2, X3) 730.39/297.03 , a__f(a(), b(), X) -> a__f(X, X, mark(X)) 730.39/297.03 , mark(a()) -> a() 730.39/297.03 , mark(b()) -> b() 730.39/297.03 , mark(f(X1, X2, X3)) -> a__f(X1, X2, mark(X3)) 730.39/297.03 , mark(c()) -> a__c() 730.39/297.03 , a__c() -> a() 730.39/297.03 , a__c() -> b() 730.39/297.03 , a__c() -> c() } 730.39/297.03 Obligation: 730.39/297.03 innermost runtime complexity 730.39/297.03 Answer: 730.39/297.03 MAYBE 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'Best' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 730.39/297.03 following reason: 730.39/297.03 730.39/297.03 Computation stopped due to timeout after 297.0 seconds. 730.39/297.03 730.39/297.03 2) 'Best' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 730.39/297.03 seconds)' failed due to the following reason: 730.39/297.03 730.39/297.03 The weightgap principle applies (using the following nonconstant 730.39/297.03 growth matrix-interpretation) 730.39/297.03 730.39/297.03 The following argument positions are usable: 730.39/297.03 Uargs(a__f) = {3} 730.39/297.03 730.39/297.03 TcT has computed the following matrix interpretation satisfying 730.39/297.03 not(EDA) and not(IDA(1)). 730.39/297.03 730.39/297.03 [a__f](x1, x2, x3) = [1] x3 + [7] 730.39/297.03 730.39/297.03 [a] = [7] 730.39/297.03 730.39/297.03 [b] = [7] 730.39/297.03 730.39/297.03 [mark](x1) = [1] x1 + [7] 730.39/297.03 730.39/297.03 [a__c] = [3] 730.39/297.03 730.39/297.03 [f](x1, x2, x3) = [1] x3 + [7] 730.39/297.03 730.39/297.03 [c] = [7] 730.39/297.03 730.39/297.03 The order satisfies the following ordering constraints: 730.39/297.03 730.39/297.03 [a__f(X1, X2, X3)] = [1] X3 + [7] 730.39/297.03 >= [1] X3 + [7] 730.39/297.03 = [f(X1, X2, X3)] 730.39/297.03 730.39/297.03 [a__f(a(), b(), X)] = [1] X + [7] 730.39/297.03 ? [1] X + [14] 730.39/297.03 = [a__f(X, X, mark(X))] 730.39/297.03 730.39/297.03 [mark(a())] = [14] 730.39/297.03 > [7] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [mark(b())] = [14] 730.39/297.03 > [7] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [mark(f(X1, X2, X3))] = [1] X3 + [14] 730.39/297.03 >= [1] X3 + [14] 730.39/297.03 = [a__f(X1, X2, mark(X3))] 730.39/297.03 730.39/297.03 [mark(c())] = [14] 730.39/297.03 > [3] 730.39/297.03 = [a__c()] 730.39/297.03 730.39/297.03 [a__c()] = [3] 730.39/297.03 ? [7] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [a__c()] = [3] 730.39/297.03 ? [7] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [a__c()] = [3] 730.39/297.03 ? [7] 730.39/297.03 = [c()] 730.39/297.03 730.39/297.03 730.39/297.03 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 730.39/297.03 730.39/297.03 We are left with following problem, upon which TcT provides the 730.39/297.03 certificate MAYBE. 730.39/297.03 730.39/297.03 Strict Trs: 730.39/297.03 { a__f(X1, X2, X3) -> f(X1, X2, X3) 730.39/297.03 , a__f(a(), b(), X) -> a__f(X, X, mark(X)) 730.39/297.03 , mark(f(X1, X2, X3)) -> a__f(X1, X2, mark(X3)) 730.39/297.03 , a__c() -> a() 730.39/297.03 , a__c() -> b() 730.39/297.03 , a__c() -> c() } 730.39/297.03 Weak Trs: 730.39/297.03 { mark(a()) -> a() 730.39/297.03 , mark(b()) -> b() 730.39/297.03 , mark(c()) -> a__c() } 730.39/297.03 Obligation: 730.39/297.03 innermost runtime complexity 730.39/297.03 Answer: 730.39/297.03 MAYBE 730.39/297.03 730.39/297.03 The weightgap principle applies (using the following nonconstant 730.39/297.03 growth matrix-interpretation) 730.39/297.03 730.39/297.03 The following argument positions are usable: 730.39/297.03 Uargs(a__f) = {3} 730.39/297.03 730.39/297.03 TcT has computed the following matrix interpretation satisfying 730.39/297.03 not(EDA) and not(IDA(1)). 730.39/297.03 730.39/297.03 [a__f](x1, x2, x3) = [1] x3 + [7] 730.39/297.03 730.39/297.03 [a] = [5] 730.39/297.03 730.39/297.03 [b] = [5] 730.39/297.03 730.39/297.03 [mark](x1) = [1] x1 + [7] 730.39/297.03 730.39/297.03 [a__c] = [6] 730.39/297.03 730.39/297.03 [f](x1, x2, x3) = [1] x3 + [7] 730.39/297.03 730.39/297.03 [c] = [3] 730.39/297.03 730.39/297.03 The order satisfies the following ordering constraints: 730.39/297.03 730.39/297.03 [a__f(X1, X2, X3)] = [1] X3 + [7] 730.39/297.03 >= [1] X3 + [7] 730.39/297.03 = [f(X1, X2, X3)] 730.39/297.03 730.39/297.03 [a__f(a(), b(), X)] = [1] X + [7] 730.39/297.03 ? [1] X + [14] 730.39/297.03 = [a__f(X, X, mark(X))] 730.39/297.03 730.39/297.03 [mark(a())] = [12] 730.39/297.03 > [5] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [mark(b())] = [12] 730.39/297.03 > [5] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [mark(f(X1, X2, X3))] = [1] X3 + [14] 730.39/297.03 >= [1] X3 + [14] 730.39/297.03 = [a__f(X1, X2, mark(X3))] 730.39/297.03 730.39/297.03 [mark(c())] = [10] 730.39/297.03 > [6] 730.39/297.03 = [a__c()] 730.39/297.03 730.39/297.03 [a__c()] = [6] 730.39/297.03 > [5] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [a__c()] = [6] 730.39/297.03 > [5] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [a__c()] = [6] 730.39/297.03 > [3] 730.39/297.03 = [c()] 730.39/297.03 730.39/297.03 730.39/297.03 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 730.39/297.03 730.39/297.03 We are left with following problem, upon which TcT provides the 730.39/297.03 certificate MAYBE. 730.39/297.03 730.39/297.03 Strict Trs: 730.39/297.03 { a__f(X1, X2, X3) -> f(X1, X2, X3) 730.39/297.03 , a__f(a(), b(), X) -> a__f(X, X, mark(X)) 730.39/297.03 , mark(f(X1, X2, X3)) -> a__f(X1, X2, mark(X3)) } 730.39/297.03 Weak Trs: 730.39/297.03 { mark(a()) -> a() 730.39/297.03 , mark(b()) -> b() 730.39/297.03 , mark(c()) -> a__c() 730.39/297.03 , a__c() -> a() 730.39/297.03 , a__c() -> b() 730.39/297.03 , a__c() -> c() } 730.39/297.03 Obligation: 730.39/297.03 innermost runtime complexity 730.39/297.03 Answer: 730.39/297.03 MAYBE 730.39/297.03 730.39/297.03 The weightgap principle applies (using the following nonconstant 730.39/297.03 growth matrix-interpretation) 730.39/297.03 730.39/297.03 The following argument positions are usable: 730.39/297.03 Uargs(a__f) = {3} 730.39/297.03 730.39/297.03 TcT has computed the following matrix interpretation satisfying 730.39/297.03 not(EDA) and not(IDA(1)). 730.39/297.03 730.39/297.03 [a__f](x1, x2, x3) = [1] x3 + [4] 730.39/297.03 730.39/297.03 [a] = [7] 730.39/297.03 730.39/297.03 [b] = [7] 730.39/297.03 730.39/297.03 [mark](x1) = [1] x1 + [0] 730.39/297.03 730.39/297.03 [a__c] = [7] 730.39/297.03 730.39/297.03 [f](x1, x2, x3) = [1] x3 + [1] 730.39/297.03 730.39/297.03 [c] = [7] 730.39/297.03 730.39/297.03 The order satisfies the following ordering constraints: 730.39/297.03 730.39/297.03 [a__f(X1, X2, X3)] = [1] X3 + [4] 730.39/297.03 > [1] X3 + [1] 730.39/297.03 = [f(X1, X2, X3)] 730.39/297.03 730.39/297.03 [a__f(a(), b(), X)] = [1] X + [4] 730.39/297.03 >= [1] X + [4] 730.39/297.03 = [a__f(X, X, mark(X))] 730.39/297.03 730.39/297.03 [mark(a())] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [mark(b())] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [mark(f(X1, X2, X3))] = [1] X3 + [1] 730.39/297.03 ? [1] X3 + [4] 730.39/297.03 = [a__f(X1, X2, mark(X3))] 730.39/297.03 730.39/297.03 [mark(c())] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [a__c()] 730.39/297.03 730.39/297.03 [a__c()] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [a()] 730.39/297.03 730.39/297.03 [a__c()] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [b()] 730.39/297.03 730.39/297.03 [a__c()] = [7] 730.39/297.03 >= [7] 730.39/297.03 = [c()] 730.39/297.03 730.39/297.03 730.39/297.03 Further, it can be verified that all rules not oriented are covered by the weightgap condition. 730.39/297.03 730.39/297.03 We are left with following problem, upon which TcT provides the 730.39/297.03 certificate MAYBE. 730.39/297.03 730.39/297.03 Strict Trs: 730.39/297.03 { a__f(a(), b(), X) -> a__f(X, X, mark(X)) 730.39/297.03 , mark(f(X1, X2, X3)) -> a__f(X1, X2, mark(X3)) } 730.39/297.03 Weak Trs: 730.39/297.03 { a__f(X1, X2, X3) -> f(X1, X2, X3) 730.39/297.03 , mark(a()) -> a() 730.39/297.03 , mark(b()) -> b() 730.39/297.03 , mark(c()) -> a__c() 730.39/297.03 , a__c() -> a() 730.39/297.03 , a__c() -> b() 730.39/297.03 , a__c() -> c() } 730.39/297.03 Obligation: 730.39/297.03 innermost runtime complexity 730.39/297.03 Answer: 730.39/297.03 MAYBE 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'Fastest' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'empty' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 2) 'With Problem ...' failed due to the following reason: 730.39/297.03 730.39/297.03 Empty strict component of the problem is NOT empty. 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 2) 'Best' failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 730.39/297.03 following reason: 730.39/297.03 730.39/297.03 The input cannot be shown compatible 730.39/297.03 730.39/297.03 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 730.39/297.03 to the following reason: 730.39/297.03 730.39/297.03 The input cannot be shown compatible 730.39/297.03 730.39/297.03 730.39/297.03 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 730.39/297.03 failed due to the following reason: 730.39/297.03 730.39/297.03 None of the processors succeeded. 730.39/297.03 730.39/297.03 Details of failed attempt(s): 730.39/297.03 ----------------------------- 730.39/297.03 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 730.39/297.03 failed due to the following reason: 730.39/297.03 730.39/297.03 match-boundness of the problem could not be verified. 730.39/297.03 730.39/297.03 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 730.39/297.03 failed due to the following reason: 730.39/297.03 730.39/297.03 match-boundness of the problem could not be verified. 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 730.39/297.03 Arrrr.. 730.74/297.34 EOF