# No SInE strategy applied
# Trying AutoSched0 for 161 seconds
# AutoSched0-Mode selected heuristic G_E___208_C18AMC_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
# and selection function SelectComplexExceptUniqMaxHorn.
#
# Preprocessing time       : 0.021 s
# Presaturation interreduction done

# Failure: User resource limit exceeded!
# Parsed axioms                        : 11
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 26
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 26
# Processed clauses                    : 29042
# ...of these trivial                  : 5
# ...subsumed                          : 14235
# ...remaining for further processing  : 14802
# Other redundant clauses eliminated   : 55
# Clauses deleted for lack of memory   : 89462
# Backward-subsumed                    : 708
# Backward-rewritten                   : 38
# Generated clauses                    : 3890999
# ...of the previous two non-trivial   : 3888863
# Contextual simplify-reflections      : 63
# Paramodulations                      : 3890939
# Factorizations                       : 6
# NegExts                              : 0
# Equation resolutions                 : 55
# Propositional unsat checks           : 2
#    Propositional check models        : 0
#    Propositional check unsatisfiable : 0
#    Propositional clauses             : 0
#    Propositional clauses after purity: 0
#    Propositional unsat core size     : 0
#    Propositional preprocessing time  : 0.000
#    Propositional encoding time       : 7.824
#    Propositional solver time         : 1.606
#    Success case prop preproc time    : 0.000
#    Success case prop encoding time   : 0.000
#    Success case prop solver time     : 0.000
# Current number of processed clauses  : 14024
#    Positive orientable unit clauses  : 20
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 14001
# Current number of unprocessed clauses: 1257125
# ...number of literals in the above   : 7514813
# Current number of archived formulas  : 0
# Current number of archived clauses   : 772
# Clause-clause subsumption calls (NU) : 55695282
# Rec. Clause-clause subsumption calls : 5070158
# Non-unit clause-clause subsumptions  : 14999
# Unit Clause-clause subsumption calls : 21169
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 622
# BW rewrite match successes           : 15
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 216040251
# No success with AutoSched0
# Trying AutoSched1 for 71 seconds
# AutoSched1-Mode selected heuristic G_E___301_C18_F1_URBAN_S5PRR_S0Y
# and selection function SelectMaxLComplexAvoidPosPred.
#
# Preprocessing time       : 0.017 s
# SatCheck found unsatisfiable ground set

