TSTP Solution File: LAT023-1 by E-SAT---3.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.2.0
% Problem : LAT023-1 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d SAT
% Computer : n017.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 10:21:45 EDT 2024
% Result : Unsatisfiable 11.52s 1.95s
% Output : CNFRefutation 11.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 10
% Syntax : Number of clauses : 62 ( 62 unt; 0 nHn; 4 RR)
% Number of literals : 62 ( 61 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 152 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(modularity_axiom,hypothesis,
join(meet(join(X1,X2),X3),X2) = join(meet(join(X3,X2),X1),X2),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',modularity_axiom) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',commutativity_of_join) ).
cnf(quasi_lattice1,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',quasi_lattice1) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',idempotence_of_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',commutativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',idempotence_of_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',associativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',associativity_of_join) ).
cnf(quasi_lattice2,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',quasi_lattice2) ).
cnf(prove_modularity,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
file('/export/starexec/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p',prove_modularity) ).
cnf(c_0_10,hypothesis,
join(meet(join(X1,X2),X3),X2) = join(meet(join(X3,X2),X1),X2),
modularity_axiom ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(meet(X1,join(X2,X3)),meet(X1,X2)) = meet(X1,join(X2,X3)),
quasi_lattice1 ).
cnf(c_0_13,hypothesis,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(join(X3,X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).
cnf(c_0_14,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,plain,
join(meet(X1,X2),meet(X1,join(X2,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_17,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_18,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_19,hypothesis,
join(X1,meet(X1,join(X2,X1))) = join(X1,meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_20,plain,
join(X1,meet(X1,join(X1,X2))) = meet(X1,join(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_22,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
quasi_lattice2 ).
cnf(c_0_23,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,hypothesis,
meet(X1,join(X1,X2)) = join(X1,meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_20]) ).
cnf(c_0_25,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_14]) ).
cnf(c_0_26,plain,
meet(join(X1,X2),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_27,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_23,c_0_15]) ).
cnf(c_0_28,hypothesis,
meet(join(X1,meet(X1,X2)),X3) = meet(X1,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_18,c_0_24]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_30,hypothesis,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X3,X1))),
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_31,plain,
meet(join(X1,X2),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,hypothesis,
meet(join(X1,meet(X2,X1)),X3) = meet(X1,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_33,plain,
meet(X1,meet(X2,meet(X3,X1))) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_34,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_35,hypothesis,
meet(X1,join(X2,X1)) = join(X1,meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_29]),c_0_19]) ).
cnf(c_0_36,hypothesis,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,join(X2,X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_30]),c_0_30]) ).
cnf(c_0_37,plain,
meet(join(X1,X2),join(meet(X3,X2),X1)) = join(meet(X3,X2),X1),
inference(spm,[status(thm)],[c_0_31,c_0_11]) ).
cnf(c_0_38,plain,
meet(X1,join(X2,meet(X2,X1))) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_14]),c_0_11]),c_0_32]),c_0_33]),c_0_34]),c_0_15]),c_0_35]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_21]) ).
cnf(c_0_40,hypothesis,
join(X1,meet(X2,join(X3,meet(X3,X1)))) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29]),c_0_21]),c_0_29]),c_0_18]),c_0_24]) ).
cnf(c_0_41,plain,
join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_29]),c_0_21]),c_0_21]) ).
cnf(c_0_42,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_43,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_11,c_0_21]) ).
cnf(c_0_44,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_38]) ).
cnf(c_0_45,hypothesis,
join(X1,join(X2,meet(X3,join(X4,X2)))) = join(X2,join(X1,meet(X4,join(X3,X2)))),
inference(spm,[status(thm)],[c_0_39,c_0_36]) ).
cnf(c_0_46,hypothesis,
join(X1,meet(X2,join(X3,meet(X1,X3)))) = join(meet(X2,X3),X1),
inference(spm,[status(thm)],[c_0_40,c_0_15]) ).
cnf(c_0_47,plain,
join(X1,join(meet(X1,X2),meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_26]),c_0_15]),c_0_24]),c_0_21]),c_0_41]),c_0_39]) ).
cnf(c_0_48,plain,
join(X1,join(meet(X1,X2),meet(X3,X2))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_31]),c_0_24]),c_0_21]),c_0_41]),c_0_39]) ).
cnf(c_0_49,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(spm,[status(thm)],[c_0_43,c_0_11]) ).
cnf(c_0_50,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X2,X1),X3),
inference(spm,[status(thm)],[c_0_21,c_0_44]) ).
cnf(c_0_51,hypothesis,
join(X1,meet(X2,join(X3,meet(X1,X2)))) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_43]),c_0_48]) ).
cnf(c_0_52,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_44]) ).
cnf(c_0_53,hypothesis,
join(X1,meet(X2,join(meet(X2,X1),X3))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_54,plain,
join(meet(X1,X2),meet(X1,join(meet(X1,X2),X3))) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_55,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
inference(fof_simplification,[status(thm)],[prove_modularity]) ).
cnf(c_0_56,hypothesis,
meet(X1,join(X2,meet(X1,X2))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_38]),c_0_14]),c_0_16]) ).
cnf(c_0_57,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_23]),c_0_54]) ).
cnf(c_0_58,plain,
join(X1,join(meet(X2,X3),meet(X1,X2))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_47,c_0_11]) ).
cnf(c_0_59,negated_conjecture,
meet(a,join(b,meet(a,c))) != join(meet(a,b),meet(a,c)),
c_0_55 ).
cnf(c_0_60,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = join(meet(X1,X3),meet(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_21]),c_0_58]),c_0_29]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60]),c_0_15]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LAT023-1 : TPTP v8.2.0. Released v2.2.0.
% 0.08/0.13 % Command : run_E %s %d SAT
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Jun 21 23:38:54 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.23/0.50 Running first-order model finding
% 0.23/0.50 Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.dtVMF5A1gP/E---3.1_29835.p
% 11.52/1.95 # Version: 3.2.0
% 11.52/1.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.52/1.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.52/1.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.52/1.95 # Starting new_bool_3 with 300s (1) cores
% 11.52/1.95 # Starting new_bool_1 with 300s (1) cores
% 11.52/1.95 # Starting sh5l with 300s (1) cores
% 11.52/1.95 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 29980 completed with status 0
% 11.52/1.95 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.52/1.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.52/1.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.52/1.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.52/1.95 # No SInE strategy applied
% 11.52/1.95 # Search class: FUUPM-FFSF22-MFFFFFNN
% 11.52/1.95 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 11.52/1.95 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 11.52/1.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.52/1.95 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.52/1.95 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.52/1.95 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 11.52/1.95 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 29990 completed with status 0
% 11.52/1.95 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 11.52/1.95 # Preprocessing class: FSSSSMSSSSSNFFN.
% 11.52/1.95 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.52/1.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.52/1.95 # No SInE strategy applied
% 11.52/1.95 # Search class: FUUPM-FFSF22-MFFFFFNN
% 11.52/1.95 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 11.52/1.95 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 11.52/1.95 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.52/1.95 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.52/1.95 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.52/1.95 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 11.52/1.95 # Preprocessing time : 0.002 s
% 11.52/1.95
% 11.52/1.95 # Proof found!
% 11.52/1.95 # SZS status Unsatisfiable
% 11.52/1.95 # SZS output start CNFRefutation
% See solution above
% 11.52/1.95 # Parsed axioms : 10
% 11.52/1.95 # Removed by relevancy pruning/SinE : 0
% 11.52/1.95 # Initial clauses : 10
% 11.52/1.95 # Removed in clause preprocessing : 0
% 11.52/1.95 # Initial clauses in saturation : 10
% 11.52/1.95 # Processed clauses : 3779
% 11.52/1.95 # ...of these trivial : 1282
% 11.52/1.95 # ...subsumed : 2230
% 11.52/1.95 # ...remaining for further processing : 267
% 11.52/1.95 # Other redundant clauses eliminated : 0
% 11.52/1.95 # Clauses deleted for lack of memory : 0
% 11.52/1.95 # Backward-subsumed : 0
% 11.52/1.95 # Backward-rewritten : 65
% 11.52/1.95 # Generated clauses : 88136
% 11.52/1.95 # ...of the previous two non-redundant : 73908
% 11.52/1.95 # ...aggressively subsumed : 0
% 11.52/1.95 # Contextual simplify-reflections : 0
% 11.52/1.95 # Paramodulations : 88136
% 11.52/1.95 # Factorizations : 0
% 11.52/1.95 # NegExts : 0
% 11.52/1.95 # Equation resolutions : 0
% 11.52/1.95 # Disequality decompositions : 0
% 11.52/1.95 # Total rewrite steps : 178190
% 11.52/1.95 # ...of those cached : 133223
% 11.52/1.95 # Propositional unsat checks : 0
% 11.52/1.95 # Propositional check models : 0
% 11.52/1.95 # Propositional check unsatisfiable : 0
% 11.52/1.95 # Propositional clauses : 0
% 11.52/1.95 # Propositional clauses after purity: 0
% 11.52/1.95 # Propositional unsat core size : 0
% 11.52/1.95 # Propositional preprocessing time : 0.000
% 11.52/1.95 # Propositional encoding time : 0.000
% 11.52/1.95 # Propositional solver time : 0.000
% 11.52/1.95 # Success case prop preproc time : 0.000
% 11.52/1.95 # Success case prop encoding time : 0.000
% 11.52/1.95 # Success case prop solver time : 0.000
% 11.52/1.95 # Current number of processed clauses : 202
% 11.52/1.95 # Positive orientable unit clauses : 163
% 11.52/1.95 # Positive unorientable unit clauses: 39
% 11.52/1.95 # Negative unit clauses : 0
% 11.52/1.95 # Non-unit-clauses : 0
% 11.52/1.95 # Current number of unprocessed clauses: 69801
% 11.52/1.95 # ...number of literals in the above : 69801
% 11.52/1.95 # Current number of archived formulas : 0
% 11.52/1.95 # Current number of archived clauses : 65
% 11.52/1.95 # Clause-clause subsumption calls (NU) : 0
% 11.52/1.95 # Rec. Clause-clause subsumption calls : 0
% 11.52/1.95 # Non-unit clause-clause subsumptions : 0
% 11.52/1.95 # Unit Clause-clause subsumption calls : 793
% 11.52/1.95 # Rewrite failures with RHS unbound : 0
% 11.52/1.95 # BW rewrite match attempts : 4053
% 11.52/1.95 # BW rewrite match successes : 470
% 11.52/1.95 # Condensation attempts : 0
% 11.52/1.95 # Condensation successes : 0
% 11.52/1.95 # Termbank termtop insertions : 1347974
% 11.52/1.95 # Search garbage collected termcells : 2
% 11.52/1.95
% 11.52/1.95 # -------------------------------------------------
% 11.52/1.95 # User time : 1.333 s
% 11.52/1.95 # System time : 0.066 s
% 11.52/1.95 # Total time : 1.399 s
% 11.52/1.95 # Maximum resident set size: 1556 pages
% 11.52/1.95
% 11.52/1.95 # -------------------------------------------------
% 11.52/1.95 # User time : 6.747 s
% 11.52/1.95 # System time : 0.326 s
% 11.52/1.95 # Total time : 7.073 s
% 11.52/1.95 # Maximum resident set size: 1688 pages
% 11.52/1.95 % E---3.1 exiting
% 11.52/1.95 % E exiting
%------------------------------------------------------------------------------