TSTP Solution File: KLE133+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : KLE133+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n031.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:05:13 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of formulae : 45 ( 42 unt; 0 def)
% Number of atoms : 51 ( 50 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 10 ( 4 ~; 0 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 16 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 57 ( 2 sgn; 34 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(domain3,axiom,
! [X4] : addition(antidomain(antidomain(X4)),antidomain(X4)) = one,
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',domain3) ).
fof(additive_commutativity,axiom,
! [X1,X2] : addition(X1,X2) = addition(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',additive_commutativity) ).
fof(multiplicative_right_identity,axiom,
! [X1] : multiplication(X1,one) = X1,
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',multiplicative_right_identity) ).
fof(domain1,axiom,
! [X4] : multiplication(antidomain(X4),X4) = zero,
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',domain1) ).
fof(goals,conjecture,
! [X4] :
( ( ! [X5] : addition(domain(X5),forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))) = forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))
& ! [X6] : forward_diamond(X4,forward_diamond(X4,domain(X6))) = forward_diamond(X4,domain(X6)) )
=> ! [X7] : addition(forward_diamond(X4,domain(X7)),forward_diamond(star(X4),domain_difference(domain(X7),forward_diamond(X4,domain(X7))))) = forward_diamond(star(X4),domain_difference(domain(X7),forward_diamond(X4,domain(X7)))) ),
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',goals) ).
fof(forward_diamond,axiom,
! [X4,X5] : forward_diamond(X4,X5) = domain(multiplication(X4,domain(X5))),
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',forward_diamond) ).
fof(domain4,axiom,
! [X4] : domain(X4) = antidomain(antidomain(X4)),
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',domain4) ).
fof(domain_difference,axiom,
! [X4,X5] : domain_difference(X4,X5) = multiplication(domain(X4),antidomain(X5)),
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',domain_difference) ).
fof(additive_identity,axiom,
! [X1] : addition(X1,zero) = X1,
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',additive_identity) ).
fof(right_annihilation,axiom,
! [X1] : multiplication(X1,zero) = zero,
file('/export/starexec/sandbox/tmp/tmp.4EviH2QL2V/E---3.1_32467.p',right_annihilation) ).
fof(c_0_10,plain,
! [X33] : addition(antidomain(antidomain(X33)),antidomain(X33)) = one,
inference(variable_rename,[status(thm)],[domain3]) ).
fof(c_0_11,plain,
! [X8,X9] : addition(X8,X9) = addition(X9,X8),
inference(variable_rename,[status(thm)],[additive_commutativity]) ).
fof(c_0_12,plain,
! [X18] : multiplication(X18,one) = X18,
inference(variable_rename,[status(thm)],[multiplicative_right_identity]) ).
fof(c_0_13,plain,
! [X30] : multiplication(antidomain(X30),X30) = zero,
inference(variable_rename,[status(thm)],[domain1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X4] :
( ( ! [X5] : addition(domain(X5),forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))) = forward_diamond(star(X4),domain_difference(domain(X5),forward_diamond(X4,domain(X5))))
& ! [X6] : forward_diamond(X4,forward_diamond(X4,domain(X6))) = forward_diamond(X4,domain(X6)) )
=> ! [X7] : addition(forward_diamond(X4,domain(X7)),forward_diamond(star(X4),domain_difference(domain(X7),forward_diamond(X4,domain(X7))))) = forward_diamond(star(X4),domain_difference(domain(X7),forward_diamond(X4,domain(X7)))) ),
inference(assume_negation,[status(cth)],[goals]) ).
fof(c_0_15,plain,
! [X43,X44] : forward_diamond(X43,X44) = domain(multiplication(X43,domain(X44))),
inference(variable_rename,[status(thm)],[forward_diamond]) ).
fof(c_0_16,plain,
! [X34] : domain(X34) = antidomain(antidomain(X34)),
inference(variable_rename,[status(thm)],[domain4]) ).
fof(c_0_17,plain,
! [X41,X42] : domain_difference(X41,X42) = multiplication(domain(X41),antidomain(X42)),
inference(variable_rename,[status(thm)],[domain_difference]) ).
cnf(c_0_18,plain,
addition(antidomain(antidomain(X1)),antidomain(X1)) = one,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
addition(X1,X2) = addition(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
multiplication(X1,one) = X1,
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,plain,
multiplication(antidomain(X1),X1) = zero,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X13] : addition(X13,zero) = X13,
inference(variable_rename,[status(thm)],[additive_identity]) ).
fof(c_0_23,negated_conjecture,
! [X56,X57] :
( addition(domain(X56),forward_diamond(star(esk1_0),domain_difference(domain(X56),forward_diamond(esk1_0,domain(X56))))) = forward_diamond(star(esk1_0),domain_difference(domain(X56),forward_diamond(esk1_0,domain(X56))))
& forward_diamond(esk1_0,forward_diamond(esk1_0,domain(X57))) = forward_diamond(esk1_0,domain(X57))
& addition(forward_diamond(esk1_0,domain(esk2_0)),forward_diamond(star(esk1_0),domain_difference(domain(esk2_0),forward_diamond(esk1_0,domain(esk2_0))))) != forward_diamond(star(esk1_0),domain_difference(domain(esk2_0),forward_diamond(esk1_0,domain(esk2_0)))) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
cnf(c_0_24,plain,
forward_diamond(X1,X2) = domain(multiplication(X1,domain(X2))),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
domain(X1) = antidomain(antidomain(X1)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,plain,
domain_difference(X1,X2) = multiplication(domain(X1),antidomain(X2)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,plain,
addition(antidomain(X1),antidomain(antidomain(X1))) = one,
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,plain,
antidomain(one) = zero,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,plain,
addition(X1,zero) = X1,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,negated_conjecture,
addition(domain(X1),forward_diamond(star(esk1_0),domain_difference(domain(X1),forward_diamond(esk1_0,domain(X1))))) = forward_diamond(star(esk1_0),domain_difference(domain(X1),forward_diamond(esk1_0,domain(X1)))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
forward_diamond(X1,X2) = antidomain(antidomain(multiplication(X1,antidomain(antidomain(X2))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]) ).
cnf(c_0_32,plain,
domain_difference(X1,X2) = multiplication(antidomain(antidomain(X1)),antidomain(X2)),
inference(rw,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
forward_diamond(esk1_0,forward_diamond(esk1_0,domain(X1))) = forward_diamond(esk1_0,domain(X1)),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
addition(zero,antidomain(zero)) = one,
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
addition(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_36,plain,
! [X26] : multiplication(X26,zero) = zero,
inference(variable_rename,[status(thm)],[right_annihilation]) ).
cnf(c_0_37,negated_conjecture,
addition(forward_diamond(esk1_0,domain(esk2_0)),forward_diamond(star(esk1_0),domain_difference(domain(esk2_0),forward_diamond(esk1_0,domain(esk2_0))))) != forward_diamond(star(esk1_0),domain_difference(domain(esk2_0),forward_diamond(esk1_0,domain(esk2_0)))),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_38,negated_conjecture,
addition(antidomain(antidomain(X1)),antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))))))))))) = antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(X1)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_32]),c_0_32]) ).
cnf(c_0_39,negated_conjecture,
antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1)))))))))))) = antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_25]),c_0_25]),c_0_31]),c_0_31]),c_0_31]) ).
cnf(c_0_40,plain,
antidomain(zero) = one,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,plain,
multiplication(X1,zero) = zero,
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
addition(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))),antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(esk2_0)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0))))))))))))))) != antidomain(antidomain(multiplication(star(esk1_0),antidomain(antidomain(multiplication(antidomain(antidomain(antidomain(antidomain(esk2_0)))),antidomain(antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(esk2_0)))))))))))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_25]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_31]),c_0_32]),c_0_32]) ).
cnf(c_0_43,negated_conjecture,
antidomain(antidomain(multiplication(esk1_0,antidomain(antidomain(antidomain(antidomain(X1))))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_39]),c_0_21]),c_0_40]),c_0_28]),c_0_41]),c_0_40]),c_0_28]),c_0_29]),c_0_39]),c_0_21]),c_0_40]),c_0_28]),c_0_41]),c_0_40]),c_0_28]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_43]),c_0_40]),c_0_20]),c_0_35]),c_0_43]),c_0_40]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KLE133+1 : TPTP v8.1.2. Released v4.0.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n031.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 : 2400
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Oct 3 05:16:59 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.47 Running first-order model finding
% 0.19/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/tmp/tmp.4EviH2QL2V/E---3.1_32467.p
% 0.19/0.50 # Version: 3.1pre001
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 # Starting sh5l with 300s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32595 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFMF21-DFFFFFNN
% 0.19/0.50 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 136s (1) cores
% 0.19/0.50 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 136s (1) cores
% 0.19/0.50 # Starting G-E--_200_C18_F1_AE_CS_SP_PI_S0Y with 136s (1) cores
% 0.19/0.50 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 32606 completed with status 0
% 0.19/0.50 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.19/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.19/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.19/0.50 # No SInE strategy applied
% 0.19/0.50 # Search class: FHUSM-FFMF21-DFFFFFNN
% 0.19/0.50 # partial match(1): FHUSM-FFMF21-MFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 # Starting G-E--_100_C18_F1_PI_AE_Q4_CS_SP_PS_S0Y with 797s (1) cores
% 0.19/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.19/0.50 # Preprocessing time : 0.002 s
% 0.19/0.50 # Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 # Proof found!
% 0.19/0.50 # SZS status Theorem
% 0.19/0.50 # SZS output start CNFRefutation
% See solution above
% 0.19/0.50 # Parsed axioms : 29
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 32
% 0.19/0.50 # Removed in clause preprocessing : 8
% 0.19/0.50 # Initial clauses in saturation : 24
% 0.19/0.50 # Processed clauses : 57
% 0.19/0.50 # ...of these trivial : 2
% 0.19/0.50 # ...subsumed : 0
% 0.19/0.50 # ...remaining for further processing : 55
% 0.19/0.50 # Other redundant clauses eliminated : 0
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 3
% 0.19/0.50 # Generated clauses : 161
% 0.19/0.50 # ...of the previous two non-redundant : 87
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 161
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 0
% 0.19/0.50 # Total rewrite steps : 444
% 0.19/0.50 # Propositional unsat checks : 0
% 0.19/0.50 # Propositional check models : 0
% 0.19/0.50 # Propositional check unsatisfiable : 0
% 0.19/0.50 # Propositional clauses : 0
% 0.19/0.50 # Propositional clauses after purity: 0
% 0.19/0.50 # Propositional unsat core size : 0
% 0.19/0.50 # Propositional preprocessing time : 0.000
% 0.19/0.50 # Propositional encoding time : 0.000
% 0.19/0.50 # Propositional solver time : 0.000
% 0.19/0.50 # Success case prop preproc time : 0.000
% 0.19/0.50 # Success case prop encoding time : 0.000
% 0.19/0.50 # Success case prop solver time : 0.000
% 0.19/0.50 # Current number of processed clauses : 28
% 0.19/0.50 # Positive orientable unit clauses : 25
% 0.19/0.50 # Positive unorientable unit clauses: 1
% 0.19/0.50 # Negative unit clauses : 0
% 0.19/0.50 # Non-unit-clauses : 2
% 0.19/0.50 # Current number of unprocessed clauses: 78
% 0.19/0.50 # ...number of literals in the above : 79
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 35
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.19/0.50 # Non-unit clause-clause subsumptions : 0
% 0.19/0.50 # Unit Clause-clause subsumption calls : 1
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 37
% 0.19/0.50 # BW rewrite match successes : 20
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 5001
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.007 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.012 s
% 0.19/0.50 # Maximum resident set size: 1848 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.027 s
% 0.19/0.50 # System time : 0.017 s
% 0.19/0.50 # Total time : 0.044 s
% 0.19/0.50 # Maximum resident set size: 1704 pages
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------