MAYBE 1063.49/298.12 MAYBE 1063.49/298.12 1063.49/298.12 We are left with following problem, upon which TcT provides the 1063.49/298.12 certificate MAYBE. 1063.49/298.12 1063.49/298.12 Strict Trs: 1063.49/298.12 { a__U11(X1, X2) -> U11(X1, X2) 1063.49/298.12 , a__U11(tt(), N) -> mark(N) 1063.49/298.12 , mark(tt()) -> tt() 1063.49/298.12 , mark(s(X)) -> s(mark(X)) 1063.49/298.12 , mark(0()) -> 0() 1063.49/298.12 , mark(plus(X1, X2)) -> a__plus(mark(X1), mark(X2)) 1063.49/298.12 , mark(isNat(X)) -> a__isNat(X) 1063.49/298.12 , mark(U11(X1, X2)) -> a__U11(mark(X1), X2) 1063.49/298.12 , mark(U21(X1, X2, X3)) -> a__U21(mark(X1), X2, X3) 1063.49/298.12 , mark(and(X1, X2)) -> a__and(mark(X1), X2) 1063.49/298.12 , a__U21(X1, X2, X3) -> U21(X1, X2, X3) 1063.49/298.12 , a__U21(tt(), M, N) -> s(a__plus(mark(N), mark(M))) 1063.49/298.12 , a__plus(X1, X2) -> plus(X1, X2) 1063.49/298.12 , a__plus(N, s(M)) -> a__U21(a__and(a__isNat(M), isNat(N)), M, N) 1063.49/298.12 , a__plus(N, 0()) -> a__U11(a__isNat(N), N) 1063.49/298.12 , a__and(X1, X2) -> and(X1, X2) 1063.49/298.12 , a__and(tt(), X) -> mark(X) 1063.49/298.12 , a__isNat(X) -> isNat(X) 1063.49/298.12 , a__isNat(s(V1)) -> a__isNat(V1) 1063.49/298.12 , a__isNat(0()) -> tt() 1063.49/298.12 , a__isNat(plus(V1, V2)) -> a__and(a__isNat(V1), isNat(V2)) } 1063.49/298.12 Obligation: 1063.49/298.12 innermost runtime complexity 1063.49/298.12 Answer: 1063.49/298.12 MAYBE 1063.49/298.12 1063.49/298.12 None of the processors succeeded. 1063.49/298.12 1063.49/298.12 Details of failed attempt(s): 1063.49/298.12 ----------------------------- 1063.49/298.12 1) 'empty' failed due to the following reason: 1063.49/298.12 1063.49/298.12 Empty strict component of the problem is NOT empty. 1063.49/298.12 1063.49/298.12 2) 'Best' failed due to the following reason: 1063.49/298.12 1063.49/298.12 None of the processors succeeded. 1063.49/298.12 1063.49/298.12 Details of failed attempt(s): 1063.49/298.12 ----------------------------- 1063.49/298.12 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1063.49/298.12 following reason: 1063.49/298.12 1063.49/298.12 Computation stopped due to timeout after 297.0 seconds. 1063.49/298.12 1063.49/298.12 2) 'Best' failed due to the following reason: 1063.49/298.12 1063.49/298.12 None of the processors succeeded. 1063.49/298.12 1063.49/298.12 Details of failed attempt(s): 1063.49/298.12 ----------------------------- 1063.49/298.12 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1063.49/298.12 seconds)' failed due to the following reason: 1063.49/298.12 1063.49/298.12 Computation stopped due to timeout after 148.0 seconds. 1063.49/298.12 1063.49/298.12 2) 'Best' failed due to the following reason: 1063.49/298.12 1063.49/298.12 None of the processors succeeded. 1063.49/298.12 1063.49/298.12 Details of failed attempt(s): 1063.49/298.12 ----------------------------- 1063.49/298.12 1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1063.49/298.12 following reason: 1063.49/298.12 1063.49/298.12 The input cannot be shown compatible 1063.49/298.12 1063.49/298.12 2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1063.49/298.12 to the following reason: 1063.49/298.12 1063.49/298.12 The input cannot be shown compatible 1063.49/298.12 1063.49/298.12 1063.49/298.12 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1063.49/298.12 failed due to the following reason: 1063.49/298.12 1063.49/298.12 None of the processors succeeded. 1063.49/298.12 1063.49/298.12 Details of failed attempt(s): 1063.49/298.12 ----------------------------- 1063.49/298.12 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1063.49/298.12 failed due to the following reason: 1063.49/298.12 1063.49/298.12 match-boundness of the problem could not be verified. 1063.49/298.12 1063.49/298.12 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1063.49/298.12 failed due to the following reason: 1063.49/298.12 1063.49/298.12 match-boundness of the problem could not be verified. 1063.49/298.12 1063.49/298.12 1063.49/298.12 1063.49/298.12 1063.49/298.12 1063.49/298.12 Arrrr.. 1063.73/298.34 EOF