TSTP Solution File: LCL422-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LCL422-1 : TPTP v8.1.2. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:12:41 EDT 2023
% Result : Unsatisfiable 776.41s 99.29s
% Output : CNFRefutation 776.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of clauses : 60 ( 22 unt; 0 nHn; 28 RR)
% Number of literals : 110 ( 0 equ; 58 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 123 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',condensed_detachment) ).
cnf(mv2,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',mv2) ).
cnf(mv3,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',mv3) ).
cnf(mv1,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',mv1) ).
cnf(mv4,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',mv4) ).
cnf(prove_ka2,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(implies(implies(not(a),not(b)),not(b))),not(implies(implies(not(a),not(c)),not(c)))),not(implies(implies(not(a),not(c)),not(c)))),not(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c)))))),
file('/export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p',prove_ka2) ).
cnf(c_0_6,axiom,
( is_a_theorem(X2)
| ~ is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X1) ),
condensed_detachment ).
cnf(c_0_7,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
mv2 ).
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,axiom,
is_a_theorem(implies(implies(implies(X1,X2),X2),implies(implies(X2,X1),X1))),
mv3 ).
cnf(c_0_10,axiom,
is_a_theorem(implies(X1,implies(X2,X1))),
mv1 ).
cnf(c_0_11,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_12,axiom,
is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1))),
mv4 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(implies(X2,X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(not(X3),not(X2)))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
is_a_theorem(implies(not(X1),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_15,c_0_10]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_11,c_0_16]) ).
cnf(c_0_19,plain,
is_a_theorem(implies(not(not(X1)),implies(X2,X1))),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(not(not(X1)),X1))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,plain,
( is_a_theorem(implies(implies(X1,implies(X2,X3)),X3))
| ~ is_a_theorem(X2)
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_22,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X3,X2))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_24,plain,
is_a_theorem(implies(not(not(X1)),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_17]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),implies(X4,X3))))
| ~ is_a_theorem(implies(X1,implies(X4,X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_26,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(X2,implies(X3,X1)))
| ~ is_a_theorem(X3)
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_6,c_0_21]) ).
cnf(c_0_27,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),not(X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_28,plain,
is_a_theorem(implies(X1,not(not(X1)))),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X2),X1))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(X4,implies(X3,X1)))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_6,c_0_25]) ).
cnf(c_0_31,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_9]) ).
cnf(c_0_32,plain,
is_a_theorem(implies(X1,implies(not(not(X2)),X2))),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_7]) ).
cnf(c_0_34,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X3,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_29]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X3),implies(implies(X4,X2),X3)))
| ~ is_a_theorem(implies(X1,X4)) ),
inference(spm,[status(thm)],[c_0_30,c_0_7]) ).
cnf(c_0_36,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(not(not(X2)),X2),X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,plain,
( is_a_theorem(implies(implies(not(X1),X2),implies(X3,X1)))
| ~ is_a_theorem(implies(X2,not(X3))) ),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(implies(implies(implies(not(implies(implies(not(a),not(b)),not(b))),not(implies(implies(not(a),not(c)),not(c)))),not(implies(implies(not(a),not(c)),not(c)))),not(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c)))))),
prove_ka2 ).
cnf(c_0_39,plain,
( is_a_theorem(implies(implies(implies(X1,X2),X2),X3))
| ~ is_a_theorem(implies(X2,X3))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
( is_a_theorem(implies(X1,not(not(X2))))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_28]) ).
cnf(c_0_42,negated_conjecture,
( ~ is_a_theorem(implies(not(implies(implies(not(a),not(c)),not(c))),not(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))))))
| ~ is_a_theorem(implies(not(implies(implies(not(a),not(b)),not(b))),not(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c)))))) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
( is_a_theorem(implies(not(X1),not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,negated_conjecture,
( ~ is_a_theorem(implies(not(implies(implies(not(a),not(c)),not(c))),not(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))))))
| ~ is_a_theorem(implies(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))),implies(implies(not(a),not(b)),not(b)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,implies(implies(X2,X3),X3)))
| ~ is_a_theorem(implies(X1,implies(implies(X3,X2),X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_9]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(X1,implies(X2,not(not(X2))))),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_47,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))),implies(implies(not(a),not(b)),not(b))))
| ~ is_a_theorem(implies(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))),implies(implies(not(a),not(c)),not(c)))) ),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_48,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_45,c_0_10]) ).
cnf(c_0_49,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,not(not(X2))),X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_46]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(implies(X1,not(X2)),implies(X2,X3)))
| ~ is_a_theorem(implies(not(X3),X1)) ),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_51,negated_conjecture,
( ~ is_a_theorem(implies(implies(implies(not(a),not(implies(implies(b,c),c))),not(implies(implies(b,c),c))),implies(implies(not(a),not(c)),not(c))))
| ~ is_a_theorem(implies(not(implies(implies(b,c),c)),implies(implies(not(a),not(b)),not(b)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_39]),c_0_48])]) ).
cnf(c_0_52,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,plain,
is_a_theorem(implies(not(not(X1)),implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_45,c_0_19]) ).
cnf(c_0_54,negated_conjecture,
( ~ is_a_theorem(implies(not(implies(implies(b,c),c)),implies(implies(not(a),not(b)),not(b))))
| ~ is_a_theorem(implies(not(implies(implies(b,c),c)),implies(implies(not(a),not(c)),not(c)))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_39]),c_0_48])]) ).
cnf(c_0_55,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_56,plain,
is_a_theorem(implies(not(implies(implies(X1,X2),X2)),not(X1))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_57,negated_conjecture,
~ is_a_theorem(implies(not(implies(implies(b,c),c)),implies(implies(not(a),not(c)),not(c)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).
cnf(c_0_58,plain,
is_a_theorem(implies(not(implies(X1,X2)),not(X2))),
inference(spm,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_59,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_55]),c_0_58])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : LCL422-1 : TPTP v8.1.2. Released v2.5.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 12:35:29 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.w4e9nufMtV/E---3.1_26815.p
% 776.41/99.29 # Version: 3.1pre001
% 776.41/99.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 776.41/99.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 776.41/99.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 776.41/99.29 # Starting new_bool_3 with 300s (1) cores
% 776.41/99.29 # Starting new_bool_1 with 300s (1) cores
% 776.41/99.29 # Starting sh5l with 300s (1) cores
% 776.41/99.29 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 26893 completed with status 0
% 776.41/99.29 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 776.41/99.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 776.41/99.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 776.41/99.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 776.41/99.29 # No SInE strategy applied
% 776.41/99.29 # Search class: FHUNM-FFSF21-DFFFFFNN
% 776.41/99.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 776.41/99.29 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 776.41/99.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 776.41/99.29 # Starting new_bool_3 with 296s (1) cores
% 776.41/99.29 # Starting new_bool_1 with 291s (1) cores
% 776.41/99.29 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 776.41/99.29 # G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 26903 completed with status 0
% 776.41/99.29 # Result found by G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 776.41/99.29 # Preprocessing class: FSMSSMSSSSSNFFN.
% 776.41/99.29 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 776.41/99.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 776.41/99.29 # No SInE strategy applied
% 776.41/99.29 # Search class: FHUNM-FFSF21-DFFFFFNN
% 776.41/99.29 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 776.41/99.29 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 355s (1) cores
% 776.41/99.29 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 776.41/99.29 # Starting new_bool_3 with 296s (1) cores
% 776.41/99.29 # Starting new_bool_1 with 291s (1) cores
% 776.41/99.29 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 776.41/99.29 # Preprocessing time : 0.002 s
% 776.41/99.29 # Presaturation interreduction done
% 776.41/99.29
% 776.41/99.29 # Proof found!
% 776.41/99.29 # SZS status Unsatisfiable
% 776.41/99.29 # SZS output start CNFRefutation
% See solution above
% 776.41/99.30 # Parsed axioms : 6
% 776.41/99.30 # Removed by relevancy pruning/SinE : 0
% 776.41/99.30 # Initial clauses : 6
% 776.41/99.30 # Removed in clause preprocessing : 0
% 776.41/99.30 # Initial clauses in saturation : 6
% 776.41/99.30 # Processed clauses : 115301
% 776.41/99.30 # ...of these trivial : 472
% 776.41/99.30 # ...subsumed : 101338
% 776.41/99.30 # ...remaining for further processing : 13491
% 776.41/99.30 # Other redundant clauses eliminated : 0
% 776.41/99.30 # Clauses deleted for lack of memory : 176403
% 776.41/99.30 # Backward-subsumed : 5797
% 776.41/99.30 # Backward-rewritten : 79
% 776.41/99.30 # Generated clauses : 5260651
% 776.41/99.30 # ...of the previous two non-redundant : 5151305
% 776.41/99.30 # ...aggressively subsumed : 0
% 776.41/99.30 # Contextual simplify-reflections : 1206
% 776.41/99.30 # Paramodulations : 5260651
% 776.41/99.30 # Factorizations : 0
% 776.41/99.30 # NegExts : 0
% 776.41/99.30 # Equation resolutions : 0
% 776.41/99.30 # Total rewrite steps : 221901
% 776.41/99.30 # Propositional unsat checks : 2
% 776.41/99.30 # Propositional check models : 0
% 776.41/99.30 # Propositional check unsatisfiable : 0
% 776.41/99.30 # Propositional clauses : 0
% 776.41/99.30 # Propositional clauses after purity: 0
% 776.41/99.30 # Propositional unsat core size : 0
% 776.41/99.30 # Propositional preprocessing time : 0.000
% 776.41/99.30 # Propositional encoding time : 3.821
% 776.41/99.30 # Propositional solver time : 0.952
% 776.41/99.30 # Success case prop preproc time : 0.000
% 776.41/99.30 # Success case prop encoding time : 0.000
% 776.41/99.30 # Success case prop solver time : 0.000
% 776.41/99.30 # Current number of processed clauses : 7609
% 776.41/99.30 # Positive orientable unit clauses : 600
% 776.41/99.30 # Positive unorientable unit clauses: 0
% 776.41/99.30 # Negative unit clauses : 124
% 776.41/99.30 # Non-unit-clauses : 6885
% 776.41/99.30 # Current number of unprocessed clauses: 1780099
% 776.41/99.30 # ...number of literals in the above : 5867594
% 776.41/99.30 # Current number of archived formulas : 0
% 776.41/99.30 # Current number of archived clauses : 5882
% 776.41/99.30 # Clause-clause subsumption calls (NU) : 27683396
% 776.41/99.30 # Rec. Clause-clause subsumption calls : 12892824
% 776.41/99.30 # Non-unit clause-clause subsumptions : 87571
% 776.41/99.30 # Unit Clause-clause subsumption calls : 162319
% 776.41/99.30 # Rewrite failures with RHS unbound : 0
% 776.41/99.30 # BW rewrite match attempts : 457978
% 776.41/99.30 # BW rewrite match successes : 78
% 776.41/99.30 # Condensation attempts : 0
% 776.41/99.30 # Condensation successes : 0
% 776.41/99.30 # Termbank termtop insertions : 132481852
% 776.41/99.30
% 776.41/99.30 # -------------------------------------------------
% 776.41/99.30 # User time : 95.280 s
% 776.41/99.30 # System time : 1.513 s
% 776.41/99.30 # Total time : 96.793 s
% 776.41/99.30 # Maximum resident set size: 1596 pages
% 776.41/99.30
% 776.41/99.30 # -------------------------------------------------
% 776.41/99.30 # User time : 479.813 s
% 776.41/99.30 # System time : 4.553 s
% 776.41/99.30 # Total time : 484.366 s
% 776.41/99.30 # Maximum resident set size: 1684 pages
% 776.41/99.30 % E---3.1 exiting
% 776.41/99.30 % E---3.1 exiting
%------------------------------------------------------------------------------