TSTP Solution File: LCL030-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL030-1 : TPTP v8.2.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 23:55:11 EDT 2024
% Result : Unsatisfiable 33.21s 4.66s
% Output : CNFRefutation 33.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 5
% Syntax : Number of clauses : 72 ( 36 unt; 0 nHn; 24 RR)
% Number of literals : 113 ( 0 equ; 44 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 4 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 201 ( 35 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(c0_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_1) ).
cnf(c0_2,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_2) ).
cnf(c0_3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c0_3) ).
cnf(prove_c0_6,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_c0_6) ).
cnf(c_0_5,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_6,plain,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
c_0_5 ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
c0_1 ).
cnf(c_0_8,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X3,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
c0_2 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X1),X1)),
c0_3 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X2,X3),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X2,X3),X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X2,X3))) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),X3))
| ~ is_a_theorem(implies(implies(X3,X4),X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_11]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X1,X2),X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_22,plain,
is_a_theorem(implies(X1,implies(X2,X2))),
inference(spm,[status(thm)],[c_0_19,c_0_10]) ).
cnf(c_0_23,plain,
is_a_theorem(implies(implies(implies(X1,X2),implies(X2,X3)),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(implies(implies(X1,X1),X2),X2)),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_14,c_0_7]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X3,X3),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_24]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(X3,X1),X2)) ),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X2,implies(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X3,X3),X1)) ),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_31,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(X4,X1),X3)) ),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_33,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_29,c_0_7]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),X3))
| ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X1,X3),X3)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(implies(X1,implies(implies(X1,X2),X2)),X3),X3)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(implies(X2,X3),X3)),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_36]) ).
cnf(c_0_38,plain,
is_a_theorem(implies(implies(implies(implies(X1,X2),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_37,c_0_7]) ).
cnf(c_0_39,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(implies(X1,X3),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_38]) ).
cnf(c_0_40,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_28,c_0_7]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_39,c_0_8]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_29,c_0_40]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(X3,X1),implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_41,c_0_7]) ).
cnf(c_0_44,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_42]) ).
cnf(c_0_45,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X1,X3)),implies(X2,X3)))),
inference(spm,[status(thm)],[c_0_39,c_0_43]) ).
cnf(c_0_46,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(implies(X4,X1),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_44]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X2,implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_41,c_0_45]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X1,implies(X3,X2)),X4),X4))),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(implies(implies(X1,implies(X2,X3)),X4),implies(implies(X1,X3),X4))),
inference(spm,[status(thm)],[c_0_41,c_0_48]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(implies(X1,implies(X4,X2)),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_49]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(implies(X1,X2),implies(implies(implies(X3,X2),X4),implies(X1,X4)))),
inference(spm,[status(thm)],[c_0_50,c_0_7]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,implies(implies(X1,implies(X1,X2)),X2))),
inference(spm,[status(thm)],[c_0_41,c_0_26]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(X1,implies(implies(implies(X2,X3),X4),implies(implies(X1,X3),X4)))),
inference(spm,[status(thm)],[c_0_39,c_0_51]) ).
cnf(c_0_54,plain,
( is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_52]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X4,implies(implies(X4,X2),X3)))),
inference(spm,[status(thm)],[c_0_41,c_0_53]) ).
cnf(c_0_56,plain,
( is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),X3)))
| ~ is_a_theorem(implies(implies(X4,X1),X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_54]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(implies(X1,X1),implies(implies(X2,X3),X2)),X2)),
inference(spm,[status(thm)],[c_0_14,c_0_24]) ).
cnf(c_0_58,plain,
( is_a_theorem(implies(X1,implies(implies(X1,X2),X3)))
| ~ is_a_theorem(implies(implies(X4,X2),X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_55]) ).
cnf(c_0_59,plain,
is_a_theorem(implies(implies(implies(X1,X2),X1),implies(implies(X1,implies(X1,X3)),X3))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_6,c_0_43]) ).
cnf(c_0_61,plain,
( is_a_theorem(implies(X1,implies(X2,implies(X3,X4))))
| ~ is_a_theorem(implies(X1,implies(X3,implies(X2,X4)))) ),
inference(spm,[status(thm)],[c_0_9,c_0_47]) ).
cnf(c_0_62,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),implies(implies(X2,implies(X2,X3)),X3)))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_29,c_0_60]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(X1,implies(implies(X2,implies(X2,X3)),implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_65,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(implies(X4,X2),implies(X1,X3))) ),
inference(spm,[status(thm)],[c_0_50,c_0_63]) ).
cnf(c_0_66,plain,
is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X3,implies(implies(X3,X1),X2)))),
inference(spm,[status(thm)],[c_0_41,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
inference(fof_simplification,[status(thm)],[prove_c0_6]) ).
cnf(c_0_68,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(X1,implies(implies(X1,X2),X3)))),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_69,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(b,c)),implies(implies(a,b),implies(a,c)))),
c_0_67 ).
cnf(c_0_70,plain,
is_a_theorem(implies(implies(X1,implies(X2,X3)),implies(implies(X1,X2),implies(X1,X3)))),
inference(spm,[status(thm)],[c_0_61,c_0_68]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL030-1 : TPTP v8.2.0. Released v1.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n019.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon May 20 02:28:23 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 33.21/4.66 # Version: 3.1.0
% 33.21/4.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 33.21/4.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.21/4.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 33.21/4.66 # Starting new_bool_3 with 300s (1) cores
% 33.21/4.66 # Starting new_bool_1 with 300s (1) cores
% 33.21/4.66 # Starting sh5l with 300s (1) cores
% 33.21/4.66 # sh5l with pid 25813 completed with status 0
% 33.21/4.66 # Result found by sh5l
% 33.21/4.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 33.21/4.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.21/4.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 33.21/4.66 # Starting new_bool_3 with 300s (1) cores
% 33.21/4.66 # Starting new_bool_1 with 300s (1) cores
% 33.21/4.66 # Starting sh5l with 300s (1) cores
% 33.21/4.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 33.21/4.66 # Search class: FHUNS-FFSF22-MFFFFFNN
% 33.21/4.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 33.21/4.66 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 33.21/4.66 # G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with pid 25820 completed with status 0
% 33.21/4.66 # Result found by G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y
% 33.21/4.66 # Preprocessing class: FSSSSMSSSSSNFFN.
% 33.21/4.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 33.21/4.66 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 33.21/4.66 # Starting new_bool_3 with 300s (1) cores
% 33.21/4.66 # Starting new_bool_1 with 300s (1) cores
% 33.21/4.66 # Starting sh5l with 300s (1) cores
% 33.21/4.66 # SinE strategy is gf500_gu_R04_F100_L20000
% 33.21/4.66 # Search class: FHUNS-FFSF22-MFFFFFNN
% 33.21/4.66 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 33.21/4.66 # Starting G-E--_060_C18_F1_PI_SE_CS_SP_CO_S0Y with 163s (1) cores
% 33.21/4.66 # Preprocessing time : 0.001 s
% 33.21/4.66
% 33.21/4.66 # Proof found!
% 33.21/4.66 # SZS status Unsatisfiable
% 33.21/4.66 # SZS output start CNFRefutation
% See solution above
% 33.21/4.66 # Parsed axioms : 6
% 33.21/4.66 # Removed by relevancy pruning/SinE : 1
% 33.21/4.66 # Initial clauses : 5
% 33.21/4.66 # Removed in clause preprocessing : 0
% 33.21/4.66 # Initial clauses in saturation : 5
% 33.21/4.66 # Processed clauses : 70798
% 33.21/4.66 # ...of these trivial : 773
% 33.21/4.66 # ...subsumed : 68455
% 33.21/4.66 # ...remaining for further processing : 1570
% 33.21/4.66 # Other redundant clauses eliminated : 0
% 33.21/4.66 # Clauses deleted for lack of memory : 0
% 33.21/4.66 # Backward-subsumed : 14
% 33.21/4.66 # Backward-rewritten : 43
% 33.21/4.66 # Generated clauses : 495811
% 33.21/4.66 # ...of the previous two non-redundant : 420821
% 33.21/4.66 # ...aggressively subsumed : 0
% 33.21/4.66 # Contextual simplify-reflections : 0
% 33.21/4.66 # Paramodulations : 495811
% 33.21/4.66 # Factorizations : 0
% 33.21/4.66 # NegExts : 0
% 33.21/4.66 # Equation resolutions : 0
% 33.21/4.66 # Disequality decompositions : 0
% 33.21/4.66 # Total rewrite steps : 74004
% 33.21/4.66 # ...of those cached : 67996
% 33.21/4.66 # Propositional unsat checks : 0
% 33.21/4.66 # Propositional check models : 0
% 33.21/4.66 # Propositional check unsatisfiable : 0
% 33.21/4.66 # Propositional clauses : 0
% 33.21/4.66 # Propositional clauses after purity: 0
% 33.21/4.66 # Propositional unsat core size : 0
% 33.21/4.66 # Propositional preprocessing time : 0.000
% 33.21/4.66 # Propositional encoding time : 0.000
% 33.21/4.66 # Propositional solver time : 0.000
% 33.21/4.66 # Success case prop preproc time : 0.000
% 33.21/4.66 # Success case prop encoding time : 0.000
% 33.21/4.66 # Success case prop solver time : 0.000
% 33.21/4.66 # Current number of processed clauses : 1513
% 33.21/4.66 # Positive orientable unit clauses : 504
% 33.21/4.66 # Positive unorientable unit clauses: 0
% 33.21/4.66 # Negative unit clauses : 14
% 33.21/4.66 # Non-unit-clauses : 995
% 33.21/4.66 # Current number of unprocessed clauses: 344699
% 33.21/4.66 # ...number of literals in the above : 414820
% 33.21/4.66 # Current number of archived formulas : 0
% 33.21/4.66 # Current number of archived clauses : 57
% 33.21/4.66 # Clause-clause subsumption calls (NU) : 11233483
% 33.21/4.66 # Rec. Clause-clause subsumption calls : 11233478
% 33.21/4.66 # Non-unit clause-clause subsumptions : 69168
% 33.21/4.66 # Unit Clause-clause subsumption calls : 19552
% 33.21/4.66 # Rewrite failures with RHS unbound : 0
% 33.21/4.66 # BW rewrite match attempts : 104315
% 33.21/4.66 # BW rewrite match successes : 43
% 33.21/4.66 # Condensation attempts : 70798
% 33.21/4.66 # Condensation successes : 735
% 33.21/4.66 # Termbank termtop insertions : 5586555
% 33.21/4.66 # Search garbage collected termcells : 12
% 33.21/4.66
% 33.21/4.66 # -------------------------------------------------
% 33.21/4.66 # User time : 3.995 s
% 33.21/4.66 # System time : 0.098 s
% 33.21/4.66 # Total time : 4.093 s
% 33.21/4.66 # Maximum resident set size: 1616 pages
% 33.21/4.66
% 33.21/4.66 # -------------------------------------------------
% 33.21/4.66 # User time : 3.997 s
% 33.21/4.66 # System time : 0.099 s
% 33.21/4.66 # Total time : 4.096 s
% 33.21/4.66 # Maximum resident set size: 1692 pages
% 33.21/4.66 % E---3.1 exiting
%------------------------------------------------------------------------------