%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU665^2 : TPTP v9.3.1. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n011.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Sep 30 08:24:56 AM UTC 2026
% Result : Theorem 0.20s 0.26s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU665^2 : TPTP v9.3.1. Released v3.7.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18 % Computer : n011.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Tue Sep 29 14:06:31 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22 Running higher-order theorem proving
% 0.08/0.24 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p
% 0.20/0.26 % Version: 3.5.1-ho
% 0.20/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.26 % Starting new_ho_7 with 300s (1) cores
% 0.20/0.26 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.26 % Starting lpo9_lambda_fix with 300s (1) cores
% 0.20/0.26 % lpo8_lambda_fix with pid 145517 completed with status 0
% 0.20/0.26 % Result found by lpo8_lambda_fix
% 0.20/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.26 % Starting new_ho_7 with 300s (1) cores
% 0.20/0.26 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,5.0,,4,20000,1.0))
% 0.20/0.26 % SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.26 % Search class: HGUSF-FFSS32-SHSFMSBN
% 0.20/0.26 % partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.20/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.26 % SubtermCWHack with pid 145519 completed with status 0
% 0.20/0.26 % Result found by SubtermCWHack
% 0.20/0.26 % Preprocessing class: HSSSSLSSSLMNHSA.
% 0.20/0.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.26 % Starting new_ho_10 with 1500s (5) cores
% 0.20/0.26 % Starting new_ho_7 with 300s (1) cores
% 0.20/0.26 % Starting lpo8_lambda_fix with 300s (1) cores
% 0.20/0.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = GSinE(CountFormulas,,5.0,,4,20000,1.0))
% 0.20/0.26 % SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0)
% 0.20/0.26 % Search class: HGUSF-FFSS32-SHSFMSBN
% 0.20/0.26 % partial match(2): HHUSF-FFSF32-SHSFMSBN
% 0.20/0.26 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.26 % Starting SubtermCWHack with 28s (1) cores
% 0.20/0.26 % Preprocessing time : 0.002 s
% 0.20/0.26
% 0.20/0.26 % Proof found!
% 0.20/0.26 % SZS status Theorem
% 0.20/0.26 % SZS output start CNFRefutation
% 0.20/0.26 thf(decl_23, type, in: $i > $i > $o).
% 0.20/0.26 thf(decl_24, type, dsetconstr: $i > ($i > $o) > $i).
% 0.20/0.26 thf(decl_25, type, dsetconstrI: $o).
% 0.20/0.26 thf(decl_26, type, setext: $o).
% 0.20/0.26 thf(decl_27, type, kpair: $i > $i > $i).
% 0.20/0.26 thf(decl_28, type, cartprod: $i > $i > $i).
% 0.20/0.26 thf(decl_29, type, cartprodpairin: $o).
% 0.20/0.26 thf(decl_30, type, dpsetconstr: $i > $i > ($i > $i > $o) > $i).
% 0.20/0.26 thf(decl_31, type, esk1_2: $i > $i > $i).
% 0.20/0.26 thf(decl_32, type, esk2_2: $i > $i > $i).
% 0.20/0.26 thf(decl_33, type, esk3_0: $i).
% 0.20/0.26 thf(decl_34, type, esk4_0: $i).
% 0.20/0.26 thf(decl_35, type, epred1_0: $i > $i > $o).
% 0.20/0.26 thf(decl_36, type, esk5_0: $i).
% 0.20/0.26 thf(decl_37, type, esk6_0: $i).
% 0.20/0.26 thf(decl_38, type, epred2_3: ($i > $i > $o) > $i > $i > $i > $o).
% 0.20/0.26 thf(decl_39, type, esk7_4: $i > $i > $i > ($i > $i > $o) > $i).
% 0.20/0.26 thf(decl_40, type, esk8_4: $i > $i > $i > ($i > $i > $o) > $i).
% 0.20/0.26 thf(dpsetconstrI, conjecture, ((dsetconstrI)=>((setext)=>((cartprodpairin)=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>((X8 @ X3 @ X4)=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ (^[X9:$i, X7:$i]:((X8 @ X9 @ X7))))))))))))), file('/export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p', dpsetconstrI)).
% 0.20/0.26 thf(dsetconstrI, axiom, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[X4:$i]:((X2 @ X4))))))))), file('/export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p', dsetconstrI)).
% 0.20/0.26 thf(cartprodpairin, axiom, ((cartprodpairin)<=>![X1:$i, X5:$i, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>(in @ (kpair @ X3 @ X4) @ (cartprod @ X1 @ X5))))))), file('/export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p', cartprodpairin)).
% 0.20/0.26 thf(setext, axiom, ((setext)<=>![X1:$i, X5:$i]:((![X3:$i]:(((in @ X3 @ X1)=>(in @ X3 @ X5)))=>(![X3:$i]:(((in @ X3 @ X5)=>(in @ X3 @ X1)))=>((X1)=(X5)))))), file('/export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p', setext)).
% 0.20/0.26 thf(dpsetconstr, axiom, ((dpsetconstr)=(^[X1:$i, X5:$i, X6:$i > $i > $o]:(dsetconstr @ (cartprod @ X1 @ X5) @ (^[X7:$i]:(?[X3:$i]:((((in @ X3 @ X1))&(?[X4:$i]:((((((in @ X4 @ X5))&((X6 @ X3 @ X4))))&(((X7)=(kpair @ X3 @ X4))))))))))))), file('/export/starexec/sandbox/tmp/tmp.nniehxZGV2/E---3.1_145502.p', dpsetconstr)).
% 0.20/0.26 thf(c_0_5, negated_conjecture, ~(((dsetconstrI)=>((setext)=>((cartprodpairin)=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>((X8 @ X3 @ X4)=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ (^[X9:$i, X7:$i]:((X8 @ X9 @ X7)))))))))))))), inference(assume_negation,[status(cth)],[dpsetconstrI])).
% 0.20/0.26 thf(c_0_6, plain, ((dsetconstrI)<=>![X1:$i, X2:$i > $o, X3:$i]:(((in @ X3 @ X1)=>((X2 @ X3)=>(in @ X3 @ (dsetconstr @ X1 @ (^[Z0:$i]:((X2 @ Z0))))))))), inference(fof_simplification,[status(thm)],[dsetconstrI])).
% 0.20/0.26 thf(c_0_7, negated_conjecture, ~((![X26:$i, X27:$i > $o, X28:$i]:(((in @ X28 @ X26)=>((X27 @ X28)=>(in @ X28 @ (dsetconstr @ X26 @ X27)))))=>(![X29:$i, X30:$i]:((![X31:$i]:(((in @ X31 @ X29)=>(in @ X31 @ X30)))=>(![X32:$i]:(((in @ X32 @ X30)=>(in @ X32 @ X29)))=>((X29)=(X30)))))=>(![X33:$i, X34:$i, X35:$i]:(((in @ X35 @ X33)=>![X36:$i]:(((in @ X36 @ X34)=>(in @ (kpair @ X35 @ X36) @ (cartprod @ X33 @ X34))))))=>![X1:$i, X5:$i, X8:$i > $i > $o, X3:$i]:(((in @ X3 @ X1)=>![X4:$i]:(((in @ X4 @ X5)=>((X8 @ X3 @ X4)=>(in @ (kpair @ X3 @ X4) @ (dpsetconstr @ X1 @ X5 @ X8))))))))))), inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_5]), cartprodpairin]), setext]), c_0_6])])).
% 0.20/0.26 thf(c_0_8, plain, ![X37:$i, X38:$i, X39:$i > $i > $o]:(((dpsetconstr @ X37 @ X38 @ X39)=(dsetconstr @ (cartprod @ X37 @ X38) @ (^[Z0:$i]:(?[X3:$i]:((((in @ X3 @ X37))&(?[X4:$i]:((((((in @ X4 @ X38))&(X39 @ X3 @ X4)))&(((Z0)=(kpair @ X3 @ X4))))))))))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[dpsetconstr])])).
% 0.20/0.26 thf(c_0_9, negated_conjecture, ![X40:$i, X41:$i > $o, X42:$i, X43:$i, X44:$i, X47:$i, X48:$i, X49:$i, X50:$i]:(((~(in @ X42 @ X40)|(~(X41 @ X42)|(in @ X42 @ (dsetconstr @ X40 @ X41))))&(((((in @ (esk2_2 @ X43 @ X44) @ X44)|((X43)=(X44))|(in @ (esk1_2 @ X43 @ X44) @ X43))&(~(in @ (esk2_2 @ X43 @ X44) @ X43)|((X43)=(X44))|(in @ (esk1_2 @ X43 @ X44) @ X43)))&(((in @ (esk2_2 @ X43 @ X44) @ X44)|((X43)=(X44))|~(in @ (esk1_2 @ X43 @ X44) @ X44))&(~(in @ (esk2_2 @ X43 @ X44) @ X43)|((X43)=(X44))|~(in @ (esk1_2 @ X43 @ X44) @ X44))))&((~(in @ X49 @ X47)|(~(in @ X50 @ X48)|(in @ (kpair @ X49 @ X50) @ (cartprod @ X47 @ X48))))&((in @ esk5_0 @ esk3_0)&((in @ esk6_0 @ esk4_0)&((epred1_0 @ esk5_0 @ esk6_0)&~(in @ (kpair @ esk5_0 @ esk6_0) @ (dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0))))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])])).
% 0.20/0.26 thf(c_0_10, plain, ![X56:$i, X57:$i, X58:$i > $i > $o]:(((dpsetconstr @ X56 @ X57 @ X58)=(dsetconstr @ (cartprod @ X56 @ X57) @ (^[Z0:$i]:(?[X3:$i]:((((in @ X3 @ X56))&(?[X4:$i]:((((((in @ X4 @ X57))&(X58 @ X3 @ X4)))&(((Z0)=(kpair @ X3 @ X4))))))))))))), inference(variable_rename,[status(thm)],[c_0_8])).
% 0.20/0.26 thf(c_0_11, plain, ![X61:$i, X1:$i, X3:$i, X6:$i > $i > $o]:(((epred2_3 @ X6 @ X3 @ X1 @ X61)<=>?[X59:$i]:(((in @ X59 @ X1)&?[X60:$i]:((((in @ X60 @ X3)&(X6 @ X59 @ X60))&((X61)=(kpair @ X59 @ X60)))))))), introduced(definition)).
% 0.20/0.26 thf(c_0_12, negated_conjecture, ![X3:$i, X2:$i > $o, X1:$i]:(((in @ X1 @ (dsetconstr @ X3 @ X2))|~((in @ X1 @ X3))|~((X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_13, plain, ![X6:$i > $i > $o, X3:$i, X1:$i]:(((dpsetconstr @ X1 @ X3 @ X6)=(dsetconstr @ (cartprod @ X1 @ X3) @ (epred2_3 @ X6 @ X3 @ X1)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_10]), c_0_11])).
% 0.20/0.26 thf(c_0_14, negated_conjecture, ~((in @ (kpair @ esk5_0 @ esk6_0) @ (dpsetconstr @ esk3_0 @ esk4_0 @ epred1_0))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_15, negated_conjecture, ![X6:$i > $i > $o, X4:$i, X3:$i, X1:$i]:(((in @ X1 @ (dpsetconstr @ X3 @ X4 @ X6))|~((in @ X1 @ (cartprod @ X3 @ X4)))|~((epred2_3 @ X6 @ X4 @ X3 @ X1)))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
% 0.20/0.26 thf(c_0_16, plain, ![X62:$i, X63:$i, X64:$i, X65:$i > $i > $o, X68:$i, X69:$i]:(((((in @ (esk7_4 @ X62 @ X63 @ X64 @ X65) @ X63)|~(epred2_3 @ X65 @ X64 @ X63 @ X62))&((((in @ (esk8_4 @ X62 @ X63 @ X64 @ X65) @ X64)|~(epred2_3 @ X65 @ X64 @ X63 @ X62))&((X65 @ (esk7_4 @ X62 @ X63 @ X64 @ X65) @ (esk8_4 @ X62 @ X63 @ X64 @ X65))|~(epred2_3 @ X65 @ X64 @ X63 @ X62)))&(((X62)=(kpair @ (esk7_4 @ X62 @ X63 @ X64 @ X65) @ (esk8_4 @ X62 @ X63 @ X64 @ X65)))|~(epred2_3 @ X65 @ X64 @ X63 @ X62))))&(~(in @ X68 @ X63)|(~(in @ X69 @ X64)|~(X65 @ X68 @ X69)|((X62)!=(kpair @ X68 @ X69)))|(epred2_3 @ X65 @ X64 @ X63 @ X62)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])).
% 0.20/0.26 thf(c_0_17, negated_conjecture, (~((in @ (kpair @ esk5_0 @ esk6_0) @ (cartprod @ esk3_0 @ esk4_0)))|~((epred2_3 @ epred1_0 @ esk4_0 @ esk3_0 @ (kpair @ esk5_0 @ esk6_0)))), inference(spm,[status(thm)],[c_0_14, c_0_15])).
% 0.20/0.26 thf(c_0_18, negated_conjecture, ![X1:$i, X3:$i, X4:$i, X5:$i]:(((in @ (kpair @ X1 @ X4) @ (cartprod @ X3 @ X5))|~((in @ X1 @ X3))|~((in @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_19, negated_conjecture, (in @ esk6_0 @ esk4_0), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_20, negated_conjecture, (in @ esk5_0 @ esk3_0), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_21, plain, ![X3:$i, X1:$i, X6:$i > $i > $o, X7:$i, X5:$i, X4:$i]:(((epred2_3 @ X6 @ X5 @ X3 @ X7)|~((in @ X1 @ X3))|~((in @ X4 @ X5))|~((X6 @ X1 @ X4))|((X7)!=(kpair @ X1 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_16])).
% 0.20/0.26 thf(c_0_22, negated_conjecture, ~((epred2_3 @ epred1_0 @ esk4_0 @ esk3_0 @ (kpair @ esk5_0 @ esk6_0))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17, c_0_18]), c_0_19]), c_0_20])])).
% 0.20/0.26 thf(c_0_23, plain, ![X1:$i, X3:$i, X4:$i, X6:$i > $i > $o, X5:$i]:(((epred2_3 @ X6 @ X1 @ X3 @ (kpair @ X4 @ X5))|~((in @ X5 @ X1))|~((in @ X4 @ X3))|~((X6 @ X4 @ X5)))), inference(er,[status(thm)],[c_0_21])).
% 0.20/0.26 thf(c_0_24, negated_conjecture, (epred1_0 @ esk5_0 @ esk6_0), inference(split_conjunct,[status(thm)],[c_0_9])).
% 0.20/0.26 thf(c_0_25, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_19]), c_0_20]), c_0_24])]), ['proof']).
% 0.20/0.26 % SZS output end CNFRefutation
% 0.20/0.26 % Parsed axioms : 13
% 0.20/0.26 % Removed by relevancy pruning/SinE : 8
% 0.20/0.26 % Initial clauses : 16
% 0.20/0.26 % Removed in clause preprocessing : 0
% 0.20/0.26 % Initial clauses in saturation : 16
% 0.20/0.26 % Processed clauses : 20
% 0.20/0.26 % ...of these trivial : 0
% 0.20/0.26 % ...subsumed : 0
% 0.20/0.26 % ...remaining for further processing : 20
% 0.20/0.26 % Other redundant clauses eliminated : 1
% 0.20/0.26 % Clauses deleted for lack of memory : 0
% 0.20/0.26 % Backward-subsumed : 1
% 0.20/0.26 % Backward-rewritten : 0
% 0.20/0.26 % Generated clauses : 11
% 0.20/0.26 % ...of the previous two non-redundant : 9
% 0.20/0.26 % ...aggressively subsumed : 0
% 0.20/0.26 % Contextual simplify-reflections : 0
% 0.20/0.26 % Paramodulations : 10
% 0.20/0.26 % Factorizations : 0
% 0.20/0.26 % NegExts : 0
% 0.20/0.26 % Equation resolutions : 1
% 0.20/0.26 % Disequality decompositions : 0
% 0.20/0.26 % Total rewrite steps : 5
% 0.20/0.26 % ...of those cached : 2
% 0.20/0.26 % Propositional unsat checks : 0
% 0.20/0.26 % Propositional check models : 0
% 0.20/0.26 % Propositional check unsatisfiable : 0
% 0.20/0.26 % Propositional clauses : 0
% 0.20/0.26 % Propositional clauses after purity: 0
% 0.20/0.26 % Propositional unsat core size : 0
% 0.20/0.26 % Propositional preprocessing time : 0.000
% 0.20/0.26 % Propositional encoding time : 0.000
% 0.20/0.26 % Propositional solver time : 0.000
% 0.20/0.26 % Success case prop preproc time : 0.000
% 0.20/0.26 % Success case prop encoding time : 0.000
% 0.20/0.26 % Success case prop solver time : 0.000
% 0.20/0.26 % Current number of processed clauses : 18
% 0.20/0.26 % Positive orientable unit clauses : 4
% 0.20/0.26 % Positive unorientable unit clauses: 0
% 0.20/0.26 % Negative unit clauses : 2
% 0.20/0.26 % Non-unit-clauses : 12
% 0.20/0.26 % Current number of unprocessed clauses: 5
% 0.20/0.26 % ...number of literals in the above : 20
% 0.20/0.26 % Current number of archived formulas : 0
% 0.20/0.26 % Current number of archived clauses : 1
% 0.20/0.26 % Clause-clause subsumption calls (NU) : 13
% 0.20/0.26 % Rec. Clause-clause subsumption calls : 6
% 0.20/0.26 % Non-unit clause-clause subsumptions : 0
% 0.20/0.26 % Unit Clause-clause subsumption calls : 1
% 0.20/0.26 % Rewrite failures with RHS unbound : 0
% 0.20/0.26 % BW rewrite match attempts : 0
% 0.20/0.26 % BW rewrite match successes : 0
% 0.20/0.26 % Condensation attempts : 0
% 0.20/0.26 % Condensation successes : 0
% 0.20/0.26 % Termbank termtop insertions : 2028
% 0.20/0.26 % Search garbage collected termcells : 685
% 0.20/0.26
% 0.20/0.26 % -------------------------------------------------
% 0.20/0.26 % User time : 0.005 s
% 0.20/0.26 % System time : 0.002 s
% 0.20/0.26 % Total time : 0.007 s
% 0.20/0.26 % Maximum resident set size: 3648 pages
% 0.20/0.26
% 0.20/0.26 % -------------------------------------------------
% 0.20/0.26 % User time : 0.007 s
% 0.20/0.26 % System time : 0.006 s
% 0.20/0.26 % Total time : 0.013 s
% 0.20/0.26 % Maximum resident set size: 4608 pages
% 0.20/0.26 % E exiting
%------------------------------------------------------------------------------