TSTP Solution File: SET720+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:23:27 EDT 2023
% Result : Theorem 57.57s 7.97s
% Output : CNFRefutation 57.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 30 ( 11 unt; 0 def)
% Number of atoms : 155 ( 12 equ)
% Maximal formula atoms : 55 ( 5 avg)
% Number of connectives : 183 ( 58 ~; 80 |; 34 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-4 aty)
% Number of variables : 92 ( 0 sgn; 52 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII11,conjecture,
! [X6,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X6,X1,X2),X2,X1),X6,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.EydGzQ24VR/E---3.1_1933.p',thII11) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X10,X3,X8) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EydGzQ24VR/E---3.1_1933.p',equal_maps) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5) ) )
& ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X6,X3,X8) )
=> X7 = X8 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.EydGzQ24VR/E---3.1_1933.p',maps) ).
fof(inverse_function,axiom,
! [X6,X1,X2,X3,X5] :
( ( member(X3,X1)
& member(X5,X2) )
=> ( apply(X6,X3,X5)
<=> apply(inverse_function(X6,X1,X2),X5,X3) ) ),
file('/export/starexec/sandbox/tmp/tmp.EydGzQ24VR/E---3.1_1933.p',inverse_function) ).
fof(c_0_4,negated_conjecture,
~ ! [X6,X1,X2] :
( ( maps(X6,X1,X2)
& one_to_one(X6,X1,X2) )
=> equal_maps(inverse_function(inverse_function(X6,X1,X2),X2,X1),X6,X1,X2) ),
inference(assume_negation,[status(cth)],[thII11]) ).
fof(c_0_5,negated_conjecture,
( maps(esk41_0,esk42_0,esk43_0)
& one_to_one(esk41_0,esk42_0,esk43_0)
& ~ equal_maps(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
fof(c_0_6,plain,
! [X99,X100,X101,X102,X103,X104,X105,X106,X107,X108,X109] :
( ( ~ equal_maps(X99,X100,X101,X102)
| ~ member(X103,X101)
| ~ member(X104,X102)
| ~ member(X105,X102)
| ~ apply(X99,X103,X104)
| ~ apply(X100,X103,X105)
| X104 = X105 )
& ( member(esk14_4(X106,X107,X108,X109),X108)
| equal_maps(X106,X107,X108,X109) )
& ( member(esk15_4(X106,X107,X108,X109),X109)
| equal_maps(X106,X107,X108,X109) )
& ( member(esk16_4(X106,X107,X108,X109),X109)
| equal_maps(X106,X107,X108,X109) )
& ( apply(X106,esk14_4(X106,X107,X108,X109),esk15_4(X106,X107,X108,X109))
| equal_maps(X106,X107,X108,X109) )
& ( apply(X107,esk14_4(X106,X107,X108,X109),esk16_4(X106,X107,X108,X109))
| equal_maps(X106,X107,X108,X109) )
& ( esk15_4(X106,X107,X108,X109) != esk16_4(X106,X107,X108,X109)
| equal_maps(X106,X107,X108,X109) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_maps])])])])])]) ).
fof(c_0_7,plain,
! [X54,X55,X56,X57,X59,X60,X61,X62,X63,X64,X66] :
( ( member(esk4_4(X54,X55,X56,X57),X56)
| ~ member(X57,X55)
| ~ maps(X54,X55,X56) )
& ( apply(X54,X57,esk4_4(X54,X55,X56,X57))
| ~ member(X57,X55)
| ~ maps(X54,X55,X56) )
& ( ~ member(X59,X55)
| ~ member(X60,X56)
| ~ member(X61,X56)
| ~ apply(X54,X59,X60)
| ~ apply(X54,X59,X61)
| X60 = X61
| ~ maps(X54,X55,X56) )
& ( member(esk6_3(X62,X63,X64),X63)
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( member(esk7_3(X62,X63,X64),X64)
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( member(esk8_3(X62,X63,X64),X64)
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( apply(X62,esk6_3(X62,X63,X64),esk7_3(X62,X63,X64))
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( apply(X62,esk6_3(X62,X63,X64),esk8_3(X62,X63,X64))
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( esk7_3(X62,X63,X64) != esk8_3(X62,X63,X64)
| member(esk5_3(X62,X63,X64),X63)
| maps(X62,X63,X64) )
& ( member(esk6_3(X62,X63,X64),X63)
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) )
& ( member(esk7_3(X62,X63,X64),X64)
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) )
& ( member(esk8_3(X62,X63,X64),X64)
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) )
& ( apply(X62,esk6_3(X62,X63,X64),esk7_3(X62,X63,X64))
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) )
& ( apply(X62,esk6_3(X62,X63,X64),esk8_3(X62,X63,X64))
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) )
& ( esk7_3(X62,X63,X64) != esk8_3(X62,X63,X64)
| ~ member(X66,X64)
| ~ apply(X62,esk5_3(X62,X63,X64),X66)
| maps(X62,X63,X64) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[maps])])])])])]) ).
fof(c_0_8,plain,
! [X156,X157,X158,X159,X160] :
( ( ~ apply(X156,X159,X160)
| apply(inverse_function(X156,X157,X158),X160,X159)
| ~ member(X159,X157)
| ~ member(X160,X158) )
& ( ~ apply(inverse_function(X156,X157,X158),X160,X159)
| apply(X156,X159,X160)
| ~ member(X159,X157)
| ~ member(X160,X158) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inverse_function])])]) ).
cnf(c_0_9,negated_conjecture,
~ equal_maps(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( apply(X1,esk14_4(X1,X2,X3,X4),esk15_4(X1,X2,X3,X4))
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( member(esk15_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,plain,
( member(esk14_4(X1,X2,X3,X4),X3)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( X3 = X5
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ member(X5,X4)
| ~ apply(X6,X1,X3)
| ~ apply(X6,X1,X5)
| ~ maps(X6,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,negated_conjecture,
maps(esk41_0,esk42_0,esk43_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_15,plain,
( apply(X1,esk14_4(X2,X1,X3,X4),esk16_4(X2,X1,X3,X4))
| equal_maps(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( member(esk16_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( apply(X1,X5,X4)
| ~ apply(inverse_function(X1,X2,X3),X4,X5)
| ~ member(X5,X2)
| ~ member(X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,negated_conjecture,
apply(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_19,negated_conjecture,
member(esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk43_0),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_20,negated_conjecture,
member(esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk42_0),
inference(spm,[status(thm)],[c_0_9,c_0_12]) ).
cnf(c_0_21,negated_conjecture,
( X1 = X2
| ~ apply(esk41_0,X3,X2)
| ~ apply(esk41_0,X3,X1)
| ~ member(X2,esk43_0)
| ~ member(X1,esk43_0)
| ~ member(X3,esk42_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_22,negated_conjecture,
apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
member(esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk43_0),
inference(spm,[status(thm)],[c_0_9,c_0_16]) ).
cnf(c_0_24,negated_conjecture,
apply(inverse_function(esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_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])]) ).
cnf(c_0_25,plain,
( equal_maps(X1,X2,X3,X4)
| esk15_4(X1,X2,X3,X4) != esk16_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_26,negated_conjecture,
( esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) = X1
| ~ apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),X1)
| ~ member(X1,esk43_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_20])]) ).
cnf(c_0_27,negated_conjecture,
apply(esk41_0,esk14_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_20]),c_0_19])]) ).
cnf(c_0_28,negated_conjecture,
esk16_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0) != esk15_4(inverse_function(inverse_function(esk41_0,esk42_0,esk43_0),esk43_0,esk42_0),esk41_0,esk42_0,esk43_0),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_19])]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET720+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.05/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n006.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:15:10 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.16/0.42 Running first-order model finding
% 0.16/0.42 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.EydGzQ24VR/E---3.1_1933.p
% 57.57/7.97 # Version: 3.1pre001
% 57.57/7.97 # Preprocessing class: FSLSSMSSSSSNFFN.
% 57.57/7.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.57/7.97 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 57.57/7.97 # Starting new_bool_3 with 300s (1) cores
% 57.57/7.97 # Starting new_bool_1 with 300s (1) cores
% 57.57/7.97 # Starting sh5l with 300s (1) cores
% 57.57/7.97 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 2012 completed with status 0
% 57.57/7.97 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 57.57/7.97 # Preprocessing class: FSLSSMSSSSSNFFN.
% 57.57/7.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.57/7.97 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 57.57/7.97 # No SInE strategy applied
% 57.57/7.97 # Search class: FGHSF-FSLF33-SFFFFFNN
% 57.57/7.97 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 57.57/7.97 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S026I with 477s (1) cores
% 57.57/7.97 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 57.57/7.97 # Starting new_bool_3 with 239s (1) cores
% 57.57/7.97 # Starting new_bool_1 with 239s (1) cores
% 57.57/7.97 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S002A with 159s (1) cores
% 57.57/7.97 # G-E--_208_C18_F1_SE_CS_SP_PS_S026I with pid 2019 completed with status 0
% 57.57/7.97 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S026I
% 57.57/7.97 # Preprocessing class: FSLSSMSSSSSNFFN.
% 57.57/7.97 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 57.57/7.97 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 57.57/7.97 # No SInE strategy applied
% 57.57/7.97 # Search class: FGHSF-FSLF33-SFFFFFNN
% 57.57/7.97 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 57.57/7.97 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S026I with 477s (1) cores
% 57.57/7.97 # Preprocessing time : 0.002 s
% 57.57/7.97 # Presaturation interreduction done
% 57.57/7.97
% 57.57/7.97 # Proof found!
% 57.57/7.97 # SZS status Theorem
% 57.57/7.97 # SZS output start CNFRefutation
% See solution above
% 57.57/7.97 # Parsed axioms : 29
% 57.57/7.97 # Removed by relevancy pruning/SinE : 0
% 57.57/7.97 # Initial clauses : 137
% 57.57/7.97 # Removed in clause preprocessing : 0
% 57.57/7.97 # Initial clauses in saturation : 137
% 57.57/7.97 # Processed clauses : 21444
% 57.57/7.97 # ...of these trivial : 1798
% 57.57/7.97 # ...subsumed : 16198
% 57.57/7.97 # ...remaining for further processing : 3448
% 57.57/7.97 # Other redundant clauses eliminated : 3
% 57.57/7.97 # Clauses deleted for lack of memory : 0
% 57.57/7.97 # Backward-subsumed : 36
% 57.57/7.97 # Backward-rewritten : 53
% 57.57/7.97 # Generated clauses : 522234
% 57.57/7.97 # ...of the previous two non-redundant : 509717
% 57.57/7.97 # ...aggressively subsumed : 0
% 57.57/7.97 # Contextual simplify-reflections : 3
% 57.57/7.97 # Paramodulations : 522225
% 57.57/7.97 # Factorizations : 6
% 57.57/7.97 # NegExts : 0
% 57.57/7.97 # Equation resolutions : 3
% 57.57/7.97 # Total rewrite steps : 16264
% 57.57/7.97 # Propositional unsat checks : 0
% 57.57/7.97 # Propositional check models : 0
% 57.57/7.97 # Propositional check unsatisfiable : 0
% 57.57/7.97 # Propositional clauses : 0
% 57.57/7.97 # Propositional clauses after purity: 0
% 57.57/7.97 # Propositional unsat core size : 0
% 57.57/7.97 # Propositional preprocessing time : 0.000
% 57.57/7.97 # Propositional encoding time : 0.000
% 57.57/7.97 # Propositional solver time : 0.000
% 57.57/7.97 # Success case prop preproc time : 0.000
% 57.57/7.97 # Success case prop encoding time : 0.000
% 57.57/7.97 # Success case prop solver time : 0.000
% 57.57/7.97 # Current number of processed clauses : 3219
% 57.57/7.97 # Positive orientable unit clauses : 1179
% 57.57/7.97 # Positive unorientable unit clauses: 0
% 57.57/7.97 # Negative unit clauses : 844
% 57.57/7.97 # Non-unit-clauses : 1196
% 57.57/7.97 # Current number of unprocessed clauses: 486210
% 57.57/7.97 # ...number of literals in the above : 967548
% 57.57/7.97 # Current number of archived formulas : 0
% 57.57/7.97 # Current number of archived clauses : 226
% 57.57/7.97 # Clause-clause subsumption calls (NU) : 503288
% 57.57/7.97 # Rec. Clause-clause subsumption calls : 263404
% 57.57/7.97 # Non-unit clause-clause subsumptions : 840
% 57.57/7.97 # Unit Clause-clause subsumption calls : 469964
% 57.57/7.97 # Rewrite failures with RHS unbound : 0
% 57.57/7.97 # BW rewrite match attempts : 24049
% 57.57/7.97 # BW rewrite match successes : 42
% 57.57/7.97 # Condensation attempts : 0
% 57.57/7.97 # Condensation successes : 0
% 57.57/7.97 # Termbank termtop insertions : 7516829
% 57.57/7.97
% 57.57/7.97 # -------------------------------------------------
% 57.57/7.97 # User time : 7.009 s
% 57.57/7.97 # System time : 0.334 s
% 57.57/7.97 # Total time : 7.343 s
% 57.57/7.97 # Maximum resident set size: 2276 pages
% 57.57/7.97
% 57.57/7.97 # -------------------------------------------------
% 57.57/7.97 # User time : 35.281 s
% 57.57/7.97 # System time : 1.032 s
% 57.57/7.97 # Total time : 36.314 s
% 57.57/7.97 # Maximum resident set size: 1740 pages
% 57.57/7.98 % E---3.1 exiting
%------------------------------------------------------------------------------