TSTP Solution File: SEV089^5 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : SEV089^5 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n026.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 Jun 24 15:53:29 EDT 2024

% Result   : Theorem 0.16s 0.45s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.10  % Problem    : SEV089^5 : TPTP v8.2.0. Released v4.0.0.
% 0.10/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n026.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Fri Jun 21 18:48:09 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.16/0.43  Running higher-order theorem proving
% 0.16/0.43  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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.EinFaOhY6g/E---3.1_7549.p
% 0.16/0.45  # Version: 3.2.0-ho
% 0.16/0.45  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.45  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.45  # Starting post_as_ho1 with 300s (1) cores
% 0.16/0.45  # Starting post_as_ho4 with 300s (1) cores
% 0.16/0.45  # Starting post_as_ho2 with 300s (1) cores
% 0.16/0.45  # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.16/0.45  # Starting full_lambda_10 with 300s (1) cores
% 0.16/0.45  # Starting new_ho_8 with 300s (1) cores
% 0.16/0.45  # new_bool_9 with pid 7628 completed with status 0
% 0.16/0.45  # Result found by new_bool_9
% 0.16/0.45  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.45  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.45  # Search class: HGHSF-FFSF11-MSSFFFNN
% 0.16/0.45  # partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting new_ho_10 with 181s (1) cores
% 0.16/0.45  # new_ho_10 with pid 7635 completed with status 0
% 0.16/0.45  # Result found by new_ho_10
% 0.16/0.45  # Preprocessing class: HSSSSMSSSSSNSSA.
% 0.16/0.45  # Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.45  # Starting post_as_ho12 with 300s (1) cores
% 0.16/0.45  # Starting new_bool_9 with 300s (1) cores
% 0.16/0.45  # SinE strategy is GSinE(CountFormulas,hypos,1,,2,20000,1.0)
% 0.16/0.45  # Search class: HGHSF-FFSF11-MSSFFFNN
% 0.16/0.45  # partial match(1): HGHSF-FFSF11-SSSFFFNN
% 0.16/0.45  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.45  # Starting new_ho_10 with 181s (1) cores
% 0.16/0.45  # Preprocessing time       : 0.001 s
% 0.16/0.45  # Presaturation interreduction done
% 0.16/0.45  
% 0.16/0.45  # Proof found!
% 0.16/0.45  # SZS status Theorem
% 0.16/0.45  # SZS output start CNFRefutation
% 0.16/0.45  thf(decl_sort1, type, a: $tType).
% 0.16/0.45  thf(decl_22, type, epred1_0: a > $o).
% 0.16/0.45  thf(decl_23, type, epred2_0: a > $o).
% 0.16/0.45  thf(decl_24, type, esk1_0: a > a).
% 0.16/0.45  thf(decl_25, type, esk2_1: a > a).
% 0.16/0.45  thf(decl_26, type, esk3_1: (a > a) > a).
% 0.16/0.45  thf(decl_27, type, esk4_1: (a > a) > a).
% 0.16/0.45  thf(decl_28, type, esk5_2: a > (a > a) > a).
% 0.16/0.45  thf(decl_29, type, esk6_2: a > (a > a) > a).
% 0.16/0.45  thf(cEQP_1B_pme, conjecture, ![X1:a > $o, X2:a > $o]:((?[X3:a > a]:((![X4:a]:(((X1 @ X4)=>(X2 @ (X3 @ X4))))&![X5:a]:(((X2 @ X5)=>?[X6:a]:(((^[X4:a]:(((X1 @ X4)&((X5)=(X3 @ X4)))))=(( ^[X7:a, X8:a]:(((X7)=(X8))) ) @ X6)))))))=>?[X3:a > a]:((![X4:a]:(((X2 @ X4)=>(X1 @ (X3 @ X4))))&![X5:a]:(((X1 @ X5)=>?[X9:a]:(((^[X4:a]:(((X2 @ X4)&((X5)=(X3 @ X4)))))=(( ^[X10:a, X11:a]:(((X10)=(X11))) ) @ X9))))))))), file('/export/starexec/sandbox2/tmp/tmp.EinFaOhY6g/E---3.1_7549.p', cEQP_1B_pme)).
% 0.16/0.45  thf(c_0_1, negated_conjecture, ~(![X1:a > $o, X2:a > $o]:((?[X3:a > a]:((![X4:a]:(((X1 @ X4)=>(X2 @ (X3 @ X4))))&![X5:a]:(((X2 @ X5)=>?[X6:a]:(((^[Z0/* 8 */:a]:((X1 @ Z0&((X5)=(X3 @ Z0)))))=($eq @ X6)))))))=>?[X3:a > a]:((![X4:a]:(((X2 @ X4)=>(X1 @ (X3 @ X4))))&![X5:a]:(((X1 @ X5)=>?[X9:a]:(((^[Z0/* 8 */:a]:((X2 @ Z0&((X5)=(X3 @ Z0)))))=($eq @ X9)))))))))), inference(fool_unroll,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cEQP_1B_pme])])])).
% 0.16/0.45  thf(c_0_2, negated_conjecture, ![X25:a, X26:a, X28:a > a, X31:a]:((((~(epred1_0 @ X25)|(epred2_0 @ (esk1_0 @ X25)))&(~(epred2_0 @ X26)|((^[Z0/* 8 */:a]:((epred1_0 @ Z0&((X26)=(esk1_0 @ Z0)))))=($eq @ (esk2_1 @ X26)))))&((((epred1_0 @ (esk4_1 @ X28))|(epred2_0 @ (esk3_1 @ X28)))&(((^[Z0/* 8 */:a]:((epred2_0 @ Z0&((esk4_1 @ X28)=(X28 @ Z0)))))!=($eq @ X31))|(epred2_0 @ (esk3_1 @ X28))))&(((epred1_0 @ (esk4_1 @ X28))|~(epred1_0 @ (X28 @ (esk3_1 @ X28))))&(((^[Z0/* 8 */:a]:((epred2_0 @ Z0&((esk4_1 @ X28)=(X28 @ Z0)))))!=($eq @ X31))|~(epred1_0 @ (X28 @ (esk3_1 @ X28)))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])])).
% 0.16/0.45  thf(c_0_3, negated_conjecture, ![X4:a]:((((^[Z0/* 8 */:a]:(((epred1_0 @ Z0)&((X4)=(esk1_0 @ Z0)))))=($eq @ (esk2_1 @ X4)))|~((epred2_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_4, negated_conjecture, ![X3:a > a, X4:a]:(((epred2_0 @ (esk3_1 @ X3))|((^[Z0/* 8 */:a]:(((epred2_0 @ Z0)&((esk4_1 @ X3)=(X3 @ Z0)))))!=($eq @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_5, negated_conjecture, ![X32:a, X4:a]:(((((epred1_0 @ X32)&((X4)=(esk1_0 @ X32)))<=>((esk2_1 @ X4)=(X32)))|~((epred2_0 @ X4)))), inference(arg_cong,[status(thm)],[c_0_3])).
% 0.16/0.45  thf(c_0_6, negated_conjecture, ![X4:a, X3:a > a]:(((epred2_0 @ (esk3_1 @ X3))|(((epred2_0 @ (esk6_2 @ X4 @ X3))&((esk4_1 @ X3)=(X3 @ (esk6_2 @ X4 @ X3))))<~>((X4)=(esk6_2 @ X4 @ X3))))), inference(neg_ext,[status(thm)],[c_0_4])).
% 0.16/0.45  thf(c_0_7, negated_conjecture, ![X4:a]:((((esk1_0 @ (esk2_1 @ X4))=(X4))|~((epred2_0 @ X4)))), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])])).
% 0.16/0.45  thf(c_0_8, negated_conjecture, ![X4:a, X3:a > a]:((((X3 @ (esk6_2 @ X4 @ X3))=(esk4_1 @ X3))|((esk6_2 @ X4 @ X3)=(X4))|(epred2_0 @ (esk3_1 @ X3)))), inference(dynamic_cnf,[status(thm)],[c_0_6])).
% 0.16/0.45  thf(c_0_9, negated_conjecture, ![X4:a, X3:a > a]:((((esk6_2 @ X4 @ X3)=(X4))|(epred2_0 @ (esk6_2 @ X4 @ X3))|(epred2_0 @ (esk3_1 @ X3)))), inference(dynamic_cnf,[status(thm)],[c_0_6])).
% 0.16/0.45  thf(c_0_10, negated_conjecture, ![X4:a]:((((esk1_0 @ (esk4_1 @ esk2_1))=(esk6_2 @ X4 @ esk2_1))|((esk6_2 @ X4 @ esk2_1)=(X4))|(epred2_0 @ (esk3_1 @ esk2_1)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_8]), c_0_9])).
% 0.16/0.45  thf(c_0_11, negated_conjecture, ![X4:a, X3:a > a]:((((^[Z0/* 8 */:a]:(((epred2_0 @ Z0)&((esk4_1 @ X3)=(X3 @ Z0)))))!=($eq @ X4))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_12, negated_conjecture, ![X4:a, X3:a > a]:(((epred2_0 @ (esk3_1 @ X3))|((X3 @ (esk6_2 @ X4 @ X3))!=(esk4_1 @ X3))|((esk6_2 @ X4 @ X3)!=(X4))|~((epred2_0 @ (esk6_2 @ X4 @ X3))))), inference(dynamic_cnf,[status(thm)],[c_0_6])).
% 0.16/0.45  thf(c_0_13, negated_conjecture, (((esk6_2 @ (esk1_0 @ (esk4_1 @ esk2_1)) @ esk2_1)=(esk1_0 @ (esk4_1 @ esk2_1)))|(epred2_0 @ (esk3_1 @ esk2_1))), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_10])])).
% 0.16/0.45  thf(c_0_14, negated_conjecture, ![X4:a]:(((epred2_0 @ (esk1_0 @ X4))|~((epred1_0 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_15, negated_conjecture, ![X3:a > a]:(((epred1_0 @ (esk4_1 @ X3))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_16, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk2_1 @ X4))|~((epred2_0 @ X4)))), inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])])).
% 0.16/0.45  thf(c_0_17, negated_conjecture, ![X3:a > a]:(((epred1_0 @ (esk4_1 @ X3))|(epred2_0 @ (esk3_1 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_2])).
% 0.16/0.45  thf(c_0_18, negated_conjecture, ![X4:a, X3:a > a]:(((((epred2_0 @ (esk5_2 @ X4 @ X3))&((esk4_1 @ X3)=(X3 @ (esk5_2 @ X4 @ X3))))<~>((X4)=(esk5_2 @ X4 @ X3)))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(neg_ext,[status(thm)],[c_0_11])).
% 0.16/0.45  thf(c_0_19, negated_conjecture, ((epred2_0 @ (esk3_1 @ esk2_1))|((esk2_1 @ (esk1_0 @ (esk4_1 @ esk2_1)))!=(esk4_1 @ esk2_1))|~((epred2_0 @ (esk1_0 @ (esk4_1 @ esk2_1))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.16/0.45  thf(c_0_20, negated_conjecture, ![X4:a]:((((esk2_1 @ (esk1_0 @ X4))=(X4))|~((epred1_0 @ X4)))), inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_5])]), c_0_14])).
% 0.16/0.45  thf(c_0_21, negated_conjecture, (epred1_0 @ (esk4_1 @ esk2_1)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])).
% 0.16/0.45  thf(c_0_22, negated_conjecture, ![X4:a, X3:a > a]:((((X3 @ (esk5_2 @ X4 @ X3))=(esk4_1 @ X3))|((esk5_2 @ X4 @ X3)=(X4))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.16/0.45  thf(c_0_23, negated_conjecture, ((epred2_0 @ (esk3_1 @ esk2_1))|~((epred2_0 @ (esk1_0 @ (esk4_1 @ esk2_1))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_21])])).
% 0.16/0.45  thf(c_0_24, negated_conjecture, ![X4:a, X3:a > a]:((((esk5_2 @ X4 @ X3)=(X4))|(epred2_0 @ (esk5_2 @ X4 @ X3))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.16/0.45  thf(c_0_25, negated_conjecture, ![X4:a]:((((esk2_1 @ (esk5_2 @ X4 @ esk2_1))=(esk4_1 @ esk2_1))|((esk5_2 @ X4 @ esk2_1)=(X4))|~((epred2_0 @ (esk3_1 @ esk2_1))))), inference(spm,[status(thm)],[c_0_22, c_0_16])).
% 0.16/0.45  thf(c_0_26, negated_conjecture, (epred2_0 @ (esk3_1 @ esk2_1)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_14]), c_0_21])])).
% 0.16/0.45  thf(c_0_27, negated_conjecture, ![X4:a]:((((esk5_2 @ X4 @ esk2_1)=(X4))|(epred2_0 @ (esk5_2 @ X4 @ esk2_1))|~((epred2_0 @ (esk3_1 @ esk2_1))))), inference(spm,[status(thm)],[c_0_24, c_0_16])).
% 0.16/0.45  thf(c_0_28, negated_conjecture, ![X4:a]:((((esk2_1 @ (esk5_2 @ X4 @ esk2_1))=(esk4_1 @ esk2_1))|((esk5_2 @ X4 @ esk2_1)=(X4)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25, c_0_26])])).
% 0.16/0.45  thf(c_0_29, negated_conjecture, ![X4:a]:((((esk5_2 @ X4 @ esk2_1)=(X4))|(epred2_0 @ (esk5_2 @ X4 @ esk2_1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_26])])).
% 0.16/0.45  thf(c_0_30, negated_conjecture, ![X4:a]:((((esk1_0 @ (esk4_1 @ esk2_1))=(esk5_2 @ X4 @ esk2_1))|((esk5_2 @ X4 @ esk2_1)=(X4)))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7, c_0_28]), c_0_29])).
% 0.16/0.45  thf(c_0_31, negated_conjecture, ![X4:a, X3:a > a]:((((X3 @ (esk5_2 @ X4 @ X3))!=(esk4_1 @ X3))|((esk5_2 @ X4 @ X3)!=(X4))|~((epred2_0 @ (esk5_2 @ X4 @ X3)))|~((epred1_0 @ (X3 @ (esk3_1 @ X3)))))), inference(dynamic_cnf,[status(thm)],[c_0_18])).
% 0.16/0.45  thf(c_0_32, negated_conjecture, ((esk5_2 @ (esk1_0 @ (esk4_1 @ esk2_1)) @ esk2_1)=(esk1_0 @ (esk4_1 @ esk2_1))), inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_30])])).
% 0.16/0.45  thf(c_0_33, negated_conjecture, (((esk2_1 @ (esk1_0 @ (esk4_1 @ esk2_1)))!=(esk4_1 @ esk2_1))|~((epred2_0 @ (esk1_0 @ (esk4_1 @ esk2_1))))|~((epred1_0 @ (esk2_1 @ (esk3_1 @ esk2_1))))), inference(spm,[status(thm)],[c_0_31, c_0_32])).
% 0.16/0.45  thf(c_0_34, negated_conjecture, (~((epred2_0 @ (esk1_0 @ (esk4_1 @ esk2_1))))|~((epred1_0 @ (esk2_1 @ (esk3_1 @ esk2_1))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_20]), c_0_21])])).
% 0.16/0.45  thf(c_0_35, negated_conjecture, ~((epred2_0 @ (esk1_0 @ (esk4_1 @ esk2_1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34, c_0_16]), c_0_26])])).
% 0.16/0.45  thf(c_0_36, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35, c_0_14]), c_0_21])]), ['proof']).
% 0.16/0.45  # SZS output end CNFRefutation
% 0.16/0.45  # Parsed axioms                        : 2
% 0.16/0.45  # Removed by relevancy pruning/SinE    : 1
% 0.16/0.45  # Initial clauses                      : 6
% 0.16/0.45  # Removed in clause preprocessing      : 0
% 0.16/0.45  # Initial clauses in saturation        : 6
% 0.16/0.45  # Processed clauses                    : 49
% 0.16/0.45  # ...of these trivial                  : 0
% 0.16/0.45  # ...subsumed                          : 4
% 0.16/0.45  # ...remaining for further processing  : 45
% 0.16/0.45  # Other redundant clauses eliminated   : 10
% 0.16/0.45  # Clauses deleted for lack of memory   : 0
% 0.16/0.45  # Backward-subsumed                    : 3
% 0.16/0.45  # Backward-rewritten                   : 7
% 0.16/0.45  # Generated clauses                    : 88
% 0.16/0.45  # ...of the previous two non-redundant : 70
% 0.16/0.45  # ...aggressively subsumed             : 0
% 0.16/0.45  # Contextual simplify-reflections      : 5
% 0.16/0.45  # Paramodulations                      : 60
% 0.16/0.45  # Factorizations                       : 5
% 0.16/0.45  # NegExts                              : 2
% 0.16/0.45  # Equation resolutions                 : 10
% 0.16/0.45  # Disequality decompositions           : 0
% 0.16/0.45  # Total rewrite steps                  : 25
% 0.16/0.45  # ...of those cached                   : 23
% 0.16/0.45  # Propositional unsat checks           : 0
% 0.16/0.45  #    Propositional check models        : 0
% 0.16/0.45  #    Propositional check unsatisfiable : 0
% 0.16/0.45  #    Propositional clauses             : 0
% 0.16/0.45  #    Propositional clauses after purity: 0
% 0.16/0.45  #    Propositional unsat core size     : 0
% 0.16/0.45  #    Propositional preprocessing time  : 0.000
% 0.16/0.45  #    Propositional encoding time       : 0.000
% 0.16/0.45  #    Propositional solver time         : 0.000
% 0.16/0.45  #    Success case prop preproc time    : 0.000
% 0.16/0.45  #    Success case prop encoding time   : 0.000
% 0.16/0.45  #    Success case prop solver time     : 0.000
% 0.16/0.45  # Current number of processed clauses  : 25
% 0.16/0.45  #    Positive orientable unit clauses  : 3
% 0.16/0.45  #    Positive unorientable unit clauses: 0
% 0.16/0.45  #    Negative unit clauses             : 1
% 0.16/0.45  #    Non-unit-clauses                  : 21
% 0.16/0.45  # Current number of unprocessed clauses: 18
% 0.16/0.45  # ...number of literals in the above   : 61
% 0.16/0.45  # Current number of archived formulas  : 0
% 0.16/0.45  # Current number of archived clauses   : 20
% 0.16/0.45  # Clause-clause subsumption calls (NU) : 91
% 0.16/0.45  # Rec. Clause-clause subsumption calls : 60
% 0.16/0.45  # Non-unit clause-clause subsumptions  : 11
% 0.16/0.45  # Unit Clause-clause subsumption calls : 5
% 0.16/0.45  # Rewrite failures with RHS unbound    : 0
% 0.16/0.45  # BW rewrite match attempts            : 1
% 0.16/0.45  # BW rewrite match successes           : 1
% 0.16/0.45  # Condensation attempts                : 49
% 0.16/0.45  # Condensation successes               : 0
% 0.16/0.45  # Termbank termtop insertions          : 2857
% 0.16/0.45  # Search garbage collected termcells   : 321
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.005 s
% 0.16/0.45  # System time              : 0.002 s
% 0.16/0.45  # Total time               : 0.007 s
% 0.16/0.45  # Maximum resident set size: 1900 pages
% 0.16/0.45  
% 0.16/0.45  # -------------------------------------------------
% 0.16/0.45  # User time                : 0.006 s
% 0.16/0.45  # System time              : 0.004 s
% 0.16/0.45  # Total time               : 0.010 s
% 0.16/0.45  # Maximum resident set size: 1720 pages
% 0.16/0.45  % E---3.1 exiting
% 0.16/0.45  % E exiting
%------------------------------------------------------------------------------