From 4253c7f8e086e380c6a20c022d55f34610978aae Mon Sep 17 00:00:00 2001 From: alex28sh Date: Thu, 22 Aug 2024 18:58:38 +0200 Subject: [PATCH] 096 changes --- Bench/096-count_up_to.py | 6 ------ 1 file changed, 6 deletions(-) diff --git a/Bench/096-count_up_to.py b/Bench/096-count_up_to.py index 76169eb..837cfc3 100644 --- a/Bench/096-count_up_to.py +++ b/Bench/096-count_up_to.py @@ -13,9 +13,6 @@ def CountUpTo(n : int) -> List[int]: not (((0) <= (d_2_i_)) and ((d_2_i_) < (len(Result())))) or (((Result())[d_2_i_]) < (n)))) Ensures(Forall(int, lambda d_1_i_: not (((0) <= (d_1_i_)) and ((d_1_i_) < (len(Result())))) or (IsPrime((Result())[d_1_i_])))) - Ensures(Forall(int, lambda d_3_p_: - Implies((((2) <= (d_3_p_)) and ((d_3_p_) < (n))) and IsPrime(d_3_p_), - Exists(int, lambda x: x >= 0 and x < len(Result()) and Result()[x] == d_3_p_)))) primes = list([int(0)] * 0) # type : List[int] primes = list([]) if (n) <= (2): @@ -29,9 +26,6 @@ def CountUpTo(n : int) -> List[int]: Implies(x >= 0 and x < len(primes), 2 <= primes[x] and primes[x] < n))) Invariant(Forall(int, lambda d_5_j_: (Implies(((0) <= (d_5_j_)) and ((d_5_j_) < (len(primes))), IsPrime((primes)[d_5_j_])), [[IsPrime((primes)[d_5_j_])]]))) - Invariant(Forall(int, lambda d_3_p_: - Implies((((2) <= (d_3_p_)) and ((d_3_p_) < (d_4_i_))) and IsPrime(d_3_p_), - Exists(int, lambda x: x >= 0 and x < len(primes) and primes[x] == d_3_p_)))) if IsPrime(d_4_i_): primes = primes + [(d_4_i_)] d_4_i_ = (d_4_i_) + (1)