TSTP Solution File: SYN139-1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SYN139-1 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n022.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:19:26 EDT 2024
% Result : Unsatisfiable 1.05s 0.61s
% Output : CNFRefutation 1.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 22
% Syntax : Number of clauses : 84 ( 29 unt; 0 nHn; 63 RR)
% Number of literals : 186 ( 0 equ; 107 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 17 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 142 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(rule_085,axiom,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_085) ).
cnf(rule_126,axiom,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_126) ).
cnf(rule_125,axiom,
( s1(X1)
| ~ p0(X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_125) ).
cnf(rule_181,axiom,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_181) ).
cnf(axiom_14,axiom,
p0(b,X1),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_14) ).
cnf(axiom_17,axiom,
q0(X1,d),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_17) ).
cnf(rule_273,axiom,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_273) ).
cnf(rule_133,axiom,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_133) ).
cnf(rule_279,axiom,
( m4(X1,X2)
| ~ l2(X3,X2)
| ~ s3(a,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_279) ).
cnf(axiom_19,axiom,
m0(X1,d,X2),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_19) ).
cnf(rule_050,axiom,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_050) ).
cnf(rule_069,axiom,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_069) ).
cnf(axiom_5,axiom,
s0(b),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_5) ).
cnf(prove_this,negated_conjecture,
~ m4(a,a),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',prove_this) ).
cnf(rule_189,axiom,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_189) ).
cnf(rule_182,axiom,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_182) ).
cnf(rule_177,axiom,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_177) ).
cnf(rule_054,axiom,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_054) ).
cnf(axiom_20,axiom,
l0(a),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_20) ).
cnf(rule_002,axiom,
( l1(X1,X1)
| ~ n0(X2,X1) ),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',rule_002) ).
cnf(axiom_37,axiom,
n0(b,a),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_37) ).
cnf(axiom_32,axiom,
k0(b),
file('/export/starexec/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p',axiom_32) ).
cnf(c_0_22,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_085]) ).
cnf(c_0_23,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
inference(fof_simplification,[status(thm)],[rule_126]) ).
cnf(c_0_24,plain,
( s1(X1)
| ~ p0(X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_125]) ).
cnf(c_0_25,plain,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_181]) ).
cnf(c_0_26,plain,
( p1(X1,X1,X1)
| ~ p0(X2,X1) ),
c_0_22 ).
cnf(c_0_27,axiom,
p0(b,X1),
axiom_14 ).
cnf(c_0_28,plain,
( s1(X1)
| ~ q0(X1,X2)
| ~ s1(X3) ),
c_0_23 ).
cnf(c_0_29,axiom,
q0(X1,d),
axiom_17 ).
cnf(c_0_30,plain,
( s1(X1)
| ~ p0(X1,X1) ),
c_0_24 ).
cnf(c_0_31,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
inference(fof_simplification,[status(thm)],[rule_273]) ).
cnf(c_0_32,plain,
( q2(X1,X1,X1)
| ~ p1(X1,X1,X1) ),
c_0_25 ).
cnf(c_0_33,plain,
p1(X1,X1,X1),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_34,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_133]) ).
cnf(c_0_35,plain,
( s1(X1)
| ~ s1(X2) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
s1(b),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_37,plain,
( s3(X1,X2)
| ~ q2(X3,X1,X3)
| ~ s2(X1)
| ~ m0(X3,X4,X2) ),
c_0_31 ).
cnf(c_0_38,plain,
q2(X1,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_39,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ s1(X3)
| ~ m0(X4,X3,X1) ),
c_0_34 ).
cnf(c_0_40,plain,
s1(X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
( m4(X1,X2)
| ~ l2(X3,X2)
| ~ s3(a,X1) ),
inference(fof_simplification,[status(thm)],[rule_279]) ).
cnf(c_0_42,plain,
( s3(X1,X2)
| ~ s2(X1)
| ~ m0(X1,X3,X2) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,axiom,
m0(X1,d,X2),
axiom_19 ).
cnf(c_0_44,plain,
( l2(X1,X1)
| ~ p0(X2,X2)
| ~ m0(X3,X4,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40])]) ).
cnf(c_0_45,plain,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
inference(fof_simplification,[status(thm)],[rule_050]) ).
cnf(c_0_46,plain,
( m4(X1,X2)
| ~ l2(X3,X2)
| ~ s3(a,X1) ),
c_0_41 ).
cnf(c_0_47,plain,
( s3(X1,X2)
| ~ s2(X1) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_48,plain,
( l2(X1,X1)
| ~ p0(X2,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_49,plain,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_069]) ).
cnf(c_0_50,plain,
( n1(X1,X2,X1)
| ~ s0(b)
| ~ l0(X1)
| ~ p0(b,X2) ),
c_0_45 ).
cnf(c_0_51,axiom,
s0(b),
axiom_5 ).
cnf(c_0_52,negated_conjecture,
~ m4(a,a),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_53,plain,
( m4(X1,X2)
| ~ s2(a)
| ~ l2(X3,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_54,plain,
l2(X1,X1),
inference(spm,[status(thm)],[c_0_48,c_0_27]) ).
cnf(c_0_55,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
inference(fof_simplification,[status(thm)],[rule_189]) ).
cnf(c_0_56,plain,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
inference(fof_simplification,[status(thm)],[rule_182]) ).
cnf(c_0_57,plain,
( p1(X1,X1,X2)
| ~ p0(X2,X1) ),
c_0_49 ).
cnf(c_0_58,plain,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
inference(fof_simplification,[status(thm)],[rule_177]) ).
cnf(c_0_59,plain,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_054]) ).
cnf(c_0_60,plain,
( n1(X1,X2,X1)
| ~ l0(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_27])]) ).
cnf(c_0_61,axiom,
l0(a),
axiom_20 ).
cnf(c_0_62,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
inference(fof_simplification,[status(thm)],[rule_002]) ).
cnf(c_0_63,negated_conjecture,
~ m4(a,a),
c_0_52 ).
cnf(c_0_64,plain,
( m4(X1,X2)
| ~ s2(a) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_65,plain,
( s2(X1)
| ~ q2(b,X1,b)
| ~ s1(b) ),
c_0_55 ).
cnf(c_0_66,plain,
( q2(X1,X2,X1)
| ~ p1(X1,X1,X3)
| ~ n1(X2,X1,X3)
| ~ q2(X2,X3,X1) ),
c_0_56 ).
cnf(c_0_67,plain,
p1(X1,X1,b),
inference(spm,[status(thm)],[c_0_57,c_0_27]) ).
cnf(c_0_68,plain,
( q2(X1,X2,X2)
| ~ k0(X2)
| ~ p1(X1,X1,X1) ),
c_0_58 ).
cnf(c_0_69,plain,
( n1(X1,X2,X2)
| ~ l0(X3)
| ~ l1(X3,X1)
| ~ n1(X1,X2,X1) ),
c_0_59 ).
cnf(c_0_70,plain,
n1(a,X1,a),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_71,plain,
( l1(X1,X1)
| ~ n0(X2,X1) ),
c_0_62 ).
cnf(c_0_72,axiom,
n0(b,a),
axiom_37 ).
cnf(c_0_73,negated_conjecture,
~ s2(a),
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_74,plain,
( s2(X1)
| ~ q2(b,X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_36])]) ).
cnf(c_0_75,plain,
( q2(X1,X2,X1)
| ~ q2(X2,b,X1)
| ~ n1(X2,X1,b) ),
inference(spm,[status(thm)],[c_0_66,c_0_67]) ).
cnf(c_0_76,plain,
( q2(X1,X2,X2)
| ~ k0(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_33])]) ).
cnf(c_0_77,axiom,
k0(b),
axiom_32 ).
cnf(c_0_78,plain,
( n1(a,X1,X1)
| ~ l1(X2,a)
| ~ l0(X2) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_79,plain,
l1(a,a),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_80,negated_conjecture,
~ q2(b,a,b),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_81,plain,
( q2(b,X1,b)
| ~ n1(X1,b,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77])]) ).
cnf(c_0_82,plain,
n1(a,X1,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_61])]) ).
cnf(c_0_83,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYN139-1 : TPTP v8.1.2. Released v1.1.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n022.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Fri May 3 10:38:27 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.47 Running first-order model finding
% 0.18/0.47 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.6L4oNS8MR1/E---3.1_22730.p
% 1.05/0.61 # Version: 3.1.0
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # Starting new_bool_3 with 300s (1) cores
% 1.05/0.61 # Starting new_bool_1 with 300s (1) cores
% 1.05/0.61 # Starting sh5l with 300s (1) cores
% 1.05/0.61 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 22885 completed with status 0
% 1.05/0.61 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # No SInE strategy applied
% 1.05/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 1.05/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 1.05/0.61 # Starting new_bool_3 with 136s (1) cores
% 1.05/0.61 # Starting new_bool_1 with 136s (1) cores
% 1.05/0.61 # Starting sh5l with 136s (1) cores
% 1.05/0.61 # SAT001_MinMin_p005000_rr_RG with pid 22899 completed with status 0
% 1.05/0.61 # Result found by SAT001_MinMin_p005000_rr_RG
% 1.05/0.61 # Preprocessing class: FSLSSMSSSSSNFFN.
% 1.05/0.61 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.05/0.61 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 1.05/0.61 # No SInE strategy applied
% 1.05/0.61 # Search class: FHUNM-FSLM00-SFFFFFNN
% 1.05/0.61 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.05/0.61 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 1.05/0.61 # Preprocessing time : 0.004 s
% 1.05/0.61 # Presaturation interreduction done
% 1.05/0.61
% 1.05/0.61 # Proof found!
% 1.05/0.61 # SZS status Unsatisfiable
% 1.05/0.61 # SZS output start CNFRefutation
% See solution above
% 1.05/0.61 # Parsed axioms : 369
% 1.05/0.61 # Removed by relevancy pruning/SinE : 0
% 1.05/0.61 # Initial clauses : 369
% 1.05/0.61 # Removed in clause preprocessing : 7
% 1.05/0.61 # Initial clauses in saturation : 362
% 1.05/0.61 # Processed clauses : 1844
% 1.05/0.61 # ...of these trivial : 90
% 1.05/0.61 # ...subsumed : 188
% 1.05/0.61 # ...remaining for further processing : 1566
% 1.05/0.61 # Other redundant clauses eliminated : 0
% 1.05/0.61 # Clauses deleted for lack of memory : 0
% 1.05/0.61 # Backward-subsumed : 179
% 1.05/0.61 # Backward-rewritten : 418
% 1.05/0.61 # Generated clauses : 2768
% 1.05/0.61 # ...of the previous two non-redundant : 1779
% 1.05/0.61 # ...aggressively subsumed : 0
% 1.05/0.61 # Contextual simplify-reflections : 3
% 1.05/0.61 # Paramodulations : 2768
% 1.05/0.61 # Factorizations : 0
% 1.05/0.61 # NegExts : 0
% 1.05/0.61 # Equation resolutions : 0
% 1.05/0.61 # Disequality decompositions : 0
% 1.05/0.61 # Total rewrite steps : 2204
% 1.05/0.61 # ...of those cached : 1643
% 1.05/0.61 # Propositional unsat checks : 0
% 1.05/0.61 # Propositional check models : 0
% 1.05/0.61 # Propositional check unsatisfiable : 0
% 1.05/0.61 # Propositional clauses : 0
% 1.05/0.61 # Propositional clauses after purity: 0
% 1.05/0.61 # Propositional unsat core size : 0
% 1.05/0.61 # Propositional preprocessing time : 0.000
% 1.05/0.61 # Propositional encoding time : 0.000
% 1.05/0.61 # Propositional solver time : 0.000
% 1.05/0.61 # Success case prop preproc time : 0.000
% 1.05/0.61 # Success case prop encoding time : 0.000
% 1.05/0.61 # Success case prop solver time : 0.000
% 1.05/0.61 # Current number of processed clauses : 641
% 1.05/0.61 # Positive orientable unit clauses : 251
% 1.05/0.61 # Positive unorientable unit clauses: 0
% 1.05/0.61 # Negative unit clauses : 6
% 1.05/0.61 # Non-unit-clauses : 384
% 1.05/0.61 # Current number of unprocessed clauses: 151
% 1.05/0.61 # ...number of literals in the above : 541
% 1.05/0.61 # Current number of archived formulas : 0
% 1.05/0.61 # Current number of archived clauses : 925
% 1.05/0.61 # Clause-clause subsumption calls (NU) : 74032
% 1.05/0.61 # Rec. Clause-clause subsumption calls : 57294
% 1.05/0.61 # Non-unit clause-clause subsumptions : 310
% 1.05/0.61 # Unit Clause-clause subsumption calls : 6398
% 1.05/0.61 # Rewrite failures with RHS unbound : 0
% 1.05/0.61 # BW rewrite match attempts : 835
% 1.05/0.61 # BW rewrite match successes : 320
% 1.05/0.61 # Condensation attempts : 0
% 1.05/0.61 # Condensation successes : 0
% 1.05/0.61 # Termbank termtop insertions : 42878
% 1.05/0.61 # Search garbage collected termcells : 1461
% 1.05/0.61
% 1.05/0.61 # -------------------------------------------------
% 1.05/0.61 # User time : 0.125 s
% 1.05/0.61 # System time : 0.009 s
% 1.05/0.61 # Total time : 0.133 s
% 1.05/0.61 # Maximum resident set size: 2644 pages
% 1.05/0.61
% 1.05/0.61 # -------------------------------------------------
% 1.05/0.61 # User time : 0.511 s
% 1.05/0.61 # System time : 0.016 s
% 1.05/0.61 # Total time : 0.527 s
% 1.05/0.61 # Maximum resident set size: 2016 pages
% 1.05/0.61 % E---3.1 exiting
%------------------------------------------------------------------------------