From db15db6775ec6d206fe0967b6deb773a57009f90 Mon Sep 17 00:00:00 2001 From: alex28sh Date: Mon, 2 Sep 2024 11:29:04 +0200 Subject: [PATCH] remove 112 --- WIP/087-get_row.py | 4 ++-- Bench/112-reverse_delete.py => WIP/122-reverse_delete.py | 1 - 2 files changed, 2 insertions(+), 3 deletions(-) rename Bench/112-reverse_delete.py => WIP/122-reverse_delete.py (99%) diff --git a/WIP/087-get_row.py b/WIP/087-get_row.py index ef46b9b..f31d84f 100644 --- a/WIP/087-get_row.py +++ b/WIP/087-get_row.py @@ -32,7 +32,7 @@ def get_row(lst : List[List[int]], x : int) -> List[Tuple[int, int]]: Invariant(Forall(int, lambda j: (Implies(j >= 0 and j < len(pos), 0 <= pos[j][0] and pos[j][0] < len(lst) and 0 <= pos[j][1] and pos[j][1] < len(lst[pos[j][0]]) and - lst[pos[j][0]][pos[j][1]] == x), [[]]))) + lst[pos[j][0]][pos[j][1]] == x)))) # Invariant(Forall(int, lambda i1: # Implies(i1 >= 0 and i1 < i, # Forall(int, lambda j1: @@ -48,7 +48,7 @@ def get_row(lst : List[List[int]], x : int) -> List[Tuple[int, int]]: Invariant(Forall(int, lambda j: (Implies(j >= 0 and j < len(pos), 0 <= pos[j][0] and pos[j][0] < len(lst) and 0 <= pos[j][1] and pos[j][1] < len(lst[pos[j][0]]) and - lst[pos[j][0]][pos[j][1]] == x), [[]]))) + lst[pos[j][0]][pos[j][1]] == x)))) # Invariant(Forall(int, lambda i1: # Implies(i1 >= 0 and i1 < i, # Forall(int, lambda j1: diff --git a/Bench/112-reverse_delete.py b/WIP/122-reverse_delete.py similarity index 99% rename from Bench/112-reverse_delete.py rename to WIP/122-reverse_delete.py index 20324af..b546d7c 100644 --- a/Bench/112-reverse_delete.py +++ b/WIP/122-reverse_delete.py @@ -78,4 +78,3 @@ def is__palindrome__pred(s : List[int]) -> bool : Requires(Acc(list_pred(s), 1/2)) return Forall(int, lambda d_10_k_: (not (((0) <= (d_10_k_)) and ((d_10_k_) < (len(s)))) or (((s)[d_10_k_]) == ((s)[((len(s)) - (1)) - (d_10_k_)])))) -