chore: fail without decreasing proof
diff --git a/src/Lean/Elab/PreDefinition/WF/Fix.lean b/src/Lean/Elab/PreDefinition/WF/Fix.lean index 0526170..6cc1f72 100644 --- a/src/Lean/Elab/PreDefinition/WF/Fix.lean +++ b/src/Lean/Elab/PreDefinition/WF/Fix.lean
@@ -20,8 +20,8 @@ let ctx := { ctx with simpLemmas.toUnfold := toUnfold } if let some mvarId ← simpTarget mvarId ctx then -- TODO: invoke tactic to close the goal - trace[Elab.definition.wf] "{MessageData.ofGoal mvarId}" - admit mvarId + Term.reportUnsolvedGoals [mvarId] + throwAbortTactic private def mkDecreasingProof (decreasingProp : Expr) (decrTactic? : Option Syntax) : TermElabM Expr := do let mvar ← mkFreshExprSyntheticOpaqueMVar decreasingProp
diff --git a/tests/lean/run/mutwf1.lean b/tests/lean/run/mutwf1.lean index c57e1e6..59d6f2e 100644 --- a/tests/lean/run/mutwf1.lean +++ b/tests/lean/run/mutwf1.lean
@@ -19,12 +19,10 @@ | Sum.inr <| Sum.inl ⟨_, _, n, _⟩ => (n, 1) | Sum.inr <| Sum.inr ⟨_, _, _, n⟩ => (n, 0)) (Prod.lex sizeOfWFRel sizeOfWFRel) +decreasing_by admit -- TODO #print f #print g #print h #eval f 5 'a' 'b' - --- TODO: decreasing proofs are still using `sorry` -#print axioms f