renamed Sledgehammer options for symmetry between positive and negative versions
authorblanchet
Thu Jan 30 14:37:53 2014 +0100 (2014-01-30)
changeset 5518317ec4a29ef71
parent 55182 dd1e95e67b30
child 55184 6e2295db4cf8
renamed Sledgehammer options for symmetry between positive and negative versions
NEWS
src/Doc/Sledgehammer/document/root.tex
src/HOL/Metis_Examples/Big_O.thy
src/HOL/Metis_Examples/Sets.thy
src/HOL/Metis_Examples/Trans_Closure.thy
src/HOL/Tools/Sledgehammer/sledgehammer_compress.ML
src/HOL/Tools/Sledgehammer/sledgehammer_isar.ML
src/HOL/Tools/Sledgehammer/sledgehammer_minimize.ML
src/HOL/Tools/Sledgehammer/sledgehammer_provers.ML
src/HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML
     1.1 --- a/NEWS	Thu Jan 30 14:28:04 2014 +0100
     1.2 +++ b/NEWS	Thu Jan 30 14:37:53 2014 +0100
     1.3 @@ -114,6 +114,14 @@
     1.4  * Theory reorganizations:
     1.5    * Big_Operators.thy ~> Groups_Big.thy and Lattices_Big.thy
     1.6  
     1.7 +* Sledgehammer:
     1.8 +  - Renamed options:
     1.9 +      isar_compress ~> compress_isar
    1.10 +      isar_try0 ~> try0_isar
    1.11 +    INCOMPATIBILITY.
    1.12 +
    1.13 +* Try0: Added 'algebra' and 'meson' to the set of proof methods.
    1.14 +
    1.15  * The symbol "\<newline>" may be used within char or string literals
    1.16  to represent (Char Nibble0 NibbleA), i.e. ASCII newline.
    1.17  
     2.1 --- a/src/Doc/Sledgehammer/document/root.tex	Thu Jan 30 14:28:04 2014 +0100
     2.2 +++ b/src/Doc/Sledgehammer/document/root.tex	Thu Jan 30 14:37:53 2014 +0100
     2.3 @@ -359,7 +359,7 @@
     2.4  \item[\labelitemi] \textbf{\textit{isar\_proofs}} (\S\ref{output-format}) specifies
     2.5  that Isar proofs should be generated, in addition to one-liner \textit{metis} or
     2.6  \textit{smt} proofs. The length of the Isar proofs can be controlled by setting
     2.7 -\textit{isar\_compress} (\S\ref{output-format}).
     2.8 +\textit{compress\_isar} (\S\ref{output-format}).
     2.9  
    2.10  \item[\labelitemi] \textbf{\textit{timeout}} (\S\ref{timeouts}) controls the
    2.11  provers' time limit. It is set to 30 seconds, but since Sledgehammer runs
    2.12 @@ -1303,15 +1303,15 @@
    2.13  (the default), Isar proofs are only generated when no working one-liner
    2.14  \textit{metis} proof is available.
    2.15  
    2.16 -\opdefault{isar\_compress}{int}{\upshape 10}
    2.17 +\opdefault{compress\_isar}{int}{\upshape 10}
    2.18  Specifies the granularity of the generated Isar proofs if \textit{isar\_proofs}
    2.19  is explicitly enabled. A value of $n$ indicates that each Isar proof step should
    2.20  correspond to a group of up to $n$ consecutive proof steps in the ATP proof.
    2.21  
    2.22  \optrueonly{dont\_compress\_isar}
    2.23 -Alias for ``\textit{isar\_compress} = 0''.
    2.24 +Alias for ``\textit{compress\_isar} = 0''.
    2.25  
    2.26 -\optrue{isar\_try0}{dont\_try0\_isar}
    2.27 +\optrue{try0\_isar}{dont\_try0\_isar}
    2.28  Specifies whether standard proof methods such as \textit{auto} and
    2.29  \textit{blast} should be tried as alternatives to \textit{metis} and
    2.30  \textit{smt} in Isar proofs. The collection of methods is roughly the same as
     3.1 --- a/src/HOL/Metis_Examples/Big_O.thy	Thu Jan 30 14:28:04 2014 +0100
     3.2 +++ b/src/HOL/Metis_Examples/Big_O.thy	Thu Jan 30 14:37:53 2014 +0100
     3.3 @@ -29,7 +29,7 @@
     3.4  
     3.5  (*** Now various verions with an increasing shrink factor ***)
     3.6  
     3.7 -sledgehammer_params [isar_proofs, isar_compress = 1]
     3.8 +sledgehammer_params [isar_proofs, compress_isar = 1]
     3.9  
    3.10  lemma
    3.11    "(\<exists>c\<Colon>'a\<Colon>linordered_idom.
    3.12 @@ -60,7 +60,7 @@
    3.13    thus "\<bar>h x\<bar> \<le> \<bar>c\<bar> * \<bar>f x\<bar>" by (metis F4)
    3.14  qed
    3.15  
    3.16 -sledgehammer_params [isar_proofs, isar_compress = 2]
    3.17 +sledgehammer_params [isar_proofs, compress_isar = 2]
    3.18  
    3.19  lemma
    3.20    "(\<exists>c\<Colon>'a\<Colon>linordered_idom.
    3.21 @@ -83,7 +83,7 @@
    3.22    thus "\<bar>h x\<bar> \<le> \<bar>c\<bar> * \<bar>f x\<bar>" by (metis F2)
    3.23  qed
    3.24  
    3.25 -sledgehammer_params [isar_proofs, isar_compress = 3]
    3.26 +sledgehammer_params [isar_proofs, compress_isar = 3]
    3.27  
    3.28  lemma
    3.29    "(\<exists>c\<Colon>'a\<Colon>linordered_idom.
    3.30 @@ -103,7 +103,7 @@
    3.31    thus "\<bar>h x\<bar> \<le> \<bar>c\<bar> * \<bar>f x\<bar>" by (metis A1 abs_ge_zero)
    3.32  qed
    3.33  
    3.34 -sledgehammer_params [isar_proofs, isar_compress = 4]
    3.35 +sledgehammer_params [isar_proofs, compress_isar = 4]
    3.36  
    3.37  lemma
    3.38    "(\<exists>c\<Colon>'a\<Colon>linordered_idom.
    3.39 @@ -123,7 +123,7 @@
    3.40    thus "\<bar>h x\<bar> \<le> \<bar>c\<bar> * \<bar>f x\<bar>" by (metis abs_mult)
    3.41  qed
    3.42  
    3.43 -sledgehammer_params [isar_proofs, isar_compress = 1]
    3.44 +sledgehammer_params [isar_proofs, compress_isar = 1]
    3.45  
    3.46  lemma bigo_alt_def: "O(f) = {h. \<exists>c. (0 < c \<and> (\<forall>x. abs (h x) <= c * abs (f x)))}"
    3.47  by (auto simp add: bigo_def bigo_pos_const)
     4.1 --- a/src/HOL/Metis_Examples/Sets.thy	Thu Jan 30 14:28:04 2014 +0100
     4.2 +++ b/src/HOL/Metis_Examples/Sets.thy	Thu Jan 30 14:37:53 2014 +0100
     4.3 @@ -21,7 +21,7 @@
     4.4  lemma "P(n::nat) ==> ~P(0) ==> n ~= 0"
     4.5  by metis
     4.6  
     4.7 -sledgehammer_params [isar_proofs, isar_compress = 1]
     4.8 +sledgehammer_params [isar_proofs, compress_isar = 1]
     4.9  
    4.10  (*multiple versions of this example*)
    4.11  lemma (*equal_union: *)
    4.12 @@ -70,7 +70,7 @@
    4.13    ultimately show "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V\<Colon>'a set. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))" by metis
    4.14  qed
    4.15  
    4.16 -sledgehammer_params [isar_proofs, isar_compress = 2]
    4.17 +sledgehammer_params [isar_proofs, compress_isar = 2]
    4.18  
    4.19  lemma (*equal_union: *)
    4.20     "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))"
    4.21 @@ -107,7 +107,7 @@
    4.22    ultimately show "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V\<Colon>'a set. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))" by metis
    4.23  qed
    4.24  
    4.25 -sledgehammer_params [isar_proofs, isar_compress = 3]
    4.26 +sledgehammer_params [isar_proofs, compress_isar = 3]
    4.27  
    4.28  lemma (*equal_union: *)
    4.29     "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))"
    4.30 @@ -124,7 +124,7 @@
    4.31    ultimately show "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V\<Colon>'a set. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))" by (metis Un_commute Un_upper2)
    4.32  qed
    4.33  
    4.34 -sledgehammer_params [isar_proofs, isar_compress = 4]
    4.35 +sledgehammer_params [isar_proofs, compress_isar = 4]
    4.36  
    4.37  lemma (*equal_union: *)
    4.38     "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))"
    4.39 @@ -140,7 +140,7 @@
    4.40    ultimately show "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V\<Colon>'a set. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))" by (metis Un_subset_iff Un_upper2)
    4.41  qed
    4.42  
    4.43 -sledgehammer_params [isar_proofs, isar_compress = 1]
    4.44 +sledgehammer_params [isar_proofs, compress_isar = 1]
    4.45  
    4.46  lemma (*equal_union: *)
    4.47     "(X = Y \<union> Z) = (Y \<subseteq> X \<and> Z \<subseteq> X \<and> (\<forall>V. Y \<subseteq> V \<and> Z \<subseteq> V \<longrightarrow> X \<subseteq> V))"
     5.1 --- a/src/HOL/Metis_Examples/Trans_Closure.thy	Thu Jan 30 14:28:04 2014 +0100
     5.2 +++ b/src/HOL/Metis_Examples/Trans_Closure.thy	Thu Jan 30 14:37:53 2014 +0100
     5.3 @@ -44,7 +44,7 @@
     5.4  
     5.5  lemma "\<lbrakk>f c = Intg x; \<forall>y. f b = Intg y \<longrightarrow> y \<noteq> x; (a, b) \<in> R\<^sup>*; (b,c) \<in> R\<^sup>*\<rbrakk>
     5.6         \<Longrightarrow> \<exists>c. (b, c) \<in> R \<and> (a, c) \<in> R\<^sup>*"
     5.7 -(* sledgehammer [isar_proofs, isar_compress = 2] *)
     5.8 +(* sledgehammer [isar_proofs, compress_isar = 2] *)
     5.9  proof -
    5.10    assume A1: "f c = Intg x"
    5.11    assume A2: "\<forall>y. f b = Intg y \<longrightarrow> y \<noteq> x"
     6.1 --- a/src/HOL/Tools/Sledgehammer/sledgehammer_compress.ML	Thu Jan 30 14:28:04 2014 +0100
     6.2 +++ b/src/HOL/Tools/Sledgehammer/sledgehammer_compress.ML	Thu Jan 30 14:37:53 2014 +0100
     6.3 @@ -93,16 +93,16 @@
     6.4  
     6.5  (* Precondition: The proof must be labeled canonically
     6.6     (cf. "Slegehammer_Proof.relabel_proof_canonically"). *)
     6.7 -fun compress_proof isar_compress
     6.8 +fun compress_proof compress_isar
     6.9      ({get_preplay_outcome, set_preplay_outcome, preplay_quietly, ...} : preplay_interface) proof =
    6.10 -  if isar_compress <= 1.0 then
    6.11 +  if compress_isar <= 1.0 then
    6.12      proof
    6.13    else
    6.14      let
    6.15        val (compress_further, decrement_step_count) =
    6.16          let
    6.17            val number_of_steps = add_proof_steps (steps_of_proof proof) 0
    6.18 -          val target_number_of_steps = Real.round (Real.fromInt number_of_steps / isar_compress)
    6.19 +          val target_number_of_steps = Real.round (Real.fromInt number_of_steps / compress_isar)
    6.20            val delta = Unsynchronized.ref (number_of_steps - target_number_of_steps)
    6.21          in
    6.22            (fn () => !delta > 0, fn () => delta := !delta - 1)
     7.1 --- a/src/HOL/Tools/Sledgehammer/sledgehammer_isar.ML	Thu Jan 30 14:28:04 2014 +0100
     7.2 +++ b/src/HOL/Tools/Sledgehammer/sledgehammer_isar.ML	Thu Jan 30 14:37:53 2014 +0100
     7.3 @@ -94,8 +94,8 @@
     7.4     ("max_mono_iters", "smart"),
     7.5     ("max_new_mono_instances", "smart"),
     7.6     ("isar_proofs", "smart"),
     7.7 -   ("isar_compress", "10"),
     7.8 -   ("isar_try0", "true"),
     7.9 +   ("compress_isar", "10"),
    7.10 +   ("try0_isar", "true"),
    7.11     ("slice", "true"),
    7.12     ("minimize", "smart"),
    7.13     ("preplay_timeout", "3")]
    7.14 @@ -103,7 +103,7 @@
    7.15  val alias_params =
    7.16    [("prover", ("provers", [])), (* undocumented *)
    7.17     ("dont_preplay", ("preplay_timeout", ["0"])),
    7.18 -   ("dont_compress_isar", ("isar_compress", ["0"])),
    7.19 +   ("dont_compress_isar", ("compress_isar", ["0"])),
    7.20     ("isar_proof", ("isar_proofs", [])) (* legacy *)]
    7.21  val negated_alias_params =
    7.22    [("no_debug", "debug"),
    7.23 @@ -117,7 +117,7 @@
    7.24     ("no_isar_proofs", "isar_proofs"),
    7.25     ("dont_slice", "slice"),
    7.26     ("dont_minimize", "minimize"),
    7.27 -   ("dont_try0_isar", "isar_try0")]
    7.28 +   ("dont_try0_isar", "try0_isar")]
    7.29  
    7.30  val params_not_for_minimize =
    7.31    ["blocking", "fact_filter", "max_facts", "fact_thresholds", "slice", "minimize"];
    7.32 @@ -286,8 +286,8 @@
    7.33      val max_new_mono_instances =
    7.34        lookup_option lookup_int "max_new_mono_instances"
    7.35      val isar_proofs = lookup_option lookup_bool "isar_proofs"
    7.36 -    val isar_compress = Real.max (1.0, lookup_real "isar_compress")
    7.37 -    val isar_try0 = lookup_bool "isar_try0"
    7.38 +    val compress_isar = Real.max (1.0, lookup_real "compress_isar")
    7.39 +    val try0_isar = lookup_bool "try0_isar"
    7.40      val slice = mode <> Auto_Try andalso lookup_bool "slice"
    7.41      val minimize = if mode = Auto_Try then NONE else lookup_option lookup_bool "minimize"
    7.42      val timeout = lookup_time "timeout"
    7.43 @@ -299,7 +299,7 @@
    7.44       uncurried_aliases = uncurried_aliases, learn = learn, fact_filter = fact_filter,
    7.45       max_facts = max_facts, fact_thresholds = fact_thresholds, max_mono_iters = max_mono_iters,
    7.46       max_new_mono_instances = max_new_mono_instances, isar_proofs = isar_proofs,
    7.47 -     isar_compress = isar_compress, isar_try0 = isar_try0, slice = slice, minimize = minimize,
    7.48 +     compress_isar = compress_isar, try0_isar = try0_isar, slice = slice, minimize = minimize,
    7.49       timeout = timeout, preplay_timeout = preplay_timeout, expect = expect}
    7.50    end
    7.51  
     8.1 --- a/src/HOL/Tools/Sledgehammer/sledgehammer_minimize.ML	Thu Jan 30 14:28:04 2014 +0100
     8.2 +++ b/src/HOL/Tools/Sledgehammer/sledgehammer_minimize.ML	Thu Jan 30 14:37:53 2014 +0100
     8.3 @@ -55,7 +55,7 @@
     8.4  fun print silent f = if silent then () else Output.urgent_message (f ())
     8.5  
     8.6  fun test_facts ({debug, verbose, overlord, spy, provers, max_mono_iters, max_new_mono_instances,
     8.7 -      type_enc, strict, lam_trans, uncurried_aliases, isar_proofs, isar_compress, isar_try0,
     8.8 +      type_enc, strict, lam_trans, uncurried_aliases, isar_proofs, compress_isar, try0_isar,
     8.9        preplay_timeout, ...} : params)
    8.10      silent (prover : prover) timeout i n state goal facts =
    8.11    let
    8.12 @@ -70,7 +70,7 @@
    8.13         uncurried_aliases = uncurried_aliases, learn = false, fact_filter = NONE,
    8.14         max_facts = SOME (length facts), fact_thresholds = (1.01, 1.01),
    8.15         max_mono_iters = max_mono_iters, max_new_mono_instances = max_new_mono_instances,
    8.16 -       isar_proofs = isar_proofs, isar_compress = isar_compress, isar_try0 = isar_try0,
    8.17 +       isar_proofs = isar_proofs, compress_isar = compress_isar, try0_isar = try0_isar,
    8.18         slice = false, minimize = SOME false, timeout = timeout, preplay_timeout = preplay_timeout,
    8.19         expect = ""}
    8.20      val problem =
    8.21 @@ -226,7 +226,7 @@
    8.22  fun adjust_reconstructor_params override_params
    8.23      ({debug, verbose, overlord, spy, blocking, provers, type_enc, strict, lam_trans,
    8.24        uncurried_aliases, learn, fact_filter, max_facts, fact_thresholds, max_mono_iters,
    8.25 -      max_new_mono_instances, isar_proofs, isar_compress, isar_try0, slice, minimize, timeout,
    8.26 +      max_new_mono_instances, isar_proofs, compress_isar, try0_isar, slice, minimize, timeout,
    8.27        preplay_timeout, expect} : params) =
    8.28    let
    8.29      fun lookup_override name default_value =
    8.30 @@ -243,7 +243,7 @@
    8.31       uncurried_aliases = uncurried_aliases, learn = learn, fact_filter = fact_filter,
    8.32       max_facts = max_facts, fact_thresholds = fact_thresholds, max_mono_iters = max_mono_iters,
    8.33       max_new_mono_instances = max_new_mono_instances, isar_proofs = isar_proofs,
    8.34 -     isar_compress = isar_compress, isar_try0 = isar_try0, slice = slice, minimize = minimize,
    8.35 +     compress_isar = compress_isar, try0_isar = try0_isar, slice = slice, minimize = minimize,
    8.36       timeout = timeout, preplay_timeout = preplay_timeout, expect = expect}
    8.37    end
    8.38  
     9.1 --- a/src/HOL/Tools/Sledgehammer/sledgehammer_provers.ML	Thu Jan 30 14:28:04 2014 +0100
     9.2 +++ b/src/HOL/Tools/Sledgehammer/sledgehammer_provers.ML	Thu Jan 30 14:37:53 2014 +0100
     9.3 @@ -36,8 +36,8 @@
     9.4       max_mono_iters : int option,
     9.5       max_new_mono_instances : int option,
     9.6       isar_proofs : bool option,
     9.7 -     isar_compress : real,
     9.8 -     isar_try0 : bool,
     9.9 +     compress_isar : real,
    9.10 +     try0_isar : bool,
    9.11       slice : bool,
    9.12       minimize : bool option,
    9.13       timeout : Time.time,
    9.14 @@ -277,8 +277,8 @@
    9.15     max_mono_iters : int option,
    9.16     max_new_mono_instances : int option,
    9.17     isar_proofs : bool option,
    9.18 -   isar_compress : real,
    9.19 -   isar_try0 : bool,
    9.20 +   compress_isar : real,
    9.21 +   try0_isar : bool,
    9.22     slice : bool,
    9.23     minimize : bool option,
    9.24     timeout : Time.time,
    9.25 @@ -546,8 +546,8 @@
    9.26      ({exec, arguments, proof_delims, known_failures, prem_role, best_slices, best_max_mono_iters,
    9.27        best_max_new_mono_instances, ...} : atp_config)
    9.28      (params as {debug, verbose, overlord, type_enc, strict, lam_trans, uncurried_aliases,
    9.29 -       fact_filter, max_facts, max_mono_iters, max_new_mono_instances, isar_proofs, isar_compress,
    9.30 -       isar_try0, slice, timeout, preplay_timeout, ...})
    9.31 +       fact_filter, max_facts, max_mono_iters, max_new_mono_instances, isar_proofs, compress_isar,
    9.32 +       try0_isar, slice, timeout, preplay_timeout, ...})
    9.33      minimize_command
    9.34      ({comment, state, goal, subgoal, subgoal_count, factss, ...} : prover_problem) =
    9.35    let
    9.36 @@ -797,8 +797,8 @@
    9.37                        |> introduce_spass_skolem
    9.38                        |> factify_atp_proof fact_names hyp_ts concl_t
    9.39                    in
    9.40 -                    (verbose, metis_type_enc, metis_lam_trans, preplay_timeout, isar_compress,
    9.41 -                     isar_try0, atp_proof, goal)
    9.42 +                    (verbose, metis_type_enc, metis_lam_trans, preplay_timeout, compress_isar,
    9.43 +                     try0_isar, atp_proof, goal)
    9.44                    end
    9.45                  val one_line_params =
    9.46                    (preplay, proof_banner mode name, used_facts,
    10.1 --- a/src/HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML	Thu Jan 30 14:28:04 2014 +0100
    10.2 +++ b/src/HOL/Tools/Sledgehammer/sledgehammer_reconstruct.ML	Thu Jan 30 14:37:53 2014 +0100
    10.3 @@ -209,8 +209,8 @@
    10.4    let
    10.5      fun isar_proof_of () =
    10.6        let
    10.7 -        val SOME (verbose, metis_type_enc, metis_lam_trans, preplay_timeout, isar_compress,
    10.8 -          isar_try0, atp_proof, goal) = try isar_params ()
    10.9 +        val SOME (verbose, metis_type_enc, metis_lam_trans, preplay_timeout, compress_isar,
   10.10 +          try0_isar, atp_proof, goal) = try isar_params ()
   10.11  
   10.12          val (params, _, concl_t) = strip_subgoal goal subgoal ctxt
   10.13          val (_, ctxt) =
   10.14 @@ -219,7 +219,7 @@
   10.15            |> (fn fixes => ctxt |> Variable.set_body false |> Proof_Context.add_fixes fixes)
   10.16  
   10.17          val do_preplay = preplay_timeout <> Time.zeroTime
   10.18 -        val isar_try0 = isar_try0 andalso do_preplay
   10.19 +        val try0_isar = try0_isar andalso do_preplay
   10.20  
   10.21          val is_fixed = Variable.is_declared ctxt orf can Name.dest_skolem
   10.22          fun skolems_of t = Term.add_frees t [] |> filter_out (is_fixed o fst) |> rev
   10.23 @@ -364,10 +364,10 @@
   10.24  
   10.25          val (play_outcome, isar_proof) =
   10.26            isar_proof
   10.27 -          |> compress_proof (if isar_proofs = SOME true then isar_compress else 1000.0)
   10.28 +          |> compress_proof (if isar_proofs = SOME true then compress_isar else 1000.0)
   10.29                 preplay_interface
   10.30 -          |> isar_try0 ? try0 preplay_timeout preplay_interface
   10.31 -          |> postprocess_remove_unreferenced_steps (isar_try0 ? min_deps_of_step preplay_interface)
   10.32 +          |> try0_isar ? try0 preplay_timeout preplay_interface
   10.33 +          |> postprocess_remove_unreferenced_steps (try0_isar ? min_deps_of_step preplay_interface)
   10.34            |> `overall_preplay_outcome
   10.35            ||> (chain_direct_proof #> kill_useless_labels_in_proof #> relabel_proof)
   10.36