TSTP Solution File: SWW949+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SWW949+1 : TPTP v8.1.0. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n027.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 : 600s
% DateTime : Thu Jul 21 00:11:44 EDT 2022
% Result : Theorem 0.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 16
% Syntax : Number of formulae : 64 ( 32 unt; 0 def)
% Number of atoms : 105 ( 15 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 76 ( 35 ~; 31 |; 2 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 74 ( 2 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(ax122,axiom,
! [X45] :
( pred_attacker(tuple_R_in_2(X45,constr_f(constr_xor(name_r1,constr_xor(X45,name_t)),name_t)))
=> pred_attacker(tuple_R_out_4(name_objective)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax122) ).
fof(ax81,axiom,
! [X5,X6,X7] : constr_xor(X5,constr_xor(X6,X7)) = constr_xor(constr_xor(X5,X6),X7),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax81) ).
fof(ax79,axiom,
! [X2] : constr_xor(X2,constr_ZERO) = X2,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax79) ).
fof(ax80,axiom,
! [X3,X4] : constr_xor(X3,X4) = constr_xor(X4,X3),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax80) ).
fof(ax78,axiom,
! [X1] : constr_xor(X1,X1) = constr_ZERO,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax78) ).
fof(ax104,axiom,
! [X32,X33] :
( ( pred_attacker(X32)
& pred_attacker(X33) )
=> pred_attacker(tuple_R_in_2(X32,X33)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax104) ).
fof(ax88,axiom,
! [X16,X17] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
=> pred_attacker(X17) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax88) ).
fof(ax118,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax118) ).
fof(ax82,axiom,
! [X8,X9] :
( ( pred_attacker(X8)
& pred_attacker(X9) )
=> pred_attacker(constr_xor(X8,X9)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax82) ).
fof(ax103,axiom,
! [X31] :
( pred_attacker(tuple_R_out_1(X31))
=> pred_attacker(X31) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax103) ).
fof(ax120,axiom,
pred_attacker(tuple_R_out_1(name_r1)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax120) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co0) ).
fof(ax99,axiom,
! [X27] :
( pred_attacker(tuple_R_out_4(X27))
=> pred_attacker(X27) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax99) ).
fof(ax87,axiom,
! [X14,X15] :
( pred_attacker(tuple_knowledge_from_1st_round_out_2(X14,X15))
=> pred_attacker(X14) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax87) ).
fof(ax90,axiom,
! [X19] :
( pred_attacker(tuple_knowledge_from_1st_round_out_1(X19))
=> pred_attacker(X19) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax90) ).
fof(ax117,axiom,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',ax117) ).
fof(c_0_16,plain,
! [X46] :
( ~ pred_attacker(tuple_R_in_2(X46,constr_f(constr_xor(name_r1,constr_xor(X46,name_t)),name_t)))
| pred_attacker(tuple_R_out_4(name_objective)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax122])])])]) ).
fof(c_0_17,plain,
! [X8,X9,X10] : constr_xor(X8,constr_xor(X9,X10)) = constr_xor(constr_xor(X8,X9),X10),
inference(variable_rename,[status(thm)],[ax81]) ).
fof(c_0_18,plain,
! [X3] : constr_xor(X3,constr_ZERO) = X3,
inference(variable_rename,[status(thm)],[ax79]) ).
fof(c_0_19,plain,
! [X5,X6] : constr_xor(X5,X6) = constr_xor(X6,X5),
inference(variable_rename,[status(thm)],[ax80]) ).
cnf(c_0_20,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(X1,constr_f(constr_xor(name_r1,constr_xor(X1,name_t)),name_t))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_21,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(constr_xor(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_22,plain,
! [X2] : constr_xor(X2,X2) = constr_ZERO,
inference(variable_rename,[status(thm)],[ax78]) ).
cnf(c_0_23,plain,
constr_xor(X1,constr_ZERO) = X1,
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,plain,
constr_xor(X1,X2) = constr_xor(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_25,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(constr_xor(X1,X2),constr_f(constr_xor(name_r1,constr_xor(X1,constr_xor(X2,name_t))),name_t))) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
constr_xor(X1,X1) = constr_ZERO,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,plain,
constr_xor(constr_ZERO,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(constr_xor(X1,name_t),constr_f(constr_xor(name_r1,X1),name_t))) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_23]) ).
cnf(c_0_29,plain,
constr_xor(X1,constr_xor(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_26]),c_0_27]) ).
cnf(c_0_30,plain,
constr_xor(X1,constr_xor(X2,X3)) = constr_xor(X2,constr_xor(X3,X1)),
inference(spm,[status(thm)],[c_0_21,c_0_24]) ).
fof(c_0_31,plain,
! [X34,X35] :
( ~ pred_attacker(X34)
| ~ pred_attacker(X35)
| pred_attacker(tuple_R_in_2(X34,X35)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax104])]) ).
fof(c_0_32,plain,
! [X18,X19] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X18,X19))
| pred_attacker(X19) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax88])]) ).
cnf(c_0_33,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r1_from_1st,name_r2_from_1st),name_t))),
inference(split_conjunct,[status(thm)],[ax118]) ).
fof(c_0_34,plain,
! [X10,X11] :
( ~ pred_attacker(X10)
| ~ pred_attacker(X11)
| pred_attacker(constr_xor(X10,X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax82])]) ).
cnf(c_0_35,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(tuple_R_in_2(constr_xor(name_t,constr_xor(name_r1,X1)),constr_f(X1,name_t))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]),c_0_30]) ).
cnf(c_0_36,plain,
( pred_attacker(tuple_R_in_2(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_38,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_2(constr_xor(name_t,name_r2_from_1st),constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t))),
inference(rw,[status(thm)],[c_0_33,c_0_24]) ).
cnf(c_0_39,plain,
( pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X2)
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_40,plain,
! [X32] :
( ~ pred_attacker(tuple_R_out_1(X32))
| pred_attacker(X32) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax103])]) ).
cnf(c_0_41,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(name_t,constr_xor(name_r1,X1)))
| ~ pred_attacker(constr_f(X1,name_t)) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
pred_attacker(constr_f(constr_xor(name_r2_from_1st,name_r1_from_1st),name_t)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
| ~ pred_attacker(constr_xor(X1,X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_39,c_0_21]) ).
cnf(c_0_44,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_45,plain,
pred_attacker(tuple_R_out_1(name_r1)),
inference(split_conjunct,[status(thm)],[ax120]) ).
fof(c_0_46,negated_conjecture,
~ pred_attacker(name_objective),
inference(assume_negation,[status(cth)],[co0]) ).
fof(c_0_47,plain,
! [X28] :
( ~ pred_attacker(tuple_R_out_4(X28))
| pred_attacker(X28) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax99])]) ).
cnf(c_0_48,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(name_t,constr_xor(name_r1,constr_xor(name_r2_from_1st,name_r1_from_1st)))) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_49,plain,
( pred_attacker(constr_xor(X1,constr_xor(X2,X3)))
| ~ pred_attacker(constr_xor(X1,X3))
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_50,plain,
pred_attacker(name_r1),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
fof(c_0_51,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[c_0_46]) ).
fof(c_0_52,plain,
! [X16,X17] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X16,X17))
| pred_attacker(X16) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax87])])])]) ).
fof(c_0_53,plain,
! [X20] :
( ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X20))
| pred_attacker(X20) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax90])]) ).
cnf(c_0_54,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_R_out_4(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_55,plain,
( pred_attacker(tuple_R_out_4(name_objective))
| ~ pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,name_r1_from_1st))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50])]) ).
cnf(c_0_56,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_57,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_58,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_knowledge_from_1st_round_out_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_59,plain,
pred_attacker(tuple_knowledge_from_1st_round_out_1(name_r1_from_1st)),
inference(split_conjunct,[status(thm)],[ax117]) ).
cnf(c_0_60,plain,
~ pred_attacker(constr_xor(name_t,constr_xor(name_r2_from_1st,name_r1_from_1st))),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,plain,
pred_attacker(constr_xor(name_t,name_r2_from_1st)),
inference(spm,[status(thm)],[c_0_57,c_0_38]) ).
cnf(c_0_62,plain,
pred_attacker(name_r1_from_1st),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_63,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_43]),c_0_61]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.13 % Problem : SWW949+1 : TPTP v8.1.0. Released v7.4.0.
% 0.09/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n027.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 : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Sun Jun 5 09:49:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.015 s
% 0.25/1.43
% 0.25/1.43 # Failure: Out of unprocessed clauses!
% 0.25/1.43 # OLD status GaveUp
% 0.25/1.43 # Parsed axioms : 124
% 0.25/1.43 # Removed by relevancy pruning/SinE : 38
% 0.25/1.43 # Initial clauses : 86
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 86
% 0.25/1.43 # Processed clauses : 86
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 0
% 0.25/1.43 # ...remaining for further processing : 86
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 0
% 0.25/1.43 # ...of the previous two non-trivial : 0
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 0
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 86
% 0.25/1.43 # Positive orientable unit clauses : 7
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 79
% 0.25/1.43 # Non-unit-clauses : 0
% 0.25/1.43 # Current number of unprocessed clauses: 0
% 0.25/1.43 # ...number of literals in the above : 0
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.25/1.43 # Non-unit clause-clause subsumptions : 0
% 0.25/1.43 # Unit Clause-clause subsumption calls : 1
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 1177
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.015 s
% 0.25/1.43 # System time : 0.001 s
% 0.25/1.43 # Total time : 0.016 s
% 0.25/1.43 # Maximum resident set size: 2840 pages
% 0.25/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.25/1.43 # Preprocessing time : 0.016 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 64
% 0.25/1.43 # Proof object clause steps : 34
% 0.25/1.43 # Proof object formula steps : 30
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 16
% 0.25/1.43 # Proof object initial formulas used : 16
% 0.25/1.43 # Proof object generating inferences : 17
% 0.25/1.43 # Proof object simplifying inferences : 11
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 124
% 0.25/1.43 # Removed by relevancy pruning/SinE : 0
% 0.25/1.43 # Initial clauses : 124
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 124
% 0.25/1.43 # Processed clauses : 900
% 0.25/1.43 # ...of these trivial : 9
% 0.25/1.43 # ...subsumed : 624
% 0.25/1.43 # ...remaining for further processing : 267
% 0.25/1.43 # Other redundant clauses eliminated : 0
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 2
% 0.25/1.43 # Backward-rewritten : 9
% 0.25/1.43 # Generated clauses : 2704
% 0.25/1.43 # ...of the previous two non-trivial : 2478
% 0.25/1.43 # Contextual simplify-reflections : 67
% 0.25/1.43 # Paramodulations : 2704
% 0.25/1.43 # Factorizations : 0
% 0.25/1.43 # Equation resolutions : 0
% 0.25/1.43 # Current number of processed clauses : 256
% 0.25/1.43 # Positive orientable unit clauses : 28
% 0.25/1.43 # Positive unorientable unit clauses: 3
% 0.25/1.43 # Negative unit clauses : 83
% 0.25/1.43 # Non-unit-clauses : 142
% 0.25/1.43 # Current number of unprocessed clauses: 1471
% 0.25/1.43 # ...number of literals in the above : 3812
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 11
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 25278
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 22984
% 0.25/1.43 # Non-unit clause-clause subsumptions : 574
% 0.25/1.43 # Unit Clause-clause subsumption calls : 965
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 91
% 0.25/1.43 # BW rewrite match successes : 57
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 41674
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.071 s
% 0.25/1.43 # System time : 0.006 s
% 0.25/1.43 # Total time : 0.077 s
% 0.25/1.43 # Maximum resident set size: 4884 pages
%------------------------------------------------------------------------------