(* Mon Nov 11 10:26:04 2002 *)
(* Using IntSet no eager transitive closure *)
(* On Karl Crary's test set *)

- Twelf.Print.subord();
Total families = 1107
Total edges =    6170 (*  6)
subTrue =       61465 (* 10)
subFalse =     380655 (*  6)
subTotal =     442120 (+ subTrue SubFalse)
reachCalls = 91143817 (* 206)

(* Timings on altosax.concert.cs.cmu.edu *)
(* Mon Nov 18 08:19:38 2002 -fp *)
(* Twelf.chatter := 1; Twelf.make "karl/sources.cfg" *)
(* This version uses
   inverted graph,
   no transitive closure,
   and incremental memotable
*)

- Twelf.Timers.show ();
Parsing       : Real =   2.121, Run =   1.910 (  1.880 usr,  0.030 gc)
Reconstruction: Real =   5.047, Run =   4.940 (  4.870 usr,  0.790 gc)
Abstraction   : Real =   1.619, Run =   1.460 (  1.440 usr,  0.190 gc)
Checking      : Real =   2.175, Run =   2.210 (  2.200 usr,  0.170 gc)
Modes         : Real =   0.362, Run =   0.350 (  0.350 usr,  0.000 gc)
Subordination : Real =   3.683, Run =   3.650 (  3.600 usr,  0.310 gc)
Termination   : Real =   0.687, Run =   0.570 (  0.570 usr,  0.040 gc)
Printing      : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Compiling     : Real =   0.031, Run =   0.030 (  0.030 usr,  0.000 gc)
Solving       : Real =   0.204, Run =   0.180 (  0.180 usr,  0.070 gc)
Coverage      : Real =  67.730, Run =  66.510 ( 66.110 usr,  2.580 gc)
Worlds        : Real =   0.467, Run =   0.420 (  0.420 usr,  0.000 gc)
ProofRecon    : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Filling       : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Filling Tabled: Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Splitting     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Recursion     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Inference     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Total         : Real =  84.125, Run =  82.230 ( 81.650 usr,  4.180 gc)

(* Twelf.doubleCheck := false *)
- Twelf.Timers.show ();
Parsing       : Real =   2.180, Run =   2.060 (  2.040 usr,  0.260 gc)
Reconstruction: Real =   4.767, Run =   4.830 (  4.770 usr,  0.510 gc)
Abstraction   : Real =   1.578, Run =   1.620 (  1.610 usr,  0.190 gc)
Checking      : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Modes         : Real =   0.441, Run =   0.470 (  0.470 usr,  0.060 gc)
Subordination : Real =   3.640, Run =   3.320 (  3.270 usr,  0.350 gc)
Termination   : Real =   0.740, Run =   0.730 (  0.720 usr,  0.120 gc)
Printing      : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Compiling     : Real =   0.031, Run =   0.020 (  0.020 usr,  0.000 gc)
Solving       : Real =   0.195, Run =   0.190 (  0.180 usr,  0.060 gc)
Coverage      : Real =  53.356, Run =  52.970 ( 52.770 usr,  2.340 gc)
Worlds        : Real =   0.473, Run =   0.440 (  0.440 usr,  0.020 gc)
ProofRecon    : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Filling       : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Filling Tabled: Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Splitting     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Recursion     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Inference     : Real =   0.000, Run =   0.000 (  0.000 usr,  0.000 gc)
Total         : Real =  67.400, Run =  66.650 ( 66.290 usr,  3.910 gc)