TSTP Solution File: SET711+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n007.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 19:23:26 EDT 2023
% Result : Theorem 0.17s 0.47s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 38 ( 14 unt; 0 def)
% Number of atoms : 159 ( 11 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 178 ( 57 ~; 72 |; 37 &)
% ( 5 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-4 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-4 aty)
% Number of variables : 112 ( 0 sgn; 65 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII03a,conjecture,
! [X6,X10,X9,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& inverse_predicate(X9,X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p',thII03a) ).
fof(one_to_one,axiom,
! [X6,X1,X2] :
( one_to_one(X6,X1,X2)
<=> ( injective(X6,X1,X2)
& surjective(X6,X1,X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p',one_to_one) ).
fof(inverse_predicate,axiom,
! [X10,X6,X1,X2] :
( inverse_predicate(X10,X6,X1,X2)
<=> ! [X3,X5] :
( ( member(X3,X1)
& member(X5,X2) )
=> ( apply(X6,X3,X5)
<=> apply(X10,X5,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p',inverse_predicate) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X10,X3,X8) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p',equal_maps) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X13,X1)
& member(X14,X1)
& member(X5,X2) )
=> ( ( apply(X6,X13,X5)
& apply(X6,X14,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p',injective) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X9,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2)
& inverse_predicate(X10,X6,X1,X2)
& inverse_predicate(X9,X6,X1,X2) )
=> equal_maps(X10,X9,X2,X1) ),
inference(assume_negation,[status(cth)],[thII03a]) ).
fof(c_0_6,plain,
! [X48,X49,X50] :
( ( injective(X48,X49,X50)
| ~ one_to_one(X48,X49,X50) )
& ( surjective(X48,X49,X50)
| ~ one_to_one(X48,X49,X50) )
& ( ~ injective(X48,X49,X50)
| ~ surjective(X48,X49,X50)
| one_to_one(X48,X49,X50) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_to_one])])]) ).
fof(c_0_7,negated_conjecture,
( maps(esk1_0,esk4_0,esk5_0)
& one_to_one(esk1_0,esk4_0,esk5_0)
& inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0)
& inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0)
& ~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X36,X37,X38,X39,X40,X41,X42,X43,X44,X45] :
( ( ~ apply(X37,X40,X41)
| apply(X36,X41,X40)
| ~ member(X40,X38)
| ~ member(X41,X39)
| ~ inverse_predicate(X36,X37,X38,X39) )
& ( ~ apply(X36,X41,X40)
| apply(X37,X40,X41)
| ~ member(X40,X38)
| ~ member(X41,X39)
| ~ inverse_predicate(X36,X37,X38,X39) )
& ( member(esk9_4(X42,X43,X44,X45),X44)
| inverse_predicate(X42,X43,X44,X45) )
& ( member(esk10_4(X42,X43,X44,X45),X45)
| inverse_predicate(X42,X43,X44,X45) )
& ( ~ apply(X43,esk9_4(X42,X43,X44,X45),esk10_4(X42,X43,X44,X45))
| ~ apply(X42,esk10_4(X42,X43,X44,X45),esk9_4(X42,X43,X44,X45))
| inverse_predicate(X42,X43,X44,X45) )
& ( apply(X43,esk9_4(X42,X43,X44,X45),esk10_4(X42,X43,X44,X45))
| apply(X42,esk10_4(X42,X43,X44,X45),esk9_4(X42,X43,X44,X45))
| inverse_predicate(X42,X43,X44,X45) ) ),
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)],[inverse_predicate])])])])])]) ).
fof(c_0_9,plain,
! [X22,X23,X24,X25,X26,X27,X28,X29,X30,X31,X32] :
( ( ~ equal_maps(X22,X23,X24,X25)
| ~ member(X26,X24)
| ~ member(X27,X25)
| ~ member(X28,X25)
| ~ apply(X22,X26,X27)
| ~ apply(X23,X26,X28)
| X27 = X28 )
& ( member(esk6_4(X29,X30,X31,X32),X31)
| equal_maps(X29,X30,X31,X32) )
& ( member(esk7_4(X29,X30,X31,X32),X32)
| equal_maps(X29,X30,X31,X32) )
& ( member(esk8_4(X29,X30,X31,X32),X32)
| equal_maps(X29,X30,X31,X32) )
& ( apply(X29,esk6_4(X29,X30,X31,X32),esk7_4(X29,X30,X31,X32))
| equal_maps(X29,X30,X31,X32) )
& ( apply(X30,esk6_4(X29,X30,X31,X32),esk8_4(X29,X30,X31,X32))
| equal_maps(X29,X30,X31,X32) )
& ( esk7_4(X29,X30,X31,X32) != esk8_4(X29,X30,X31,X32)
| equal_maps(X29,X30,X31,X32) ) ),
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)],[equal_maps])])])])])]) ).
fof(c_0_10,plain,
! [X77,X78,X79,X80,X81,X82,X83,X84,X85] :
( ( ~ injective(X77,X78,X79)
| ~ member(X80,X78)
| ~ member(X81,X78)
| ~ member(X82,X79)
| ~ apply(X77,X80,X82)
| ~ apply(X77,X81,X82)
| X80 = X81 )
& ( member(esk18_3(X83,X84,X85),X84)
| injective(X83,X84,X85) )
& ( member(esk19_3(X83,X84,X85),X84)
| injective(X83,X84,X85) )
& ( member(esk20_3(X83,X84,X85),X85)
| injective(X83,X84,X85) )
& ( apply(X83,esk18_3(X83,X84,X85),esk20_3(X83,X84,X85))
| injective(X83,X84,X85) )
& ( apply(X83,esk19_3(X83,X84,X85),esk20_3(X83,X84,X85))
| injective(X83,X84,X85) )
& ( esk18_3(X83,X84,X85) != esk19_3(X83,X84,X85)
| injective(X83,X84,X85) ) ),
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)],[injective])])])])])]) ).
cnf(c_0_11,plain,
( injective(X1,X2,X3)
| ~ one_to_one(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
one_to_one(esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( apply(X4,X3,X2)
| ~ apply(X1,X2,X3)
| ~ member(X3,X5)
| ~ member(X2,X6)
| ~ inverse_predicate(X1,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,negated_conjecture,
inverse_predicate(esk3_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_15,negated_conjecture,
~ equal_maps(esk2_0,esk3_0,esk5_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,plain,
( apply(X1,esk6_4(X2,X1,X3,X4),esk8_4(X2,X1,X3,X4))
| equal_maps(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_17,plain,
( member(esk8_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,plain,
( member(esk6_4(X1,X2,X3,X4),X3)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,plain,
( X4 = X5
| ~ injective(X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X6,X3)
| ~ apply(X1,X4,X6)
| ~ apply(X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
injective(esk1_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( apply(esk1_0,X1,X2)
| ~ apply(esk3_0,X2,X1)
| ~ member(X1,esk4_0)
| ~ member(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
apply(esk3_0,esk6_4(esk2_0,esk3_0,esk5_0,esk4_0),esk8_4(esk2_0,esk3_0,esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,negated_conjecture,
member(esk8_4(esk2_0,esk3_0,esk5_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
member(esk6_4(esk2_0,esk3_0,esk5_0,esk4_0),esk5_0),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_25,negated_conjecture,
inverse_predicate(esk2_0,esk1_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,plain,
( apply(X1,esk6_4(X1,X2,X3,X4),esk7_4(X1,X2,X3,X4))
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( member(esk7_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_28,negated_conjecture,
( X1 = X2
| ~ apply(esk1_0,X2,X3)
| ~ apply(esk1_0,X1,X3)
| ~ member(X3,esk5_0)
| ~ member(X2,esk4_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_29,negated_conjecture,
apply(esk1_0,esk8_4(esk2_0,esk3_0,esk5_0,esk4_0),esk6_4(esk2_0,esk3_0,esk5_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24])]) ).
cnf(c_0_30,negated_conjecture,
( apply(esk1_0,X1,X2)
| ~ apply(esk2_0,X2,X1)
| ~ member(X1,esk4_0)
| ~ member(X2,esk5_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
apply(esk2_0,esk6_4(esk2_0,esk3_0,esk5_0,esk4_0),esk7_4(esk2_0,esk3_0,esk5_0,esk4_0)),
inference(spm,[status(thm)],[c_0_15,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
member(esk7_4(esk2_0,esk3_0,esk5_0,esk4_0),esk4_0),
inference(spm,[status(thm)],[c_0_15,c_0_27]) ).
cnf(c_0_33,plain,
( equal_maps(X1,X2,X3,X4)
| esk7_4(X1,X2,X3,X4) != esk8_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_34,negated_conjecture,
( X1 = esk8_4(esk2_0,esk3_0,esk5_0,esk4_0)
| ~ apply(esk1_0,X1,esk6_4(esk2_0,esk3_0,esk5_0,esk4_0))
| ~ member(X1,esk4_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_24]),c_0_23])]) ).
cnf(c_0_35,negated_conjecture,
apply(esk1_0,esk7_4(esk2_0,esk3_0,esk5_0,esk4_0),esk6_4(esk2_0,esk3_0,esk5_0,esk4_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_24])]) ).
cnf(c_0_36,negated_conjecture,
esk8_4(esk2_0,esk3_0,esk5_0,esk4_0) != esk7_4(esk2_0,esk3_0,esk5_0,esk4_0),
inference(spm,[status(thm)],[c_0_15,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_32])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : SET711+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n007.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 2400
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Oct 2 17:04:39 EDT 2023
% 0.13/0.33 % CPUTime :
% 0.17/0.45 Running first-order model finding
% 0.17/0.45 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.duVHaLtTdk/E---3.1_27700.p
% 0.17/0.47 # Version: 3.1pre001
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.47 # Starting sh5l with 300s (1) cores
% 0.17/0.47 # new_bool_3 with pid 27778 completed with status 0
% 0.17/0.47 # Result found by new_bool_3
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.17/0.47 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.17/0.47 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 27782 completed with status 0
% 0.17/0.47 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.17/0.47 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.17/0.47 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.47 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.17/0.47 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.47 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.47 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.17/0.47 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.17/0.47 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.47 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.17/0.47 # Preprocessing time : 0.003 s
% 0.17/0.47 # Presaturation interreduction done
% 0.17/0.47
% 0.17/0.47 # Proof found!
% 0.17/0.47 # SZS status Theorem
% 0.17/0.47 # SZS output start CNFRefutation
% See solution above
% 0.17/0.47 # Parsed axioms : 29
% 0.17/0.47 # Removed by relevancy pruning/SinE : 22
% 0.17/0.47 # Initial clauses : 47
% 0.17/0.47 # Removed in clause preprocessing : 0
% 0.17/0.47 # Initial clauses in saturation : 47
% 0.17/0.47 # Processed clauses : 124
% 0.17/0.47 # ...of these trivial : 0
% 0.17/0.47 # ...subsumed : 0
% 0.17/0.47 # ...remaining for further processing : 124
% 0.17/0.47 # Other redundant clauses eliminated : 0
% 0.17/0.47 # Clauses deleted for lack of memory : 0
% 0.17/0.47 # Backward-subsumed : 0
% 0.17/0.47 # Backward-rewritten : 2
% 0.17/0.47 # Generated clauses : 114
% 0.17/0.47 # ...of the previous two non-redundant : 101
% 0.17/0.47 # ...aggressively subsumed : 0
% 0.17/0.47 # Contextual simplify-reflections : 0
% 0.17/0.47 # Paramodulations : 114
% 0.17/0.47 # Factorizations : 0
% 0.17/0.47 # NegExts : 0
% 0.17/0.47 # Equation resolutions : 0
% 0.17/0.47 # Total rewrite steps : 42
% 0.17/0.47 # Propositional unsat checks : 0
% 0.17/0.47 # Propositional check models : 0
% 0.17/0.47 # Propositional check unsatisfiable : 0
% 0.17/0.47 # Propositional clauses : 0
% 0.17/0.47 # Propositional clauses after purity: 0
% 0.17/0.47 # Propositional unsat core size : 0
% 0.17/0.47 # Propositional preprocessing time : 0.000
% 0.17/0.47 # Propositional encoding time : 0.000
% 0.17/0.47 # Propositional solver time : 0.000
% 0.17/0.47 # Success case prop preproc time : 0.000
% 0.17/0.47 # Success case prop encoding time : 0.000
% 0.17/0.47 # Success case prop solver time : 0.000
% 0.17/0.47 # Current number of processed clauses : 75
% 0.17/0.47 # Positive orientable unit clauses : 15
% 0.17/0.47 # Positive unorientable unit clauses: 0
% 0.17/0.47 # Negative unit clauses : 2
% 0.17/0.47 # Non-unit-clauses : 58
% 0.17/0.47 # Current number of unprocessed clauses: 69
% 0.17/0.47 # ...number of literals in the above : 405
% 0.17/0.47 # Current number of archived formulas : 0
% 0.17/0.47 # Current number of archived clauses : 49
% 0.17/0.47 # Clause-clause subsumption calls (NU) : 1087
% 0.17/0.47 # Rec. Clause-clause subsumption calls : 520
% 0.17/0.47 # Non-unit clause-clause subsumptions : 0
% 0.17/0.47 # Unit Clause-clause subsumption calls : 9
% 0.17/0.47 # Rewrite failures with RHS unbound : 0
% 0.17/0.47 # BW rewrite match attempts : 5
% 0.17/0.47 # BW rewrite match successes : 2
% 0.17/0.47 # Condensation attempts : 0
% 0.17/0.47 # Condensation successes : 0
% 0.17/0.47 # Termbank termtop insertions : 6140
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.010 s
% 0.17/0.47 # System time : 0.005 s
% 0.17/0.47 # Total time : 0.014 s
% 0.17/0.47 # Maximum resident set size: 1908 pages
% 0.17/0.47
% 0.17/0.47 # -------------------------------------------------
% 0.17/0.47 # User time : 0.012 s
% 0.17/0.47 # System time : 0.005 s
% 0.17/0.47 # Total time : 0.017 s
% 0.17/0.47 # Maximum resident set size: 1740 pages
% 0.17/0.47 % E---3.1 exiting
%------------------------------------------------------------------------------