TSTP Solution File: LCL062-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : LCL062-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:18 EDT 2024
% Result : Unsatisfiable 37.55s 5.21s
% Output : CNFRefutation 37.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 5
% Syntax : Number of clauses : 73 ( 33 unt; 0 nHn; 29 RR)
% Number of literals : 127 ( 0 equ; 61 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 171 ( 42 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(cn_1,axiom,
is_a_theorem(implies(implies(X1,X2),implies(implies(X2,X3),implies(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_1) ).
cnf(cn_2,axiom,
is_a_theorem(implies(implies(not(X1),X1),X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_2) ).
cnf(cn_3,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cn_3) ).
cnf(prove_cn_60,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(not(b),c)),implies(a,implies(implies(e,c),implies(implies(b,e),c))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_cn_60) ).
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)))),
cn_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(implies(not(X1),X1),X1)),
cn_2 ).
cnf(c_0_11,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X1,implies(X4,X3)))
| ~ is_a_theorem(implies(X2,X4)) ),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_12,axiom,
is_a_theorem(implies(X1,implies(not(X1),X2))),
cn_3 ).
cnf(c_0_13,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(not(X2),X2))) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,not(X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),not(X1))) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_17,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(X2) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X2,X4))
| ~ is_a_theorem(implies(X4,X3)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_19,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X2),X1)) ),
inference(spm,[status(thm)],[c_0_13,c_0_8]) ).
cnf(c_0_20,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(X4,X3))
| ~ is_a_theorem(X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_21,plain,
is_a_theorem(implies(X1,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_22,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X2))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_19]) ).
cnf(c_0_23,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,X3),X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_7]) ).
cnf(c_0_26,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_27,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_9,c_0_26]) ).
cnf(c_0_28,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_29,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(X3,X1))
| ~ is_a_theorem(X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_8]) ).
cnf(c_0_30,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(not(X2),X4),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_31,plain,
is_a_theorem(implies(implies(not(implies(not(X1),X1)),implies(not(X1),X1)),X1)),
inference(spm,[status(thm)],[c_0_13,c_0_10]) ).
cnf(c_0_32,plain,
( is_a_theorem(implies(X1,implies(not(X2),X3)))
| ~ is_a_theorem(implies(X1,X4))
| ~ is_a_theorem(implies(X4,X2)) ),
inference(spm,[status(thm)],[c_0_9,c_0_28]) ).
cnf(c_0_33,plain,
( is_a_theorem(implies(implies(X1,X2),X2))
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_29,c_0_10]) ).
cnf(c_0_34,plain,
is_a_theorem(implies(X1,implies(implies(not(X2),X2),X2))),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( is_a_theorem(implies(implies(X1,X2),implies(not(X3),X4)))
| ~ is_a_theorem(implies(implies(implies(X2,X5),implies(X1,X5)),X3)) ),
inference(spm,[status(thm)],[c_0_32,c_0_7]) ).
cnf(c_0_36,plain,
is_a_theorem(implies(implies(implies(implies(not(X1),X1),X1),X2),X2)),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(not(X1),X1)) ),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_38,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_9,c_0_7]) ).
cnf(c_0_39,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(not(implies(X1,X2)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X3,X2)))
| ~ is_a_theorem(implies(not(implies(implies(X1,X2),implies(X3,X2))),implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,plain,
is_a_theorem(implies(X1,implies(X2,implies(not(X2),X3)))),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_42,plain,
is_a_theorem(implies(implies(X1,implies(not(X2),X2)),implies(X1,X2))),
inference(spm,[status(thm)],[c_0_13,c_0_39]) ).
cnf(c_0_43,plain,
is_a_theorem(implies(implies(implies(not(X1),X2),X3),implies(X1,X3))),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(not(implies(implies(X2,X1),X1)),X3))),
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_45,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(implies(not(X1),X3),X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_43]) ).
cnf(c_0_46,plain,
is_a_theorem(implies(implies(not(X1),X2),implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_13,c_0_44]) ).
cnf(c_0_47,plain,
is_a_theorem(implies(X1,implies(implies(X2,X1),X1))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,plain,
( is_a_theorem(implies(X1,implies(X2,X1)))
| ~ is_a_theorem(implies(X2,implies(X3,X1))) ),
inference(spm,[status(thm)],[c_0_11,c_0_47]) ).
cnf(c_0_49,plain,
is_a_theorem(implies(X1,implies(X2,X1))),
inference(spm,[status(thm)],[c_0_48,c_0_12]) ).
cnf(c_0_50,plain,
( is_a_theorem(implies(X1,implies(X2,X3)))
| ~ is_a_theorem(implies(implies(X4,X2),X3)) ),
inference(spm,[status(thm)],[c_0_18,c_0_49]) ).
cnf(c_0_51,plain,
is_a_theorem(implies(X1,implies(X2,implies(implies(X2,X3),X3)))),
inference(spm,[status(thm)],[c_0_50,c_0_46]) ).
cnf(c_0_52,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X2)))),
inference(spm,[status(thm)],[c_0_50,c_0_21]) ).
cnf(c_0_53,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(not(b),c)),implies(a,implies(implies(e,c),implies(implies(b,e),c))))),
inference(fof_simplification,[status(thm)],[prove_cn_60]) ).
cnf(c_0_54,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(X1,implies(X3,X2)))
| ~ is_a_theorem(implies(not(X2),X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_19]) ).
cnf(c_0_55,plain,
is_a_theorem(implies(X1,implies(implies(X1,X2),X2))),
inference(spm,[status(thm)],[c_0_37,c_0_51]) ).
cnf(c_0_56,plain,
( is_a_theorem(X1)
| ~ is_a_theorem(implies(implies(X2,implies(not(X2),X3)),X1)) ),
inference(spm,[status(thm)],[c_0_22,c_0_41]) ).
cnf(c_0_57,plain,
is_a_theorem(implies(implies(implies(X1,X2),X3),implies(X2,X3))),
inference(spm,[status(thm)],[c_0_40,c_0_52]) ).
cnf(c_0_58,negated_conjecture,
~ is_a_theorem(implies(implies(a,implies(not(b),c)),implies(a,implies(implies(e,c),implies(implies(b,e),c))))),
c_0_53 ).
cnf(c_0_59,plain,
( is_a_theorem(implies(implies(X1,X2),implies(X1,X3)))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_60,plain,
( is_a_theorem(implies(X1,X2))
| ~ is_a_theorem(implies(not(X2),implies(X1,X2))) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
is_a_theorem(implies(X1,implies(not(implies(X2,X1)),X3))),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,negated_conjecture,
~ is_a_theorem(implies(implies(not(b),c),implies(implies(e,c),implies(implies(b,e),c)))),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
( is_a_theorem(implies(implies(X1,X2),X3))
| ~ is_a_theorem(implies(not(X3),X1))
| ~ is_a_theorem(implies(X2,X3)) ),
inference(spm,[status(thm)],[c_0_54,c_0_59]) ).
cnf(c_0_64,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,implies(X4,X2))))),
inference(spm,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_65,plain,
is_a_theorem(implies(not(implies(X1,not(X2))),X2)),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,negated_conjecture,
( ~ is_a_theorem(implies(not(implies(implies(e,c),implies(implies(b,e),c))),not(b)))
| ~ is_a_theorem(implies(c,implies(implies(e,c),implies(implies(b,e),c)))) ),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_67,plain,
is_a_theorem(implies(X1,implies(X2,implies(X3,X1)))),
inference(spm,[status(thm)],[c_0_37,c_0_64]) ).
cnf(c_0_68,plain,
( is_a_theorem(implies(X1,not(X2)))
| ~ is_a_theorem(implies(X2,implies(X1,not(X2)))) ),
inference(spm,[status(thm)],[c_0_22,c_0_65]) ).
cnf(c_0_69,negated_conjecture,
~ is_a_theorem(implies(not(implies(implies(e,c),implies(implies(b,e),c))),not(b))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).
cnf(c_0_70,plain,
( is_a_theorem(implies(not(X1),not(X2)))
| ~ is_a_theorem(implies(X2,X1)) ),
inference(spm,[status(thm)],[c_0_68,c_0_28]) ).
cnf(c_0_71,negated_conjecture,
~ is_a_theorem(implies(b,implies(implies(e,c),implies(implies(b,e),c)))),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_38]),c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LCL062-1 : TPTP v8.2.0. Released v1.0.0.
% 0.06/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 01:05:38 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
% 37.55/5.21 # Version: 3.1.0
% 37.55/5.21 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.55/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.55/5.21 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.55/5.21 # Starting new_bool_3 with 300s (1) cores
% 37.55/5.21 # Starting new_bool_1 with 300s (1) cores
% 37.55/5.21 # Starting sh5l with 300s (1) cores
% 37.55/5.21 # new_bool_1 with pid 4418 completed with status 0
% 37.55/5.21 # Result found by new_bool_1
% 37.55/5.21 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.55/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.55/5.21 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.55/5.21 # Starting new_bool_3 with 300s (1) cores
% 37.55/5.21 # Starting new_bool_1 with 300s (1) cores
% 37.55/5.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 37.55/5.21 # Search class: FHUNS-FFSF21-MFFFFFNN
% 37.55/5.21 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 37.55/5.21 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 37.55/5.21 # H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with pid 4424 completed with status 0
% 37.55/5.21 # Result found by H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V
% 37.55/5.21 # Preprocessing class: FSSSSMSSSSSNFFN.
% 37.55/5.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 37.55/5.21 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 37.55/5.21 # Starting new_bool_3 with 300s (1) cores
% 37.55/5.21 # Starting new_bool_1 with 300s (1) cores
% 37.55/5.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 37.55/5.21 # Search class: FHUNS-FFSF21-MFFFFFNN
% 37.55/5.21 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 37.55/5.21 # Starting H----_011_C07_F1_PI_AE_Q4_CS_SP_PS_S0V with 181s (1) cores
% 37.55/5.21 # Preprocessing time : 0.001 s
% 37.55/5.21 # Presaturation interreduction done
% 37.55/5.21
% 37.55/5.21 # Proof found!
% 37.55/5.21 # SZS status Unsatisfiable
% 37.55/5.21 # SZS output start CNFRefutation
% See solution above
% 37.55/5.21 # Parsed axioms : 5
% 37.55/5.21 # Removed by relevancy pruning/SinE : 0
% 37.55/5.21 # Initial clauses : 5
% 37.55/5.21 # Removed in clause preprocessing : 0
% 37.55/5.21 # Initial clauses in saturation : 5
% 37.55/5.21 # Processed clauses : 91098
% 37.55/5.21 # ...of these trivial : 1035
% 37.55/5.21 # ...subsumed : 84782
% 37.55/5.21 # ...remaining for further processing : 5281
% 37.55/5.21 # Other redundant clauses eliminated : 0
% 37.55/5.21 # Clauses deleted for lack of memory : 0
% 37.55/5.21 # Backward-subsumed : 2443
% 37.55/5.21 # Backward-rewritten : 139
% 37.55/5.21 # Generated clauses : 428273
% 37.55/5.21 # ...of the previous two non-redundant : 405102
% 37.55/5.21 # ...aggressively subsumed : 0
% 37.55/5.21 # Contextual simplify-reflections : 17
% 37.55/5.21 # Paramodulations : 428273
% 37.55/5.21 # Factorizations : 0
% 37.55/5.21 # NegExts : 0
% 37.55/5.21 # Equation resolutions : 0
% 37.55/5.21 # Disequality decompositions : 0
% 37.55/5.21 # Total rewrite steps : 26364
% 37.55/5.21 # ...of those cached : 23844
% 37.55/5.21 # Propositional unsat checks : 0
% 37.55/5.21 # Propositional check models : 0
% 37.55/5.21 # Propositional check unsatisfiable : 0
% 37.55/5.21 # Propositional clauses : 0
% 37.55/5.21 # Propositional clauses after purity: 0
% 37.55/5.21 # Propositional unsat core size : 0
% 37.55/5.21 # Propositional preprocessing time : 0.000
% 37.55/5.21 # Propositional encoding time : 0.000
% 37.55/5.21 # Propositional solver time : 0.000
% 37.55/5.21 # Success case prop preproc time : 0.000
% 37.55/5.21 # Success case prop encoding time : 0.000
% 37.55/5.21 # Success case prop solver time : 0.000
% 37.55/5.21 # Current number of processed clauses : 2694
% 37.55/5.21 # Positive orientable unit clauses : 475
% 37.55/5.21 # Positive unorientable unit clauses: 0
% 37.55/5.21 # Negative unit clauses : 519
% 37.55/5.21 # Non-unit-clauses : 1700
% 37.55/5.21 # Current number of unprocessed clauses: 311186
% 37.55/5.21 # ...number of literals in the above : 1098142
% 37.55/5.21 # Current number of archived formulas : 0
% 37.55/5.21 # Current number of archived clauses : 2587
% 37.55/5.21 # Clause-clause subsumption calls (NU) : 3205176
% 37.55/5.21 # Rec. Clause-clause subsumption calls : 1876797
% 37.55/5.21 # Non-unit clause-clause subsumptions : 53195
% 37.55/5.21 # Unit Clause-clause subsumption calls : 113933
% 37.55/5.21 # Rewrite failures with RHS unbound : 0
% 37.55/5.21 # BW rewrite match attempts : 120832
% 37.55/5.21 # BW rewrite match successes : 38
% 37.55/5.21 # Condensation attempts : 0
% 37.55/5.21 # Condensation successes : 0
% 37.55/5.21 # Termbank termtop insertions : 6531019
% 37.55/5.21 # Search garbage collected termcells : 8
% 37.55/5.21
% 37.55/5.21 # -------------------------------------------------
% 37.55/5.21 # User time : 4.505 s
% 37.55/5.21 # System time : 0.150 s
% 37.55/5.21 # Total time : 4.655 s
% 37.55/5.21 # Maximum resident set size: 1624 pages
% 37.55/5.21
% 37.55/5.21 # -------------------------------------------------
% 37.55/5.21 # User time : 4.506 s
% 37.55/5.21 # System time : 0.152 s
% 37.55/5.21 # Total time : 4.658 s
% 37.55/5.21 # Maximum resident set size: 1696 pages
% 37.55/5.21 % E---3.1 exiting
%------------------------------------------------------------------------------