*To*: George Karabotsos <g_karab at cs.concordia.ca>*Subject*: Re: [isabelle] ML "set simp_trace": Congruence Rule question*From*: Tobias Nipkow <nipkow at in.tum.de>*Date*: Wed, 12 Dec 2007 11:42:03 +0100*Cc*: isabelle-users at cl.cam.ac.uk*In-reply-to*: <475ECBC1.7050200@cs.concordia.ca>*References*: <475ECBC1.7050200@cs.concordia.ca>*User-agent*: Thunderbird 1.5.0.7 (X11/20060909)

The premise A = A == ?c is the instantiated premise of the congruence rule ?b == ?c ==> if ?b then ?x else ?y == if ?c then ?x else ?y

Tobias George Karabotsos wrote:

Hello, I am examining the simplifier's trace for the following lemma: lemma "(if A=A then AV else if AA=BB then BV else CV) = AV" by simpThere is a part of the trace I do not understand - specifically I amtalking about the following part:[1]Applying congruence rule: A = A == ?c ==> if A = A then AV else if AA = BB then BV else CV == if ?c then AV else if AA = BB then BV else CV trace_simp_depth_limit exceeded! Where did the A =A == ?c rule came from? TIA, George

**Follow-Ups**:**Re: [isabelle] ML "set simp_trace": Congruence Rule question***From:*George Karabotsos

**References**:**[isabelle] ML "set simp_trace": Congruence Rule question***From:*George Karabotsos

- Previous by Date: [isabelle] ML "set simp_trace": Congruence Rule question
- Next by Date: Re: [isabelle] ML "set simp_trace": Congruence Rule question
- Previous by Thread: [isabelle] ML "set simp_trace": Congruence Rule question
- Next by Thread: Re: [isabelle] ML "set simp_trace": Congruence Rule question
- Cl-isabelle-users December 2007 archives indexes sorted by: [ thread ] [ subject ] [ author ] [ date ]
- Cl-isabelle-users list archive Table of Contents
- More information about the Cl-isabelle-users mailing list