TSTP Solution File: NUN085+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : NUN085+2 : TPTP v8.1.2. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n009.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:09:13 EDT 2023
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 69 ( 41 unt; 0 def)
% Number of atoms : 151 ( 61 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 141 ( 59 ~; 44 |; 38 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 101 ( 6 sgn; 43 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(axiom_1,axiom,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_1) ).
fof(zeroplusoneidzero,conjecture,
! [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r3(X23,X22,X39) )
| ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) ) )
| ! [X17] :
( X39 != X17
| ~ r1(X17) ) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',zeroplusoneidzero) ).
fof(axiom_4a,axiom,
! [X30] :
? [X31] :
( ? [X32] :
( r1(X32)
& r3(X30,X32,X31) )
& X31 = X30 ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_4a) ).
fof(axiom_3,axiom,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_3) ).
fof(axiom_1a,axiom,
! [X14,X15] :
? [X16] :
( ? [X17] :
( ? [X18] :
( r2(X15,X18)
& r3(X14,X18,X17) )
& X17 = X16 )
& ? [X19] :
( r2(X19,X16)
& r3(X14,X15,X19) ) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_1a) ).
fof(axiom_2,axiom,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_2) ).
fof(axiom_7a,axiom,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
file('/export/starexec/sandbox2/tmp/tmp.o6DNASFY5O/E---3.1_30888.p',axiom_7a) ).
fof(c_0_7,plain,
? [X1] :
! [X2] :
( ( ~ r1(X2)
& X2 != X1 )
| ( r1(X2)
& X2 = X1 ) ),
inference(fof_simplification,[status(thm)],[axiom_1]) ).
fof(c_0_8,negated_conjecture,
~ ! [X39] :
( ! [X22] :
( ! [X23] :
( ~ r1(X23)
| ~ r3(X23,X22,X39) )
| ! [X16] :
( ~ r1(X16)
| ~ r2(X16,X22) ) )
| ! [X17] :
( X39 != X17
| ~ r1(X17) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[zeroplusoneidzero])]) ).
fof(c_0_9,plain,
! [X50] :
( ( r1(X50)
| ~ r1(X50) )
& ( X50 = esk6_0
| ~ r1(X50) )
& ( r1(X50)
| X50 != esk6_0 )
& ( X50 = esk6_0
| X50 != esk6_0 ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,negated_conjecture,
( r1(esk3_0)
& r3(esk3_0,esk2_0,esk1_0)
& r1(esk4_0)
& r2(esk4_0,esk2_0)
& esk1_0 = esk5_0
& r1(esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_11,plain,
( X1 = esk6_0
| ~ r1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,negated_conjecture,
r1(esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
esk6_0 = esk4_0,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
( X1 = esk4_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_15,negated_conjecture,
r1(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
esk4_0 = esk3_0,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
r1(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
esk1_0 = esk5_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_19,plain,
( X1 = esk3_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
r1(esk1_0),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_21,plain,
! [X51] :
( r1(esk8_1(X51))
& r3(X51,esk8_1(X51),esk7_1(X51))
& esk7_1(X51) = X51 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_4a])]) ).
cnf(c_0_22,negated_conjecture,
esk3_0 = esk1_0,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_23,plain,
! [X6,X7] :
? [X8] :
! [X9] :
( ( ~ r3(X6,X7,X9)
& X9 != X8 )
| ( r3(X6,X7,X9)
& X9 = X8 ) ),
inference(fof_simplification,[status(thm)],[axiom_3]) ).
cnf(c_0_24,plain,
r3(X1,esk8_1(X1),esk7_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
esk7_1(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( X1 = esk1_0
| ~ r1(X1) ),
inference(rw,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_27,plain,
r1(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_28,plain,
! [X84,X85,X87] :
( ( r3(X84,X85,X87)
| ~ r3(X84,X85,X87) )
& ( X87 = esk24_2(X84,X85)
| ~ r3(X84,X85,X87) )
& ( r3(X84,X85,X87)
| X87 != esk24_2(X84,X85) )
& ( X87 = esk24_2(X84,X85)
| X87 != esk24_2(X84,X85) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])])]) ).
cnf(c_0_29,plain,
r3(X1,esk8_1(X1),X1),
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
esk8_1(X1) = esk1_0,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
fof(c_0_31,plain,
! [X68,X69] :
( r2(X69,esk18_2(X68,X69))
& r3(X68,esk18_2(X68,X69),esk17_2(X68,X69))
& esk17_2(X68,X69) = esk16_2(X68,X69)
& r2(esk19_2(X68,X69),esk16_2(X68,X69))
& r3(X68,X69,esk19_2(X68,X69)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).
fof(c_0_32,plain,
! [X3] :
? [X4] :
! [X5] :
( ( ~ r2(X3,X5)
& X5 != X4 )
| ( r2(X3,X5)
& X5 = X4 ) ),
inference(fof_simplification,[status(thm)],[axiom_2]) ).
cnf(c_0_33,plain,
( X1 = esk24_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,plain,
r3(X1,esk1_0,X1),
inference(rw,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
r3(X1,X2,esk19_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
fof(c_0_36,plain,
! [X65,X67] :
( ( r2(X65,X67)
| ~ r2(X65,X67) )
& ( X67 = esk15_1(X65)
| ~ r2(X65,X67) )
& ( r2(X65,X67)
| X67 != esk15_1(X65) )
& ( X67 = esk15_1(X65)
| X67 != esk15_1(X65) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_32])])]) ).
cnf(c_0_37,plain,
r2(esk19_2(X1,X2),esk16_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,plain,
esk17_2(X1,X2) = esk16_2(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_39,plain,
esk24_2(X1,esk1_0) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,plain,
esk24_2(X1,X2) = esk19_2(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_41,plain,
( X1 = esk15_1(X2)
| ~ r2(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
r2(esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_43,plain,
r2(X1,esk18_2(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_44,plain,
r2(esk19_2(X1,X2),esk17_2(X1,X2)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,plain,
esk19_2(X1,esk1_0) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,negated_conjecture,
esk15_1(esk4_0) = esk2_0,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
fof(c_0_47,plain,
! [X41,X42] :
( ! [X43] :
( ~ r1(X43)
| X43 != X42 )
| ~ r2(X41,X42) ),
inference(fof_simplification,[status(thm)],[axiom_7a]) ).
cnf(c_0_48,plain,
r3(X1,esk18_2(X1,X2),esk17_2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_49,plain,
esk18_2(X1,X2) = esk15_1(X2),
inference(spm,[status(thm)],[c_0_41,c_0_43]) ).
cnf(c_0_50,plain,
r2(X1,esk17_2(X1,esk1_0)),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
esk15_1(esk3_0) = esk2_0,
inference(rw,[status(thm)],[c_0_46,c_0_16]) ).
cnf(c_0_52,negated_conjecture,
r3(esk3_0,esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_53,plain,
! [X62,X63,X64] :
( ~ r1(X64)
| X64 != X63
| ~ r2(X62,X63) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_47])]) ).
cnf(c_0_54,plain,
r3(X1,esk15_1(X2),esk17_2(X1,X2)),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
esk17_2(X1,esk1_0) = esk15_1(X1),
inference(spm,[status(thm)],[c_0_41,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
esk15_1(esk1_0) = esk2_0,
inference(rw,[status(thm)],[c_0_51,c_0_22]) ).
cnf(c_0_57,negated_conjecture,
esk24_2(esk3_0,esk2_0) = esk1_0,
inference(spm,[status(thm)],[c_0_33,c_0_52]) ).
cnf(c_0_58,plain,
( ~ r1(X1)
| X1 != X2
| ~ r2(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
r3(X1,esk2_0,esk15_1(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_60,negated_conjecture,
esk24_2(esk1_0,esk2_0) = esk1_0,
inference(rw,[status(thm)],[c_0_57,c_0_22]) ).
cnf(c_0_61,plain,
( ~ r2(X1,X2)
| ~ r1(X2) ),
inference(er,[status(thm)],[c_0_58]) ).
cnf(c_0_62,negated_conjecture,
r2(esk3_0,esk2_0),
inference(rw,[status(thm)],[c_0_42,c_0_16]) ).
cnf(c_0_63,plain,
( X1 = esk19_2(X2,X3)
| ~ r3(X2,X3,X1) ),
inference(rw,[status(thm)],[c_0_33,c_0_40]) ).
cnf(c_0_64,negated_conjecture,
r3(esk1_0,esk2_0,esk2_0),
inference(spm,[status(thm)],[c_0_59,c_0_56]) ).
cnf(c_0_65,negated_conjecture,
esk19_2(esk1_0,esk2_0) = esk1_0,
inference(rw,[status(thm)],[c_0_60,c_0_40]) ).
cnf(c_0_66,negated_conjecture,
~ r1(esk2_0),
inference(spm,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_67,negated_conjecture,
esk2_0 = esk1_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUN085+2 : TPTP v8.1.2. Released v7.3.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n009.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Oct 2 20:45:44 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/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.o6DNASFY5O/E---3.1_30888.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 # sh5l with pid 30969 completed with status 0
% 0.19/0.50 # Result found by sh5l
% 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.19/0.50 # G-E--_200_B02_F1_SE_CS_SP_PI_S0S with pid 30974 completed with status 0
% 0.19/0.50 # Result found by G-E--_200_B02_F1_SE_CS_SP_PI_S0S
% 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 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.19/0.50 # Search class: FGHSM-FFMM21-SFFFFFNN
% 0.19/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.19/0.50 # Starting G-E--_200_B02_F1_SE_CS_SP_PI_S0S with 163s (1) cores
% 0.19/0.50 # Preprocessing time : 0.001 s
% 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 : 12
% 0.19/0.50 # Removed by relevancy pruning/SinE : 0
% 0.19/0.50 # Initial clauses : 45
% 0.19/0.50 # Removed in clause preprocessing : 8
% 0.19/0.50 # Initial clauses in saturation : 37
% 0.19/0.50 # Processed clauses : 127
% 0.19/0.50 # ...of these trivial : 4
% 0.19/0.50 # ...subsumed : 15
% 0.19/0.50 # ...remaining for further processing : 108
% 0.19/0.50 # Other redundant clauses eliminated : 6
% 0.19/0.50 # Clauses deleted for lack of memory : 0
% 0.19/0.50 # Backward-subsumed : 0
% 0.19/0.50 # Backward-rewritten : 54
% 0.19/0.50 # Generated clauses : 120
% 0.19/0.50 # ...of the previous two non-redundant : 133
% 0.19/0.50 # ...aggressively subsumed : 0
% 0.19/0.50 # Contextual simplify-reflections : 0
% 0.19/0.50 # Paramodulations : 114
% 0.19/0.50 # Factorizations : 0
% 0.19/0.50 # NegExts : 0
% 0.19/0.50 # Equation resolutions : 6
% 0.19/0.50 # Total rewrite steps : 122
% 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 : 48
% 0.19/0.50 # Positive orientable unit clauses : 31
% 0.19/0.50 # Positive unorientable unit clauses: 0
% 0.19/0.50 # Negative unit clauses : 2
% 0.19/0.50 # Non-unit-clauses : 15
% 0.19/0.50 # Current number of unprocessed clauses: 22
% 0.19/0.50 # ...number of literals in the above : 35
% 0.19/0.50 # Current number of archived formulas : 0
% 0.19/0.50 # Current number of archived clauses : 54
% 0.19/0.50 # Clause-clause subsumption calls (NU) : 80
% 0.19/0.50 # Rec. Clause-clause subsumption calls : 50
% 0.19/0.50 # Non-unit clause-clause subsumptions : 6
% 0.19/0.50 # Unit Clause-clause subsumption calls : 54
% 0.19/0.50 # Rewrite failures with RHS unbound : 0
% 0.19/0.50 # BW rewrite match attempts : 43
% 0.19/0.50 # BW rewrite match successes : 25
% 0.19/0.50 # Condensation attempts : 0
% 0.19/0.50 # Condensation successes : 0
% 0.19/0.50 # Termbank termtop insertions : 2334
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.005 s
% 0.19/0.50 # System time : 0.005 s
% 0.19/0.50 # Total time : 0.010 s
% 0.19/0.50 # Maximum resident set size: 1888 pages
% 0.19/0.50
% 0.19/0.50 # -------------------------------------------------
% 0.19/0.50 # User time : 0.006 s
% 0.19/0.50 # System time : 0.006 s
% 0.19/0.50 # Total time : 0.013 s
% 0.19/0.50 # Maximum resident set size: 1720 pages
% 0.19/0.50 % E---3.1 exiting
% 0.19/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------