1.1 --- a/src/HOL/Mirabelle/Tools/mirabelle_sledgehammer.ML	Fri Dec 17 15:30:43 2010 +0100
     1.2 +++ b/src/HOL/Mirabelle/Tools/mirabelle_sledgehammer.ML	Fri Dec 17 16:20:02 2010 +0100
     1.3 @@ -376,7 +376,8 @@
     1.4      val problem =
     1.5        {state = st', goal = goal, subgoal = i,
     1.6         subgoal_count = Sledgehammer_Util.subgoal_count st,
     1.7 -       facts = facts |> map Sledgehammer_Provers.Untranslated_Fact}
     1.8 +       facts = facts |> map Sledgehammer_Provers.Untranslated_Fact,
     1.9 +       smt_head = NONE}
    1.10      val time_limit =
    1.11        (case hard_timeout of
    1.12          NONE => I

     2.1 --- a/src/HOL/Mirabelle/Tools/sledgehammer_tactic.ML	Fri Dec 17 15:30:43 2010 +0100
     2.2 +++ b/src/HOL/Mirabelle/Tools/sledgehammer_tactic.ML	Fri Dec 17 16:20:02 2010 +0100
     2.3 @@ -47,7 +47,8 @@
     2.4                          (prop_of goal))
     2.5      val problem =
     2.6        {state = Proof.init ctxt, goal = goal, subgoal = i, subgoal_count = n,
     2.7 -       facts = map Sledgehammer_Provers.Untranslated_Fact facts}
     2.8 +       facts = map Sledgehammer_Provers.Untranslated_Fact facts,
     2.9 +       smt_head = NONE}
    2.10    in
    2.11      (case prover params (K "") problem of
    2.12        {outcome = NONE, used_facts, ...} => used_facts |> map fst |> SOME