TSTP Solution File: MGT006+1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n001.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:34:31 EDT 2023
% Result : Theorem 0.21s 0.50s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 4
% Syntax : Number of formulae : 41 ( 11 unt; 0 def)
% Number of atoms : 211 ( 0 equ)
% Maximal formula atoms : 31 ( 5 avg)
% Number of connectives : 299 ( 129 ~; 125 |; 39 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 139 ( 18 sgn; 48 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_FOL,conjecture,
! [X1,X7,X8,X9,X10,X5,X6] :
( ( organization(X1,X5)
& organization(X1,X6)
& reorganization_free(X1,X5,X6)
& reliability(X1,X7,X5)
& reliability(X1,X8,X6)
& accountability(X1,X9,X5)
& accountability(X1,X10,X6)
& greater(X6,X5) )
=> ( greater(X8,X7)
& greater(X10,X9) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JQ0whre2QJ/E---3.1_19436.p',t6_FOL) ).
fof(a2_FOL,hypothesis,
! [X1,X4,X5,X6,X7,X8,X9,X10,X11,X12] :
( ( organization(X1,X5)
& organization(X4,X6)
& reliability(X1,X7,X5)
& reliability(X4,X8,X6)
& accountability(X1,X9,X5)
& accountability(X4,X10,X6)
& reproducibility(X1,X11,X5)
& reproducibility(X4,X12,X6) )
=> ( greater(X12,X11)
<=> ( greater(X8,X7)
& greater(X10,X9) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.JQ0whre2QJ/E---3.1_19436.p',a2_FOL) ).
fof(a4_FOL,hypothesis,
! [X1,X11,X12,X5,X6] :
( ( organization(X1,X5)
& organization(X1,X6)
& reorganization_free(X1,X5,X6)
& reproducibility(X1,X11,X5)
& reproducibility(X1,X12,X6)
& greater(X6,X5) )
=> greater(X12,X11) ),
file('/export/starexec/sandbox2/tmp/tmp.JQ0whre2QJ/E---3.1_19436.p',a4_FOL) ).
fof(mp3,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : reproducibility(X1,X3,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.JQ0whre2QJ/E---3.1_19436.p',mp3) ).
fof(c_0_4,negated_conjecture,
~ ! [X1,X7,X8,X9,X10,X5,X6] :
( ( organization(X1,X5)
& organization(X1,X6)
& reorganization_free(X1,X5,X6)
& reliability(X1,X7,X5)
& reliability(X1,X8,X6)
& accountability(X1,X9,X5)
& accountability(X1,X10,X6)
& greater(X6,X5) )
=> ( greater(X8,X7)
& greater(X10,X9) ) ),
inference(assume_negation,[status(cth)],[t6_FOL]) ).
fof(c_0_5,hypothesis,
! [X20,X21,X22,X23,X24,X25,X26,X27,X28,X29] :
( ( greater(X25,X24)
| ~ greater(X29,X28)
| ~ organization(X20,X22)
| ~ organization(X21,X23)
| ~ reliability(X20,X24,X22)
| ~ reliability(X21,X25,X23)
| ~ accountability(X20,X26,X22)
| ~ accountability(X21,X27,X23)
| ~ reproducibility(X20,X28,X22)
| ~ reproducibility(X21,X29,X23) )
& ( greater(X27,X26)
| ~ greater(X29,X28)
| ~ organization(X20,X22)
| ~ organization(X21,X23)
| ~ reliability(X20,X24,X22)
| ~ reliability(X21,X25,X23)
| ~ accountability(X20,X26,X22)
| ~ accountability(X21,X27,X23)
| ~ reproducibility(X20,X28,X22)
| ~ reproducibility(X21,X29,X23) )
& ( ~ greater(X25,X24)
| ~ greater(X27,X26)
| greater(X29,X28)
| ~ organization(X20,X22)
| ~ organization(X21,X23)
| ~ reliability(X20,X24,X22)
| ~ reliability(X21,X25,X23)
| ~ accountability(X20,X26,X22)
| ~ accountability(X21,X27,X23)
| ~ reproducibility(X20,X28,X22)
| ~ reproducibility(X21,X29,X23) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a2_FOL])])]) ).
fof(c_0_6,negated_conjecture,
( organization(esk1_0,esk6_0)
& organization(esk1_0,esk7_0)
& reorganization_free(esk1_0,esk6_0,esk7_0)
& reliability(esk1_0,esk2_0,esk6_0)
& reliability(esk1_0,esk3_0,esk7_0)
& accountability(esk1_0,esk4_0,esk6_0)
& accountability(esk1_0,esk5_0,esk7_0)
& greater(esk7_0,esk6_0)
& ( ~ greater(esk3_0,esk2_0)
| ~ greater(esk5_0,esk4_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X6)
| ~ organization(X7,X8)
| ~ reliability(X5,X9,X6)
| ~ reliability(X7,X10,X8)
| ~ accountability(X5,X2,X6)
| ~ accountability(X7,X1,X8)
| ~ reproducibility(X5,X4,X6)
| ~ reproducibility(X7,X3,X8) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,negated_conjecture,
accountability(esk1_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
organization(esk1_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X30,X31,X32,X33,X34] :
( ~ organization(X30,X33)
| ~ organization(X30,X34)
| ~ reorganization_free(X30,X33,X34)
| ~ reproducibility(X30,X31,X33)
| ~ reproducibility(X30,X32,X34)
| ~ greater(X34,X33)
| greater(X32,X31) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a4_FOL])]) ).
cnf(c_0_11,negated_conjecture,
( greater(esk5_0,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X1,X5)
| ~ reliability(esk1_0,X6,esk7_0)
| ~ reliability(X4,X7,X5)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]) ).
cnf(c_0_12,negated_conjecture,
reliability(esk1_0,esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_13,plain,
! [X35,X36] :
( ~ organization(X35,X36)
| reproducibility(X35,esk8_2(X35,X36),X36) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp3])])]) ).
cnf(c_0_14,hypothesis,
( greater(X5,X4)
| ~ organization(X1,X2)
| ~ organization(X1,X3)
| ~ reorganization_free(X1,X2,X3)
| ~ reproducibility(X1,X4,X2)
| ~ reproducibility(X1,X5,X3)
| ~ greater(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
reorganization_free(esk1_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
organization(esk1_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,hypothesis,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ organization(X5,X6)
| ~ organization(X7,X8)
| ~ reliability(X5,X2,X6)
| ~ reliability(X7,X1,X8)
| ~ accountability(X5,X9,X6)
| ~ accountability(X7,X10,X8)
| ~ reproducibility(X5,X4,X6)
| ~ reproducibility(X7,X3,X8) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( greater(esk5_0,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X1,X5)
| ~ reliability(X4,X6,X5)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reproducibility(X4,X3,X5)
| ~ organization(X4,X5) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_20,plain,
( reproducibility(X1,esk8_2(X1,X2),X2)
| ~ organization(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,negated_conjecture,
( greater(X1,X2)
| ~ reproducibility(esk1_0,X1,esk7_0)
| ~ reproducibility(esk1_0,X2,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_9]),c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
( greater(X1,X2)
| ~ greater(X3,X4)
| ~ accountability(X5,X6,X7)
| ~ reliability(esk1_0,X1,esk7_0)
| ~ reliability(X5,X2,X7)
| ~ reproducibility(esk1_0,X3,esk7_0)
| ~ reproducibility(X5,X4,X7)
| ~ organization(X5,X7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_8]),c_0_9])]) ).
cnf(c_0_23,negated_conjecture,
( greater(esk5_0,X1)
| ~ greater(esk8_2(esk1_0,esk7_0),X2)
| ~ accountability(X3,X1,X4)
| ~ reliability(X3,X5,X4)
| ~ reproducibility(X3,X2,X4)
| ~ organization(X3,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_9])]) ).
cnf(c_0_24,negated_conjecture,
( greater(esk8_2(esk1_0,esk7_0),X1)
| ~ reproducibility(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_20]),c_0_9])]) ).
cnf(c_0_25,negated_conjecture,
( greater(esk3_0,X1)
| ~ greater(X2,X3)
| ~ accountability(X4,X5,X6)
| ~ reliability(X4,X1,X6)
| ~ reproducibility(esk1_0,X2,esk7_0)
| ~ reproducibility(X4,X3,X6)
| ~ organization(X4,X6) ),
inference(spm,[status(thm)],[c_0_22,c_0_12]) ).
cnf(c_0_26,negated_conjecture,
( greater(esk5_0,X1)
| ~ accountability(X2,X1,X3)
| ~ reliability(X2,X4,X3)
| ~ reproducibility(esk1_0,X5,esk6_0)
| ~ reproducibility(X2,X5,X3)
| ~ organization(X2,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,negated_conjecture,
( greater(esk3_0,X1)
| ~ greater(esk8_2(esk1_0,esk7_0),X2)
| ~ accountability(X3,X4,X5)
| ~ reliability(X3,X1,X5)
| ~ reproducibility(X3,X2,X5)
| ~ organization(X3,X5) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_9])]) ).
cnf(c_0_28,negated_conjecture,
( greater(esk5_0,X1)
| ~ accountability(X2,X1,X3)
| ~ reliability(X2,X4,X3)
| ~ reproducibility(X2,esk8_2(esk1_0,esk6_0),X3)
| ~ organization(X2,X3) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_20]),c_0_17])]) ).
cnf(c_0_29,negated_conjecture,
( greater(esk3_0,X1)
| ~ accountability(X2,X3,X4)
| ~ reliability(X2,X1,X4)
| ~ reproducibility(esk1_0,X5,esk6_0)
| ~ reproducibility(X2,X5,X4)
| ~ organization(X2,X4) ),
inference(spm,[status(thm)],[c_0_27,c_0_24]) ).
cnf(c_0_30,negated_conjecture,
( greater(esk5_0,X1)
| ~ accountability(esk1_0,X1,esk6_0)
| ~ reliability(esk1_0,X2,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_20]),c_0_17])]) ).
cnf(c_0_31,negated_conjecture,
accountability(esk1_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_32,negated_conjecture,
( greater(esk3_0,X1)
| ~ accountability(X2,X3,X4)
| ~ reliability(X2,X1,X4)
| ~ reproducibility(X2,esk8_2(esk1_0,esk6_0),X4)
| ~ organization(X2,X4) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_20]),c_0_17])]) ).
cnf(c_0_33,negated_conjecture,
( greater(esk5_0,esk4_0)
| ~ reliability(esk1_0,X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
reliability(esk1_0,esk2_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_35,negated_conjecture,
( greater(esk3_0,X1)
| ~ accountability(esk1_0,X2,esk6_0)
| ~ reliability(esk1_0,X1,esk6_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_20]),c_0_17])]) ).
cnf(c_0_36,negated_conjecture,
( ~ greater(esk3_0,esk2_0)
| ~ greater(esk5_0,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_37,negated_conjecture,
greater(esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,negated_conjecture,
( greater(esk3_0,X1)
| ~ reliability(esk1_0,X1,esk6_0) ),
inference(spm,[status(thm)],[c_0_35,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
~ greater(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_34]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : MGT006+1 : TPTP v8.1.2. Released v2.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n001.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Oct 3 00:59:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/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.JQ0whre2QJ/E---3.1_19436.p
% 0.21/0.50 # Version: 3.1pre001
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # sh5l with pid 19517 completed with status 0
% 0.21/0.50 # Result found by sh5l
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHHNF-FFSM22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # SAT001_MinMin_p005000_rr_RG with pid 19519 completed with status 0
% 0.21/0.50 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.50 # Starting sh5l with 300s (1) cores
% 0.21/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.50 # Search class: FHHNF-FFSM22-SFFFFFNN
% 0.21/0.50 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.50 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.50 # Preprocessing time : 0.001 s
% 0.21/0.50 # Presaturation interreduction done
% 0.21/0.50
% 0.21/0.50 # Proof found!
% 0.21/0.50 # SZS status Theorem
% 0.21/0.50 # SZS output start CNFRefutation
% See solution above
% 0.21/0.50 # Parsed axioms : 4
% 0.21/0.50 # Removed by relevancy pruning/SinE : 0
% 0.21/0.50 # Initial clauses : 14
% 0.21/0.50 # Removed in clause preprocessing : 0
% 0.21/0.50 # Initial clauses in saturation : 14
% 0.21/0.50 # Processed clauses : 49
% 0.21/0.50 # ...of these trivial : 0
% 0.21/0.50 # ...subsumed : 0
% 0.21/0.50 # ...remaining for further processing : 49
% 0.21/0.50 # Other redundant clauses eliminated : 0
% 0.21/0.50 # Clauses deleted for lack of memory : 0
% 0.21/0.50 # Backward-subsumed : 3
% 0.21/0.50 # Backward-rewritten : 2
% 0.21/0.50 # Generated clauses : 24
% 0.21/0.50 # ...of the previous two non-redundant : 24
% 0.21/0.50 # ...aggressively subsumed : 0
% 0.21/0.50 # Contextual simplify-reflections : 0
% 0.21/0.50 # Paramodulations : 24
% 0.21/0.50 # Factorizations : 0
% 0.21/0.50 # NegExts : 0
% 0.21/0.50 # Equation resolutions : 0
% 0.21/0.50 # Total rewrite steps : 19
% 0.21/0.50 # Propositional unsat checks : 0
% 0.21/0.50 # Propositional check models : 0
% 0.21/0.50 # Propositional check unsatisfiable : 0
% 0.21/0.50 # Propositional clauses : 0
% 0.21/0.50 # Propositional clauses after purity: 0
% 0.21/0.50 # Propositional unsat core size : 0
% 0.21/0.50 # Propositional preprocessing time : 0.000
% 0.21/0.50 # Propositional encoding time : 0.000
% 0.21/0.50 # Propositional solver time : 0.000
% 0.21/0.50 # Success case prop preproc time : 0.000
% 0.21/0.50 # Success case prop encoding time : 0.000
% 0.21/0.50 # Success case prop solver time : 0.000
% 0.21/0.50 # Current number of processed clauses : 30
% 0.21/0.50 # Positive orientable unit clauses : 9
% 0.21/0.50 # Positive unorientable unit clauses: 0
% 0.21/0.50 # Negative unit clauses : 1
% 0.21/0.50 # Non-unit-clauses : 20
% 0.21/0.50 # Current number of unprocessed clauses: 3
% 0.21/0.50 # ...number of literals in the above : 26
% 0.21/0.50 # Current number of archived formulas : 0
% 0.21/0.50 # Current number of archived clauses : 19
% 0.21/0.50 # Clause-clause subsumption calls (NU) : 431
% 0.21/0.50 # Rec. Clause-clause subsumption calls : 23
% 0.21/0.50 # Non-unit clause-clause subsumptions : 3
% 0.21/0.50 # Unit Clause-clause subsumption calls : 17
% 0.21/0.50 # Rewrite failures with RHS unbound : 0
% 0.21/0.50 # BW rewrite match attempts : 1
% 0.21/0.50 # BW rewrite match successes : 1
% 0.21/0.50 # Condensation attempts : 0
% 0.21/0.50 # Condensation successes : 0
% 0.21/0.50 # Termbank termtop insertions : 2044
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.005 s
% 0.21/0.50 # System time : 0.003 s
% 0.21/0.50 # Total time : 0.008 s
% 0.21/0.50 # Maximum resident set size: 1732 pages
% 0.21/0.50
% 0.21/0.50 # -------------------------------------------------
% 0.21/0.50 # User time : 0.007 s
% 0.21/0.50 # System time : 0.004 s
% 0.21/0.50 # Total time : 0.011 s
% 0.21/0.50 # Maximum resident set size: 1680 pages
% 0.21/0.50 % E---3.1 exiting
% 0.21/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------