TSTP Solution File: KLE062+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE062+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:04:50 EDT 2023
% Result : Theorem 0.15s 0.50s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 62 unt; 0 def)
% Number of atoms : 62 ( 61 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 109 ( 8 sgn; 42 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(domain(X4),one) = one,
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',additive_commutativity) ).
fof(domain2,axiom,
! [X4,X5] : domain(multiplication(X4,X5)) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',domain2) ).
fof(multiplicative_left_identity,axiom,
! [X1] : multiplication(one,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',multiplicative_left_identity) ).
fof(domain5,axiom,
! [X4,X5] : domain(addition(X4,X5)) = addition(domain(X4),domain(X5)),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',domain5) ).
fof(domain1,axiom,
! [X4] : addition(X4,multiplication(domain(X4),X4)) = multiplication(domain(X4),X4),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',domain1) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',multiplicative_right_identity) ).
fof(right_distributivity,axiom,
! [X1,X2,X3] : multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',right_distributivity) ).
fof(left_distributivity,axiom,
! [X1,X2,X3] : multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',left_distributivity) ).
fof(multiplicative_associativity,axiom,
! [X1,X2,X3] : multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',multiplicative_associativity) ).
fof(goals,conjecture,
! [X4,X5] : multiplication(domain(X4),domain(X5)) = multiplication(domain(X5),domain(X4)),
file('/export/starexec/sandbox/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p',goals) ).
fof(c_0_11,plain,
! [X31] : addition(domain(X31),one) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_12,plain,
! [X6,X7] : addition(X6,X7) = addition(X7,X6),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_13,plain,
! [X29,X30] : domain(multiplication(X29,X30)) = domain(multiplication(X29,domain(X30))),
inference(variable_rename,[status(thm)],[domain2]) ).
fof(c_0_14,plain,
! [X17] : multiplication(one,X17) = X17,
inference(variable_rename,[status(thm)],[multiplicative_left_identity]) ).
fof(c_0_15,plain,
! [X32,X33] : domain(addition(X32,X33)) = addition(domain(X32),domain(X33)),
inference(variable_rename,[status(thm)],[domain5]) ).
fof(c_0_16,plain,
! [X28] : addition(X28,multiplication(domain(X28),X28)) = multiplication(domain(X28),X28),
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_17,plain,
! [X16] : multiplication(X16,one) = X16,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
cnf(c_0_18,plain,
addition(domain(X1),one) = one,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
domain(multiplication(X1,X2)) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
multiplication(one,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X18,X19,X20] : multiplication(X18,addition(X19,X20)) = addition(multiplication(X18,X19),multiplication(X18,X20)),
inference(variable_rename,[status(thm)],[right_distributivity]) ).
fof(c_0_23,plain,
! [X21,X22,X23] : multiplication(addition(X21,X22),X23) = addition(multiplication(X21,X23),multiplication(X22,X23)),
inference(variable_rename,[status(thm)],[left_distributivity]) ).
cnf(c_0_24,plain,
domain(addition(X1,X2)) = addition(domain(X1),domain(X2)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
addition(X1,multiplication(domain(X1),X1)) = multiplication(domain(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
addition(one,domain(X1)) = one,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
domain(domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_29,plain,
multiplication(X1,addition(X2,X3)) = addition(multiplication(X1,X2),multiplication(X1,X3)),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
multiplication(addition(X1,X2),X3) = addition(multiplication(X1,X3),multiplication(X2,X3)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
domain(multiplication(X1,addition(domain(X2),domain(X3)))) = domain(multiplication(X1,addition(X2,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_32,plain,
domain(one) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_33,plain,
! [X13,X14,X15] : multiplication(X13,multiplication(X14,X15)) = multiplication(multiplication(X13,X14),X15),
inference(variable_rename,[status(thm)],[multiplicative_associativity]) ).
cnf(c_0_34,plain,
addition(domain(X1),multiplication(domain(X1),domain(X1))) = multiplication(domain(X1),domain(X1)),
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_35,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(X2,one)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_19]) ).
cnf(c_0_36,plain,
addition(X1,multiplication(X1,X2)) = multiplication(X1,addition(one,X2)),
inference(spm,[status(thm)],[c_0_29,c_0_26]) ).
cnf(c_0_37,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(X2,one),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_19]) ).
cnf(c_0_38,plain,
domain(multiplication(X1,addition(X2,one))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_19]),c_0_27]),c_0_26]) ).
cnf(c_0_39,plain,
multiplication(X1,multiplication(X2,X3)) = multiplication(multiplication(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_40,plain,
multiplication(domain(X1),domain(X1)) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19]),c_0_27]),c_0_26]) ).
cnf(c_0_41,plain,
addition(X1,multiplication(X2,X1)) = multiplication(addition(one,X2),X1),
inference(spm,[status(thm)],[c_0_30,c_0_21]) ).
cnf(c_0_42,plain,
addition(X1,multiplication(X1,domain(X2))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_27]),c_0_26]) ).
cnf(c_0_43,plain,
multiplication(domain(X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_37]),c_0_19]),c_0_27]),c_0_21]) ).
cnf(c_0_44,plain,
addition(domain(X1),domain(multiplication(X1,X2))) = domain(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_24]) ).
cnf(c_0_45,plain,
multiplication(domain(X1),multiplication(domain(X1),X2)) = multiplication(domain(X1),X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
addition(X1,multiplication(domain(X2),X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_21]),c_0_21]) ).
cnf(c_0_47,plain,
multiplication(domain(X1),addition(X2,X1)) = addition(X1,multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_43]),c_0_19]) ).
cnf(c_0_48,plain,
addition(domain(X1),domain(multiplication(domain(X1),X2))) = domain(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_28]),c_0_28]) ).
cnf(c_0_49,plain,
addition(domain(X1),domain(multiplication(domain(X2),X1))) = domain(X1),
inference(spm,[status(thm)],[c_0_24,c_0_46]) ).
cnf(c_0_50,plain,
multiplication(addition(X1,domain(X2)),X2) = addition(X2,multiplication(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_43]),c_0_19]) ).
fof(c_0_51,negated_conjecture,
~ ! [X4,X5] : multiplication(domain(X4),domain(X5)) = multiplication(domain(X5),domain(X4)),
inference(assume_negation,[status(cth)],[goals]) ).
cnf(c_0_52,plain,
multiplication(domain(multiplication(domain(X1),X2)),X2) = multiplication(domain(X1),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_46]),c_0_30]),c_0_48]) ).
cnf(c_0_53,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X2)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_28]),c_0_28]),c_0_42]) ).
cnf(c_0_54,plain,
multiplication(domain(X1),multiplication(domain(X2),X1)) = multiplication(domain(X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_49]),c_0_46]) ).
fof(c_0_55,negated_conjecture,
multiplication(domain(esk1_0),domain(esk2_0)) != multiplication(domain(esk2_0),domain(esk1_0)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_51])])]) ).
cnf(c_0_56,plain,
multiplication(domain(multiplication(domain(X1),X2)),domain(X1)) = domain(multiplication(domain(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_28]),c_0_28]),c_0_42]) ).
cnf(c_0_57,plain,
domain(multiplication(domain(X1),X2)) = multiplication(domain(X1),domain(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_20]),c_0_53]) ).
cnf(c_0_58,plain,
multiplication(domain(X1),multiplication(domain(X2),domain(X1))) = multiplication(domain(X2),domain(X1)),
inference(spm,[status(thm)],[c_0_54,c_0_28]) ).
cnf(c_0_59,negated_conjecture,
multiplication(domain(esk1_0),domain(esk2_0)) != multiplication(domain(esk2_0),domain(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_60,plain,
multiplication(domain(X1),domain(X2)) = multiplication(domain(X2),domain(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_39]),c_0_58]),c_0_57]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : KLE062+1 : TPTP v8.1.2. Released v4.0.0.
% 0.09/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n028.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Tue Oct 3 05:05:37 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 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/tmp/tmp.gQQM7KZMEP/E---3.1_21251.p
% 0.15/0.50 # Version: 3.1pre001
% 0.15/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.50 # Starting sh5l with 300s (1) cores
% 0.15/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 21328 completed with status 0
% 0.15/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 # No SInE strategy applied
% 0.15/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.50 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 0.15/0.50 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S2U with 136s (1) cores
% 0.15/0.50 # G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with pid 21336 completed with status 0
% 0.15/0.50 # Result found by G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y
% 0.15/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.50 # No SInE strategy applied
% 0.15/0.50 # Search class: FHUSM-FFSF21-MFFFFFNN
% 0.15/0.50 # Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.50 # Starting G-E--_208_C12_11_nc_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.50 # Starting G-E--_092_C01_F1_AE_CS_SP_PS_CO_S0Y with 136s (1) cores
% 0.15/0.50 # Preprocessing time : 0.001 s
% 0.15/0.50 # Presaturation interreduction done
% 0.15/0.50
% 0.15/0.50 # Proof found!
% 0.15/0.50 # SZS status Theorem
% 0.15/0.50 # SZS output start CNFRefutation
% See solution above
% 0.15/0.50 # Parsed axioms : 18
% 0.15/0.50 # Removed by relevancy pruning/SinE : 0
% 0.15/0.50 # Initial clauses : 19
% 0.15/0.50 # Removed in clause preprocessing : 0
% 0.15/0.50 # Initial clauses in saturation : 19
% 0.15/0.50 # Processed clauses : 330
% 0.15/0.50 # ...of these trivial : 120
% 0.15/0.50 # ...subsumed : 67
% 0.15/0.50 # ...remaining for further processing : 143
% 0.15/0.50 # Other redundant clauses eliminated : 0
% 0.15/0.50 # Clauses deleted for lack of memory : 0
% 0.15/0.50 # Backward-subsumed : 0
% 0.15/0.50 # Backward-rewritten : 35
% 0.15/0.50 # Generated clauses : 8364
% 0.15/0.50 # ...of the previous two non-redundant : 3821
% 0.15/0.50 # ...aggressively subsumed : 0
% 0.15/0.50 # Contextual simplify-reflections : 0
% 0.15/0.50 # Paramodulations : 8364
% 0.15/0.50 # Factorizations : 0
% 0.15/0.50 # NegExts : 0
% 0.15/0.50 # Equation resolutions : 0
% 0.15/0.50 # Total rewrite steps : 14652
% 0.15/0.50 # Propositional unsat checks : 0
% 0.15/0.50 # Propositional check models : 0
% 0.15/0.50 # Propositional check unsatisfiable : 0
% 0.15/0.50 # Propositional clauses : 0
% 0.15/0.50 # Propositional clauses after purity: 0
% 0.15/0.50 # Propositional unsat core size : 0
% 0.15/0.50 # Propositional preprocessing time : 0.000
% 0.15/0.50 # Propositional encoding time : 0.000
% 0.15/0.50 # Propositional solver time : 0.000
% 0.15/0.50 # Success case prop preproc time : 0.000
% 0.15/0.50 # Success case prop encoding time : 0.000
% 0.15/0.50 # Success case prop solver time : 0.000
% 0.15/0.50 # Current number of processed clauses : 89
% 0.15/0.50 # Positive orientable unit clauses : 78
% 0.15/0.50 # Positive unorientable unit clauses: 9
% 0.15/0.50 # Negative unit clauses : 0
% 0.15/0.50 # Non-unit-clauses : 2
% 0.15/0.50 # Current number of unprocessed clauses: 3489
% 0.15/0.50 # ...number of literals in the above : 3489
% 0.15/0.50 # Current number of archived formulas : 0
% 0.15/0.50 # Current number of archived clauses : 54
% 0.15/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.15/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.15/0.50 # Non-unit clause-clause subsumptions : 0
% 0.15/0.50 # Unit Clause-clause subsumption calls : 24
% 0.15/0.50 # Rewrite failures with RHS unbound : 0
% 0.15/0.50 # BW rewrite match attempts : 367
% 0.15/0.50 # BW rewrite match successes : 108
% 0.15/0.50 # Condensation attempts : 330
% 0.15/0.50 # Condensation successes : 0
% 0.15/0.50 # Termbank termtop insertions : 97686
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.067 s
% 0.15/0.50 # System time : 0.006 s
% 0.15/0.50 # Total time : 0.073 s
% 0.15/0.50 # Maximum resident set size: 1728 pages
% 0.15/0.50
% 0.15/0.50 # -------------------------------------------------
% 0.15/0.50 # User time : 0.345 s
% 0.15/0.50 # System time : 0.023 s
% 0.15/0.50 # Total time : 0.368 s
% 0.15/0.50 # Maximum resident set size: 1684 pages
% 0.15/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------