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