MAYBE 1059.68/297.02 MAYBE 1059.68/297.02 1059.68/297.02 We are left with following problem, upon which TcT provides the 1059.68/297.02 certificate MAYBE. 1059.68/297.02 1059.68/297.02 Strict Trs: 1059.68/297.02 { U11(tt(), V1, V2) -> U12(isNat(activate(V1)), activate(V2)) 1059.68/297.02 , U12(tt(), V2) -> U13(isNat(activate(V2))) 1059.68/297.02 , isNat(X) -> n__isNat(X) 1059.68/297.02 , isNat(n__0()) -> tt() 1059.68/297.02 , isNat(n__plus(V1, V2)) -> 1059.68/297.02 U11(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), 1059.68/297.02 activate(V1), 1059.68/297.02 activate(V2)) 1059.68/297.02 , isNat(n__s(V1)) -> U21(isNatKind(activate(V1)), activate(V1)) 1059.68/297.02 , activate(X) -> X 1059.68/297.02 , activate(n__0()) -> 0() 1059.68/297.02 , activate(n__plus(X1, X2)) -> plus(activate(X1), activate(X2)) 1059.68/297.02 , activate(n__isNatKind(X)) -> isNatKind(X) 1059.68/297.02 , activate(n__s(X)) -> s(activate(X)) 1059.68/297.02 , activate(n__and(X1, X2)) -> and(activate(X1), X2) 1059.68/297.02 , activate(n__isNat(X)) -> isNat(X) 1059.68/297.02 , U13(tt()) -> tt() 1059.68/297.02 , U21(tt(), V1) -> U22(isNat(activate(V1))) 1059.68/297.02 , U22(tt()) -> tt() 1059.68/297.02 , U31(tt(), N) -> activate(N) 1059.68/297.02 , U41(tt(), M, N) -> s(plus(activate(N), activate(M))) 1059.68/297.02 , s(X) -> n__s(X) 1059.68/297.02 , plus(X1, X2) -> n__plus(X1, X2) 1059.68/297.02 , plus(N, s(M)) -> 1059.68/297.02 U41(and(and(isNat(M), n__isNatKind(M)), 1059.68/297.02 n__and(n__isNat(N), n__isNatKind(N))), 1059.68/297.02 M, 1059.68/297.02 N) 1059.68/297.02 , plus(N, 0()) -> U31(and(isNat(N), n__isNatKind(N)), N) 1059.68/297.02 , and(X1, X2) -> n__and(X1, X2) 1059.68/297.02 , and(tt(), X) -> activate(X) 1059.68/297.02 , isNatKind(X) -> n__isNatKind(X) 1059.68/297.02 , isNatKind(n__0()) -> tt() 1059.68/297.02 , isNatKind(n__plus(V1, V2)) -> 1059.68/297.02 and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) 1059.68/297.02 , isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 1059.68/297.02 , 0() -> n__0() } 1059.68/297.02 Obligation: 1059.68/297.02 innermost runtime complexity 1059.68/297.02 Answer: 1059.68/297.02 MAYBE 1059.68/297.02 1059.68/297.02 Arguments of following rules are not normal-forms: 1059.68/297.02 1059.68/297.02 { plus(N, s(M)) -> 1059.68/297.02 U41(and(and(isNat(M), n__isNatKind(M)), 1059.68/297.02 n__and(n__isNat(N), n__isNatKind(N))), 1059.68/297.02 M, 1059.68/297.02 N) 1059.68/297.02 , plus(N, 0()) -> U31(and(isNat(N), n__isNatKind(N)), N) } 1059.68/297.02 1059.68/297.02 All above mentioned rules can be savely removed. 1059.68/297.02 1059.68/297.02 We are left with following problem, upon which TcT provides the 1059.68/297.02 certificate MAYBE. 1059.68/297.02 1059.68/297.02 Strict Trs: 1059.68/297.02 { U11(tt(), V1, V2) -> U12(isNat(activate(V1)), activate(V2)) 1059.68/297.02 , U12(tt(), V2) -> U13(isNat(activate(V2))) 1059.68/297.02 , isNat(X) -> n__isNat(X) 1059.68/297.02 , isNat(n__0()) -> tt() 1059.68/297.02 , isNat(n__plus(V1, V2)) -> 1059.68/297.02 U11(and(isNatKind(activate(V1)), n__isNatKind(activate(V2))), 1059.68/297.02 activate(V1), 1059.68/297.02 activate(V2)) 1059.68/297.02 , isNat(n__s(V1)) -> U21(isNatKind(activate(V1)), activate(V1)) 1059.68/297.02 , activate(X) -> X 1059.68/297.02 , activate(n__0()) -> 0() 1059.68/297.02 , activate(n__plus(X1, X2)) -> plus(activate(X1), activate(X2)) 1059.68/297.02 , activate(n__isNatKind(X)) -> isNatKind(X) 1059.68/297.02 , activate(n__s(X)) -> s(activate(X)) 1059.68/297.02 , activate(n__and(X1, X2)) -> and(activate(X1), X2) 1059.68/297.02 , activate(n__isNat(X)) -> isNat(X) 1059.68/297.02 , U13(tt()) -> tt() 1059.68/297.02 , U21(tt(), V1) -> U22(isNat(activate(V1))) 1059.68/297.02 , U22(tt()) -> tt() 1059.68/297.02 , U31(tt(), N) -> activate(N) 1059.68/297.02 , U41(tt(), M, N) -> s(plus(activate(N), activate(M))) 1059.68/297.02 , s(X) -> n__s(X) 1059.68/297.02 , plus(X1, X2) -> n__plus(X1, X2) 1059.68/297.02 , and(X1, X2) -> n__and(X1, X2) 1059.68/297.02 , and(tt(), X) -> activate(X) 1059.68/297.02 , isNatKind(X) -> n__isNatKind(X) 1059.68/297.02 , isNatKind(n__0()) -> tt() 1059.68/297.02 , isNatKind(n__plus(V1, V2)) -> 1059.68/297.02 and(isNatKind(activate(V1)), n__isNatKind(activate(V2))) 1059.68/297.02 , isNatKind(n__s(V1)) -> isNatKind(activate(V1)) 1059.68/297.02 , 0() -> n__0() } 1059.68/297.02 Obligation: 1059.68/297.02 innermost runtime complexity 1059.68/297.02 Answer: 1059.68/297.02 MAYBE 1059.68/297.02 1059.68/297.02 None of the processors succeeded. 1059.68/297.02 1059.68/297.02 Details of failed attempt(s): 1059.68/297.02 ----------------------------- 1059.68/297.02 1) 'empty' failed due to the following reason: 1059.68/297.02 1059.68/297.02 Empty strict component of the problem is NOT empty. 1059.68/297.02 1059.68/297.02 2) 'Best' failed due to the following reason: 1059.68/297.02 1059.68/297.02 None of the processors succeeded. 1059.68/297.02 1059.68/297.02 Details of failed attempt(s): 1059.68/297.02 ----------------------------- 1059.68/297.02 1) 'With Problem ... (timeout of 297 seconds)' failed due to the 1059.68/297.02 following reason: 1059.68/297.02 1059.68/297.02 Computation stopped due to timeout after 297.0 seconds. 1059.68/297.02 1059.68/297.02 2) 'Best' failed due to the following reason: 1059.68/297.02 1059.68/297.02 None of the processors succeeded. 1059.68/297.02 1059.68/297.02 Details of failed attempt(s): 1059.68/297.02 ----------------------------- 1059.68/297.02 1) 'With Problem ... (timeout of 148 seconds) (timeout of 297 1059.68/297.02 seconds)' failed due to the following reason: 1059.68/297.02 1059.68/297.02 Computation stopped due to timeout after 148.0 seconds. 1059.68/297.02 1059.68/297.02 2) 'Best' failed due to the following reason: 1059.68/297.02 1059.68/297.02 None of the processors succeeded. 1059.68/297.02 1059.68/297.02 Details of failed attempt(s): 1059.68/297.02 ----------------------------- 1059.68/297.02 1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due 1059.68/297.02 to the following reason: 1059.68/297.02 1059.68/297.02 The input cannot be shown compatible 1059.68/297.02 1059.68/297.02 2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the 1059.68/297.02 following reason: 1059.68/297.02 1059.68/297.02 The input cannot be shown compatible 1059.68/297.02 1059.68/297.02 1059.68/297.02 3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)' 1059.68/297.02 failed due to the following reason: 1059.68/297.02 1059.68/297.02 None of the processors succeeded. 1059.68/297.02 1059.68/297.02 Details of failed attempt(s): 1059.68/297.02 ----------------------------- 1059.68/297.02 1) 'Bounds with minimal-enrichment and initial automaton 'match'' 1059.68/297.02 failed due to the following reason: 1059.68/297.02 1059.68/297.02 match-boundness of the problem could not be verified. 1059.68/297.02 1059.68/297.02 2) 'Bounds with perSymbol-enrichment and initial automaton 'match'' 1059.68/297.02 failed due to the following reason: 1059.68/297.02 1059.68/297.02 match-boundness of the problem could not be verified. 1059.68/297.02 1059.68/297.02 1059.68/297.02 1059.68/297.02 1059.68/297.02 1059.68/297.02 Arrrr.. 1059.81/297.12 EOF