Hi,
I'm working on a proof that produces many subgoals due to a rather
complex case-splitting structure. To see, if some changes to the proof
increase or decrease the complexity, I'd like to know how many subgoals
are produced and solved in the whole proof.
So, is there any way to find out the number of subgoals, without
manually stepping through the proof and counting?
I know I can use the running time of the proof to compare different
approaches, but I'm not sure how accurate this will be.
With regards,
Matthias
------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot
_______________________________________________
hol-info mailing list
hol-info@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/hol-info
