TSTP Solution File: ITP082^1 by E---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.2.0
% Problem : ITP082^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 Jun 24 09:11:41 EDT 2024
% Result : Theorem 0.38s 0.92s
% Output : CNFRefutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 34 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 72 ( 29 equ; 0 cnn)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 296 ( 22 ~; 10 |; 1 &; 257 @)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 7 avg)
% Number of types : 9 ( 8 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 22 usr; 11 con; 0-7 aty)
% Number of variables : 58 ( 0 ^ 54 !; 4 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
set_val: $tType ).
thf(decl_sort2,type,
g: $tType ).
thf(decl_sort3,type,
list_node: $tType ).
thf(decl_sort4,type,
node: $tType ).
thf(decl_sort5,type,
list_P561207620_edgeD: $tType ).
thf(decl_sort6,type,
val: $tType ).
thf(decl_sort7,type,
produc1432036078de_val: $tType ).
thf(decl_sort8,type,
option_list_val: $tType ).
thf(decl_22,type,
graph_1012773594_edgeD: ( g > list_node ) > ( g > $o ) > ( g > node > list_P561207620_edgeD ) > g > node > list_node > node > $o ).
thf(decl_26,type,
append_node: list_node > list_node > list_node ).
thf(decl_32,type,
cons_node: node > list_node > list_node ).
thf(decl_35,type,
nil_node: list_node ).
thf(decl_38,type,
hd_node: list_node > node ).
thf(decl_50,type,
sSA_CF551432799de_val: ( g > list_node ) > ( g > node > set_val ) > ( g > produc1432036078de_val > option_list_val ) > g > val > node ).
thf(decl_59,type,
alpha_n: g > list_node ).
thf(decl_61,type,
defs: g > node > set_val ).
thf(decl_62,type,
g2: g ).
thf(decl_63,type,
i: node ).
thf(decl_64,type,
inEdges: g > node > list_P561207620_edgeD ).
thf(decl_65,type,
invar: g > $o ).
thf(decl_71,type,
phis: g > produc1432036078de_val > option_list_val ).
thf(decl_72,type,
pred_phi_r: node ).
thf(decl_73,type,
r: val ).
thf(decl_74,type,
ri: list_node ).
thf(decl_75,type,
rs: list_node ).
thf(decl_76,type,
rs_rest: list_node ).
thf(decl_79,type,
tmp: list_node ).
thf(decl_227,type,
esk136_1: list_node > list_node ).
thf(decl_228,type,
esk137_1: list_node > node ).
thf(decl_338,type,
esk247_0: list_node ).
thf(fact_235_neq__Nil__rev__conv,axiom,
! [X408: list_node] :
( ( X408 != nil_node )
<=> ? [X409: list_node,X410: node] :
( X408
= ( append_node @ X409 @ ( cons_node @ X410 @ nil_node ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_235_neq__Nil__rev__conv) ).
thf(fact_38_hd__append2,axiom,
! [X14: list_node,X15: list_node] :
( ( X14 != nil_node )
=> ( ( hd_node @ ( append_node @ X14 @ X15 ) )
= ( hd_node @ X14 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_38_hd__append2) ).
thf(fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062,axiom,
~ ! [X8: list_node] :
( rs
!= ( append_node @ ri @ X8 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062) ).
thf(fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062,axiom,
( ri
= ( append_node @ tmp @ ( cons_node @ i @ nil_node ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062) ).
thf(fact_3_old_Opath2__split_I2_J,axiom,
! [X1: g,X2: node,X3: list_node,X4: node,X5: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ ( append_node @ X3 @ ( cons_node @ X4 @ X5 ) ) @ X6 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ ( cons_node @ X4 @ X5 ) @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_3_old_Opath2__split_I2_J) ).
thf(fact_16_old_Opath2__forget__hd,axiom,
! [X1: g,X2: node,X3: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X6 )
=> ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ ( hd_node @ X3 ) @ X3 @ X6 ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_16_old_Opath2__forget__hd) ).
thf(conj_0,conjecture,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r,
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',conj_0) ).
thf(fact_1_rs_H__rest__def,axiom,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_1_rs_H__rest__def) ).
thf(fact_5_rs_H__props_I1_J,axiom,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
file('/export/starexec/sandbox2/tmp/tmp.vQosL1onvp/E---3.1_27307.p',fact_5_rs_H__props_I1_J) ).
thf(c_0_9,plain,
! [X408: list_node] :
( ( X408 != nil_node )
<=> ? [X409: list_node,X410: node] :
( X408
= ( append_node @ X409 @ ( cons_node @ X410 @ nil_node ) ) ) ),
inference(fof_simplification,[status(thm)],[fact_235_neq__Nil__rev__conv]) ).
thf(c_0_10,plain,
! [X1973: list_node,X1976: list_node,X1977: list_node,X1978: node] :
( ( ( X1973 = nil_node )
| ( X1973
= ( append_node @ ( esk136_1 @ X1973 ) @ ( cons_node @ ( esk137_1 @ X1973 ) @ nil_node ) ) ) )
& ( ( X1976
!= ( append_node @ X1977 @ ( cons_node @ X1978 @ nil_node ) ) )
| ( X1976 != nil_node ) ) ),
inference(fof_nnf,[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)],[c_0_9])])])])])]) ).
thf(c_0_11,plain,
! [X14: list_node,X15: list_node] :
( ( X14 != nil_node )
=> ( ( hd_node @ ( append_node @ X14 @ X15 ) )
= ( hd_node @ X14 ) ) ),
inference(fof_simplification,[status(thm)],[fact_38_hd__append2]) ).
thf(c_0_12,plain,
~ ! [X8: list_node] :
( rs
!= ( append_node @ ri @ X8 ) ),
inference(fof_simplification,[status(thm)],[fact_19__092_060open_062_092_060And_062thesis_O_A_I_092_060And_062rs_H__rest_O_Ars_H_A_061_Ari_A_064_Ars_H__rest_A_092_060Longrightarrow_062_Athesis_J_A_092_060Longrightarrow_062_Athesis_092_060close_062]) ).
thf(c_0_13,plain,
! [X2: node,X5: list_node,X3: list_node] :
( ( X3
!= ( append_node @ X5 @ ( cons_node @ X2 @ nil_node ) ) )
| ( X3 != nil_node ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_14,plain,
! [X2316: list_node,X2317: list_node] :
( ( X2316 = nil_node )
| ( ( hd_node @ ( append_node @ X2316 @ X2317 ) )
= ( hd_node @ X2316 ) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
thf(c_0_15,plain,
( rs
= ( append_node @ ri @ esk247_0 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
thf(c_0_16,plain,
! [X3: list_node,X2: node] :
( ( append_node @ X3 @ ( cons_node @ X2 @ nil_node ) )
!= nil_node ),
inference(er,[status(thm)],[c_0_13]) ).
thf(c_0_17,plain,
( ri
= ( append_node @ tmp @ ( cons_node @ i @ nil_node ) ) ),
inference(split_conjunct,[status(thm)],[fact_18__092_060open_062ri_A_061_Atmp_A_064_A_091i_093_092_060close_062]) ).
thf(c_0_18,plain,
! [X1557: g,X1558: node,X1559: list_node,X1560: node,X1561: list_node,X1562: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1557 @ X1558 @ ( append_node @ X1559 @ ( cons_node @ X1560 @ X1561 ) ) @ X1562 )
| ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1557 @ X1560 @ ( cons_node @ X1560 @ X1561 ) @ X1562 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_3_old_Opath2__split_I2_J])])]) ).
thf(c_0_19,plain,
! [X1591: g,X1592: node,X1593: list_node,X1594: node] :
( ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1591 @ X1592 @ X1593 @ X1594 )
| ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1591 @ ( hd_node @ X1593 ) @ X1593 @ X1594 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_16_old_Opath2__forget__hd])])]) ).
thf(c_0_20,plain,
! [X5: list_node,X3: list_node] :
( ( X3 = nil_node )
| ( ( hd_node @ ( append_node @ X3 @ X5 ) )
= ( hd_node @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_21,plain,
( rs
= ( append_node @ ri @ esk247_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_22,plain,
ri != nil_node,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
thf(c_0_23,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_24,plain,
! [X1: g,X2: node,X3: list_node,X4: node,X5: list_node,X6: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ ( cons_node @ X4 @ X5 ) @ X6 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ ( append_node @ X3 @ ( cons_node @ X4 @ X5 ) ) @ X6 ) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_25,plain,
( rs
= ( append_node @ tmp @ ( cons_node @ i @ rs_rest ) ) ),
inference(split_conjunct,[status(thm)],[fact_1_rs_H__rest__def]) ).
thf(c_0_26,plain,
! [X1: g,X2: node,X3: list_node,X4: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ ( hd_node @ X3 ) @ X3 @ X4 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X2 @ X3 @ X4 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_27,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( sSA_CF551432799de_val @ alpha_n @ defs @ phis @ g2 @ r ) @ rs @ pred_phi_r,
inference(split_conjunct,[status(thm)],[fact_5_rs_H__props_I1_J]) ).
thf(c_0_28,plain,
( ( hd_node @ rs )
= ( hd_node @ ri ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
thf(c_0_29,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(fof_nnf,[status(thm)],[c_0_23]) ).
thf(c_0_30,plain,
! [X1: g,X4: node,X2: node] :
( ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ i @ ( cons_node @ i @ rs_rest ) @ X2 )
| ~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ X1 @ X4 @ rs @ X2 ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_31,plain,
graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ ( hd_node @ ri ) @ rs @ pred_phi_r,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
thf(c_0_32,negated_conjecture,
~ ( graph_1012773594_edgeD @ alpha_n @ invar @ inEdges @ g2 @ i @ ( cons_node @ i @ rs_rest ) @ pred_phi_r ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ITP082^1 : TPTP v8.2.0. Released v7.5.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n002.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Tue Jun 18 21:45:09 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.38/0.54 Running higher-order theorem proving
% 0.38/0.54 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.vQosL1onvp/E---3.1_27307.p
% 0.38/0.92 # Version: 3.2.0-ho
% 0.38/0.92 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.38/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.92 # Starting ehoh_best2 with 1500s (5) cores
% 0.38/0.92 # Starting additional_ho_6 with 300s (1) cores
% 0.38/0.92 # Starting new_bool_5 with 300s (1) cores
% 0.38/0.92 # Starting new_bool_1 with 300s (1) cores
% 0.38/0.92 # new_bool_5 with pid 27452 completed with status 8
% 0.38/0.92 # additional_ho_6 with pid 27451 completed with status 0
% 0.38/0.92 # Result found by additional_ho_6
% 0.38/0.92 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.38/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.92 # Starting ehoh_best2 with 1500s (5) cores
% 0.38/0.92 # Starting additional_ho_6 with 300s (1) cores
% 0.38/0.92 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.38/0.92 # Search class: HGHSM-FSLM32-MHSFFSBN
% 0.38/0.92 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.92 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.92 # new_ho_10 with pid 27497 completed with status 0
% 0.38/0.92 # Result found by new_ho_10
% 0.38/0.92 # Preprocessing class: HSLSSMSMSSMNHSA.
% 0.38/0.92 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.38/0.92 # Starting ehoh_best2 with 1500s (5) cores
% 0.38/0.92 # Starting additional_ho_6 with 300s (1) cores
% 0.38/0.92 # SinE strategy is GSinE(CountFormulas,hypos,4.0,,2,20000,1.0)
% 0.38/0.92 # Search class: HGHSM-FSLM32-MHSFFSBN
% 0.38/0.92 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.38/0.92 # Starting new_ho_10 with 163s (1) cores
% 0.38/0.92 # Preprocessing time : 0.011 s
% 0.38/0.92 # Presaturation interreduction done
% 0.38/0.92
% 0.38/0.92 # Proof found!
% 0.38/0.92 # SZS status Theorem
% 0.38/0.92 # SZS output start CNFRefutation
% See solution above
% 0.38/0.92 # Parsed axioms : 423
% 0.38/0.92 # Removed by relevancy pruning/SinE : 169
% 0.38/0.92 # Initial clauses : 590
% 0.38/0.92 # Removed in clause preprocessing : 24
% 0.38/0.92 # Initial clauses in saturation : 566
% 0.38/0.92 # Processed clauses : 1515
% 0.38/0.92 # ...of these trivial : 33
% 0.38/0.92 # ...subsumed : 279
% 0.38/0.92 # ...remaining for further processing : 1203
% 0.38/0.92 # Other redundant clauses eliminated : 2249
% 0.38/0.92 # Clauses deleted for lack of memory : 0
% 0.38/0.92 # Backward-subsumed : 8
% 0.38/0.92 # Backward-rewritten : 27
% 0.38/0.92 # Generated clauses : 12204
% 0.38/0.92 # ...of the previous two non-redundant : 9556
% 0.38/0.92 # ...aggressively subsumed : 0
% 0.38/0.92 # Contextual simplify-reflections : 1
% 0.38/0.92 # Paramodulations : 9952
% 0.38/0.92 # Factorizations : 0
% 0.38/0.92 # NegExts : 0
% 0.38/0.92 # Equation resolutions : 2276
% 0.38/0.92 # Disequality decompositions : 0
% 0.38/0.92 # Total rewrite steps : 1133
% 0.38/0.92 # ...of those cached : 820
% 0.38/0.92 # Propositional unsat checks : 0
% 0.38/0.92 # Propositional check models : 0
% 0.38/0.92 # Propositional check unsatisfiable : 0
% 0.38/0.92 # Propositional clauses : 0
% 0.38/0.92 # Propositional clauses after purity: 0
% 0.38/0.92 # Propositional unsat core size : 0
% 0.38/0.92 # Propositional preprocessing time : 0.000
% 0.38/0.92 # Propositional encoding time : 0.000
% 0.38/0.92 # Propositional solver time : 0.000
% 0.38/0.92 # Success case prop preproc time : 0.000
% 0.38/0.92 # Success case prop encoding time : 0.000
% 0.38/0.92 # Success case prop solver time : 0.000
% 0.38/0.92 # Current number of processed clauses : 650
% 0.38/0.92 # Positive orientable unit clauses : 112
% 0.38/0.92 # Positive unorientable unit clauses: 0
% 0.38/0.92 # Negative unit clauses : 55
% 0.38/0.92 # Non-unit-clauses : 483
% 0.38/0.92 # Current number of unprocessed clauses: 8996
% 0.38/0.92 # ...number of literals in the above : 33262
% 0.38/0.92 # Current number of archived formulas : 0
% 0.38/0.92 # Current number of archived clauses : 461
% 0.38/0.92 # Clause-clause subsumption calls (NU) : 58611
% 0.38/0.92 # Rec. Clause-clause subsumption calls : 20596
% 0.38/0.92 # Non-unit clause-clause subsumptions : 140
% 0.38/0.92 # Unit Clause-clause subsumption calls : 2184
% 0.38/0.92 # Rewrite failures with RHS unbound : 0
% 0.38/0.92 # BW rewrite match attempts : 289
% 0.38/0.92 # BW rewrite match successes : 5
% 0.38/0.92 # Condensation attempts : 1515
% 0.38/0.92 # Condensation successes : 0
% 0.38/0.92 # Termbank termtop insertions : 255388
% 0.38/0.92 # Search garbage collected termcells : 16261
% 0.38/0.92
% 0.38/0.92 # -------------------------------------------------
% 0.38/0.92 # User time : 0.333 s
% 0.38/0.92 # System time : 0.013 s
% 0.38/0.92 # Total time : 0.346 s
% 0.38/0.92 # Maximum resident set size: 5160 pages
% 0.38/0.92
% 0.38/0.92 # -------------------------------------------------
% 0.38/0.92 # User time : 0.403 s
% 0.38/0.92 # System time : 0.066 s
% 0.38/0.92 # Total time : 0.470 s
% 0.38/0.92 # Maximum resident set size: 2724 pages
% 0.38/0.92 % E---3.1 exiting
% 0.38/0.92 % E exiting
%------------------------------------------------------------------------------