TSTP Solution File: SWW353+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SWW353+1 : TPTP v8.1.2. Released v5.2.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 : 300s
% WCLimit : 300s
% DateTime : Sat May 4 10:03:18 EDT 2024
% Result : Theorem 15.60s 3.98s
% Output : CNFRefutation 15.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 9
% Syntax : Number of formulae : 40 ( 30 unt; 0 def)
% Number of atoms : 52 ( 29 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 30 ( 18 ~; 8 |; 1 &)
% ( 2 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 22 ( 22 usr; 10 con; 0-3 aty)
% Number of variables : 77 ( 8 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_singleton__conv2,axiom,
! [X6,X5] : hAPP(c_Set_OCollect(X5),hAPP(c_fequal,X6)) = hAPP(hAPP(c_Set_Oinsert(X5),X6),c_Orderings_Obot__class_Obot(tc_fun(X5,tc_HOL_Obool))),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',fact_singleton__conv2) ).
fof(fact_Collect__def,axiom,
! [X18,X5] : hAPP(c_Set_OCollect(X5),X18) = X18,
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',fact_Collect__def) ).
fof(fact_Collect__mem__eq,axiom,
! [X13,X5] : hAPP(c_Set_OCollect(X5),hAPP(hAPP(c_COMBC(X5,tc_fun(X5,tc_HOL_Obool),tc_HOL_Obool),c_member(X5)),X13)) = X13,
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',fact_Collect__mem__eq) ).
fof(conj_3,conjecture,
c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,v_pname))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',conj_3) ).
fof(conj_1,hypothesis,
! [X3] :
( hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X3),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody)))
=> c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,X3))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',conj_1) ).
fof(help_c__COMBC__1,axiom,
! [X37,X17,X18,X5,X81,X10] : hAPP(hAPP(hAPP(c_COMBC(X10,X81,X5),X18),X17),X37) = hAPP(hAPP(X18,X37),X17),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',help_c__COMBC__1) ).
fof(fact_domIff,axiom,
! [X96,X10,X6,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X6),c_Map_Odom(X5,X10,X96)))
<=> hAPP(X96,X6) != c_Option_Ooption_ONone(X10) ),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',fact_domIff) ).
fof(fact_option_Osimps_I2_J,axiom,
! [X86,X5] : c_Option_Ooption_ONone(X5) != hAPP(c_Option_Ooption_OSome(X5),X86),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',fact_option_Osimps_I2_J) ).
fof(conj_2,hypothesis,
hAPP(c_Com_Obody,v_pname) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),v_y),
file('/export/starexec/sandbox/tmp/tmp.6si2GqbKQ1/E---3.1_15012.p',conj_2) ).
fof(c_0_9,plain,
! [X920,X921] : hAPP(c_Set_OCollect(X921),hAPP(c_fequal,X920)) = hAPP(hAPP(c_Set_Oinsert(X921),X920),c_Orderings_Obot__class_Obot(tc_fun(X921,tc_HOL_Obool))),
inference(variable_rename,[status(thm)],[fact_singleton__conv2]) ).
fof(c_0_10,plain,
! [X3268,X3269] : hAPP(c_Set_OCollect(X3269),X3268) = X3268,
inference(variable_rename,[status(thm)],[fact_Collect__def]) ).
fof(c_0_11,plain,
! [X3291,X3292] : hAPP(c_Set_OCollect(X3292),hAPP(hAPP(c_COMBC(X3292,tc_fun(X3292,tc_HOL_Obool),tc_HOL_Obool),c_member(X3292)),X3291)) = X3291,
inference(variable_rename,[status(thm)],[fact_Collect__mem__eq]) ).
fof(c_0_12,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,v_pname))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_3])]) ).
fof(c_0_13,hypothesis,
! [X325] :
( ~ hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X325),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody)))
| c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,X325))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])]) ).
cnf(c_0_14,plain,
hAPP(c_Set_OCollect(X1),hAPP(c_fequal,X2)) = hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
hAPP(c_Set_OCollect(X1),X2) = X2,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_16,plain,
! [X1113,X1114,X1115,X1116,X1117,X1118] : hAPP(hAPP(hAPP(c_COMBC(X1118,X1117,X1116),X1115),X1114),X1113) = hAPP(hAPP(X1115,X1113),X1114),
inference(variable_rename,[status(thm)],[help_c__COMBC__1]) ).
cnf(c_0_17,plain,
hAPP(c_Set_OCollect(X1),hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_18,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,v_pname))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))),
inference(fof_nnf,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,X1))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool))))
| ~ hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X1),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody))) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
hAPP(hAPP(c_Set_Oinsert(X1),X2),c_Orderings_Obot__class_Obot(tc_fun(X1,tc_HOL_Obool))) = hAPP(c_fequal,X2),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_21,plain,
hAPP(hAPP(hAPP(c_COMBC(X1,X2,X3),X4),X5),X6) = hAPP(hAPP(X4,X6),X5),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
hAPP(hAPP(c_COMBC(X1,tc_fun(X1,tc_HOL_Obool),tc_HOL_Obool),c_member(X1)),X2) = X2,
inference(rw,[status(thm)],[c_0_17,c_0_15]) ).
fof(c_0_23,plain,
! [X96,X10,X6,X5] :
( hBOOL(hAPP(hAPP(c_member(X5),X6),c_Map_Odom(X5,X10,X96)))
<=> hAPP(X96,X6) != c_Option_Ooption_ONone(X10) ),
inference(fof_simplification,[status(thm)],[fact_domIff]) ).
cnf(c_0_24,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(hAPP(c_Set_Oinsert(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate)),c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,v_pname))),c_Orderings_Obot__class_Obot(tc_fun(tc_Hoare__Mirabelle_Otriple(tc_Com_Ostate),tc_HOL_Obool)))),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_25,hypothesis,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(c_fequal,c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,X1))))
| ~ hBOOL(hAPP(hAPP(c_member(tc_Com_Opname),X1),c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody))) ),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_26,plain,
hAPP(hAPP(c_member(X1),X2),X3) = hAPP(X3,X2),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
fof(c_0_27,plain,
! [X718,X719,X720,X721] :
( ( ~ hBOOL(hAPP(hAPP(c_member(X721),X720),c_Map_Odom(X721,X719,X718)))
| hAPP(X718,X720) != c_Option_Ooption_ONone(X719) )
& ( hAPP(X718,X720) = c_Option_Ooption_ONone(X719)
| hBOOL(hAPP(hAPP(c_member(X721),X720),c_Map_Odom(X721,X719,X718))) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
fof(c_0_28,plain,
! [X86,X5] : c_Option_Ooption_ONone(X5) != hAPP(c_Option_Ooption_OSome(X5),X86),
inference(fof_simplification,[status(thm)],[fact_option_Osimps_I2_J]) ).
cnf(c_0_29,negated_conjecture,
~ c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(c_fequal,c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,v_pname)))),
inference(rw,[status(thm)],[c_0_24,c_0_20]) ).
cnf(c_0_30,hypothesis,
( c_Hoare__Mirabelle_Ohoare__derivs(tc_Com_Ostate,v_G,hAPP(c_fequal,c_Hoare__Mirabelle_OMGT(hAPP(c_Com_Ocom_OBODY,X1))))
| ~ hBOOL(hAPP(c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody),X1)) ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( hAPP(X1,X2) = c_Option_Ooption_ONone(X3)
| hBOOL(hAPP(hAPP(c_member(X4),X2),c_Map_Odom(X4,X3,X1))) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_32,plain,
! [X902,X903] : c_Option_Ooption_ONone(X903) != hAPP(c_Option_Ooption_OSome(X903),X902),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_28])]) ).
cnf(c_0_33,negated_conjecture,
~ hBOOL(hAPP(c_Map_Odom(tc_Com_Opname,tc_Com_Ocom,c_Com_Obody),v_pname)),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,plain,
( hAPP(X1,X2) = c_Option_Ooption_ONone(X3)
| hBOOL(hAPP(c_Map_Odom(X4,X3,X1),X2)) ),
inference(rw,[status(thm)],[c_0_31,c_0_26]) ).
cnf(c_0_35,plain,
c_Option_Ooption_ONone(X1) != hAPP(c_Option_Ooption_OSome(X1),X2),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_36,negated_conjecture,
c_Option_Ooption_ONone(tc_Com_Ocom) = hAPP(c_Com_Obody,v_pname),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_37,hypothesis,
hAPP(c_Com_Obody,v_pname) = hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),v_y),
inference(split_conjunct,[status(thm)],[conj_2]) ).
cnf(c_0_38,negated_conjecture,
hAPP(c_Option_Ooption_OSome(tc_Com_Ocom),X1) != hAPP(c_Com_Obody,v_pname),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,hypothesis,
$false,
inference(sr,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWW353+1 : TPTP v8.1.2. Released v5.2.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n031.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Fri May 3 13:44:02 EDT 2024
% 0.14/0.34 % CPUTime :
% 1.38/1.62 Running first-order model finding
% 1.38/1.62 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.6si2GqbKQ1/E---3.1_15012.p
% 15.60/3.98 # Version: 3.1.0
% 15.60/3.98 # Preprocessing class: FMLMSLSMSSSNFFN.
% 15.60/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.60/3.98 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 15.60/3.98 # Starting new_bool_3 with 300s (1) cores
% 15.60/3.98 # Starting new_bool_1 with 300s (1) cores
% 15.60/3.98 # Starting sh5l with 300s (1) cores
% 15.60/3.98 # new_bool_1 with pid 15225 completed with status 0
% 15.60/3.98 # Result found by new_bool_1
% 15.60/3.98 # Preprocessing class: FMLMSLSMSSSNFFN.
% 15.60/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.60/3.98 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 15.60/3.98 # Starting new_bool_3 with 300s (1) cores
% 15.60/3.98 # Starting new_bool_1 with 300s (1) cores
% 15.60/3.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.60/3.98 # Search class: FGHSM-SMLM33-DFFFFFNN
% 15.60/3.98 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.60/3.98 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 15.60/3.98 # SAT001_MinMin_p005000_rr with pid 15323 completed with status 0
% 15.60/3.98 # Result found by SAT001_MinMin_p005000_rr
% 15.60/3.98 # Preprocessing class: FMLMSLSMSSSNFFN.
% 15.60/3.98 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 15.60/3.98 # Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 15.60/3.98 # Starting new_bool_3 with 300s (1) cores
% 15.60/3.98 # Starting new_bool_1 with 300s (1) cores
% 15.60/3.98 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 15.60/3.98 # Search class: FGHSM-SMLM33-DFFFFFNN
% 15.60/3.98 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 15.60/3.98 # Starting SAT001_MinMin_p005000_rr with 163s (1) cores
% 15.60/3.98 # Preprocessing time : 0.071 s
% 15.60/3.98 # Presaturation interreduction done
% 15.60/3.98
% 15.60/3.98 # Proof found!
% 15.60/3.98 # SZS status Theorem
% 15.60/3.98 # SZS output start CNFRefutation
% See solution above
% 15.60/3.99 # Parsed axioms : 5245
% 15.60/3.99 # Removed by relevancy pruning/SinE : 3175
% 15.60/3.99 # Initial clauses : 3032
% 15.60/3.99 # Removed in clause preprocessing : 89
% 15.60/3.99 # Initial clauses in saturation : 2943
% 15.60/3.99 # Processed clauses : 11063
% 15.60/3.99 # ...of these trivial : 571
% 15.60/3.99 # ...subsumed : 4752
% 15.60/3.99 # ...remaining for further processing : 5740
% 15.60/3.99 # Other redundant clauses eliminated : 630
% 15.60/3.99 # Clauses deleted for lack of memory : 0
% 15.60/3.99 # Backward-subsumed : 76
% 15.60/3.99 # Backward-rewritten : 360
% 15.60/3.99 # Generated clauses : 81218
% 15.60/3.99 # ...of the previous two non-redundant : 75322
% 15.60/3.99 # ...aggressively subsumed : 0
% 15.60/3.99 # Contextual simplify-reflections : 22
% 15.60/3.99 # Paramodulations : 80574
% 15.60/3.99 # Factorizations : 2
% 15.60/3.99 # NegExts : 0
% 15.60/3.99 # Equation resolutions : 674
% 15.60/3.99 # Disequality decompositions : 0
% 15.60/3.99 # Total rewrite steps : 26598
% 15.60/3.99 # ...of those cached : 20657
% 15.60/3.99 # Propositional unsat checks : 1
% 15.60/3.99 # Propositional check models : 0
% 15.60/3.99 # Propositional check unsatisfiable : 0
% 15.60/3.99 # Propositional clauses : 0
% 15.60/3.99 # Propositional clauses after purity: 0
% 15.60/3.99 # Propositional unsat core size : 0
% 15.60/3.99 # Propositional preprocessing time : 0.000
% 15.60/3.99 # Propositional encoding time : 0.112
% 15.60/3.99 # Propositional solver time : 0.050
% 15.60/3.99 # Success case prop preproc time : 0.000
% 15.60/3.99 # Success case prop encoding time : 0.000
% 15.60/3.99 # Success case prop solver time : 0.000
% 15.60/3.99 # Current number of processed clauses : 2892
% 15.60/3.99 # Positive orientable unit clauses : 732
% 15.60/3.99 # Positive unorientable unit clauses: 60
% 15.60/3.99 # Negative unit clauses : 590
% 15.60/3.99 # Non-unit-clauses : 1510
% 15.60/3.99 # Current number of unprocessed clauses: 62414
% 15.60/3.99 # ...number of literals in the above : 126454
% 15.60/3.99 # Current number of archived formulas : 0
% 15.60/3.99 # Current number of archived clauses : 2615
% 15.60/3.99 # Clause-clause subsumption calls (NU) : 997544
% 15.60/3.99 # Rec. Clause-clause subsumption calls : 531016
% 15.60/3.99 # Non-unit clause-clause subsumptions : 2144
% 15.60/3.99 # Unit Clause-clause subsumption calls : 67021
% 15.60/3.99 # Rewrite failures with RHS unbound : 167
% 15.60/3.99 # BW rewrite match attempts : 14794
% 15.60/3.99 # BW rewrite match successes : 762
% 15.60/3.99 # Condensation attempts : 0
% 15.60/3.99 # Condensation successes : 0
% 15.60/3.99 # Termbank termtop insertions : 2721230
% 15.60/3.99 # Search garbage collected termcells : 69066
% 15.60/3.99
% 15.60/3.99 # -------------------------------------------------
% 15.60/3.99 # User time : 2.063 s
% 15.60/3.99 # System time : 0.086 s
% 15.60/3.99 # Total time : 2.148 s
% 15.60/3.99 # Maximum resident set size: 18452 pages
% 15.60/3.99
% 15.60/3.99 # -------------------------------------------------
% 15.60/3.99 # User time : 2.190 s
% 15.60/3.99 # System time : 0.093 s
% 15.60/3.99 # Total time : 2.283 s
% 15.60/3.99 # Maximum resident set size: 9576 pages
% 15.60/3.99 % E---3.1 exiting
%------------------------------------------------------------------------------