default_prompts.py

from lang_config import LANG, ALL_LANGS
from cmdline import args
   
if LANG == "Dafny":
    proof_marker = "ensures"
    cheat_marker = None
elif LANG == "Coq":
    proof_marker = "Qed"
    cheat_marker = "Admitted"
elif LANG == "Lean4":
    proof_marker = "theorem"
    cheat_marker = "sorry"
elif LANG == "Rust" or LANG == "Scala" or LANG == "Python":
    proof_marker = None
    cheat_marker = None

NO_CHECK_PROOF = lambda v: True
if proof_marker:
    CHECK_PROOF = lambda v: proof_marker in v
    CHECK_PROOF2 = lambda v: v.count(proof_marker) >= 2
else:
    CHECK_PROOF = NO_CHECK_PROOF
    CHECK_PROOF2 = NO_CHECK_PROOF

NO_CHECK_CHEAT = lambda v: False
if cheat_marker:
    CHECK_CHEAT = lambda v: cheat_marker in v
else:
    CHECK_CHEAT = NO_CHECK_CHEAT

problem_multistep_python = (
    f"""### Spec: In {LANG}, write a function sum_unique_prime_factors(n) that returns the sum of the unique prime factors of 
the natural number n. Example: if the input number was 28, the function would return 9 (2 + 7), 
if the input was 45, it would return 8 (3 + 5) and if the input was 97, it would return 97, as 97 is prime. 
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def sum_unique_prime_factors(n):": "test(sum_unique_prime_factors(28) == 9)\ntest(sum_unique_prime_factors(45) == 8)\ntest(sum_unique_prime_factors(60) == 10)"
    }
)

problem_python_2_oneshot = (
    f"""### Spec: In {LANG}, write a magic(s) function that: given a string s, it finds all the characters that repeat an odd 
    number of times in the string and remove them from it. Then, for every pair of the same character next to each other, 
    you should remove one of them. Then, it should rotate any letters in the string by the length of the resulting string 
    (rotate A two times would result in a C, rotating H once would result in an I and rotating F 26 times would result back in F). 
    It should return this final function.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def magic(s):": "test(magic('vvbbbsszzzzcc  kklllccffzzrr!!') == 'hello world!')"
    }
)

problem_python_2_steps = (
    f"""### Spec: In {LANG}, write a function remove_odd(s), that given a string s, it removes the characters that 
    appear on it an odd number of times. Then, write a function 'remove_pairs(s)', that given a string, for every 
    pair of the same character next to each other, it removes one of them ('hheelllloo' would become 'hello'). Then, 
    write another function 'rotate_letters(s, n)', that given a string and a number, it rotates the letters of the alfabet 
    by n (rotating A once gives B, rotating D twice gives F and so on). Then, write a final function 'magic(s)' that, 
    using the previous functions, removes the odd appearing characters, remove pairs of characters, and after all these
    changes, it rotates the letters of this final string by the its final number of characters.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def remove_odd(s):" : "test(remove_odd('kkkppoottaiiiattoojjj') == 'ppoottaattoo')",
        "def remove_pairs(s):" : "test(remove_pairs('ppoottaattoo') == 'potato')\ntest(remove_pairs('hheelllloo') == 'hello')",
        "def rotate_letters(s, n):" : "test(rotate_letters('abc', 1) == 'bcd')",
        "def magic(s):" : "test(magic('vvbbbsszzzzcc  kklllccffzzrr!!') == 'hello world!')"
    }
)

problem_python_3_oneshot = (
    f"""### Spec: In {LANG}, Write a function string_to_number(s) that given a string s, converts each of its alpha numeric characters into numbers. The convesion
    is as follows: a or A is coverted to 1, b or B is converted to 2 and so on until z or Z is converted to 26. Characters that represent
    digits should be converted to themselves, and all other characters should be converted to 0. The function string_to_numbers(s) should
    return the sum of the converted list. Then, write a function sum_unique_prime_factors(n) that given a number n, returns the sum of the unique prime factors of n.
    After, write a function magic(n) that calculates and returns the magic number of a string. The magic number of a string is obtained by 
    converting the string to a number using the string_to_number function, then using sum_unique_prime_factors in such number. Finally, 
    write a function best_string(t) that, given a text t, returns the string in such test that yields the highest magic number""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def best_string(t):": "test(best_string('Hello world! A quick example with numbers 123 and special characters $%#.') == 'quick')"
    }
)

problem_python_3_steps = (
    f"""### Spec: In {LANG}, Write a function string_to_number(s) that given a string s, converts each of its alpha numeric characters into numbers. The convesion
    is as follows: a or A is coverted to 1, b or B is converted to 2 and so on until z or Z is converted to 26. Characters that represent
    digits should be converted to themselves, and all other characters should be converted to 0. The function string_to_numbers(s) should
    return the sum of the converted list. Then, write a function sum_unique_prime_factors(n) that given a number n, returns the sum of the unique prime factors of n.
    After, write a function magic(n) that calculates and returns the magic number of a string. The magic number of a string is obtained by 
    converting the string to a number using the string_to_number function, then using sum_unique_prime_factors in such number. Finally, 
    write a function best_string(t) that, given a text t, returns the string in such test that yields the highest magic number""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def string_to_number(s):" : "test(string_to_number('quick!') == 61)",
        "def sum_unique_prime_factors(n):" : "test(sum_unique_prime_factors(51) == 20)",
        "def magic(s):" : "test(magic('Hello') == 15)",
        "def best_string(t):" : "test(best_string('Hello world! A quick example with numbers 123 and special characters $%#.') == 'quick')"
    }
)

problem_python_4_oneshot = (
    f"""### Spec: In {LANG}, 
    First, write a function palindrome(s) that checks whether a string as is a palindrome, returning True or False accordingly. Then,
    write a function find_palindrome(t), that given a text, returns the last palindrome word of the text. If no palindromes are found, it 
    should simply return the last word of the text. Then, write a function vowel_count(s) that given a word, count the number of vowels in it (vowels are only
    a, e, i, o, u). Then, write a function find_char(s, n), that given a string s and a number n, finds the nth character of the string modulo
    the length. Finally, write function process_palindrome(t) using the previous functions that given a text t, returns the nth character of 
    the last palindrome of a text where n is the number of vowels in such palindrome.""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def process_palindrome(t):": "test(process_palindrome('Madam, Anna went to the market. She also met Civic in Nevada.') == 'v')"
    }
)

