TSTP Solution File: NUM591+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM591+1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 08:55:36 EDT 2024
% Result : Timeout 329.26s 37.40s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 29 ( 10 unt; 0 def)
% Number of atoms : 165 ( 26 equ)
% Maximal formula atoms : 33 ( 5 avg)
% Number of connectives : 247 ( 111 ~; 105 |; 24 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 46 ( 0 sgn 12 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1,X2] :
( aElementOf0(X1,xT)
& aSubsetOf0(X2,xY)
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(xd,X3) = X1 ) ),
file('/export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p',m__) ).
fof(m__3398,hypothesis,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ! [X2] :
( ( aSubsetOf0(X2,szNzAzT0)
& isCountable0(X2) )
=> ! [X3] :
( ( aFunction0(X3)
& szDzozmdt0(X3) = slbdtsldtrb0(X2,X1)
& aSubsetOf0(sdtlcdtrc0(X3,szDzozmdt0(X3)),xT) )
=> ( iLess0(X1,xK)
=> ? [X4] :
( aElementOf0(X4,xT)
& ? [X5] :
( aSubsetOf0(X5,X2)
& isCountable0(X5)
& ! [X6] :
( aElementOf0(X6,slbdtsldtrb0(X5,X1))
=> sdtlpdtrp0(X3,X6) = X4 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p',m__3398) ).
fof(m__4423,hypothesis,
iLess0(xk,xK),
file('/export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p',m__4423) ).
fof(m__3533,hypothesis,
( aElementOf0(xk,szNzAzT0)
& szszuzczcdt0(xk) = xK ),
file('/export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p',m__3533) ).
fof(m__4482,hypothesis,
( aSubsetOf0(xY,szNzAzT0)
& isCountable0(xY)
& aFunction0(xd)
& szDzozmdt0(xd) = slbdtsldtrb0(xY,xk)
& aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT) ),
file('/export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p',m__4482) ).
fof(c_0_5,negated_conjecture,
~ ? [X1,X2] :
( aElementOf0(X1,xT)
& aSubsetOf0(X2,xY)
& isCountable0(X2)
& ! [X3] :
( ( aSet0(X3)
& aElementOf0(X3,slbdtsldtrb0(X2,xk)) )
=> sdtlpdtrp0(xd,X3) = X1 ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,hypothesis,
! [X177,X178,X179,X182] :
( ( aElementOf0(esk20_3(X177,X178,X179),xT)
| ~ iLess0(X177,xK)
| ~ aFunction0(X179)
| szDzozmdt0(X179) != slbdtsldtrb0(X178,X177)
| ~ aSubsetOf0(sdtlcdtrc0(X179,szDzozmdt0(X179)),xT)
| ~ aSubsetOf0(X178,szNzAzT0)
| ~ isCountable0(X178)
| ~ aElementOf0(X177,szNzAzT0) )
& ( aSubsetOf0(esk21_3(X177,X178,X179),X178)
| ~ iLess0(X177,xK)
| ~ aFunction0(X179)
| szDzozmdt0(X179) != slbdtsldtrb0(X178,X177)
| ~ aSubsetOf0(sdtlcdtrc0(X179,szDzozmdt0(X179)),xT)
| ~ aSubsetOf0(X178,szNzAzT0)
| ~ isCountable0(X178)
| ~ aElementOf0(X177,szNzAzT0) )
& ( isCountable0(esk21_3(X177,X178,X179))
| ~ iLess0(X177,xK)
| ~ aFunction0(X179)
| szDzozmdt0(X179) != slbdtsldtrb0(X178,X177)
| ~ aSubsetOf0(sdtlcdtrc0(X179,szDzozmdt0(X179)),xT)
| ~ aSubsetOf0(X178,szNzAzT0)
| ~ isCountable0(X178)
| ~ aElementOf0(X177,szNzAzT0) )
& ( ~ aElementOf0(X182,slbdtsldtrb0(esk21_3(X177,X178,X179),X177))
| sdtlpdtrp0(X179,X182) = esk20_3(X177,X178,X179)
| ~ iLess0(X177,xK)
| ~ aFunction0(X179)
| szDzozmdt0(X179) != slbdtsldtrb0(X178,X177)
| ~ aSubsetOf0(sdtlcdtrc0(X179,szDzozmdt0(X179)),xT)
| ~ aSubsetOf0(X178,szNzAzT0)
| ~ isCountable0(X178)
| ~ aElementOf0(X177,szNzAzT0) ) ),
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)],[m__3398])])])])])]) ).
fof(c_0_7,negated_conjecture,
! [X197,X198] :
( ( aSet0(esk22_2(X197,X198))
| ~ aElementOf0(X197,xT)
| ~ aSubsetOf0(X198,xY)
| ~ isCountable0(X198) )
& ( aElementOf0(esk22_2(X197,X198),slbdtsldtrb0(X198,xk))
| ~ aElementOf0(X197,xT)
| ~ aSubsetOf0(X198,xY)
| ~ isCountable0(X198) )
& ( sdtlpdtrp0(xd,esk22_2(X197,X198)) != X197
| ~ aElementOf0(X197,xT)
| ~ aSubsetOf0(X198,xY)
| ~ isCountable0(X198) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).
cnf(c_0_8,hypothesis,
( sdtlpdtrp0(X4,X1) = esk20_3(X2,X3,X4)
| ~ aElementOf0(X1,slbdtsldtrb0(esk21_3(X2,X3,X4),X2))
| ~ iLess0(X2,xK)
| ~ aFunction0(X4)
| szDzozmdt0(X4) != slbdtsldtrb0(X3,X2)
| ~ aSubsetOf0(sdtlcdtrc0(X4,szDzozmdt0(X4)),xT)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ isCountable0(X3)
| ~ aElementOf0(X2,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
( aElementOf0(esk22_2(X1,X2),slbdtsldtrb0(X2,xk))
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
iLess0(xk,xK),
inference(split_conjunct,[status(thm)],[m__4423]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3533]) ).
cnf(c_0_12,negated_conjecture,
( sdtlpdtrp0(xd,esk22_2(X1,X2)) != X1
| ~ aElementOf0(X1,xT)
| ~ aSubsetOf0(X2,xY)
| ~ isCountable0(X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,negated_conjecture,
( sdtlpdtrp0(X1,esk22_2(X2,esk21_3(xk,X3,X1))) = esk20_3(xk,X3,X1)
| szDzozmdt0(X1) != slbdtsldtrb0(X3,xk)
| ~ aFunction0(X1)
| ~ aSubsetOf0(sdtlcdtrc0(X1,szDzozmdt0(X1)),xT)
| ~ aSubsetOf0(esk21_3(xk,X3,X1),xY)
| ~ aSubsetOf0(X3,szNzAzT0)
| ~ isCountable0(esk21_3(xk,X3,X1))
| ~ isCountable0(X3)
| ~ aElementOf0(X2,xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11])]) ).
cnf(c_0_14,hypothesis,
aFunction0(xd),
inference(split_conjunct,[status(thm)],[m__4482]) ).
cnf(c_0_15,hypothesis,
aSubsetOf0(sdtlcdtrc0(xd,szDzozmdt0(xd)),xT),
inference(split_conjunct,[status(thm)],[m__4482]) ).
cnf(c_0_16,hypothesis,
( isCountable0(esk21_3(X1,X2,X3))
| ~ iLess0(X1,xK)
| ~ aFunction0(X3)
| szDzozmdt0(X3) != slbdtsldtrb0(X2,X1)
| ~ aSubsetOf0(sdtlcdtrc0(X3,szDzozmdt0(X3)),xT)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( slbdtsldtrb0(X1,xk) != szDzozmdt0(xd)
| ~ aSubsetOf0(esk21_3(xk,X1,xd),xY)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isCountable0(esk21_3(xk,X1,xd))
| ~ isCountable0(X1)
| ~ aElementOf0(esk20_3(xk,X1,xd),xT) ),
inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])])]) ).
cnf(c_0_18,hypothesis,
( isCountable0(esk21_3(X1,X2,xd))
| slbdtsldtrb0(X2,X1) != szDzozmdt0(xd)
| ~ iLess0(X1,xK)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_15]),c_0_14])]) ).
cnf(c_0_19,hypothesis,
( aSubsetOf0(esk21_3(X1,X2,X3),X2)
| ~ iLess0(X1,xK)
| ~ aFunction0(X3)
| szDzozmdt0(X3) != slbdtsldtrb0(X2,X1)
| ~ aSubsetOf0(sdtlcdtrc0(X3,szDzozmdt0(X3)),xT)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,hypothesis,
( slbdtsldtrb0(X1,xk) != szDzozmdt0(xd)
| ~ aSubsetOf0(esk21_3(xk,X1,xd),xY)
| ~ aSubsetOf0(X1,szNzAzT0)
| ~ isCountable0(X1)
| ~ aElementOf0(esk20_3(xk,X1,xd),xT) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_10]),c_0_11])]) ).
cnf(c_0_21,hypothesis,
( aSubsetOf0(esk21_3(X1,X2,xd),X2)
| slbdtsldtrb0(X2,X1) != szDzozmdt0(xd)
| ~ iLess0(X1,xK)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_15]),c_0_14])]) ).
cnf(c_0_22,hypothesis,
szDzozmdt0(xd) = slbdtsldtrb0(xY,xk),
inference(split_conjunct,[status(thm)],[m__4482]) ).
cnf(c_0_23,hypothesis,
aSubsetOf0(xY,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__4482]) ).
cnf(c_0_24,hypothesis,
isCountable0(xY),
inference(split_conjunct,[status(thm)],[m__4482]) ).
cnf(c_0_25,hypothesis,
( aElementOf0(esk20_3(X1,X2,X3),xT)
| ~ iLess0(X1,xK)
| ~ aFunction0(X3)
| szDzozmdt0(X3) != slbdtsldtrb0(X2,X1)
| ~ aSubsetOf0(sdtlcdtrc0(X3,szDzozmdt0(X3)),xT)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,hypothesis,
~ aElementOf0(esk20_3(xk,xY,xd),xT),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_10]),c_0_11])]) ).
cnf(c_0_27,hypothesis,
( aElementOf0(esk20_3(X1,X2,xd),xT)
| slbdtsldtrb0(X2,X1) != szDzozmdt0(xd)
| ~ iLess0(X1,xK)
| ~ aSubsetOf0(X2,szNzAzT0)
| ~ isCountable0(X2)
| ~ aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_15]),c_0_14])]) ).
cnf(c_0_28,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_22]),c_0_10]),c_0_23]),c_0_24]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM591+1 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n017.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:00:06 EDT 2024
% 0.15/0.35 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.84NZOyU3NX/E---3.1_11015.p
% 329.26/37.40 # Version: 3.1.0
% 329.26/37.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 329.26/37.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 329.26/37.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 329.26/37.40 # Starting new_bool_3 with 300s (1) cores
% 329.26/37.40 # Starting new_bool_1 with 300s (1) cores
% 329.26/37.40 # Starting sh5l with 300s (1) cores
% 329.26/37.40 # C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 11161 completed with status 7
% 329.26/37.40 # Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 329.26/37.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 329.26/37.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 329.26/37.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 329.26/37.40 # No SInE strategy applied
% 329.26/37.40 # Search class: FGHSF-FSLM32-MFFFFFNN
% 329.26/37.40 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 329.26/37.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 329.26/37.40 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 329.26/37.40 # Starting G-E--_302_C18_F1_URBAN_S0Y with 151s (1) cores
% 329.26/37.40 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S0U with 151s (1) cores
% 329.26/37.40 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 146s (1) cores
% 329.26/37.40 # G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 11168 completed with status 0
% 329.26/37.40 # Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 329.26/37.40 # Preprocessing class: FSLSSMSMSSSNFFN.
% 329.26/37.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 329.26/37.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 329.26/37.40 # No SInE strategy applied
% 329.26/37.40 # Search class: FGHSF-FSLM32-MFFFFFNN
% 329.26/37.40 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 329.26/37.40 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 901s (1) cores
% 329.26/37.40 # Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 329.26/37.40 # Preprocessing time : 0.006 s
% 329.26/37.40
% 329.26/37.40 # Proof found!
% 329.26/37.40 # SZS status Theorem
% 329.26/37.40 # SZS output start CNFRefutation
% See solution above
% 329.26/37.40 # Parsed axioms : 93
% 329.26/37.40 # Removed by relevancy pruning/SinE : 0
% 329.26/37.40 # Initial clauses : 189
% 329.26/37.40 # Removed in clause preprocessing : 7
% 329.26/37.40 # Initial clauses in saturation : 182
% 329.26/37.40 # Processed clauses : 46753
% 329.26/37.40 # ...of these trivial : 156
% 329.26/37.40 # ...subsumed : 29828
% 329.26/37.40 # ...remaining for further processing : 16769
% 329.26/37.40 # Other redundant clauses eliminated : 181
% 329.26/37.40 # Clauses deleted for lack of memory : 0
% 329.26/37.40 # Backward-subsumed : 1580
% 329.26/37.40 # Backward-rewritten : 2178
% 329.26/37.40 # Generated clauses : 915844
% 329.26/37.40 # ...of the previous two non-redundant : 885520
% 329.26/37.40 # ...aggressively subsumed : 0
% 329.26/37.40 # Contextual simplify-reflections : 1821
% 329.26/37.40 # Paramodulations : 915658
% 329.26/37.40 # Factorizations : 1
% 329.26/37.40 # NegExts : 0
% 329.26/37.40 # Equation resolutions : 188
% 329.26/37.40 # Disequality decompositions : 0
% 329.26/37.40 # Total rewrite steps : 198237
% 329.26/37.40 # ...of those cached : 198016
% 329.26/37.40 # Propositional unsat checks : 0
% 329.26/37.40 # Propositional check models : 0
% 329.26/37.40 # Propositional check unsatisfiable : 0
% 329.26/37.40 # Propositional clauses : 0
% 329.26/37.40 # Propositional clauses after purity: 0
% 329.26/37.40 # Propositional unsat core size : 0
% 329.26/37.40 # Propositional preprocessing time : 0.000
% 329.26/37.40 # Propositional encoding time : 0.000
% 329.26/37.40 # Propositional solver time : 0.000
% 329.26/37.40 # Success case prop preproc time : 0.000
% 329.26/37.40 # Success case prop encoding time : 0.000
% 329.26/37.40 # Success case prop solver time : 0.000
% 329.26/37.40 # Current number of processed clauses : 12969
% 329.26/37.40 # Positive orientable unit clauses : 226
% 329.26/37.40 # Positive unorientable unit clauses: 0
% 329.26/37.40 # Negative unit clauses : 131
% 329.26/37.40 # Non-unit-clauses : 12612
% 329.26/37.40 # Current number of unprocessed clauses: 817975
% 329.26/37.40 # ...number of literals in the above : 5032225
% 329.26/37.40 # Current number of archived formulas : 0
% 329.26/37.40 # Current number of archived clauses : 3760
% 329.26/37.40 # Clause-clause subsumption calls (NU) : 43323772
% 329.26/37.40 # Rec. Clause-clause subsumption calls : 6825735
% 329.26/37.40 # Non-unit clause-clause subsumptions : 22520
% 329.26/37.40 # Unit Clause-clause subsumption calls : 246697
% 329.26/37.40 # Rewrite failures with RHS unbound : 0
% 329.26/37.40 # BW rewrite match attempts : 193
% 329.26/37.40 # BW rewrite match successes : 60
% 329.26/37.40 # Condensation attempts : 0
% 329.26/37.40 # Condensation successes : 0
% 329.26/37.40 # Termbank termtop insertions : 33166452
% 329.26/37.40 # Search garbage collected termcells : 3622
% 329.26/37.40
% 329.26/37.40 # -------------------------------------------------
% 329.26/37.40 # User time : 35.772 s
% 329.26/37.40 # System time : 0.730 s
% 329.26/37.40 # Total time : 36.502 s
% 329.26/37.40 # Maximum resident set size: 2388 pages
% 329.26/37.40
% 329.26/37.40 # -------------------------------------------------
% 329.26/37.40 # User time : 142.746 s
% 329.26/37.40 # System time : 2.836 s
% 329.26/37.40 # Total time : 145.581 s
% 329.26/37.40 # Maximum resident set size: 1812 pages
% 329.26/37.40 % E---3.1 exiting
% 329.26/37.40 % E exiting
%------------------------------------------------------------------------------