0.04/0.13 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.13/0.14 % Command : run_E %s %d THM 0.14/0.35 % Computer : n020.cluster.edu 0.14/0.35 % Model : x86_64 x86_64 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.35 % Memory : 8042.1875MB 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.35 % CPULimit : 960 0.14/0.35 % WCLimit : 120 0.14/0.35 % DateTime : Tue Aug 9 02:15:05 EDT 2022 0.14/0.35 % CPUTime : 0.20/0.49 Running first-order on 8 cores theorem proving 0.20/0.49 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p 0.20/0.49 # Version: 3.0pre003 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 0.20/0.51 # Starting new_bool_3 with 120s (1) cores 0.20/0.51 # Starting new_bool_1 with 120s (1) cores 0.20/0.51 # Starting sh5l with 120s (1) cores 0.20/0.51 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with pid 22247 completed with status 0 0.20/0.51 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: FGUSF-FFMM21-MFFFFFNN 0.20/0.51 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 300s (1) cores 0.20/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 61s (1) cores 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 61s (1) cores 0.20/0.51 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 61s (1) cores 0.20/0.51 # Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 61s (1) cores 0.20/0.51 # U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 22263 completed with status 0 0.20/0.51 # Result found by U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN 0.20/0.51 # Preprocessing class: FSMSSLSSSSSNFFN. 0.20/0.51 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 600s (5) cores 0.20/0.51 # No SInE strategy applied 0.20/0.51 # Search class: FGUSF-FFMM21-MFFFFFNN 0.20/0.51 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.51 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 300s (1) cores 0.20/0.51 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 61s (1) cores 0.20/0.51 # Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 61s (1) cores 0.20/0.51 # Starting U----_207d_00_B07_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 61s (1) cores 0.20/0.51 # Preprocessing time : 0.004 s 0.20/0.51 # Presaturation interreduction done 0.20/0.51 0.20/0.51 # Proof found! 0.20/0.51 # SZS status Theorem 0.20/0.51 # SZS output start CNFRefutation 0.20/0.51 tff(decl_22, type, and_1: $o). 0.20/0.51 tff(decl_23, type, and: ($i * $i) > $i). 0.20/0.51 tff(decl_24, type, implies: ($i * $i) > $i). 0.20/0.51 tff(decl_25, type, is_a_theorem: $i > $o). 0.20/0.51 tff(decl_26, type, modus_tollens: $o). 0.20/0.51 tff(decl_27, type, not: $i > $i). 0.20/0.51 tff(decl_28, type, and_2: $o). 0.20/0.51 tff(decl_29, type, or: ($i * $i) > $i). 0.20/0.51 tff(decl_30, type, or_3: $o). 0.20/0.51 tff(decl_31, type, and_3: $o). 0.20/0.51 tff(decl_32, type, equivalence_3: $o). 0.20/0.51 tff(decl_33, type, equiv: ($i * $i) > $i). 0.20/0.51 tff(decl_34, type, kn2: $o). 0.20/0.51 tff(decl_35, type, kn3: $o). 0.20/0.51 tff(decl_36, type, or_1: $o). 0.20/0.51 tff(decl_37, type, cn3: $o). 0.20/0.51 tff(decl_38, type, cn1: $o). 0.20/0.51 tff(decl_39, type, equivalence_1: $o). 0.20/0.51 tff(decl_40, type, substitution_of_equivalents: $o). 0.20/0.51 tff(decl_41, type, r5: $o). 0.20/0.51 tff(decl_42, type, r2: $o). 0.20/0.51 tff(decl_43, type, or_2: $o). 0.20/0.51 tff(decl_44, type, cn2: $o). 0.20/0.51 tff(decl_45, type, implies_2: $o). 0.20/0.51 tff(decl_46, type, r1: $o). 0.20/0.51 tff(decl_47, type, r3: $o). 0.20/0.51 tff(decl_48, type, r4: $o). 0.20/0.51 tff(decl_49, type, kn1: $o). 0.20/0.51 tff(decl_50, type, equivalence_2: $o). 0.20/0.51 tff(decl_51, type, modus_ponens: $o). 0.20/0.51 tff(decl_52, type, implies_1: $o). 0.20/0.51 tff(decl_53, type, implies_3: $o). 0.20/0.51 tff(decl_54, type, op_implies_and: $o). 0.20/0.51 tff(decl_55, type, op_implies_or: $o). 0.20/0.51 tff(decl_56, type, op_equiv: $o). 0.20/0.51 tff(decl_57, type, op_or: $o). 0.20/0.51 tff(decl_58, type, op_and: $o). 0.20/0.51 tff(decl_59, type, esk1_0: $i). 0.20/0.51 tff(decl_60, type, esk2_0: $i). 0.20/0.51 tff(decl_61, type, esk3_0: $i). 0.20/0.51 tff(decl_62, type, esk4_0: $i). 0.20/0.51 tff(decl_63, type, esk5_0: $i). 0.20/0.51 tff(decl_64, type, esk6_0: $i). 0.20/0.51 tff(decl_65, type, esk7_0: $i). 0.20/0.51 tff(decl_66, type, esk8_0: $i). 0.20/0.51 tff(decl_67, type, esk9_0: $i). 0.20/0.51 tff(decl_68, type, esk10_0: $i). 0.20/0.51 tff(decl_69, type, esk11_0: $i). 0.20/0.51 tff(decl_70, type, esk12_0: $i). 0.20/0.51 tff(decl_71, type, esk13_0: $i). 0.20/0.51 tff(decl_72, type, esk14_0: $i). 0.20/0.51 tff(decl_73, type, esk15_0: $i). 0.20/0.51 tff(decl_74, type, esk16_0: $i). 0.20/0.51 tff(decl_75, type, esk17_0: $i). 0.20/0.51 tff(decl_76, type, esk18_0: $i). 0.20/0.51 tff(decl_77, type, esk19_0: $i). 0.20/0.51 tff(decl_78, type, esk20_0: $i). 0.20/0.51 tff(decl_79, type, esk21_0: $i). 0.20/0.51 tff(decl_80, type, esk22_0: $i). 0.20/0.51 tff(decl_81, type, esk23_0: $i). 0.20/0.51 tff(decl_82, type, esk24_0: $i). 0.20/0.51 tff(decl_83, type, esk25_0: $i). 0.20/0.51 tff(decl_84, type, esk26_0: $i). 0.20/0.51 tff(decl_85, type, esk27_0: $i). 0.20/0.51 tff(decl_86, type, esk28_0: $i). 0.20/0.51 tff(decl_87, type, esk29_0: $i). 0.20/0.51 tff(decl_88, type, esk30_0: $i). 0.20/0.51 tff(decl_89, type, esk31_0: $i). 0.20/0.51 tff(decl_90, type, esk32_0: $i). 0.20/0.51 tff(decl_91, type, esk33_0: $i). 0.20/0.51 tff(decl_92, type, esk34_0: $i). 0.20/0.51 tff(decl_93, type, esk35_0: $i). 0.20/0.51 tff(decl_94, type, esk36_0: $i). 0.20/0.51 tff(decl_95, type, esk37_0: $i). 0.20/0.51 tff(decl_96, type, esk38_0: $i). 0.20/0.51 tff(decl_97, type, esk39_0: $i). 0.20/0.51 tff(decl_98, type, esk40_0: $i). 0.20/0.51 tff(decl_99, type, esk41_0: $i). 0.20/0.51 tff(decl_100, type, esk42_0: $i). 0.20/0.51 tff(decl_101, type, esk43_0: $i). 0.20/0.51 tff(decl_102, type, esk44_0: $i). 0.20/0.51 tff(decl_103, type, esk45_0: $i). 0.20/0.51 tff(decl_104, type, esk46_0: $i). 0.20/0.51 tff(decl_105, type, esk47_0: $i). 0.20/0.51 tff(decl_106, type, esk48_0: $i). 0.20/0.51 tff(decl_107, type, esk49_0: $i). 0.20/0.51 tff(decl_108, type, esk50_0: $i). 0.20/0.51 tff(decl_109, type, esk51_0: $i). 0.20/0.51 tff(decl_110, type, esk52_0: $i). 0.20/0.51 tff(decl_111, type, esk53_0: $i). 0.20/0.51 tff(decl_112, type, esk54_0: $i). 0.20/0.51 tff(decl_113, type, esk55_0: $i). 0.20/0.51 fof(op_implies_and, axiom, (![X1, X2]:(implies(X1,X2)=not(and(X1,not(X2))))<=op_implies_and), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_and)). 0.20/0.51 fof(op_implies_or, axiom, (op_implies_or=>![X1, X2]:(or(not(X1),X2)=implies(X1,X2))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_implies_or)). 0.20/0.51 fof(op_and, axiom, (op_and=>![X1, X2]:(and(X1,X2)=not(or(not(X1),not(X2))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_and)). 0.20/0.51 fof(principia_op_implies_or, axiom, op_implies_or, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_op_implies_or)). 0.20/0.51 fof(op_or, axiom, (![X1, X2]:(not(and(not(X1),not(X2)))=or(X1,X2))<=op_or), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+1.ax', op_or)). 0.20/0.51 fof(hilbert_op_implies_and, axiom, op_implies_and, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_op_implies_and)). 0.20/0.51 fof(principia_op_and, axiom, op_and, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_op_and)). 0.20/0.51 fof(modus_tollens, axiom, (modus_tollens<=>![X1, X2]:(is_a_theorem(implies(implies(not(X2),not(X1)),implies(X1,X2))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', modus_tollens)). 0.20/0.51 fof(hilbert_modus_tollens, axiom, modus_tollens, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_modus_tollens)). 0.20/0.51 fof(hilbert_op_or, axiom, op_or, file('/export/starexec/sandbox/benchmark/Axioms/LCL006+2.ax', hilbert_op_or)). 0.20/0.51 fof(r3, axiom, (r3<=>![X4, X5]:(is_a_theorem(implies(or(X4,X5),or(X5,X4))))), file('/export/starexec/sandbox/benchmark/Axioms/LCL006+0.ax', r3)). 0.20/0.51 fof(principia_r3, conjecture, r3, file('/export/starexec/sandbox/benchmark/theBenchmark.p', principia_r3)). 0.20/0.51 fof(c_0_12, plain, (op_implies_and=>![X1, X2]:(implies(X1,X2)=not(and(X1,not(X2))))), inference(fof_simplification,[status(thm)],[op_implies_and])). 0.20/0.51 fof(c_0_13, plain, ![X119, X120]:((~op_implies_or|or(not(X119),X120)=implies(X119,X120))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_implies_or])])])). 0.20/0.51 fof(c_0_14, plain, ![X117, X118]:((~op_implies_and|implies(X117,X118)=not(and(X117,not(X118))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])). 0.20/0.51 fof(c_0_15, plain, ![X125, X126]:((~op_and|and(X125,X126)=not(or(not(X125),not(X126))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[op_and])])])). 0.20/0.51 cnf(c_0_16, plain, (or(not(X1),X2)=implies(X1,X2)|~op_implies_or), inference(split_conjunct,[status(thm)],[c_0_13])). 0.20/0.51 cnf(c_0_17, plain, (op_implies_or), inference(split_conjunct,[status(thm)],[principia_op_implies_or])). 0.20/0.51 fof(c_0_18, plain, (op_or=>![X1, X2]:(not(and(not(X1),not(X2)))=or(X1,X2))), inference(fof_simplification,[status(thm)],[op_or])). 0.20/0.51 cnf(c_0_19, plain, (implies(X1,X2)=not(and(X1,not(X2)))|~op_implies_and), inference(split_conjunct,[status(thm)],[c_0_14])). 0.20/0.51 cnf(c_0_20, plain, (op_implies_and), inference(split_conjunct,[status(thm)],[hilbert_op_implies_and])). 0.20/0.51 cnf(c_0_21, plain, (and(X1,X2)=not(or(not(X1),not(X2)))|~op_and), inference(split_conjunct,[status(thm)],[c_0_15])). 0.20/0.51 cnf(c_0_22, plain, (or(not(X1),X2)=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16, c_0_17])])). 0.20/0.51 cnf(c_0_23, plain, (op_and), inference(split_conjunct,[status(thm)],[principia_op_and])). 0.20/0.51 fof(c_0_24, plain, ![X11, X12]:(((~modus_tollens|is_a_theorem(implies(implies(not(X12),not(X11)),implies(X11,X12))))&(~is_a_theorem(implies(implies(not(esk4_0),not(esk3_0)),implies(esk3_0,esk4_0)))|modus_tollens))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[modus_tollens])])])])). 0.20/0.51 fof(c_0_25, plain, ![X123, X124]:((~op_or|not(and(not(X123),not(X124)))=or(X123,X124))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])). 0.20/0.51 cnf(c_0_26, plain, (not(and(X1,not(X2)))=implies(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19, c_0_20])])). 0.20/0.51 cnf(c_0_27, plain, (and(X1,X2)=not(implies(X1,not(X2)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21, c_0_22]), c_0_23])])). 0.20/0.51 cnf(c_0_28, plain, (is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))|~modus_tollens), inference(split_conjunct,[status(thm)],[c_0_24])). 0.20/0.51 cnf(c_0_29, plain, (modus_tollens), inference(split_conjunct,[status(thm)],[hilbert_modus_tollens])). 0.20/0.51 cnf(c_0_30, plain, (not(and(not(X1),not(X2)))=or(X1,X2)|~op_or), inference(split_conjunct,[status(thm)],[c_0_25])). 0.20/0.51 cnf(c_0_31, plain, (not(not(implies(X1,not(not(X2)))))=implies(X1,X2)), inference(rw,[status(thm)],[c_0_26, c_0_27])). 0.20/0.51 cnf(c_0_32, plain, (op_or), inference(split_conjunct,[status(thm)],[hilbert_op_or])). 0.20/0.51 fof(c_0_33, plain, ![X87, X88]:(((~r3|is_a_theorem(implies(or(X87,X88),or(X88,X87))))&(~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0)))|r3))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[r3])])])])). 0.20/0.51 fof(c_0_34, negated_conjecture, ~r3, inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[principia_r3])])). 0.20/0.51 cnf(c_0_35, plain, (is_a_theorem(implies(implies(not(X1),not(X2)),implies(X2,X1)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_28, c_0_29])])). 0.20/0.51 cnf(c_0_36, plain, (implies(not(X1),X2)=or(X1,X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_30, c_0_27]), c_0_31]), c_0_32])])). 0.20/0.51 cnf(c_0_37, plain, (r3|~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0)))), inference(split_conjunct,[status(thm)],[c_0_33])). 0.20/0.51 cnf(c_0_38, negated_conjecture, (~r3), inference(split_conjunct,[status(thm)],[c_0_34])). 0.20/0.51 cnf(c_0_39, plain, (is_a_theorem(implies(or(X1,not(X2)),implies(X2,X1)))), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.20/0.51 cnf(c_0_40, plain, (~is_a_theorem(implies(or(esk41_0,esk42_0),or(esk42_0,esk41_0)))), inference(sr,[status(thm)],[c_0_37, c_0_38])). 0.20/0.51 cnf(c_0_41, plain, (is_a_theorem(implies(or(X1,not(not(X2))),or(X2,X1)))), inference(spm,[status(thm)],[c_0_39, c_0_36])). 0.20/0.51 cnf(c_0_42, plain, (implies(implies(X1,not(not(X2))),X3)=implies(implies(X1,X2),X3)), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_31]), c_0_22])). 0.20/0.51 cnf(c_0_43, plain, (~is_a_theorem(implies(implies(not(esk41_0),esk42_0),or(esk42_0,esk41_0)))), inference(rw,[status(thm)],[c_0_40, c_0_36])). 0.20/0.51 cnf(c_0_44, plain, (is_a_theorem(implies(implies(not(X1),X2),or(X2,X1)))), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41, c_0_36]), c_0_42])). 0.20/0.51 cnf(c_0_45, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_44])]), ['proof']). 0.20/0.51 # SZS output end CNFRefutation 0.20/0.51 # Parsed axioms : 53 0.20/0.51 # Removed by relevancy pruning/SinE : 0 0.20/0.51 # Initial clauses : 82 0.20/0.51 # Removed in clause preprocessing : 0 0.20/0.51 # Initial clauses in saturation : 82 0.20/0.51 # Processed clauses : 223 0.20/0.51 # ...of these trivial : 38 0.20/0.51 # ...subsumed : 18 0.20/0.51 # ...remaining for further processing : 167 0.20/0.51 # Other redundant clauses eliminated : 0 0.20/0.51 # Clauses deleted for lack of memory : 0 0.20/0.51 # Backward-subsumed : 2 0.20/0.51 # Backward-rewritten : 7 0.20/0.51 # Generated clauses : 367 0.20/0.51 # ...of the previous two non-redundant : 280 0.20/0.51 # ...aggressively subsumed : 0 0.20/0.51 # Contextual simplify-reflections : 0 0.20/0.51 # Paramodulations : 367 0.20/0.51 # Factorizations : 0 0.20/0.51 # NegExts : 0 0.20/0.51 # Equation resolutions : 0 0.20/0.51 # Propositional unsat checks : 0 0.20/0.51 # Propositional check models : 0 0.20/0.51 # Propositional check unsatisfiable : 0 0.20/0.51 # Propositional clauses : 0 0.20/0.51 # Propositional clauses after purity: 0 0.20/0.51 # Propositional unsat core size : 0 0.20/0.51 # Propositional preprocessing time : 0.000 0.20/0.51 # Propositional encoding time : 0.000 0.20/0.51 # Propositional solver time : 0.000 0.20/0.51 # Success case prop preproc time : 0.000 0.20/0.51 # Success case prop encoding time : 0.000 0.20/0.51 # Success case prop solver time : 0.000 0.20/0.51 # Current number of processed clauses : 100 0.20/0.51 # Positive orientable unit clauses : 66 0.20/0.51 # Positive unorientable unit clauses: 1 0.20/0.51 # Negative unit clauses : 4 0.20/0.51 # Non-unit-clauses : 29 0.20/0.51 # Current number of unprocessed clauses: 197 0.20/0.51 # ...number of literals in the above : 258 0.20/0.51 # Current number of archived formulas : 0 0.20/0.51 # Current number of archived clauses : 67 0.20/0.51 # Clause-clause subsumption calls (NU) : 126 0.20/0.51 # Rec. Clause-clause subsumption calls : 118 0.20/0.51 # Non-unit clause-clause subsumptions : 17 0.20/0.51 # Unit Clause-clause subsumption calls : 83 0.20/0.51 # Rewrite failures with RHS unbound : 0 0.20/0.51 # BW rewrite match attempts : 129 0.20/0.51 # BW rewrite match successes : 10 0.20/0.51 # Condensation attempts : 0 0.20/0.51 # Condensation successes : 0 0.20/0.51 # Termbank termtop insertions : 8550 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.015 s 0.20/0.51 # System time : 0.006 s 0.20/0.51 # Total time : 0.021 s 0.20/0.51 # Maximum resident set size: 1952 pages 0.20/0.51 0.20/0.51 # ------------------------------------------------- 0.20/0.51 # User time : 0.039 s 0.20/0.51 # System time : 0.023 s 0.20/0.51 # Total time : 0.063 s 0.20/0.51 # Maximum resident set size: 1748 pages 0.20/0.51 EOF