TSTP Solution File: NUM660^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM660^4 : TPTP v8.1.2. Released v7.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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:56:05 EDT 2024
% Result : Theorem 0.18s 0.49s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 33
% Syntax : Number of formulae : 60 ( 35 unt; 19 typ; 0 def)
% Number of atoms : 154 ( 65 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 176 ( 19 ~; 5 |; 5 &; 120 @)
% ( 0 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 22 ( 19 usr; 5 con; 0-3 aty)
% Number of variables : 89 ( 84 ^ 5 !; 0 ?; 89 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
is_of: $i > ( $i > $o ) > $o ).
thf(decl_23,type,
all_of: ( $i > $o ) > ( $i > $o ) > $o ).
thf(decl_25,type,
in: $i > $i > $o ).
thf(decl_61,type,
imp: $o > $o > $o ).
thf(decl_62,type,
d_not: $o > $o ).
thf(decl_67,type,
l_or: $o > $o > $o ).
thf(decl_72,type,
l_some: $i > ( $i > $o ) > $o ).
thf(decl_77,type,
e_is: $i > $i > $i > $o ).
thf(decl_123,type,
nat: $i ).
thf(decl_124,type,
n_is: $i > $i > $o ).
thf(decl_127,type,
n_some: ( $i > $o ) > $o ).
thf(decl_142,type,
n_pl: $i > $i > $i ).
thf(decl_147,type,
diffprop: $i > $i > $i > $o ).
thf(decl_148,type,
d_29_ii: $i > $i > $o ).
thf(decl_149,type,
iii: $i > $i > $o ).
thf(decl_151,type,
moreis: $i > $i > $o ).
thf(decl_152,type,
lessis: $i > $i > $o ).
thf(decl_154,type,
esk1_0: $i ).
thf(decl_155,type,
esk2_0: $i ).
thf(def_e_is,axiom,
( e_is
= ( ^ [X1: $i,X101: $i,X102: $i] : ( X101 = X102 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_e_is) ).
thf(def_diffprop,axiom,
( diffprop
= ( ^ [X1: $i,X207: $i,X4: $i] : ( n_is @ X1 @ ( n_pl @ X207 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_diffprop) ).
thf(def_n_is,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_n_is) ).
thf(def_d_not,axiom,
( d_not
= ( ^ [X76: $o] : ( imp @ X76 @ ~ $true ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_d_not) ).
thf(def_imp,axiom,
( imp
= ( ^ [X74: $o,X75: $o] :
( X74
=> X75 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_imp) ).
thf(def_d_29_ii,axiom,
( d_29_ii
= ( ^ [X1: $i,X210: $i] : ( n_some @ ( diffprop @ X1 @ X210 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_d_29_ii) ).
thf(def_l_or,axiom,
( l_or
= ( ^ [X83: $o] : ( imp @ ( d_not @ X83 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_l_or) ).
thf(def_iii,axiom,
( iii
= ( ^ [X1: $i,X211: $i] : ( n_some @ ( diffprop @ X211 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_iii) ).
thf(def_all_of,axiom,
( all_of
= ( ^ [X3: $i > $o,X2: $i > $o] :
! [X4: $i] :
( ( is_of @ X4 @ X3 )
=> ( X2 @ X4 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_all_of) ).
thf(def_is_of,axiom,
( is_of
= ( ^ [X1: $i,X2: $i > $o] : ( X2 @ X1 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_is_of) ).
thf(def_moreis,axiom,
( moreis
= ( ^ [X1: $i,X229: $i] : ( l_or @ ( d_29_ii @ X1 @ X229 ) @ ( n_is @ X1 @ X229 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_moreis) ).
thf(def_n_some,axiom,
( n_some
= ( l_some @ nat ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_n_some) ).
thf(def_lessis,axiom,
( lessis
= ( ^ [X1: $i,X230: $i] : ( l_or @ ( iii @ X1 @ X230 ) @ ( n_is @ X1 @ X230 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',def_lessis) ).
thf(satz13,conjecture,
( all_of
@ ^ [X1: $i] : ( in @ X1 @ nat )
@ ^ [X1: $i] :
( all_of
@ ^ [X231: $i] : ( in @ X231 @ nat )
@ ^ [X232: $i] :
( ( moreis @ X1 @ X232 )
=> ( lessis @ X232 @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p',satz13) ).
thf(c_0_14,plain,
( e_is
= ( ^ [Z0: $i,Z1: $i,Z2: $i] : ( Z1 = Z2 ) ) ),
inference(fof_simplification,[status(thm)],[def_e_is]) ).
thf(c_0_15,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_diffprop]) ).
thf(c_0_16,axiom,
( n_is
= ( ^ [Z0: $i,Z1: $i] : ( Z0 = Z1 ) ) ),
inference(apply_def,[status(thm)],[def_n_is,c_0_14]) ).
thf(c_0_17,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(fof_simplification,[status(thm)],[def_d_not]) ).
thf(c_0_18,plain,
( imp
= ( ^ [Z0: $o,Z1: $o] :
( Z0
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_imp]) ).
thf(c_0_19,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_d_29_ii]) ).
thf(c_0_20,plain,
( diffprop
= ( ^ [Z0: $i,Z1: $i,Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_15,c_0_16]) ).
thf(c_0_21,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(fof_simplification,[status(thm)],[def_l_or]) ).
thf(c_0_22,plain,
( d_not
= ( ^ [Z0: $o] :
( Z0
=> ~ $true ) ) ),
inference(apply_def,[status(thm)],[c_0_17,c_0_18]) ).
thf(c_0_23,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z1
= ( n_pl @ Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[def_iii]) ).
thf(c_0_24,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_all_of]) ).
thf(c_0_25,plain,
( is_of
= ( ^ [Z0: $i,Z1: $i > $o] : ( Z1 @ Z0 ) ) ),
inference(fof_simplification,[status(thm)],[def_is_of]) ).
thf(c_0_26,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_moreis]) ).
thf(c_0_27,plain,
( d_29_ii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_19,c_0_20]),def_n_some]) ).
thf(c_0_28,plain,
( l_or
= ( ^ [Z0: $o,Z1: $o] :
( ( Z0
=> ~ $true )
=> Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21,c_0_22]),c_0_18]) ).
thf(c_0_29,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat
@ ^ [Z2: $i] :
( Z1
= ( n_pl @ Z0 @ Z2 ) ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[def_lessis]) ).
thf(c_0_30,plain,
( iii
= ( ^ [Z0: $i,Z1: $i] :
( l_some @ nat
@ ^ [Z2: $i] :
( Z1
= ( n_pl @ Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_23,c_0_20]),def_n_some]) ).
thf(c_0_31,plain,
( all_of
= ( ^ [Z0: $i > $o,Z1: $i > $o] :
! [X4: $i] :
( ( Z0 @ X4 )
=> ( Z1 @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_32,plain,
( moreis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat
@ ^ [Z2: $i] :
( Z0
= ( n_pl @ Z1 @ Z2 ) ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_28]) ).
thf(c_0_33,plain,
( lessis
= ( ^ [Z0: $i,Z1: $i] :
( ( ( l_some @ nat
@ ^ [Z2: $i] :
( Z1
= ( n_pl @ Z0 @ Z2 ) ) )
=> ~ $true )
=> ( Z0 = Z1 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_29,c_0_30]),c_0_16]),c_0_28]) ).
thf(c_0_34,negated_conjecture,
~ ! [X289: $i] :
( ( in @ X289 @ nat )
=> ! [X288: $i] :
( ( in @ X288 @ nat )
=> ( ( ( ( l_some @ nat
@ ^ [Z0: $i] :
( X289
= ( n_pl @ X288 @ Z0 ) ) )
=> ~ $true )
=> ( X289 = X288 ) )
=> ( ( ( l_some @ nat
@ ^ [Z0: $i] :
( X289
= ( n_pl @ X288 @ Z0 ) ) )
=> ~ $true )
=> ( X288 = X289 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz13])]),c_0_31]),c_0_32]),c_0_33]) ).
thf(c_0_35,negated_conjecture,
( ( in @ esk1_0 @ nat )
& ( in @ esk2_0 @ nat )
& ( ( l_some @ nat
@ ^ [Z0: $i] :
( esk1_0
= ( n_pl @ esk2_0 @ Z0 ) ) )
| ( esk1_0 = esk2_0 ) )
& ( $true
| ( esk1_0 = esk2_0 ) )
& ( ~ ( l_some @ nat
@ ^ [Z0: $i] :
( esk1_0
= ( n_pl @ esk2_0 @ Z0 ) ) )
| ~ $true )
& ( esk2_0 != esk1_0 ) ),
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_34])])])])]) ).
thf(c_0_36,negated_conjecture,
( ~ ( l_some @ nat
@ ^ [Z0: $i] :
( esk1_0
= ( n_pl @ esk2_0 @ Z0 ) ) )
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_37,negated_conjecture,
( ( l_some @ nat
@ ^ [Z0: $i] :
( esk1_0
= ( n_pl @ esk2_0 @ Z0 ) ) )
| ( esk1_0 = esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_38,negated_conjecture,
esk2_0 != esk1_0,
inference(split_conjunct,[status(thm)],[c_0_35]) ).
thf(c_0_39,negated_conjecture,
~ ( l_some @ nat
@ ^ [Z0: $i] :
( esk1_0
= ( n_pl @ esk2_0 @ Z0 ) ) ),
inference(cn,[status(thm)],[c_0_36]) ).
thf(c_0_40,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : NUM660^4 : TPTP v8.1.2. Released v7.1.0.
% 0.09/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n021.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 09:22:43 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.vSJGmqlLZT/E---3.1_31629.p
% 0.18/0.49 # Version: 3.1.0-ho
% 0.18/0.49 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.18/0.49 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting lpo1_fix with 900s (3) cores
% 0.18/0.49 # Starting full_lambda_9 with 300s (1) cores
% 0.18/0.49 # Starting almost_fo_4 with 300s (1) cores
% 0.18/0.49 # Starting new_ho_9 with 300s (1) cores
% 0.18/0.49 # Starting pre_casc_4 with 300s (1) cores
% 0.18/0.49 # Starting ho_unfolding_6 with 300s (1) cores
% 0.18/0.49 # pre_casc_4 with pid 31711 completed with status 0
% 0.18/0.49 # Result found by pre_casc_4
% 0.18/0.49 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.18/0.49 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting lpo1_fix with 900s (3) cores
% 0.18/0.49 # Starting full_lambda_9 with 300s (1) cores
% 0.18/0.49 # Starting almost_fo_4 with 300s (1) cores
% 0.18/0.49 # Starting new_ho_9 with 300s (1) cores
% 0.18/0.49 # Starting pre_casc_4 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.49 # Search class: HGUSM-FFMM31-DHSMMSBN
% 0.18/0.49 # partial match(3): HGHSM-FFMM31-SHSSMSBN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.49 # new_ho_10 with pid 31713 completed with status 0
% 0.18/0.49 # Result found by new_ho_10
% 0.18/0.49 # Preprocessing class: HSLMSMSSLLLCHSA.
% 0.18/0.49 # Scheduled 6 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.49 # Starting lpo1_fix with 900s (3) cores
% 0.18/0.49 # Starting full_lambda_9 with 300s (1) cores
% 0.18/0.49 # Starting almost_fo_4 with 300s (1) cores
% 0.18/0.49 # Starting new_ho_9 with 300s (1) cores
% 0.18/0.49 # Starting pre_casc_4 with 300s (1) cores
% 0.18/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true)
% 0.18/0.49 # Search class: HGUSM-FFMM31-DHSMMSBN
% 0.18/0.49 # partial match(3): HGHSM-FFMM31-SHSSMSBN
% 0.18/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.18/0.49 # Preprocessing time : 0.005 s
% 0.18/0.49 # Presaturation interreduction done
% 0.18/0.49
% 0.18/0.49 # Proof found!
% 0.18/0.49 # SZS status Theorem
% 0.18/0.49 # SZS output start CNFRefutation
% See solution above
% 0.18/0.49 # Parsed axioms : 349
% 0.18/0.49 # Removed by relevancy pruning/SinE : 289
% 0.18/0.49 # Initial clauses : 96
% 0.18/0.49 # Removed in clause preprocessing : 9
% 0.18/0.49 # Initial clauses in saturation : 87
% 0.18/0.49 # Processed clauses : 13
% 0.18/0.49 # ...of these trivial : 0
% 0.18/0.49 # ...subsumed : 0
% 0.18/0.49 # ...remaining for further processing : 12
% 0.18/0.49 # Other redundant clauses eliminated : 0
% 0.18/0.49 # Clauses deleted for lack of memory : 0
% 0.18/0.49 # Backward-subsumed : 0
% 0.18/0.49 # Backward-rewritten : 0
% 0.18/0.49 # Generated clauses : 0
% 0.18/0.49 # ...of the previous two non-redundant : 0
% 0.18/0.49 # ...aggressively subsumed : 0
% 0.18/0.49 # Contextual simplify-reflections : 0
% 0.18/0.49 # Paramodulations : 0
% 0.18/0.49 # Factorizations : 0
% 0.18/0.49 # NegExts : 0
% 0.18/0.49 # Equation resolutions : 0
% 0.18/0.49 # Disequality decompositions : 0
% 0.18/0.49 # Total rewrite steps : 1
% 0.18/0.49 # ...of those cached : 0
% 0.18/0.49 # Propositional unsat checks : 0
% 0.18/0.49 # Propositional check models : 0
% 0.18/0.49 # Propositional check unsatisfiable : 0
% 0.18/0.49 # Propositional clauses : 0
% 0.18/0.49 # Propositional clauses after purity: 0
% 0.18/0.49 # Propositional unsat core size : 0
% 0.18/0.49 # Propositional preprocessing time : 0.000
% 0.18/0.49 # Propositional encoding time : 0.000
% 0.18/0.49 # Propositional solver time : 0.000
% 0.18/0.49 # Success case prop preproc time : 0.000
% 0.18/0.49 # Success case prop encoding time : 0.000
% 0.18/0.49 # Success case prop solver time : 0.000
% 0.18/0.49 # Current number of processed clauses : 12
% 0.18/0.49 # Positive orientable unit clauses : 5
% 0.18/0.49 # Positive unorientable unit clauses: 0
% 0.18/0.49 # Negative unit clauses : 4
% 0.18/0.49 # Non-unit-clauses : 3
% 0.18/0.49 # Current number of unprocessed clauses: 74
% 0.18/0.49 # ...number of literals in the above : 246
% 0.18/0.49 # Current number of archived formulas : 0
% 0.18/0.49 # Current number of archived clauses : 0
% 0.18/0.49 # Clause-clause subsumption calls (NU) : 1
% 0.18/0.49 # Rec. Clause-clause subsumption calls : 1
% 0.18/0.49 # Non-unit clause-clause subsumptions : 0
% 0.18/0.49 # Unit Clause-clause subsumption calls : 0
% 0.18/0.49 # Rewrite failures with RHS unbound : 0
% 0.18/0.49 # BW rewrite match attempts : 0
% 0.18/0.49 # BW rewrite match successes : 0
% 0.18/0.49 # Condensation attempts : 13
% 0.18/0.49 # Condensation successes : 0
% 0.18/0.49 # Termbank termtop insertions : 12299
% 0.18/0.49 # Search garbage collected termcells : 4711
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.009 s
% 0.18/0.49 # System time : 0.005 s
% 0.18/0.49 # Total time : 0.014 s
% 0.18/0.49 # Maximum resident set size: 3000 pages
% 0.18/0.49
% 0.18/0.49 # -------------------------------------------------
% 0.18/0.49 # User time : 0.014 s
% 0.18/0.49 # System time : 0.008 s
% 0.18/0.49 # Total time : 0.022 s
% 0.18/0.49 # Maximum resident set size: 2200 pages
% 0.18/0.49 % E---3.1 exiting
% 0.18/0.49 % E exiting
%------------------------------------------------------------------------------