# Proof found!
# SZS status Theorem
# SZS output start CNFRefutation
fof(dt_k6_domain_1, axiom, ![X1, X2]:((~(v1_xboole_0(X1))&m1_subset_1(X2,X1))=>m1_subset_1(k6_domain_1(X1,X2),k1_zfmisc_1(X1))), file('classes5/classes5__t7_classes5', dt_k6_domain_1)).
fof(fraenkel_a_1_0_eqrel_1, axiom, ![X1, X2]:(~(v1_xboole_0(X2))=>(r2_hidden(X1,a_1_0_eqrel_1(X2))<=>?[X3]:(m1_subset_1(X3,X2)&X1=k6_domain_1(X2,X3)))), file('classes5/classes5__t7_classes5', fraenkel_a_1_0_eqrel_1)).
fof(t3_subset, axiom, ![X1, X2]:(m1_subset_1(X1,k1_zfmisc_1(X2))<=>r1_tarski(X1,X2)), file('classes5/classes5__t7_classes5', t3_subset)).
fof(d4_tarski, axiom, ![X1, X2]:(X2=k3_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>?[X4]:(r2_hidden(X3,X4)&r2_hidden(X4,X1)))), file('classes5/classes5__t7_classes5', d4_tarski)).
fof(d1_tarski, axiom, ![X1, X2]:(X2=k1_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>X3=X1)), file('classes5/classes5__t7_classes5', d1_tarski)).
fof(d3_tarski, axiom, ![X1, X2]:(r1_tarski(X1,X2)<=>![X3]:(r2_hidden(X3,X1)=>r2_hidden(X3,X2))), file('classes5/classes5__t7_classes5', d3_tarski)).
fof(redefinition_k6_domain_1, axiom, ![X1, X2]:((~(v1_xboole_0(X1))&m1_subset_1(X2,X1))=>k6_domain_1(X1,X2)=k1_tarski(X2)), file('classes5/classes5__t7_classes5', redefinition_k6_domain_1)).
fof(t1_subset, axiom, ![X1, X2]:(r2_tarski(X1,X2)=>m1_subset_1(X1,X2)), file('classes5/classes5__t7_classes5', t1_subset)).
fof(redefinition_r2_tarski, axiom, ![X1, X2]:(r2_tarski(X1,X2)<=>r2_hidden(X1,X2)), file('classes5/classes5__t7_classes5', redefinition_r2_tarski)).
fof(t7_classes5, conjecture, ![X1]:(~(v1_xboole_0(X1))=>k3_tarski(k11_eqrel_1(X1))=X1), file('classes5/classes5__t7_classes5', t7_classes5)).
fof(t37_eqrel_1, axiom, ![X1]:(~(v1_xboole_0(X1))=>k11_eqrel_1(X1)=a_1_0_eqrel_1(X1)), file('classes5/classes5__t7_classes5', t37_eqrel_1)).
fof(c_0_11, plain, ![X1, X2]:((~v1_xboole_0(X1)&m1_subset_1(X2,X1))=>m1_subset_1(k6_domain_1(X1,X2),k1_zfmisc_1(X1))), inference(fof_simplification,[status(thm)],[dt_k6_domain_1])).
fof(c_0_12, plain, ![X1, X2]:(~v1_xboole_0(X2)=>(r2_hidden(X1,a_1_0_eqrel_1(X2))<=>?[X3]:(m1_subset_1(X3,X2)&X1=k6_domain_1(X2,X3)))), inference(fof_simplification,[status(thm)],[fraenkel_a_1_0_eqrel_1])).
fof(c_0_13, plain, ![X55, X56]:(v1_xboole_0(X55)|~m1_subset_1(X56,X55)|m1_subset_1(k6_domain_1(X55,X56),k1_zfmisc_1(X55))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])).
fof(c_0_14, plain, ![X57, X58, X60]:(((m1_subset_1(esk7_2(X57,X58),X58)|~r2_hidden(X57,a_1_0_eqrel_1(X58))|v1_xboole_0(X58))&(X57=k6_domain_1(X58,esk7_2(X57,X58))|~r2_hidden(X57,a_1_0_eqrel_1(X58))|v1_xboole_0(X58)))&(~m1_subset_1(X60,X58)|X57!=k6_domain_1(X58,X60)|r2_hidden(X57,a_1_0_eqrel_1(X58))|v1_xboole_0(X58))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])).
fof(c_0_15, plain, ![X68, X69]:((~m1_subset_1(X68,k1_zfmisc_1(X69))|r1_tarski(X68,X69))&(~r1_tarski(X68,X69)|m1_subset_1(X68,k1_zfmisc_1(X69)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])).
cnf(c_0_16, plain, (v1_xboole_0(X1)|m1_subset_1(k6_domain_1(X1,X2),k1_zfmisc_1(X1))|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_13])).
cnf(c_0_17, plain, (X1=k6_domain_1(X2,esk7_2(X1,X2))|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_eqrel_1(X2))), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_18, plain, (m1_subset_1(esk7_2(X1,X2),X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_eqrel_1(X2))), inference(split_conjunct,[status(thm)],[c_0_14])).
cnf(c_0_19, plain, (r1_tarski(X1,X2)|~m1_subset_1(X1,k1_zfmisc_1(X2))), inference(split_conjunct,[status(thm)],[c_0_15])).
cnf(c_0_20, plain, (m1_subset_1(X1,k1_zfmisc_1(X2))|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_eqrel_1(X2))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
fof(c_0_21, plain, ![X44, X45, X46, X48, X49, X50, X51, X53]:((((r2_hidden(X46,esk4_3(X44,X45,X46))|~r2_hidden(X46,X45)|X45!=k3_tarski(X44))&(r2_hidden(esk4_3(X44,X45,X46),X44)|~r2_hidden(X46,X45)|X45!=k3_tarski(X44)))&(~r2_hidden(X48,X49)|~r2_hidden(X49,X44)|r2_hidden(X48,X45)|X45!=k3_tarski(X44)))&((~r2_hidden(esk5_2(X50,X51),X51)|(~r2_hidden(esk5_2(X50,X51),X53)|~r2_hidden(X53,X50))|X51=k3_tarski(X50))&((r2_hidden(esk5_2(X50,X51),esk6_2(X50,X51))|r2_hidden(esk5_2(X50,X51),X51)|X51=k3_tarski(X50))&(r2_hidden(esk6_2(X50,X51),X50)|r2_hidden(esk5_2(X50,X51),X51)|X51=k3_tarski(X50))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d4_tarski])])])])])])).
fof(c_0_22, plain, ![X31, X32, X33, X34, X35, X36]:(((~r2_hidden(X33,X32)|X33=X31|X32!=k1_tarski(X31))&(X34!=X31|r2_hidden(X34,X32)|X32!=k1_tarski(X31)))&((~r2_hidden(esk2_2(X35,X36),X36)|esk2_2(X35,X36)!=X35|X36=k1_tarski(X35))&(r2_hidden(esk2_2(X35,X36),X36)|esk2_2(X35,X36)=X35|X36=k1_tarski(X35)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tarski])])])])])])).
fof(c_0_23, plain, ![X38, X39, X40, X41, X42]:((~r1_tarski(X38,X39)|(~r2_hidden(X40,X38)|r2_hidden(X40,X39)))&((r2_hidden(esk3_2(X41,X42),X41)|r1_tarski(X41,X42))&(~r2_hidden(esk3_2(X41,X42),X42)|r1_tarski(X41,X42)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_tarski])])])])])])).
cnf(c_0_24, plain, (r1_tarski(X1,X2)|v1_xboole_0(X2)|~r2_hidden(X1,a_1_0_eqrel_1(X2))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
cnf(c_0_25, plain, (r2_hidden(esk4_3(X1,X2,X3),X1)|~r2_hidden(X3,X2)|X2!=k3_tarski(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_26, plain, (r2_hidden(X1,X3)|X1!=X2|X3!=k1_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_22])).
fof(c_0_27, plain, ![X1, X2]:((~v1_xboole_0(X1)&m1_subset_1(X2,X1))=>k6_domain_1(X1,X2)=k1_tarski(X2)), inference(fof_simplification,[status(thm)],[redefinition_k6_domain_1])).
cnf(c_0_28, plain, (r2_hidden(X3,X2)|~r1_tarski(X1,X2)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_23])).
cnf(c_0_29, plain, (r1_tarski(esk4_3(a_1_0_eqrel_1(X1),X2,X3),X1)|v1_xboole_0(X1)|X2!=k3_tarski(a_1_0_eqrel_1(X1))|~r2_hidden(X3,X2)), inference(spm,[status(thm)],[c_0_24, c_0_25])).
cnf(c_0_30, plain, (r2_hidden(X1,X4)|~r2_hidden(X1,X2)|~r2_hidden(X2,X3)|X4!=k3_tarski(X3)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_31, plain, (r2_hidden(esk6_2(X1,X2),X1)|r2_hidden(esk5_2(X1,X2),X2)|X2=k3_tarski(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_32, plain, (r2_hidden(X1,X2)|X2!=k1_tarski(X1)), inference(er,[status(thm)],[c_0_26])).
cnf(c_0_33, plain, (r2_hidden(X3,a_1_0_eqrel_1(X2))|v1_xboole_0(X2)|~m1_subset_1(X1,X2)|X3!=k6_domain_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_14])).
fof(c_0_34, plain, ![X61, X62]:(v1_xboole_0(X61)|~m1_subset_1(X62,X61)|k6_domain_1(X61,X62)=k1_tarski(X62)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])).
cnf(c_0_35, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|X3!=k3_tarski(a_1_0_eqrel_1(X2))|~r2_hidden(X1,esk4_3(a_1_0_eqrel_1(X2),X3,X4))|~r2_hidden(X4,X3)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
cnf(c_0_36, plain, (r2_hidden(X1,esk4_3(X2,X3,X1))|~r2_hidden(X1,X3)|X3!=k3_tarski(X2)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_37, plain, (X1=k3_tarski(X2)|r2_hidden(esk5_2(X2,X1),X1)|r2_hidden(X3,X4)|X4!=k3_tarski(X2)|~r2_hidden(X3,esk6_2(X2,X1))), inference(spm,[status(thm)],[c_0_30, c_0_31])).
cnf(c_0_38, plain, (r2_hidden(esk5_2(X1,X2),esk6_2(X1,X2))|r2_hidden(esk5_2(X1,X2),X2)|X2=k3_tarski(X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_39, plain, (X2=k3_tarski(X1)|~r2_hidden(esk5_2(X1,X2),X2)|~r2_hidden(esk5_2(X1,X2),X3)|~r2_hidden(X3,X1)), inference(split_conjunct,[status(thm)],[c_0_21])).
cnf(c_0_40, plain, (r2_hidden(X1,k1_tarski(X1))), inference(er,[status(thm)],[c_0_32])).
cnf(c_0_41, plain, (r2_hidden(k6_domain_1(X1,X2),a_1_0_eqrel_1(X1))|v1_xboole_0(X1)|~m1_subset_1(X2,X1)), inference(er,[status(thm)],[c_0_33])).
cnf(c_0_42, plain, (v1_xboole_0(X1)|k6_domain_1(X1,X2)=k1_tarski(X2)|~m1_subset_1(X2,X1)), inference(split_conjunct,[status(thm)],[c_0_34])).
fof(c_0_43, plain, ![X65, X66]:(~r2_tarski(X65,X66)|m1_subset_1(X65,X66)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])).
fof(c_0_44, plain, ![X63, X64]:((~r2_tarski(X63,X64)|r2_hidden(X63,X64))&(~r2_hidden(X63,X64)|r2_tarski(X63,X64))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_r2_tarski])])).
fof(c_0_45, negated_conjecture, ~(![X1]:(~v1_xboole_0(X1)=>k3_tarski(k11_eqrel_1(X1))=X1)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t7_classes5])])).
fof(c_0_46, plain, ![X1]:(~v1_xboole_0(X1)=>k11_eqrel_1(X1)=a_1_0_eqrel_1(X1)), inference(fof_simplification,[status(thm)],[t37_eqrel_1])).
cnf(c_0_47, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|X3!=k3_tarski(a_1_0_eqrel_1(X2))|~r2_hidden(X1,X3)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
cnf(c_0_48, plain, (X1=k3_tarski(X2)|r2_hidden(esk5_2(X2,X1),X3)|r2_hidden(esk5_2(X2,X1),X1)|X3!=k3_tarski(X2)), inference(spm,[status(thm)],[c_0_37, c_0_38])).
cnf(c_0_49, plain, (X1=k3_tarski(X2)|~r2_hidden(k1_tarski(esk5_2(X2,X1)),X2)|~r2_hidden(esk5_2(X2,X1),X1)), inference(spm,[status(thm)],[c_0_39, c_0_40])).
cnf(c_0_50, plain, (r2_hidden(k1_tarski(X1),a_1_0_eqrel_1(X2))|v1_xboole_0(X2)|~m1_subset_1(X1,X2)), inference(spm,[status(thm)],[c_0_41, c_0_42])).
cnf(c_0_51, plain, (m1_subset_1(X1,X2)|~r2_tarski(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_43])).
cnf(c_0_52, plain, (r2_tarski(X1,X2)|~r2_hidden(X1,X2)), inference(split_conjunct,[status(thm)],[c_0_44])).
fof(c_0_53, negated_conjecture, (~v1_xboole_0(esk1_0)&k3_tarski(k11_eqrel_1(esk1_0))!=esk1_0), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])).
fof(c_0_54, plain, ![X67]:(v1_xboole_0(X67)|k11_eqrel_1(X67)=a_1_0_eqrel_1(X67)), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_46])])).
cnf(c_0_55, plain, (r2_hidden(X1,X2)|v1_xboole_0(X2)|~r2_hidden(X1,k3_tarski(a_1_0_eqrel_1(X2)))), inference(er,[status(thm)],[c_0_47])).
cnf(c_0_56, plain, (X1=k3_tarski(X2)|r2_hidden(esk5_2(X2,X1),k3_tarski(X2))|r2_hidden(esk5_2(X2,X1),X1)), inference(er,[status(thm)],[c_0_48])).
cnf(c_0_57, plain, (X1=k3_tarski(a_1_0_eqrel_1(X2))|v1_xboole_0(X2)|~m1_subset_1(esk5_2(a_1_0_eqrel_1(X2),X1),X2)|~r2_hidden(esk5_2(a_1_0_eqrel_1(X2),X1),X1)), inference(spm,[status(thm)],[c_0_49, c_0_50])).
cnf(c_0_58, plain, (m1_subset_1(X1,X2)|~r2_hidden(X1,X2)), inference(spm,[status(thm)],[c_0_51, c_0_52])).
cnf(c_0_59, negated_conjecture, (k3_tarski(k11_eqrel_1(esk1_0))!=esk1_0), inference(split_conjunct,[status(thm)],[c_0_53])).
cnf(c_0_60, plain, (v1_xboole_0(X1)|k11_eqrel_1(X1)=a_1_0_eqrel_1(X1)), inference(split_conjunct,[status(thm)],[c_0_54])).
cnf(c_0_61, negated_conjecture, (~v1_xboole_0(esk1_0)), inference(split_conjunct,[status(thm)],[c_0_53])).
cnf(c_0_62, plain, (r2_hidden(esk5_2(a_1_0_eqrel_1(X1),X2),X1)|v1_xboole_0(X1)|X2=k3_tarski(a_1_0_eqrel_1(X1))|r2_hidden(esk5_2(a_1_0_eqrel_1(X1),X2),X2)), inference(spm,[status(thm)],[c_0_55, c_0_56])).
cnf(c_0_63, plain, (X1=k3_tarski(a_1_0_eqrel_1(X2))|v1_xboole_0(X2)|~r2_hidden(esk5_2(a_1_0_eqrel_1(X2),X1),X1)|~r2_hidden(esk5_2(a_1_0_eqrel_1(X2),X1),X2)), inference(spm,[status(thm)],[c_0_57, c_0_58])).
cnf(c_0_64, negated_conjecture, (k3_tarski(a_1_0_eqrel_1(esk1_0))!=esk1_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_59, c_0_60]), c_0_61])).
cnf(c_0_65, plain, ($false), inference(cdclpropres,[status(thm)],[c_0_62, c_0_63, c_0_64, c_0_61]), ['proof']).
# SZS output end CNFRefutation
# Proof object total steps             : 66
# Proof object clause steps            : 39
# Proof object formula steps           : 27
# Proof object conjectures             : 6
# Proof object clause conjectures      : 3
# Proof object formula conjectures     : 3
# Proof object initial clauses used    : 19
# Proof object initial formulas used   : 11
# Proof object generating inferences   : 18
# Proof object simplifying inferences  : 3
# Training examples: 0 positive, 0 negative
# Parsed axioms                        : 11
# Removed by relevancy pruning/SinE    : 0
# Initial clauses                      : 26
# Removed in clause preprocessing      : 0
# Initial clauses in saturation        : 26
# Processed clauses                    : 7883
# ...of these trivial                  : 28
# ...subsumed                          : 2855
# ...remaining for further processing  : 5000
# Other redundant clauses eliminated   : 1251
# Clauses deleted for lack of memory   : 0
# Backward-subsumed                    : 89
# Backward-rewritten                   : 2631
# Generated clauses                    : 1012600
# ...of the previous two non-trivial   : 1011693
# Contextual simplify-reflections      : 7
# Paramodulations                      : 1010775
# Factorizations                       : 4
# NegExts                              : 0
# Equation resolutions                 : 1821
# Propositional unsat checks           : 1
#    Propositional check models        : 0
#    Propositional check unsatisfiable : 1
#    Propositional clauses             : 917456
#    Propositional clauses after purity: 28323
#    Propositional unsat core size     : 4
#    Propositional preprocessing time  : 0.000
#    Propositional encoding time       : 6.958
#    Propositional solver time         : 0.168
#    Success case prop preproc time    : 0.000
#    Success case prop encoding time   : 6.958
#    Success case prop solver time     : 0.168
# Current number of processed clauses  : 2267
#    Positive orientable unit clauses  : 4
#    Positive unorientable unit clauses: 0
#    Negative unit clauses             : 3
#    Non-unit-clauses                  : 2260
# Current number of unprocessed clauses: 915189
# ...number of literals in the above   : 5389209
# Current number of archived formulas  : 0
# Current number of archived clauses   : 2720
# Clause-clause subsumption calls (NU) : 2317937
# Rec. Clause-clause subsumption calls : 306249
# Non-unit clause-clause subsumptions  : 2951
# Unit Clause-clause subsumption calls : 7497
# Rewrite failures with RHS unbound    : 0
# BW rewrite match attempts            : 568550
# BW rewrite match successes           : 1239
# Condensation attempts                : 0
# Condensation successes               : 0
# Termbank termtop insertions          : 93418885

# -------------------------------------------------
# User time                : 198.084 s
# System time              : 3.724 s
# Total time               : 201.808 s
# Maximum resident set size: 3588 pages