problem_python_4_steps = (
    f"""### Spec: In {LANG}, 
    First, write a function palindrome(s) that checks whether a string as is a palindrome, returning True or False accordingly. Then,
    write a function find_palindrome(t), that given a text, returns the last palindrome word of the text. If no palindromes are found, it 
    should simply return the last word of the text. Then, write a function vowel_count(s) that given a word, count the number of vowels in it (vowels are only
    a, e, i, o, u). Then, write a function find_char(s, n), that given a string s and a number n, finds the nth character of the string modulo
    the length. Finally, write function process_palindrome(t) using the previous functions that given a text t, returns the nth character of 
    the last palindrome of a text where n is the number of vowels in such palindrome.""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Python'],
    None,
    {
        "def palindrome(s):" : "test(palindrome('Anna') == True) \ntest(palindrome('hannah') == True \npalindrome(trevor) == False)",
        "def find_palindrome(t):" : "test(find_palindrome('Madam, Anna went to the market. She also met Civic in Nevada.') == 'Civic')\n test(find_palindrome('Madam, Anna went to the market. She also met Civic in Nevada.') == 'Civic')",
        "def vowel_count(s):" : "test(vowel_count(anna) == 2) \ntest(vowel_count(PotAto) == 3)",
        "def find_char(s, n):" : "find_char('Civic', 2) == 'v'",
        "def process_palindrome(t):" : "test(process_palindrome('Madam, Anna went to the market. She also met Civic in Nevada.') == 'v')"
    }
)


problem_parser_res = (
    f"""### Spec: In {LANG}, write a parser function for arithmetic expressions that contain only addition.
The function should take a string that contains a sequence of integers and '+' symbols, and return its result.
No characters other than digits and '+' may be in the string.
Example: "1" evaluates to 1. "1+1" evaluates to 2. "100+3" evaluates to 103. "1+2+3+4+5+8+12" evaluates to 35.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_parser_myfib = (
    f"""### Spec: In {LANG}, write a function called fib that generates the number of factors for the n-th Fibonacci number, 
    where n is the input. The function should take an integer n and return its result. Fibonacci numbers are defined 
    as the first term being 0, the second term being 1, and the third term being the sum of the first two terms, which
    is 1. The fourth term is the sum of the two prior terms, which equals 2. The fifth term is the sum of the third and 
    fourth term, which is 3. Every succeeding term is equal to the sum of the two preceding terms. Let the first term
    in the series be 0, and let the second term in the series be 1.
Example: The function should take in 3, which gives Fibonacci number 1, and evaluate to 1. 
7 evaluates to 4. 9 evaluates to 4. 144 evaluates to 15.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_parser_race = (
    f"""### Spec: In {LANG}, write a function that takes can solve the problem: if I came in the n-th person to finish a race
    how many people crossed the finish line before me? 

Example: If I came in 5th place, 4 people crossed the finished line before me. So the function takes in 5 and returns 4. If I 
come in 100th place, the function takes in 100, and it returns 99. 
""",
    2000,
    None,
    2,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_parser_quad = (
    f"""### Spec: In {LANG}, write a function that calculates the roots of a quadratic equation ax^2 + bx + c,
where the coefficients a, b, c, are provided by the user. 
Example: if the inputs are 1, 2, 1, then the function's result is -1. If the inputs are 1, 1, -6, then the 
function's results are -3 and 2.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)


problem_parser_word = (
    f"""### Spec: In {LANG}, write a function that extracts the top N most frequent words in the paragraph. The function
    should take in a paragraph and an integer N, and return the N words that appear the most in the paragraph and their 
    respective counts.
Example: "Natural language processing (NLP) is a subfield of linguistics, computer science, and artificial intelligence
concerned with the interactions between computers and human language, in particular how to program computers
to process and analyze large amounts of natural language data." and 5 results in "language: 2, natural: 2, processing: 1, nlp: 1, is: 1".
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_parser_data = (
    f"""### Spec: In {LANG}, write a parser function for arithmetic expressions that contain only addition and multiplication.
First, create a data structure that stores expressions.
Then write a function takes a string that contains a sequence of integers and '+', '*' symbols, and return the expression in the data structure you defined earlier.
Both operators have the same precedence. There are no parentheses.
No characters other than digits and '+', '*' may be in the string.
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None,
)

problem_parser_interest = (
    f"""### Spec: Tom decides to invest some money in a bank. He deposits D dollars into the account, which pays an annual interest rate of r%. 
    However, he also plans to deposit an additional A dollars every year into the same account. The interest is compounded annually.
    In {LANG}, write a function that will calculate the total amount of money Tom will have in his account after n years.

Example: if the initial deposit is 5000 dollars, the annual interest rate is 5%, and the yearly deposit is 1200 dollars, then after 10 years, 
Tom will have approximately $23,580.79 in his account. This means that the function takes in its inputs 5000 and 5 and 1200 and 10 and returns
23,580.79. 
""",
    2000,
    None,
    5,
    25,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)


problem_fact = (
    f"""### Spec: In {LANG}, write a factorial function and prove that the factorial is always strictly positive.
{'''### Hint: Use a plain function, NOT a function method.
### Hint: Use a nat, NOT an int.
''' if LANG=='Dafny' else ''
}{'''### Hint: Don't forget to import the Arith module.
### Hint: use `Nat.lt_0_1` in the base case of the proof.
### Hint: use `Nat.lt_lt_add_r` in the inductive case of the proof.
''' if LANG=='Coq' else ''
}""",
    500,
    None,
    5,
    15,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_fact_dafny_check = (
    f"""### Spec: In {LANG}, write a factorial function, called `fac`, and prove (in a lemma called `FacPositive(n: nat)`) that the factorial is always strictly positive.
{'''### Hint: Use a plain function, NOT a function method.
### Hint: Use a nat, NOT an int.
''' if LANG=='Dafny' else ''
}{'''### Hint: Don't forget to import the Arith module.
### Hint: use `Nat.lt_0_1` in the base case of the proof.
### Hint: use `Nat.lt_lt_add_r` in the inductive case of the proof.
''' if LANG=='Coq' else ''
}""",
    500,
    None,
    5,
    15,
    CHECK_PROOF, CHECK_CHEAT,
    ['Dafny'],
    """
lemma CHECK_FacPositive(n: nat) ensures fac(n) > 0 { FacPositive(n); }
    """,
    None
)

problem_fact_coq_check = (
    f"""### Spec: In {LANG}, write a factorial function, called `fac`, and prove (in a lemma `FacPositive: forall (n: nat), fac n > 0`) that the factorial is always strictly positive.
{'''### Hint: Use a plain function, NOT a function method.
### Hint: Use a nat, NOT an int.
''' if LANG=='Dafny' else ''
}{'''### Hint: Don't forget to import the Arith module.
### Hint: use `Nat.lt_0_1` in the base case of the proof.
### Hint: use `Nat.lt_lt_add_r` in the inductive case of the proof.
''' if LANG=='Coq' else ''
}""",
    500,
    None,
    5,
    15,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    """
Lemma CHECK_FacPositive: forall (n: nat), fac n > 0. Proof. intros. apply FacPositive; eauto. Qed.
    """,
    None
)

problem_mult_proof_coq = (
    """
```Coq
Require Import Arith.
Theorem mult_lemma6 : forall a b n : nat, n <> 0 -> n * a = n * b -> a = b.
Proof.
""",
    1000,
    None,
    4,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    None,
    None
    )

problem_1_divides_n_proof_coq = (
    """
```Coq
Require Import Arith.
Require Import Peano_dec.
Require Import Compare_dec.
Require Import Wf_nat.
 
Inductive divides : nat -> nat -> Prop :=
    dividesDef : forall a b q : nat, b = q * a -> divides a b.

Lemma SO_divides_all : forall n : nat, divides 1 n.
Proof.
""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    None,
    None)

problem_partial_maps_proof_coq = (
    """
```Coq
From Coq Require Import Arith.Arith.
From Coq Require Import Bool.Bool.
Require Import Coq.Strings.String.
From Coq Require Import Logic.FunctionalExtensionality.
From Coq Require Import Lists.List.
Import ListNotations.
Set Default Goal Selector "!".


Definition total_map (A : Type) := string -> A.

Definition t_empty {A : Type} (v : A) : total_map A :=
  (fun _ => v).

Definition t_update {A : Type} (m : total_map A)
                    (x : string) (v : A) :=
  fun x' => if String.eqb x x' then v else m x'.

Notation "'_' '!->' v" := (t_empty v)
  (at level 100, right associativity).

Notation "x '!->' v ';' m" := (t_update m x v)
                              (at level 100, v at next level, right associativity).

Definition examplemap' :=
  ( "bar" !-> true;
    "foo" !-> true;
    _ !-> false
  ).

Definition partial_map (A : Type) := total_map (option A).

Definition empty {A : Type} : partial_map A :=
  t_empty None.

Definition update {A : Type} (m : partial_map A)
           (x : string) (v : A) :=
  (x !-> Some v ; m).

Notation "x '|->' v ';' m" := (update m x v)
  (at level 100, v at next level, right associativity).

Notation "x '|->' v" := (update empty x v)
  (at level 100).
  
Definition examplepmap :=
  ("Church" |-> true ; "Turing" |-> false).

Definition includedin {A : Type} (m m' : partial_map A) :=
  forall x v, m x = Some v -> m' x = Some v.

Theorem includedin_update : forall (A : Type) (m m' : partial_map A)
                                 (x : string) (vx : A),
includedin m m' ->
includedin (x |-> vx ; m) (x |-> vx ; m').
Proof.
""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    None,
    None)

problem_opt0_proof_coq = (
    """
```Coq
Require Import Coq.Strings.String.
Require Import Arith.

Inductive Expr : Type :=
  | Const : nat -> Expr
  | Var : string -> Expr
  | Add : Expr -> Expr -> Expr.

Fixpoint Eval (e : Expr) (env : string -> nat) : nat :=
  match e with
    | Const n => n
    | Var x => env x
    | Add e1 e2 => Eval e1 env + Eval e2 env
  end.

Fixpoint Optimize (e : Expr) : Expr :=
  match e with
    | Const n => e
    | Var x => e
    | Add e1 e2 =>
      match e1, e2 with
        | Const 0, _ => Optimize e2
        | _, Const 0 => Optimize e1
        | _, _ => Add (Optimize e1) (Optimize e2)
      end
  end.

Theorem Optimizer_preserves_semantics :
  forall e env, Eval (Optimize e) env = Eval e env.
Proof.
""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    None,
    None)

problem_opt0_coq_proof_hints = """
### Hint: For the proof, do `induction e.`. Do NOT name the hypotheses with `as`.
### Hint: The simple cases are by `simpl. reflexivity.`.
### Hint: The addition case is by `simpl. rewrite <- IHe1. rewrite <- IHe2. destruct (optimize e1); destruct (optimize e2); try destruct n; try destruct n0; eauto using PeanoNat.Nat.add_0_r.`.
### Hint: You'll need `Require Import Arith`.
"""

EXTRA_CONSTANT_FOLDING = " and performs all additions by constants"
EXTRA_CONSTANT_FOLDING = ""

hint_match_dafny = '''### Hint: Recall that in Dafny, pattern match takes the form
match e
case Foo(x, y) => 1
case Bar(x) => 2
case _ => 3
''' if LANG=='Dafny' else ''
hint_match_dafny = hint_match_dafny if args.show_hint_match_dafny else ''

problem_opt0 = (
    f"""### Spec: In {LANG}, write an ADT for arithmetic expressions comprising constants, variables and binary additions. Then write an evaluator taking an expression and an environment (a function that takes a variable name and returns a number) and returning the number resulting from evaluation. Then write an optimizer taking an expression and returning an expression with all additions by 0 removed{EXTRA_CONSTANT_FOLDING}. Then prove that the optimizer preserves the semantics as defined by the evaluation function.
{hint_match_dafny}### Hint: In the optimizer, recursively optimize the sub-expressions.
{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`.
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: With tactics like `induction` and `destruct`, _avoid_ naming with `as` and let Coq pick the names for you. For example, use `induction e.` but _not_ `induction e as [...]`.
''' + problem_opt0_coq_proof_hints if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_opt0_python = (
    f"""### Spec: In {LANG}, write an ADT for arithmetic expressions comprising constants, variables and binary additions. Then write an evaluator taking an expression and an environment (a function that takes a variable name and returns a number) and returning the number resulting from evaluation. Then write an optimizer taking an expression and returning an expression with all additions by 0 removed{EXTRA_CONSTANT_FOLDING}. Then prove that the optimizer preserves the semantics as defined by the evaluation function.
{hint_match_dafny}### Hint: In the optimizer, recursively optimize the sub-expressions.
{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`.
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: With tactics like `induction` and `destruct`, _avoid_ naming with `as` and let Coq pick the names for you. For example, use `induction e.` but _not_ `induction e as [...]`.
''' + problem_opt0_coq_proof_hints if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ["Python"],
    None,
    {
        "\ndef optimize": "test(optimize(Const(5)).evaluate() == 5)"
    }
)

problem_opt0_dafny_check = (
    f"""### Spec: In {LANG}, write an ADT for arithmetic expressions (called `Expr`) comprising constants, variables and binary additions. Then write an evaluator (called `Eval`) taking an expression and an environment (a function that takes a variable name and returns a number) and returning the number resulting from evaluation. Then write an optimizer (called `Optimize`) taking an expression and returning an expression with all additions by 0 removed{EXTRA_CONSTANT_FOLDING}. Then prove that the optimizer preserves the semantics as defined by the evaluation function. Do so by proving the lemma `OptimizePreservesSemantics(e: Expr, env: string -> int) ensures Eval(Optimize(e), env) == Eval(e, env)`.
{hint_match_dafny}### Hint: In the optimizer, recursively optimize the sub-expressions.
{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`.
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: With tactics like `induction` and `destruct`, _avoid_ naming with `as` and let Coq pick the names for you. For example, use `induction e.` but _not_ `induction e as [...]`.
''' + problem_opt0_coq_proof_hints if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    """
    lemma CHECK_OPS(e: Expr, env: string -> int)
    requires true
    ensures Eval(Optimize(e), env) == Eval(e, env)
{
    OptimizePreservesSemantics(e, env);
}
""",
None
)

problem_opt0_coq_check = (
    f"""### Spec: In {LANG}, write an ADT for arithmetic expressions (called `Expr`) comprising constants, variables and binary additions. Then write an evaluator (called `Eval`) taking an expression and an environment (a function that takes a variable name and returns a number) and returning the number resulting from evaluation. Then write an optimizer (called `Optimize`) taking an expression and returning an expression with all additions by 0 removed{EXTRA_CONSTANT_FOLDING}. Then prove that the optimizer preserves the semantics as defined by the evaluation function. Do so by proving the lemma `OptimizePreservesSemantics: forall (e: Expr) (env: string -> nat), Eval(Optimize(e), env) = Eval(e, env)`.
{hint_match_dafny}### Hint: In the optimizer, recursively optimize the sub-expressions.
{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`.
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: With tactics like `induction` and `destruct`, _avoid_ naming with `as` and let Coq pick the names for you. For example, use `induction e.` but _not_ `induction e as [...]`.
''' + problem_opt0_coq_proof_hints if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ["Coq"],
    """
    Lemma CHECK_OPS: forall (e: Expr) (env: string -> nat), Eval (Optimize e) env = Eval e env.
    Proof.
    intros.
    apply OptimizePreservesSemantics; eauto.
    Qed.
""",
None
)

problem_opt0_opt_dafny = ("""### Spec: In Dafny, write an ADT for arithmetic expressions comprising constants, variables and binary addition. Then write a predicate `optimal` that holds on an expression if it has no additions by 0. Then write an optimizer `optimize` that removes all additions by 0. Then write a lemma `OptimizerOptimal` that ensures `optimal(optimize(e))` for all expressions `e`.
### Hint: Don't use the same structure for `optimize` as for `optimal`. Instead, follow the next hint.
### Hint: In the addition case, the `optimize` function should recursively optimize the sub-expressions and then match on the optimized sub-expressions.
### Hint: Do NOT use `requires` anywhere.
### Hint: Write the lemma as
lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.

```dafny
datatype Expr = Const(i: int) | Var(x: string) | Add(e1: Expr, e2: Expr)

predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}

""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,# if LANG != 'Dafny' else (lambda v: CHECK_CHEAT(v) or "requires" not in v or "==>" not in v),
    ['Dafny'],
    None,
    None
)

problem_pattern_match_train_dafny = (("""In Dafny, we have the following ADT:

```dafny
datatype Foo = Bar(n: nat) | Baz(a: Foo, b: Foo)
```

Take the denotation of a Foo to be 2 times n for a Bar, and sum of the denotations of its Foos for a Baz.

```dafny
function denotation(foo: Foo): nat
{
""", [
    """
```dafny
lemma ex1()
ensures denotation(Baz(Bar(2), Bar(1))) == 6
{}

lemma denotationAlwaysEven(foo: Foo)
ensures denotation(foo) % 2 == 0
{
  match foo
  case Bar(n) =>
  case Baz(a, b) =>
    denotationAlwaysEven(a);
    denotationAlwaysEven(b);
}
```
""",
    """
A lemma that proves that the denotation of a Foo is always even.

```dafny
lemma denotationAlwaysEven(foo: Foo)
ensures denotation(foo) % 2 == 0
{
"""]),
    500,
    None,
    5,
    15,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Dafny'],
    None,
    None
)

problem_pattern_match_train_dafny2 = (("""In Dafny, we have the following ADT:

```dafny
datatype Foo = Bar(n: nat) | Baz(x: Foo)
```

Take the denotation of a Foo to be 2 times n for a Bar, and the denotations of its Foo for a Baz.

```dafny
function denotation(foo: Foo): nat
{
""", [
    """
```dafny
lemma ex1()
ensures denotation(Baz(Bar(2))) == 4
{}

lemma denotationAlwaysEven(foo: Foo)
ensures denotation(foo) % 2 == 0
{
  match foo
  case Bar(n) =>
  case Baz(x) =>
    denotationAlwaysEven(x);
}
```
""",
    """
A lemma that proves that the denotation of a Foo is always even.

```dafny
lemma denotationAlwaysEven(foo: Foo)
ensures denotation(foo) % 2 == 0
{
"""]),
    500,
    None,
    5,
    15,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Dafny'],
    None,
    None
)

problem_opt0_opt_dafny_sanity_check = (("""### Spec: In Dafny, write an ADT for arithmetic expressions comprising constants, variables and binary addition. Then write an optimizer `optimize` that removes all additions by 0.
### Hint: In the addition case, the `optimize` function should recursively optimize the sub-expressions and then match on the optimized sub-expressions.
"""+hint_match_dafny+"""


```dafny
datatype Expr = Const(i: int) | Var(x: string) | Add(e1: Expr, e2: Expr)

function optimize(e: Expr): Expr
{
""", ["""
```dafny
predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}

lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
{
  match e
  case Add(e1, e2) =>
    OptimizerOptimal(e1);
    OptimizerOptimal(e2);
  case _ =>
}
```
"""]),
    500,
    None,
    5,
    15,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Dafny'],
    None,
    None
)

problem_opt0_dafny_sanity_check = (("""In Dafny, an ADT for arithmetic expressions comprising constants, variables and binary addition.

```dafny
datatype Expr = Const(i: int) | Var(x: string) | Add(e1: Expr, e2: Expr)
```

An evaluator `eval` taking an expression and an environment (a function that takes a variable name and returns a number) and returning the number resulting from evaluation.

```dafny
function eval(e: Expr, env: string -> int): int
{
"""
, ["",
   """

An optimizer taking an expression and returning an expression with all additions by 0 removed.
In the addition case, the `optimize` function first recursively optimize the sub-expressions, then matches against the the optimized sub-expressions to check for constants 0.

```dafny
function optimize(e: Expr): Expr
{
""", """
```dafny
predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}

lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
{
  match e
  case Add(e1, e2) =>
    OptimizerOptimal(e1);
    OptimizerOptimal(e2);
  case _ =>
}
```
""", """

A lemma proving that the optimizer preserves the semantics.
By structural induction on e.
Pattern match against e, and simply call the lemma recursively on the sub-expressions.

```dafny
lemma OptimizerPreservesSemantics(e: Expr, env: string -> int)
ensures eval(optimize(e), env) == eval(e, env)
{
"""
]),
    500,
    None,
    5,
    15,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ['Dafny'],
    None,
    None
)

problem_opt0_opt = (f"""### Spec: In {LANG}, write an ADT for arithmetic expressions comprising constants, variables and binary addition. Then write a predicate `optimal` that holds on an expression if it has no additions by 0. Then write an optimizer `optimize` that removes all additions by 0. Then write a lemma `OptimizerOptimal` that ensures `optimal(optimize(e))` for all expressions `e`.
{'''### Hint: This is the definiton of the `optimal` predicate:
predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}
### Hint: Don't use the same structure for `optimize` as for `optimal`. Instead, follow the next hint.
''' if LANG=='Dafny' else ''
}### Hint: In the addition case, the `optimize` function should recursively optimize the sub-expressions and then match on the optimized sub-expressions.
{'''### Hint: Do NOT use `requires` anywhere.
''' if LANG=='Dafny' else ''
}{'''### Hint: Write the lemma as
lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
''' if LANG=='Dafny' else ''
}{hint_match_dafny
}{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: If you do induction on `e` with sub-expressions `e1` and `e2`, the two inductive hypotheses are called `IHe1` and `IHe2`.
''' if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,# if LANG != 'Dafny' else (lambda v: CHECK_CHEAT(v) or "requires" not in v or "==>" not in v),
    ALL_LANGS,
    None,
    None
)

problem_opt0_opt_dafny_check = (f"""### Spec: In {LANG}, write an ADT `Expr` for arithmetic expressions comprising constants, variables and binary addition. Then write a predicate `optimal` that holds on an expression if it has no additions by 0. Then write an optimizer `optimize` that removes all additions by 0. Then write a lemma `OptimizerOptimal` that ensures `optimal(optimize(e))` for all expressions `e`.
{'''### Hint: This is the definiton of the `optimal` predicate:
predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}
### Hint: Don't use the same structure for `optimize` as for `optimal`. Instead, follow the next hint.
''' if LANG=='Dafny' else ''
}### Hint: In the addition case, the `optimize` function should recursively optimize the sub-expressions and then match on the optimized sub-expressions.
{'''### Hint: Do NOT use `requires` anywhere.
''' if LANG=='Dafny' else ''
}{'''### Hint: Write the lemma as
lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
''' if LANG=='Dafny' else ''
}{hint_match_dafny
}{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: If you do induction on `e` with sub-expressions `e1` and `e2`, the two inductive hypotheses are called `IHe1` and `IHe2`.
''' if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,# if LANG != 'Dafny' else (lambda v: CHECK_CHEAT(v) or "requires" not in v or "==>" not in v),
    ["Dafny"],
    "lemma CHECK_OptimizerOptimal(e: Expr) ensures optimal(optimize(e)) { OptimizerOptimal(e); }",
    None
)

problem_opt0_opt_coq_check = (f"""### Spec: In {LANG}, write an ADT `Expr` for arithmetic expressions comprising constants, variables and binary addition. Then write a predicate `optimal` that holds on an expression if it has no additions by 0. Then write an optimizer `optimize` that removes all additions by 0. Then write a lemma `OptimizerOptimal` that ensures `optimal(optimize(e))` for all expressions `e`.
{'''### Hint: This is the definiton of the `optimal` predicate:
predicate optimal(e: Expr) {
  match e
  case Add(Const(0), _) => false
  case Add(_, Const(0)) => false
  case Add(e1, e2) => optimal(e1) && optimal(e2)
  case _ => true
}
### Hint: Don't use the same structure for `optimize` as for `optimal`. Instead, follow the next hint.
''' if LANG=='Dafny' else ''
}### Hint: In the addition case, the `optimize` function should recursively optimize the sub-expressions and then match on the optimized sub-expressions.
{'''### Hint: Do NOT use `requires` anywhere.
''' if LANG=='Dafny' else ''
}{'''### Hint: Write the lemma as
lemma OptimizerOptimal(e: Expr)
  ensures optimal(optimize(e))
''' if LANG=='Dafny' else ''
}{hint_match_dafny
}{'''### Hint: For the proof, just do a simple pattern match (match not if) and call the lemma recursively without adding asserts.
''' if LANG=='Dafny' else ''
}{'''### Hint: You can import the `string` datatype with the line `Require Import Coq.Strings.String.`
### Hint: Use Fixpoint instead of Definition for recursive functions.
### Hint: If you do induction on `e` with sub-expressions `e1` and `e2`, the two inductive hypotheses are called `IHe1` and `IHe2`.
''' if LANG=='Coq' else ''
}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,# if LANG != 'Dafny' else (lambda v: CHECK_CHEAT(v) or "requires" not in v or "==>" not in v),
    ["Coq"],
    "Lemma CHECK_OptimizerOptimal: forall (e: Expr), optimal(optimize(e)). Proof. intros. apply OptimizerOptimal; eauto. Qed.",
    None
)

problem_mult = (
    f"""### Spec: In {LANG}, prove that for all natural numbers `a`, `b`, `n`, if `n` is not zero, then `n*a` equals `n*b` implies `a` equals `b`.
{'''### Hint: Define the lemma only once and prove it right there, don't leave a TODO, don't explain the proof beforehand, just prove it.
''' if LANG=='Dafny' else ''
}""",
    1000,
    None,
    8,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_mult_dafny_check = (
    f"""### Spec: In {LANG}, prove the lemma `Mult(a: nat, b: nat, n: nat)`. It states that for all natural numbers `a`, `b`, `n`, if `n` is not zero, then `n*a` equals `n*b` implies `a` equals `b`.
{'''### Hint: Define the lemma only once and prove it right there, don't leave a TODO, don't explain the proof beforehand, just prove it.
''' if LANG=='Dafny' else ''
}""",
    1000,
    None,
    8,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Dafny'],
    """
    lemma {:autocontract} CHECK_Mult(a: nat, b: nat, n: nat)
    requires n > 0 && n*a == n*b
    ensures a == b { Mult(a, b, n); }
    """,
    None
)

problem_max_dafny = (
    """
```dafny
function isMax(m: int, numbers: seq<int>): bool
{
    m in numbers &&
    forall i :: 0 <= i < |numbers| ==> numbers[i] <= m

}

// Calculate the max of a sequence of numbers.
method max(numbers: seq<int>) returns (result: int)
requires numbers != []
ensures isMax(result, numbers)
""",
    1000,
    None,
    5,
    20,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    None,
    None
)


# HumanEvalX, Problem 9
problem_rolling_max_dafny = (
    """
```dafny
function isMax(m: int, numbers: seq<int>): bool
{
    m in numbers &&
    forall i :: 0 <= i < |numbers| ==> numbers[i] <= m

}

// Calculate the max of a sequence of numbers.
method max(numbers: seq<int>) returns (result: int)
requires numbers != []
ensures isMax(result, numbers)
{
    result := numbers[0];
    for i := 1 to |numbers|
    invariant isMax(result, numbers[0..i])
    {
        if numbers[i] > result {
            result := numbers[i];
        }
    }
}

method check_rolling_even(numbers: seq<int>) returns (result: seq<bool>)
ensures |result| == |numbers|
ensures forall i :: 0 < i < |result| ==> result[i] == (numbers[i] % 2 == 0)
{
    result := [];
    for i := 0 to |numbers|
    invariant |result| == i
    invariant forall j :: 0 <= j < i ==> result[j] == (numbers[j] % 2 == 0)
    {
        result := result + [numbers[i] % 2 == 0];
    }
}

// From a given list of integers,
// generate a list of rolling maximum element found
// until given moment in the sequence.
method rolling_max(numbers: seq<int>) returns (result: seq<int>)
requires numbers != []
ensures |result| == |numbers|
ensures forall i :: 0 < i < |result| ==> isMax(result[i], numbers[0..(i+1)])
""",
    1000,
    None,
    5,
    20,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    None,
    None
)


# HumanEvalX, Problem 3
problem_below0_dafny = (
    """
### Hint: In Dafny, the result is assigned `result := true` and `return` takes no arguments.
### Hint: Remember to have an invariant related running balance and the sum.
### Hint: Call the lemma sum_plus immediately after you add to the balance to maintain the invariant, before any if statement.
```Dafny
function sum(s: seq<int>, n: nat): int
    requires n <= |s|
{
    if |s| == 0 || n == 0 then
        0
    else
        s[0] + sum(s[1..], n-1)
}

lemma sum_plus(s: seq<int>, i: nat)
    requires i < |s|
    ensures sum(s, i) + s[i] == sum(s, i+1)
{
}

method below_zero(ops: seq<int>) returns (result: bool)
/*
You're given a list of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
- assert !below_zero([1, 2, 3])
- assert below_zero([1, 2, -4, 5])
*/
    ensures result """
    + "<==>"
    + """ exists n: nat :: n <= |ops| && sum(ops, n) < 0
{
""",
    1000,
    None,
    5,
    20,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    None,
    None
)


problem_intersperse_invariants_dafny = (
    """
Here is the method interperse without verification.
method intersperse_without_verification(numbers: seq<int>, delimiter: int) returns (interspersed: seq<int>)
// TODO: missing ensures here
{
    interspersed := [];
    for i := 0 to |numbers|
    // TODO: missing invariants here
    {
        if i > 0 {
            interspersed := interspersed + [delimiter];
        }
        interspersed := interspersed + [numbers[i]];
    }
}

Now, here is the same method with `ensures` clauses.
Make sure the body verifies by defining `invariant` clauses.
```Dafny
method intersperse(numbers: seq<int>, delimiter: int) returns (interspersed: seq<int>)
/*
Insert a number 'delimeter' between every two consecutive elements of input list `numbers'
- assert intersperse([], 4) == []
- assert intersperse([1, 2, 3], 4) == [1, 4, 2, 4, 3]
*/
    ensures |interspersed| == if |numbers| > 0 then 2 * |numbers| - 1 else 0
    ensures forall i :: 0 <= i < |interspersed| ==> i % 2 == 0 ==>
                interspersed[i] == numbers[i / 2]
    ensures forall i :: 0 <= i < |interspersed| ==> i % 2 == 1 ==>
                interspersed[i] == delimiter
{
""",
    1000,
    None,
    5,
    20,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    None,
    None
)


# HumanEvalX, Problem 3
problem_intersperse_dafny = (
    """
```Dafny
method intersperse(numbers: seq<int>, delimiter: int) returns (interspersed: seq<int>)
/*
Insert a number 'delimeter' between every two consecutive elements of input list `numbers'
- assert intersperse([], 4) == []
- assert intersperse([1, 2, 3], 4) == [1, 4, 2, 4, 3]
*/
    ensures |interspersed| == if |numbers| > 0 then 2 * |numbers| - 1 else 0
    ensures forall i :: 0 <= i < |interspersed| ==> i % 2 == 0 ==>
                interspersed[i] == numbers[i / 2]
    ensures forall i :: 0 <= i < |interspersed| ==> i % 2 == 1 ==>
                interspersed[i] == delimiter
{
""",
    1000,
    None,
    5,
    20,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    None,
    None
)

problem_bst = (f"""### Spec: In {LANG}, (1) write an ADT for a tree of natural numbers.
Then (2) write a predicate that checks whether a given tree is a binary search tree (BST).
Then (3) write a function that inserts an element into a binary search tree while preserving the BST property.
Then (4) write a predicate that checks whether a given tree contains a given element.
Then (5) write a lemma about the insert function that ensures that the tree resulting from inserting an element contains that element (without requiring nor ensuring the BST property).
Then (6) write another lemma about the insert function that checks the BST property continues to hold after insertion. This lemma should take bounds on the BST, and require that the element to be inserted is within those bounds.
{'### Hint: For each proof, do not use assertions. Just analyze the structure based on the insert function, and recursively call the lemma to match the recursive calls in the function.' if LANG=='Dafny' else ''}
{hint_match_dafny}{'### Hint: do not have `requires` nor `ensures` clauses in the insert function. The lemmas will be proved after the definition; in those lemmas, have `requires` and `ensures` clauses.' if LANG=='Dafny' else ''
}{'### Hint: Use Fixpoint instead of Definition for recursive functions.' if LANG=='Coq' else ''
}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_bst_dafny_check = (f"""### Spec: In {LANG}, (1) write an ADT for a tree of natural numbers. Call it `Tree`.
Then (2) write a predicate `IsBST` that checks whether a given tree is a binary search tree (BST).
Then (3) write a function `insert` that inserts an element into a binary search tree while preserving the BST property.
Then (4) write a predicate `Contains` that checks whether a given tree contains a given element.
Then (5) write a lemma `InsertContains` about the insert function that ensures that the tree resulting from inserting an element contains that element (without requiring nor ensuring the BST property).
Then (6) write another lemma `InsertPreservesBST` about the insert function that checks the BST property continues to hold after insertion. This lemma should take bounds on the BST, and require that the element to be inserted is within those bounds.
{'### Hint: For each proof, do not use assertions. Just analyze the structure based on the insert function, and recursively call the lemma to match the recursive calls in the function.' if LANG=='Dafny' else ''}
{hint_match_dafny}{'### Hint: do not have `requires` nor `ensures` clauses in the insert function. The lemmas will be proved after the definition; in those lemmas, have `requires` and `ensures` clauses.' if LANG=='Dafny' else ''
}{'### Hint: Use Fixpoint instead of Definition for recursive functions.' if LANG=='Coq' else ''
}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ['Dafny'],
    """
// (5) Lemma about the insert function that ensures the tree resulting from inserting an element contains that element
lemma CHECK_InsertContains(t: Tree, x: nat)
  ensures Contains(insert(t, x), x)
{
  InsertContains(t, x);
}

// (6) Lemma about the insert function that checks the BST property continues to hold after insertion
lemma CHECK_InsertPreservesBST(t: Tree, x: nat, min: nat, max: nat)
  requires IsBST(t, min, max) && min <= x <= max
  ensures IsBST(insert(t, x), min, max)
{
    InsertPreservesBST(t, x, min, max);
}
    """,
    None
)

problem_bst_coq_check = (f"""### Spec: In {LANG}, (1) write an ADT for a tree of natural numbers. Call it `Tree`.
Then (2) write a predicate `IsBST` that checks whether a given tree is a binary search tree (BST).
Then (3) write a function `insert` that inserts an element into a binary search tree while preserving the BST property.
Then (4) write a predicate `Contains` that checks whether a given tree contains a given element.
Then (5) write a lemma `InsertContains` about the insert function that ensures that the tree resulting from inserting an element contains that element (without requiring nor ensuring the BST property).
Then (6) write another lemma `InsertPreservesBST` about the insert function that checks the BST property continues to hold after insertion. This lemma should take bounds on the BST, and require that the element to be inserted is within those bounds.
### Hint: Start with `Require Import List. Import ListNotations.`
{'### Hint: For each proof, do not use assertions. Just analyze the structure based on the insert function, and recursively call the lemma to match the recursive calls in the function.' if LANG=='Dafny' else ''}
{hint_match_dafny}{'### Hint: do not have `requires` nor `ensures` clauses in the insert function. The lemmas will be proved after the definition; in those lemmas, have `requires` and `ensures` clauses.' if LANG=='Dafny' else ''
}{'### Hint: Use Fixpoint instead of Definition for recursive functions.' if LANG=='Coq' else ''
}
### Hint: Use `l` and `r` for variable names instead of `left` and `right` to avoid name clashes.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ['Coq'],
    """
// (5) Lemma about the insert function that ensures the tree resulting from inserting an element contains that element
Lemma CHECK_InsertContains: forall (t: Tree) (x: nat),
  Contains (insert t  x) x.
Proof.
  intros.
  eapply InsertContains; eauto.
Qed.

// (6) Lemma about the insert function that checks the BST property continues to hold after insertion
lemma CHECK_InsertPreservesBST: forall (t: Tree) (x: nat) (min: nat) (max: nat),
  (IsBST t min max) -> min <= x <= max ->
  IsBST (insert t x) min max.
Proof.
    intros.
    eapply InsertPreservesBST; eauto.
Qed.
    """,
    None
)

problem_bst_dafny_sanity_check = ((hint_match_dafny+"""
In Dafny, an ADT for a tree of natural numbers.

```dafny
datatype Tree = Empty | Node(left: Tree, value: nat, right: Tree)
```

a predicate that checks whether a given tree is a binary search tree (BST):

```dafny
function IsBST(t: Tree, min: nat, max: nat): bool
{
""",
["", """
a function that inserts an element into a binary search tree while preserving the BST property:

```dafny
function Insert(t: Tree, value: nat): Tree
{
""",
 "", """
a predicate that checks whether a given tree contains a given element:

```dafny
function Contains(t: Tree, value: nat): bool
{
""",
 "", """
a lemma about the insert function that ensures that the tree resulting from inserting an element contains that element (without requiring nor ensuring the BST property):

```dafny
lemma InsertEnsuresContains(t: Tree, value: nat)
  ensures Contains(Insert(t, value), value)
{
""",
 "", """
another lemma about the insert function that checks the BST property continues to hold after insertion. This lemma should take bounds on the BST, and require that the element to be inserted is within those bounds:

```dafny
lemma InsertPreservesBST(t: Tree, value: nat, min: nat, max: nat)
  requires min <= value < max && IsBST(t, min, max)
  ensures IsBST(Insert(t, value), min, max)
{
"""]),
    1000,
    None,
    5,
    15,
    NO_CHECK_PROOF, NO_CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_repeat = (
    f"""### Spec: In {LANG}:
(1) Write a function `repeat` that takes an integer `x` and a natural number `n` as inputs, and returns a list of length `n` in which every element is `x`.
(2) Then write a lemma `repeat_correct` that checks that for any `x` and `n`, `repeat` returns a list of length `n` and that every element of the list is `x`.
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: In a specification, you can write `forall i :: 0 <= i < n ==> CONDITION`.
''' if LANG == 'Dafny' else ''}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_repeat_dafny_check = (
    f"""### Spec: In {LANG}:
(1) Write a function `repeat` that takes an integer `x` and a natural number `n` as inputs, and returns a list of length `n` in which every element is `x`.
(2) Then write a lemma `repeat_correct` that checks that for any `x` and `n`, `repeat` returns a list of length `n` and that every element of the list is `x`.
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: In a specification, you can write `forall i :: 0 <= i < n ==> CONDITION`.
''' if LANG == 'Dafny' else ''}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Dafny'],
    """
    lemma CHECK_repeat_correct(x: int, n: nat)
      ensures |repeat(x, n)| == n
      ensures forall i :: 0 <= i < n ==> repeat(x, n)[i] == x
    {
      repeat_correct(x, n);
    }
    """,
    None
)

problem_repeat_coq_check = (
    f"""### Spec: In {LANG}:
(1) Write a function `repeat` that takes an integer `x` and a natural number `n` as inputs, and returns a list of length `n` in which every element is `x`.
(2) Then write a lemma `repeat_correct` that checks that for any `x` and `n`, `repeat` returns a list of length `n` and that every element of the list is `x`.
### Hint: Start with `Require Import List. Import ListNotations.`
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: In a specification, you can write `forall i :: 0 <= i < n ==> CONDITION`.
''' if LANG == 'Dafny' else ''}""",
    1000,
    None,
    22,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    """
    Lemma CHECK_repeat_correct: forall (x: int) (n: nat),
      length (repeat x n) = n /\
      forall i, 0 <= i -> i < n -> nth (repeat x n) i = x.
    Proof.
      intros.
      eapply repeat_correct; eauto.
    Qed.
    """,
    None
)

problem_repeat2 = (
    f"""### Spec: In {LANG}:
(1) Write a function `repeat` that takes an integer `x` and a natural number `n` as inputs, and returns a list of length `n` in which every element is `x`.
(2) Write a lemma that checks that for any `x` and `n`, `repeat` returns a list of length `n`.
(3) Write a lemma that checks that for any `x` and `n`, `repeat` returns a list where every elemenis `x`.
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: In a specification, you can write `forall VAR :: CONDITION1 ==> CONDITION2`.
''' if LANG == 'Dafny' else ''
}{'''### Hint: Import `Coq.Lists.List`.
''' if LANG == 'Coq' else ''}""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_reverse = (f"""### Spec: In {LANG}:
(1) Write a function `reverse` that takes a list as input and reverses it.
(2) Then write a lemma `reverse_permutes` that checks that for any list `l`, an element exists in `l` if and only if it exists in the result of calling `reverse` on `l`.
(3) Then write a lemma `reverse_involutes` that checks that for any list `l`, calling `reverse` twice on `l` yields `l`.
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: Use a plain `function` to define `reverse`, not a `function method` or a `method`.
''' if LANG == 'Dafny' else ''
}{'''### Hint: Import `Coq.Lists.List`.
''' if LANG == 'Coq' else ''}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_reverse_dafny_check = (f"""### Spec: In {LANG}:
(1) Write a function `reverse` that takes a list as input and reverses it.
(2) Then write a lemma `reverse_permutes` that checks that for any list `l`, an element exists in `l` if and only if it exists in the result of calling `reverse` on `l`.
(3) Then write a lemma `reverse_involutes` that checks that for any list `l`, calling `reverse` twice on `l` yields `l`.
{'''### Hint: The length of a list or sequence `s` is `|s|`.
### Hint: Use a plain `function` to define `reverse`, not a `function method` or a `method`.
''' if LANG == 'Dafny' else ''
}{'''### Hint: Import `Coq.Lists.List`.
''' if LANG == 'Coq' else ''}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF2, CHECK_CHEAT,
    ["Dafny"],
    """
    lemma CHECK__reverse_permutes(l: seq<int>)
    // TODO
    {
    }
    lemma CHECK__reverse_involutes(l: seq<int>)
    ensures reverse(reverse(l)) == l;
    {
      reverse_involutes(l);
    }
    """,
    None
)

problem_append = (f"""### Spec: In {LANG}:
(1) Write a function `app` that takes two lists of natural numbers as input and concatenates them.
(2) Then write a function `nth_elt` that returns the `n`th element of a given list of natural numbers.
(3) Then write a lemma `app_correct` that checks that for any two lists of natural numbers `l1` and `l2` and any natural number `n`,  the `n`th element of the result of calling app on `l1` and `l2` is either the nth element of `l1` or the `(n - length l1)`th element of `l2`.
{'''### Hint: In Dafny, the length of a list `l` is `|l|`.
''' if LANG == 'Dafny' else ''}{
'''### Hint: Import `Coq.Lists.List`.
''' if LANG == 'Coq' else ''}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_unzip = (f"""### Spec: In {LANG}:
(1) Write a function `unzip` that takes a list of pairs and returns a pair of lists, where the first element is a list of all the first elements of the original list, and the second elemens is a list of all the second elements of the original list.
(2) Then write a lemma that proves that the length of the lists in the returned pair of `unzip` are the same as the length of the original list.
{'''### Hint: In Dafny, the length of a list `l` is `|l|`.
### Hint: Write `unzip` as a `function`, not a `method`.
''' if LANG == 'Dafny' else ''}{
'''### Hint: Import `Coq.Lists.List`.
''' if LANG == 'Coq' else ''}
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_days = (f"""### Spec: In {LANG}:
(1) Write an ADT for the days of the week: Sunday to Saturday.
(2) Write a function that gives the next business day.
(3) Write a function that iterates the next business day function, for an arbitrary number n of business days.
(4) Write a lemma that ensures that starting with a business day, taking the next five business days is idempotent.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_days_dafny_check = (f"""### Spec: In {LANG}:
(1) Write an ADT `Day` for the days of the week: `Sunday` to `Saturday`.
(2) Write a function `next_biz_day` that gives the next business day.
(3) Write a function`iter_biz_day(d: Day, n: nat): Day` that iterates the next business day function, for an arbitrary number n of business days.
(4) Write a lemma `iter5_biz_day_idempotent` that ensures that starting with a business day, taking the next five business days is idempotent.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ["Dafny"],
    """
    lemma CHECK_iter5_biz_day_idempotent(d: Day)
    requires d != Saturday
    requires d != Sunday
    ensures iter_biz_day(d, 5) == d
    {
      iter5_biz_day_idempotent(d);
    }
    """,
    None
)

problem_food = (f"""### Spec: In {LANG}:
(1) Write a datatype for food: Pasta or Pizza. Each Pasta or Pizza has a list of toppings. Each topping is one of: tomato, cheese, olive, broccoli, mushroom, pepper.
(2) Write a predicate that accepts any pizza with five toppings or fewer, and any pasta with two toppings or fewer.
(3) Write a lemma that proves that an accepted food with more than three toppings must be a pizza.
### Hint: The length of a list or sequence `s` is `|s|`.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_food_dafny_check = (f"""### Spec: In {LANG}:
(1) Write a datatype for `Food`: `Pasta` or `Pizza`. Each Pasta or Pizza has a list of toppings. Each `Topping` is one of: `tomato`, `cheese`, `olive`, `broccoli`, `mushroom`, `pepper`.
(2) Write a predicate `ok` that accepts any pizza with five toppings or fewer, and any pasta with two toppings or fewer.
(3) Write a lemma `ok3_pizza` that proves that an accepted food with three or more toppings must be a pizza.
### Hint: The length of a list or sequence `s` is `|s|`.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Dafny'],
    """
    lemma CHECK_ok3_pizza(x: Food)
    requires ok(x)
    requires |x.toppings| >= 3
    ensures match x { case Pizza(_) => true case _ => false }
    {
      ok3_pizza(x);
    }
    """,
    None
)

problem_lights = (f"""### Spec: In {LANG}:
(1) Write a datatype for traffic lights with cases red, yellow, green.
(2) Write a function which takes two lights, source and target, and returns a list of lights, the first element being the source and the last element being the target. If the source and target are not yellow and are distinct, then the returned list has a middle element of yellow.
(3) Write a lemma to prove that a returned list never has adjacent elements that are distinct and red or green.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problem_lights_more = (f"""### Spec: In {LANG}:
(1) Write a datatype `light` for traffic lights with cases `Red`, `Yellow`, `Green`.
(2) Write a function `activation` which takes two lights, source and target, and returns a list of lights, the first element being the source and the last element being the target. If the source and target are not yellow and are distinct, then the returned list has a middle element of yellow.
(3) Write a helper `adjacent_ok` that takes two lights, and checks that they are not one red and the other green.
(4) Write a helper `all_adjacent_ok` that takes a list of lights, and checks that all adjacent elements are `adjacent_ok`.
(5) Write a lemma `check_activation(source: light, target: light)` to prove that a returned list never has adjacent elements that are distinct and red or green. The `ensures` clause should be `all_adjacent_ok(activation(source, target))`.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Dafny'],
    None,
    None
)

problem_lights_more_check = (
    problem_lights_more[0],
    problem_lights_more[1],
    problem_lights_more[2],
    problem_lights_more[3],
    problem_lights_more[4],
    problem_lights_more[5],
    problem_lights_more[6],
    ['Dafny'],
    """lemma CHECK__check_activation(source: light, target: light)
    ensures all_adjacent_ok(activation(source, target))
    {
      check_activation(source, target);
    }
    """,
    None)
    

problem_lights_more_coq_check = (f"""### Spec: In {LANG}:
(1) Write a datatype `light` for traffic lights with cases `Red`, `Yellow`, `Green`.
(2) Write a function `activation` which takes two lights, source and target, and returns a list of lights, the first element being the source and the last element being the target. If the source and target are not yellow and are distinct, then the returned list has a middle element of yellow.
(3) Write a helper `adjacent_ok` that takes two lights, and checks that they are not one red and the other green.
(4) Write a helper `all_adjacent_ok` that takes a list of lights, and checks that all adjacent elements are `adjacent_ok`.
(5) Write a lemma `check_activation` to prove that forall source and target lights, a returned list never has adjacent elements that are distinct and red or green. The proposition should be `all_adjacent_ok (activation source target)`.
### Hint: Start with `Require Import List. Import ListNotations.`
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ['Coq'],
    """Lemma CHECK__check_activation: forall (source: light) (target: light),
    all_adjacent_ok(activation(source  target).
    Proof.
      intros.
      eapply check_activation; eauto.
    Qed.
    """,
    None
)


problem_max_and_lists = (f"""### Spec: In {LANG}:
(1) Write a function that takes three number lists of the same length, and compute the element-by-element max resulting in a new list.
(2) Prove that using the previous function, then a max on the resulting list, vs using the max on each list, then the max on three maxes, result in the same max.
""",
    1000,
    None,
    5,
    40,
    CHECK_PROOF, CHECK_CHEAT,
    ALL_LANGS,
    None,
    None
)

problems_dict = {
    "problem_python_2_steps" : problem_python_2_steps,
    "problem_python_2_oneshot" : problem_python_2_oneshot,
    "problem_python_3_steps" : problem_python_3_steps,
    "problem_python_3_oneshot" : problem_python_3_oneshot,
    "problem_python_4_steps" : problem_python_4_steps,
    "problem_python_4_oneshot" : problem_python_4_oneshot,
    "problem_multistep_python" : problem_multistep_python,
    "problem_parser_res" : problem_parser_res,
    "problem_parser_myfib" : problem_parser_myfib,
    "problem_parser_race" : problem_parser_race,
    "problem_parser_quad" : problem_parser_quad,
    "problem_parser_word" : problem_parser_word,
    "problem_parser_interest" : problem_parser_interest,
    "problem_parser_data" : problem_parser_data,
    "problem_fact" : problem_fact,
    "problem_mult_proof_coq" : problem_mult_proof_coq,
    "problem_1_divides_n_proof_coq" : problem_1_divides_n_proof_coq,
    "problem_partial_maps_proof_coq" : problem_partial_maps_proof_coq,
    "problem_opt0_proof_coq" : problem_opt0_proof_coq,
    "problem_opt0_coq_proof_hints" : problem_opt0_coq_proof_hints,
    "problem_opt0" : problem_opt0,
    "problem_opt0_opt_dafny" : problem_opt0_opt_dafny,
    "problem_opt0_opt_dafny_sanity_check" : problem_opt0_opt_dafny_sanity_check,
    "problem_opt0_dafny_sanity_check" : problem_opt0_dafny_sanity_check,
    "problem_opt0_opt" : problem_opt0_opt,
    "problem_opt0_dafny_check": problem_opt0_dafny_check,
    "problem_opt0_coq_check": problem_opt0_coq_check,
    "problem_mult" : problem_mult,
    "problem_max_dafny" : problem_max_dafny,
    "problem_rolling_max_dafny" : problem_rolling_max_dafny,
    "problem_below0_dafny" : problem_below0_dafny,
    "problem_intersperse_invariants_dafny" : problem_intersperse_invariants_dafny,
    "problem_intersperse_dafny" : problem_intersperse_dafny,
    "problem_bst" : problem_bst,
    "problem_bst_dafny_sanity_check" : problem_bst_dafny_sanity_check,
    "problem_pattern_match_train_dafny" : problem_pattern_match_train_dafny,
    "problem_pattern_match_train_dafny2" : problem_pattern_match_train_dafny2,
    "problem_repeat" : problem_repeat,
    "problem_repeat_dafny_check" : problem_repeat_dafny_check,
    "problem_repeat_coq_check" : problem_repeat_coq_check,
    "problem_repeat2" : problem_repeat2,
    "problem_reverse" : problem_reverse,
    "problem_reverse_dafny_check" : problem_reverse_dafny_check,
    "problem_append" : problem_append,
    "problem_unzip" : problem_unzip,
    "problem_days" : problem_days,
    "problem_days_dafny_check" : problem_days_dafny_check,
    "problem_food" : problem_food,
    "problem_food_dafny_check" : problem_food_dafny_check,
    "problem_lights" : problem_lights,
    "problem_lights_more" : problem_lights_more,
    "problem_lights_more_check" : problem_lights_more_check,
    "problem_lights_more_coq_check": problem_lights_more_coq_check,
    "problem_max_and_lists" : problem_max_and_lists,
    "problem_fact_dafny_check": problem_fact_dafny_check,
    "problem_fact_coq_check": problem_fact_coq_check,
    "problem_opt0_opt_dafny_check": problem_opt0_opt_dafny_check,
    "problem_opt0_opt_coq_check": problem_opt0_opt_coq_check,
    "problem_mult_dafny_check": problem_mult_dafny_check,
    "problem_bst_dafny_check" : problem_bst_dafny_check,
    "problem_bst_coq_check" : problem_bst_coq_check,
}

# Set the right-hand side to the selected problem.
(
    prompt,
    max_new_tokens,
    expansion_count,
    min_lines,
    max_depth,
    check_func,
    check_cheat_func,
    supported_langs,
    check_string,
    test_dict
) = problems_dict[args.problem_name]

if type(prompt) is tuple:
    (prompt, sanity_check) = prompt
else:
    sanity_check = []

assert LANG in supported_langs

def remove_hints2(prompt):
    return prompt[:prompt.index('### Hint')]

def remove_hints3(prompt):
    try:
        i = prompt.rindex("```")
        code = prompt[i:]
    except ValueError:
        code = ""
    return prompt[:prompt.index('### Hint')]+"\n\n"+code
    
def remove_hints(prompt):
    lines = prompt.split("\n")
    lines = [line for line in lines if not line.startswith("### Hint: ")]
    return "\n".join(lines)

if args.remove_hints:
    prompt = remove_hints3(prompt)

if prompt.count("```") % 2 == 1:
    pass

elif False and 'factorial' in prompt and LANG == "Coq":
    prompt += f"""
### Hint: Use some lemmas provided in Out. You cannot solve the base case by `reflexivity` since `<` is not reflexive. You also need a lemma in the inductive case. Use `apply` to use a lemma.

```{LANG.lower()}

Require Import Arith.
Search (0 < 1) inside Nat.
Search (_ < _ -> _ < _ + _) inside Nat.

Fixpoint factorial
"""
#Check Nat.lt_0_1.
#Check Nat.lt_lt_add_r.

elif LANG == "Coq" and "Proof." in prompt:
    pass

elif LANG != "Lean4":
    prompt += f"""
```{LANG.lower()}
"""

elif LANG == "Lean4":
    prompt += """
```lean4
import Mathlib
"""

if LANG == "Coq" and args.coq_import_lia:
    prompt += """
Require Import Lia.
"""