TSTP Solution File: ITP019^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP019^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 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 : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:15:42 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 25 ( 7 unt; 11 typ; 0 def)
% Number of atoms : 23 ( 22 equ; 0 cnn)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 139 ( 12 ~; 4 |; 2 &; 118 @)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 5 ( 5 >; 0 *; 0 +; 0 <<)
% Number of symbols : 11 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 6 ( 0 ^ 6 !; 0 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
tp__ty_2Enum_2Enum: $tType ).
thf(decl_sort2,type,
tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $tType ).
thf(decl_26,type,
ap: $i > $i > $i ).
thf(decl_36,type,
inj__ty_2Enum_2Enum: tp__ty_2Enum_2Enum > $i ).
thf(decl_38,type,
c_2Enum_2E0: $i ).
thf(decl_39,type,
fo__c_2Enum_2E0: tp__ty_2Enum_2Enum ).
thf(decl_44,type,
inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal > $i ).
thf(decl_45,type,
surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal: $i > tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).
thf(decl_46,type,
c_2Ecomplex_2Ecomplex__of__num: $i ).
thf(decl_47,type,
c_2Ecomplex_2Ecomplex__inv: $i ).
thf(decl_54,type,
esk5_0: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal ).
thf(conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ,conjecture,
! [X30: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X30
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
=> ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X30 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ) ).
thf(conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0,axiom,
! [X30: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X30 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
<=> ( X30
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0) ).
thf(stp_eq_fo_c_2Enum_2E0,axiom,
( ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 )
= c_2Enum_2E0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',stp_eq_fo_c_2Enum_2E0) ).
thf(c_0_3,negated_conjecture,
~ ! [X30: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X30
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
=> ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X30 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__NZ])]) ).
thf(c_0_4,plain,
! [X125: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X125 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( X125
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) )
& ( ( X125
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X125 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_thm_2Ecomplex_2ECOMPLEX__INV__EQ__0])])]) ).
thf(c_0_5,negated_conjecture,
( ( esk5_0
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
& ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk5_0 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
! [X21: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X21
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X21 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
( ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 )
= c_2Enum_2E0 ),
inference(split_conjunct,[status(thm)],[stp_eq_fo_c_2Enum_2E0]) ).
thf(c_0_8,negated_conjecture,
( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk5_0 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
( esk5_0
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ ( inj__ty_2Enum_2Enum @ fo__c_2Enum_2E0 ) ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_10,plain,
! [X21: tp__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal] :
( ( X21
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ c_2Enum_2E0 ) ) )
| ( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ X21 ) ) )
!= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ c_2Enum_2E0 ) ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]) ).
thf(c_0_11,negated_conjecture,
( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__inv @ ( inj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ esk5_0 ) ) )
= ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ c_2Enum_2E0 ) ) ),
inference(rw,[status(thm)],[c_0_8,c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( surj__c_ty_2Epair_2Eprod_ty_2Erealax_2Ereal_ty_2Erealax_2Ereal @ ( ap @ c_2Ecomplex_2Ecomplex__of__num @ c_2Enum_2E0 ) )
!= esk5_0 ),
inference(rw,[status(thm)],[c_0_9,c_0_7]) ).
thf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.14 % Problem : ITP019^2 : TPTP v8.2.0. Bugfixed v7.5.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n006.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 16:47:08 EDT 2024
% 0.14/0.37 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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
% 0.21/0.53 # Version: 3.1.0-ho
% 0.21/0.53 # partial match(1): HSLSSMSMSSSNSFA
% 0.21/0.53 # Preprocessing class: HSMSSMSMSSSNSFA.
% 0.21/0.53 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting new_ho_10 with 900s (3) cores
% 0.21/0.53 # Starting sh2lt with 300s (1) cores
% 0.21/0.53 # Starting new_ho_5 with 300s (1) cores
% 0.21/0.53 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.53 # Starting sh9 with 300s (1) cores
% 0.21/0.53 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.53 # ehoh_best8_lambda with pid 17613 completed with status 0
% 0.21/0.53 # Result found by ehoh_best8_lambda
% 0.21/0.53 # partial match(1): HSLSSMSMSSSNSFA
% 0.21/0.53 # Preprocessing class: HSMSSMSMSSSNSFA.
% 0.21/0.53 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting new_ho_10 with 900s (3) cores
% 0.21/0.53 # Starting sh2lt with 300s (1) cores
% 0.21/0.53 # Starting new_ho_5 with 300s (1) cores
% 0.21/0.53 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.53 # Starting sh9 with 300s (1) cores
% 0.21/0.53 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHSM-FFMM31-MSFFFFBN
% 0.21/0.53 # partial match(1): HGHSM-FFMM31-DSFFFFBN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting sh5 with 181s (1) cores
% 0.21/0.53 # sh5 with pid 17617 completed with status 0
% 0.21/0.53 # Result found by sh5
% 0.21/0.53 # partial match(1): HSLSSMSMSSSNSFA
% 0.21/0.53 # Preprocessing class: HSMSSMSMSSSNSFA.
% 0.21/0.53 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting new_ho_10 with 900s (3) cores
% 0.21/0.53 # Starting sh2lt with 300s (1) cores
% 0.21/0.53 # Starting new_ho_5 with 300s (1) cores
% 0.21/0.53 # Starting full_lambda_5 with 300s (1) cores
% 0.21/0.53 # Starting sh9 with 300s (1) cores
% 0.21/0.53 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HGHSM-FFMM31-MSFFFFBN
% 0.21/0.53 # partial match(1): HGHSM-FFMM31-DSFFFFBN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting sh5 with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.002 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.53 # Parsed axioms : 71
% 0.21/0.53 # Removed by relevancy pruning/SinE : 0
% 0.21/0.53 # Initial clauses : 99
% 0.21/0.53 # Removed in clause preprocessing : 48
% 0.21/0.53 # Initial clauses in saturation : 51
% 0.21/0.53 # Processed clauses : 69
% 0.21/0.53 # ...of these trivial : 0
% 0.21/0.53 # ...subsumed : 0
% 0.21/0.53 # ...remaining for further processing : 69
% 0.21/0.53 # Other redundant clauses eliminated : 2
% 0.21/0.53 # Clauses deleted for lack of memory : 0
% 0.21/0.53 # Backward-subsumed : 0
% 0.21/0.53 # Backward-rewritten : 0
% 0.21/0.53 # Generated clauses : 5
% 0.21/0.53 # ...of the previous two non-redundant : 3
% 0.21/0.53 # ...aggressively subsumed : 0
% 0.21/0.53 # Contextual simplify-reflections : 0
% 0.21/0.53 # Paramodulations : 2
% 0.21/0.53 # Factorizations : 0
% 0.21/0.53 # NegExts : 0
% 0.21/0.53 # Equation resolutions : 2
% 0.21/0.53 # Disequality decompositions : 0
% 0.21/0.53 # Total rewrite steps : 6
% 0.21/0.53 # ...of those cached : 5
% 0.21/0.53 # Propositional unsat checks : 0
% 0.21/0.53 # Propositional check models : 0
% 0.21/0.53 # Propositional check unsatisfiable : 0
% 0.21/0.53 # Propositional clauses : 0
% 0.21/0.53 # Propositional clauses after purity: 0
% 0.21/0.53 # Propositional unsat core size : 0
% 0.21/0.53 # Propositional preprocessing time : 0.000
% 0.21/0.53 # Propositional encoding time : 0.000
% 0.21/0.53 # Propositional solver time : 0.000
% 0.21/0.53 # Success case prop preproc time : 0.000
% 0.21/0.53 # Success case prop encoding time : 0.000
% 0.21/0.53 # Success case prop solver time : 0.000
% 0.21/0.53 # Current number of processed clauses : 16
% 0.21/0.53 # Positive orientable unit clauses : 12
% 0.21/0.53 # Positive unorientable unit clauses: 0
% 0.21/0.53 # Negative unit clauses : 3
% 0.21/0.53 # Non-unit-clauses : 1
% 0.21/0.53 # Current number of unprocessed clauses: 36
% 0.21/0.53 # ...number of literals in the above : 91
% 0.21/0.53 # Current number of archived formulas : 0
% 0.21/0.53 # Current number of archived clauses : 51
% 0.21/0.53 # Clause-clause subsumption calls (NU) : 207
% 0.21/0.53 # Rec. Clause-clause subsumption calls : 96
% 0.21/0.53 # Non-unit clause-clause subsumptions : 0
% 0.21/0.53 # Unit Clause-clause subsumption calls : 2
% 0.21/0.53 # Rewrite failures with RHS unbound : 0
% 0.21/0.53 # BW rewrite match attempts : 3
% 0.21/0.53 # BW rewrite match successes : 0
% 0.21/0.53 # Condensation attempts : 69
% 0.21/0.53 # Condensation successes : 0
% 0.21/0.53 # Termbank termtop insertions : 5314
% 0.21/0.53 # Search garbage collected termcells : 1052
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.011 s
% 0.21/0.53 # System time : 0.002 s
% 0.21/0.53 # Total time : 0.013 s
% 0.21/0.53 # Maximum resident set size: 2048 pages
% 0.21/0.53
% 0.21/0.53 # -------------------------------------------------
% 0.21/0.53 # User time : 0.013 s
% 0.21/0.53 # System time : 0.004 s
% 0.21/0.53 # Total time : 0.017 s
% 0.21/0.53 # Maximum resident set size: 1812 pages
% 0.21/0.53 % E---3.1 exiting
% 0.21/0.53 % E exiting
%------------------------------------------------------------------------------