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