TSTP Solution File: GRA028^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : GRA028^1 : TPTP v8.2.0. Released v3.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : Mon May 20 20:41:02 EDT 2024
% Result : Theorem 1.68s 0.69s
% Output : CNFRefutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 6 unt; 2 typ; 0 def)
% Number of atoms : 99 ( 47 equ; 0 cnn)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 434 ( 73 ~; 122 |; 40 &; 189 @)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 34 ( 13 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 133 ( 133 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 2 usr; 3 con; 0-2 aty)
% Number of variables : 115 ( 8 ^ 87 !; 20 ?; 115 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
epred1_0: ( $o > $o ) > ( $o > $o ) > $o ).
thf(decl_23,type,
epred2_0: ( $o > $o ) > $o ).
thf(ramsey_u_2_4_4,conjecture,
! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
=> ( ? [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ( X1 @ X5 @ X4 ) )
| ? [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X9 @ X4 )
& ( X9 @ X5 )
& ~ ( X9 @ X7 )
& ~ ( X9 @ X8 )
& ~ ( X10 @ X4 )
& ~ ( X10 @ X5 )
& ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X1 @ X5 @ X4 )
& ~ ( X1 @ X7 @ X4 )
& ~ ( X1 @ X7 @ X5 )
& ~ ( X1 @ X8 @ X4 )
& ~ ( X1 @ X8 @ X5 )
& ~ ( X1 @ X8 @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ramsey_u_2_4_4) ).
thf(c_0_1,negated_conjecture,
~ ! [X1: ( $o > $o ) > ( $o > $o ) > $o] :
( ! [X2: $o > $o,X3: $o > $o] :
( ( X1 @ X2 @ X3 )
=> ( X1 @ X3 @ X2 ) )
=> ( ? [X4: $o > $o,X5: $o > $o,X6: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ( X1 @ X5 @ X4 ) )
| ? [X4: $o > $o,X5: $o > $o,X7: $o > $o,X8: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o] :
( ( X6 @ X4 )
& ~ ( X6 @ X5 )
& ~ ( X6 @ X7 )
& ~ ( X6 @ X8 )
& ~ ( X9 @ X4 )
& ( X9 @ X5 )
& ~ ( X9 @ X7 )
& ~ ( X9 @ X8 )
& ~ ( X10 @ X4 )
& ~ ( X10 @ X5 )
& ( X10 @ X7 )
& ~ ( X10 @ X8 )
& ~ ( X1 @ X5 @ X4 )
& ~ ( X1 @ X7 @ X4 )
& ~ ( X1 @ X7 @ X5 )
& ~ ( X1 @ X8 @ X4 )
& ~ ( X1 @ X8 @ X5 )
& ~ ( X1 @ X8 @ X7 ) ) ) ),
inference(assume_negation,[status(cth)],[ramsey_u_2_4_4]) ).
thf(c_0_2,negated_conjecture,
! [X25: $o > $o,X26: $o > $o,X27: $o > $o,X28: $o > $o,X29: ( $o > $o ) > $o,X30: $o > $o,X31: $o > $o,X32: $o > $o,X33: $o > $o,X34: ( $o > $o ) > $o,X35: ( $o > $o ) > $o,X36: ( $o > $o ) > $o] :
( ( ~ ( epred1_0 @ X25 @ X26 )
| ( epred1_0 @ X26 @ X25 ) )
& ( ~ ( X29 @ X27 )
| ( X29 @ X28 )
| ~ ( epred1_0 @ X28 @ X27 ) )
& ( ~ ( X34 @ X30 )
| ( X34 @ X31 )
| ( X34 @ X32 )
| ( X34 @ X33 )
| ( X35 @ X30 )
| ~ ( X35 @ X31 )
| ( X35 @ X32 )
| ( X35 @ X33 )
| ( X36 @ X30 )
| ( X36 @ X31 )
| ~ ( X36 @ X32 )
| ( X36 @ X33 )
| ( epred1_0 @ X31 @ X30 )
| ( epred1_0 @ X32 @ X30 )
| ( epred1_0 @ X32 @ X31 )
| ( epred1_0 @ X33 @ X30 )
| ( epred1_0 @ X33 @ X31 )
| ( epred1_0 @ X33 @ X32 ) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])]) ).
thf(c_0_3,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X6: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X10: ( $o > $o ) > $o,X5: $o > $o,X4: $o > $o] :
( ( X6 @ X3 )
| ( X6 @ X4 )
| ( X6 @ X5 )
| ( X9 @ X2 )
| ( X9 @ X4 )
| ( X9 @ X5 )
| ( X10 @ X2 )
| ( X10 @ X3 )
| ( X10 @ X5 )
| ( epred1_0 @ X3 @ X2 )
| ( epred1_0 @ X4 @ X2 )
| ( epred1_0 @ X4 @ X3 )
| ( epred1_0 @ X5 @ X2 )
| ( epred1_0 @ X5 @ X3 )
| ( epred1_0 @ X5 @ X4 )
| ~ ( X6 @ X2 )
| ~ ( X9 @ X3 )
| ~ ( X10 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_4,negated_conjecture,
! [X6: ( $o > $o ) > $o,X3: $o > $o,X2: $o > $o] :
( ( X6 @ X3 )
| ~ ( X6 @ X2 )
| ~ ( epred1_0 @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
! [X37: $o > $o,X38: $o] :
( ( X37 @ ( epred2_0 @ X37 ) )
| ~ ( X37 @ X38 ) ),
inference(introduce_choice_axiom,[status(thm)],]) ).
thf(c_0_6,negated_conjecture,
! [X2: $o > $o,X4: $o > $o,X3: $o > $o,X10: ( $o > $o ) > $o,X9: ( $o > $o ) > $o,X6: ( $o > $o ) > $o,X5: $o > $o] :
( ( X6 @ X2 )
| ( X6 @ X3 )
| ( X6 @ X4 )
| ( X9 @ X5 )
| ( X9 @ X3 )
| ( X9 @ X4 )
| ( X10 @ X5 )
| ( X10 @ X2 )
| ( X10 @ X4 )
| ~ ( X10 @ X3 )
| ~ ( X9 @ X2 )
| ~ ( X6 @ X5 ) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
! [X2: $o > $o,X38: $o] :
( ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X2 @ X38 ) ),
inference(choice_inst,[status(thm)],[c_0_4,c_0_5]) ).
thf(c_0_8,negated_conjecture,
! [X3: $o > $o,X5: $o > $o,X9: ( $o > $o ) > $o,X6: ( $o > $o ) > $o,X4: $o > $o,X2: $o > $o] :
( ( X2 = X3 )
| ( X4 = X3 )
| ( X5 = X3 )
| ( X6 @ X4 )
| ( X6 @ X3 )
| ( X6 @ X5 )
| ( X9 @ X2 )
| ( X9 @ X3 )
| ( X9 @ X5 )
| ~ ( X9 @ X4 )
| ~ ( X6 @ X2 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_6]) ).
thf(c_0_9,negated_conjecture,
! [X38: $o] :
( ( epred2_0
@ ^ [Z0: $o] : ( Z0 = X38 ) )
<=> X38 ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_7]) ).
thf(c_0_10,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X6: ( $o > $o ) > $o,X5: $o > $o,X4: $o > $o] :
( ( X2 = X3 )
| ( X4 = X3 )
| ( X2 = X5 )
| ( X3 = X5 )
| ( X4 = X5 )
| ( X6 @ X2 )
| ( X6 @ X5 )
| ( X6 @ X3 )
| ~ ( X6 @ X4 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( epred2_0
@ ^ [Z0: $o] : ~ Z0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_12,negated_conjecture,
! [X3: $o > $o,X2: $o > $o,X4: $o > $o,X5: $o > $o] :
( ( X2 = X3 )
| ( X3 = X4 )
| ( X5 = X4 )
| ( X2 = X4 )
| ( X3 = X5 )
| ( X2 = X5 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]),c_0_10]) ).
thf(c_0_13,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X4: $o > $o] :
( ( X2 = $not )
| ( $not = X3 )
| ( X4 = X3 )
| ( X2 = X3 )
| ( X4 = X2 )
| ~ ( epred2_0 @ X4 ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_14,negated_conjecture,
! [X2: $o > $o,X3: $o > $o,X469: $o,X4: $o > $o] :
( ( ( X2 @ X469 )
<=> ~ X469 )
| ( $not = X3 )
| ( X4 = X2 )
| ( X2 = X3 )
| ( X4 = X3 )
| ~ ( epred2_0 @ X4 ) ),
inference(arg_cong,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X2: $o > $o,X4: $o > $o,X3: $o > $o] :
( ( $not = X2 )
| ( X3 = X2 )
| ( X4 = X2 )
| ( X3 = X4 )
| ( X4 @ ~ $true )
| ~ ( epred2_0 @ X3 ) ),
inference(dynamic_cnf,[status(thm)],[c_0_14]) ).
thf(c_0_16,negated_conjecture,
( epred2_0
@ ^ [Z0: $o] : Z0 ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_9])]) ).
thf(c_0_17,negated_conjecture,
! [X3: $o > $o,X2: $o > $o] :
( ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( ( ^ [Z0: $o] : Z0 )
= X3 )
| ( $not = X3 )
| ( X2 = X3 )
| ( X2 @ ~ $true ) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_18,negated_conjecture,
! [X1039: $o,X3: $o > $o,X2: $o > $o] :
( ( $not = X3 )
| ( ( ^ [Z0: $o] : Z0 )
= X3 )
| ( X1039
<=> ( X2 @ X1039 ) )
| ( X2 = X3 )
| ( X2 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( $not = X2 )
| ( X3 = X2 )
| ( X3 @ ~ $true )
| ( X3 @ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_18])]) ).
thf(c_0_20,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( $not = X2 )
| ( ( ^ [Z0: $o] : Z0 )
= X2 )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_19]),c_0_7]) ).
thf(c_0_21,negated_conjecture,
! [X2: $o > $o,X1589: $o,X3: $o > $o] :
( ( $not = X2 )
| ( X1589
<=> ( X2 @ X1589 ) )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) ) ),
inference(arg_cong,[status(thm)],[c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X3: $o > $o,X2: $o > $o] :
( ( $not = X2 )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) )
| ~ ( X2 @ ~ $true ) ),
inference(dynamic_cnf,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X1607: $o,X3: $o > $o,X2: $o > $o] :
( ( ~ X1607
<=> ( X2 @ X1607 ) )
| ( X3 = X2 )
| ( X3 @ ( epred2_0 @ X3 ) )
| ~ ( X2 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_22]) ).
thf(c_0_24,negated_conjecture,
! [X2: $o > $o,X3: $o > $o] :
( ( X2 = X3 )
| ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X3 @ $true )
| ~ ( X3 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_23])]) ).
thf(c_0_25,negated_conjecture,
! [X2: $o > $o,X1644: $o,X3: $o > $o] :
( ( ( X2 @ X1644 )
<=> ( X3 @ X1644 ) )
| ( X2 @ ( epred2_0 @ X2 ) )
| ~ ( X3 @ $true )
| ~ ( X3 @ ~ $true ) ),
inference(arg_cong,[status(thm)],[c_0_24]) ).
thf(c_0_26,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(cn,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_25])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : GRA028^1 : TPTP v8.2.0. Released v3.6.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n011.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Sat May 18 12:42:52 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.68/0.69 # Version: 3.1.0-ho
% 1.68/0.69 # Preprocessing class: HSMSSMSSSSSNHHA.
% 1.68/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting full_lambda_6 with 900s (3) cores
% 1.68/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.68/0.69 # Starting lpo6_lambda_fix with 300s (1) cores
% 1.68/0.69 # Starting ho_unfolding_1 with 300s (1) cores
% 1.68/0.69 # Starting new_ho_10_unif with 300s (1) cores
% 1.68/0.69 # Starting ho_unfolding_2 with 300s (1) cores
% 1.68/0.69 # lpo6_lambda_fix with pid 19479 completed with status 0
% 1.68/0.69 # Result found by lpo6_lambda_fix
% 1.68/0.69 # Preprocessing class: HSMSSMSSSSSNHHA.
% 1.68/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting full_lambda_6 with 900s (3) cores
% 1.68/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.68/0.69 # Starting lpo6_lambda_fix with 300s (1) cores
% 1.68/0.69 # No SInE strategy applied
% 1.68/0.69 # Search class: HGUNF-FFSF00-SHHFFMBN
% 1.68/0.69 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.69 # Starting ehoh_best6_lambda with 163s (1) cores
% 1.68/0.69 # ehoh_best6_lambda with pid 19485 completed with status 0
% 1.68/0.69 # Result found by ehoh_best6_lambda
% 1.68/0.69 # Preprocessing class: HSMSSMSSSSSNHHA.
% 1.68/0.69 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 1.68/0.69 # Starting full_lambda_6 with 900s (3) cores
% 1.68/0.69 # Starting post_as_ho1 with 300s (1) cores
% 1.68/0.69 # Starting lpo6_lambda_fix with 300s (1) cores
% 1.68/0.69 # No SInE strategy applied
% 1.68/0.69 # Search class: HGUNF-FFSF00-SHHFFMBN
% 1.68/0.69 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 1.68/0.69 # Starting ehoh_best6_lambda with 163s (1) cores
% 1.68/0.69 # Preprocessing time : 0.001 s
% 1.68/0.69 # Presaturation interreduction done
% 1.68/0.69
% 1.68/0.69 # Proof found!
% 1.68/0.69 # SZS status Theorem
% 1.68/0.69 # SZS output start CNFRefutation
% See solution above
% 1.68/0.69 # Parsed axioms : 1
% 1.68/0.69 # Removed by relevancy pruning/SinE : 0
% 1.68/0.69 # Initial clauses : 3
% 1.68/0.69 # Removed in clause preprocessing : 0
% 1.68/0.69 # Initial clauses in saturation : 3
% 1.68/0.69 # Processed clauses : 769
% 1.68/0.69 # ...of these trivial : 19
% 1.68/0.69 # ...subsumed : 196
% 1.68/0.69 # ...remaining for further processing : 553
% 1.68/0.69 # Other redundant clauses eliminated : 1592
% 1.68/0.69 # Clauses deleted for lack of memory : 0
% 1.68/0.69 # Backward-subsumed : 74
% 1.68/0.69 # Backward-rewritten : 0
% 1.68/0.69 # Generated clauses : 11835
% 1.68/0.69 # ...of the previous two non-redundant : 4367
% 1.68/0.69 # ...aggressively subsumed : 0
% 1.68/0.69 # Contextual simplify-reflections : 16
% 1.68/0.69 # Paramodulations : 8654
% 1.68/0.69 # Factorizations : 463
% 1.68/0.69 # NegExts : 115
% 1.68/0.69 # Equation resolutions : 1592
% 1.68/0.69 # Disequality decompositions : 0
% 1.68/0.69 # Total rewrite steps : 2938
% 1.68/0.69 # ...of those cached : 2937
% 1.68/0.69 # Propositional unsat checks : 0
% 1.68/0.69 # Propositional check models : 0
% 1.68/0.69 # Propositional check unsatisfiable : 0
% 1.68/0.69 # Propositional clauses : 0
% 1.68/0.69 # Propositional clauses after purity: 0
% 1.68/0.69 # Propositional unsat core size : 0
% 1.68/0.69 # Propositional preprocessing time : 0.000
% 1.68/0.69 # Propositional encoding time : 0.000
% 1.68/0.69 # Propositional solver time : 0.000
% 1.68/0.69 # Success case prop preproc time : 0.000
% 1.68/0.69 # Success case prop encoding time : 0.000
% 1.68/0.69 # Success case prop solver time : 0.000
% 1.68/0.69 # Current number of processed clauses : 156
% 1.68/0.69 # Positive orientable unit clauses : 2
% 1.68/0.69 # Positive unorientable unit clauses: 0
% 1.68/0.69 # Negative unit clauses : 1
% 1.68/0.69 # Non-unit-clauses : 153
% 1.68/0.69 # Current number of unprocessed clauses: 3601
% 1.68/0.69 # ...number of literals in the above : 30557
% 1.68/0.69 # Current number of archived formulas : 0
% 1.68/0.69 # Current number of archived clauses : 398
% 1.68/0.69 # Clause-clause subsumption calls (NU) : 9630
% 1.68/0.69 # Rec. Clause-clause subsumption calls : 1147
% 1.68/0.69 # Non-unit clause-clause subsumptions : 285
% 1.68/0.69 # Unit Clause-clause subsumption calls : 7
% 1.68/0.69 # Rewrite failures with RHS unbound : 0
% 1.68/0.69 # BW rewrite match attempts : 1
% 1.68/0.69 # BW rewrite match successes : 1
% 1.68/0.69 # Condensation attempts : 0
% 1.68/0.69 # Condensation successes : 0
% 1.68/0.69 # Termbank termtop insertions : 452755
% 1.68/0.69 # Search garbage collected termcells : 416
% 1.68/0.69
% 1.68/0.69 # -------------------------------------------------
% 1.68/0.69 # User time : 0.231 s
% 1.68/0.69 # System time : 0.009 s
% 1.68/0.69 # Total time : 0.240 s
% 1.68/0.69 # Maximum resident set size: 1696 pages
% 1.68/0.69
% 1.68/0.69 # -------------------------------------------------
% 1.68/0.69 # User time : 0.232 s
% 1.68/0.69 # System time : 0.011 s
% 1.68/0.69 # Total time : 0.243 s
% 1.68/0.69 # Maximum resident set size: 1720 pages
% 1.68/0.69 % E---3.1 exiting
% 1.68/0.69 % E exiting
%------------------------------------------------------------------------------