TSTP Solution File: RNG007-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : RNG007-1 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:14:40 EDT 2023
% Result : Unsatisfiable 0.81s 0.58s
% Output : CNFRefutation 0.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of clauses : 70 ( 36 unt; 0 nHn; 36 RR)
% Number of literals : 142 ( 12 equ; 74 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 179 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(addition_is_well_defined,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',addition_is_well_defined) ).
cnf(additive_identity1,axiom,
sum(additive_identity,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',additive_identity1) ).
cnf(commutativity_of_addition,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',commutativity_of_addition) ).
cnf(closure_of_addition,axiom,
sum(X1,X2,add(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',closure_of_addition) ).
cnf(associativity_of_addition2,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',associativity_of_addition2) ).
cnf(left_inverse,axiom,
sum(additive_inverse(X1),X1,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',left_inverse) ).
cnf(distributivity1,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',distributivity1) ).
cnf(x_squared_is_x,hypothesis,
product(X1,X1,X1),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',x_squared_is_x) ).
cnf(associativity_of_addition1,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',associativity_of_addition1) ).
cnf(closure_of_multiplication,axiom,
product(X1,X2,multiply(X1,X2)),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',closure_of_multiplication) ).
cnf(right_inverse,axiom,
sum(X1,additive_inverse(X1),additive_identity),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',right_inverse) ).
cnf(distributivity3,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ product(X6,X2,X7) ),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',distributivity3) ).
cnf(prove_a_plus_a_is_id,negated_conjecture,
~ sum(a,a,additive_identity),
file('/export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p',prove_a_plus_a_is_id) ).
cnf(c_0_13,axiom,
( X3 = X4
| ~ sum(X1,X2,X3)
| ~ sum(X1,X2,X4) ),
addition_is_well_defined ).
cnf(c_0_14,axiom,
sum(additive_identity,X1,X1),
additive_identity1 ).
cnf(c_0_15,axiom,
( sum(X2,X1,X3)
| ~ sum(X1,X2,X3) ),
commutativity_of_addition ).
cnf(c_0_16,axiom,
sum(X1,X2,add(X1,X2)),
closure_of_addition ).
cnf(c_0_17,axiom,
( sum(X3,X4,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X1,X5,X6) ),
associativity_of_addition2 ).
cnf(c_0_18,axiom,
sum(additive_inverse(X1),X1,additive_identity),
left_inverse ).
cnf(c_0_19,plain,
( X1 = X2
| ~ sum(additive_identity,X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,plain,
sum(X1,X2,add(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_21,plain,
( sum(X1,X2,X3)
| ~ sum(X4,additive_inverse(X2),X1)
| ~ sum(X4,additive_identity,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
add(X1,additive_identity) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X1,X4,X5)
| ~ sum(X2,X4,X6)
| ~ product(X1,X6,X7) ),
distributivity1 ).
cnf(c_0_24,hypothesis,
product(X1,X1,X1),
x_squared_is_x ).
cnf(c_0_25,plain,
( sum(X1,X2,X3)
| ~ sum(X3,additive_inverse(X2),X1) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_16]),c_0_22]) ).
cnf(c_0_26,hypothesis,
( sum(X1,X2,X3)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ sum(X5,X4,X3) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,axiom,
( sum(X1,X5,X6)
| ~ sum(X1,X2,X3)
| ~ sum(X2,X4,X5)
| ~ sum(X3,X4,X6) ),
associativity_of_addition1 ).
cnf(c_0_28,plain,
( X1 = add(X2,X3)
| ~ sum(X2,X3,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_29,plain,
sum(additive_identity,X1,additive_inverse(additive_inverse(X1))),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_30,plain,
add(additive_identity,X1) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_31,hypothesis,
( sum(X1,X2,X2)
| ~ product(X2,X3,X1)
| ~ sum(X3,X2,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_32,axiom,
product(X1,X2,multiply(X1,X2)),
closure_of_multiplication ).
cnf(c_0_33,plain,
( X1 = additive_identity
| ~ sum(additive_inverse(X2),X2,X1) ),
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_34,plain,
( sum(X1,X2,additive_identity)
| ~ sum(X1,X3,additive_inverse(X4))
| ~ sum(X3,X4,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_35,axiom,
sum(X1,additive_inverse(X1),additive_identity),
right_inverse ).
cnf(c_0_36,plain,
additive_inverse(additive_inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_37,hypothesis,
( sum(multiply(X1,X2),X1,X1)
| ~ sum(X2,X1,X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_38,plain,
sum(add(X1,additive_inverse(X2)),X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_39,plain,
add(X1,additive_inverse(X1)) = additive_identity,
inference(spm,[status(thm)],[c_0_33,c_0_20]) ).
cnf(c_0_40,plain,
( sum(X1,additive_identity,additive_identity)
| ~ sum(X1,X2,X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_41,hypothesis,
sum(multiply(X1,additive_identity),X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,axiom,
( sum(X3,X5,X7)
| ~ product(X1,X2,X3)
| ~ product(X4,X2,X5)
| ~ sum(X1,X4,X6)
| ~ product(X6,X2,X7) ),
distributivity3 ).
cnf(c_0_43,hypothesis,
sum(multiply(X1,additive_identity),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_44,hypothesis,
( sum(X1,X2,X3)
| ~ product(X4,X3,X2)
| ~ product(X5,X3,X1)
| ~ sum(X5,X4,X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_24]) ).
cnf(c_0_45,hypothesis,
multiply(X1,additive_identity) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_43]),c_0_22]) ).
cnf(c_0_46,hypothesis,
( sum(X1,X2,X2)
| ~ product(X3,X2,X1)
| ~ sum(X3,X2,X2) ),
inference(spm,[status(thm)],[c_0_44,c_0_24]) ).
cnf(c_0_47,hypothesis,
product(X1,additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_32,c_0_45]) ).
cnf(c_0_48,hypothesis,
( sum(multiply(X1,X2),X2,X2)
| ~ sum(X1,X2,X2) ),
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_49,hypothesis,
( sum(X1,X2,additive_identity)
| ~ product(X3,X4,X2)
| ~ product(X3,X5,X1)
| ~ sum(X5,X4,additive_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_47]) ).
cnf(c_0_50,plain,
( sum(X1,X2,X3)
| ~ sum(X1,X4,additive_identity)
| ~ sum(X4,X3,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_14]) ).
cnf(c_0_51,hypothesis,
sum(multiply(additive_identity,X1),X1,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_38]),c_0_39]) ).
cnf(c_0_52,hypothesis,
( sum(X1,X2,additive_identity)
| ~ product(X2,X3,X1)
| ~ sum(X3,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_49,c_0_24]) ).
cnf(c_0_53,plain,
( sum(X1,add(X2,X3),X3)
| ~ sum(X1,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_50,c_0_16]) ).
cnf(c_0_54,hypothesis,
sum(multiply(additive_identity,X1),additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_40,c_0_51]) ).
cnf(c_0_55,plain,
( sum(X1,X2,add(X3,X4))
| ~ sum(X5,X3,X2)
| ~ sum(X1,X5,X4) ),
inference(spm,[status(thm)],[c_0_27,c_0_20]) ).
cnf(c_0_56,hypothesis,
( sum(multiply(X1,X2),X1,additive_identity)
| ~ sum(X2,X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_52,c_0_32]) ).
cnf(c_0_57,plain,
sum(additive_inverse(X1),add(X1,X2),X2),
inference(spm,[status(thm)],[c_0_53,c_0_18]) ).
cnf(c_0_58,hypothesis,
multiply(additive_identity,X1) = additive_identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_54]),c_0_22]) ).
cnf(c_0_59,plain,
( sum(X1,additive_identity,add(X2,X3))
| ~ sum(X1,additive_inverse(X2),X3) ),
inference(spm,[status(thm)],[c_0_55,c_0_18]) ).
cnf(c_0_60,hypothesis,
sum(multiply(X1,additive_inverse(X1)),X1,additive_identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_22]),c_0_22]) ).
cnf(c_0_61,hypothesis,
product(additive_identity,X1,additive_identity),
inference(spm,[status(thm)],[c_0_32,c_0_58]) ).
cnf(c_0_62,hypothesis,
sum(multiply(additive_inverse(X1),X1),additive_identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_36]),c_0_22]) ).
cnf(c_0_63,hypothesis,
( sum(X1,X2,additive_identity)
| ~ product(X3,X4,X2)
| ~ product(X5,X4,X1)
| ~ sum(X5,X3,additive_identity) ),
inference(spm,[status(thm)],[c_0_42,c_0_61]) ).
cnf(c_0_64,hypothesis,
multiply(additive_inverse(X1),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_62]),c_0_22]) ).
cnf(c_0_65,hypothesis,
( sum(X1,X2,additive_identity)
| ~ product(X3,X2,X1)
| ~ sum(X3,X2,additive_identity) ),
inference(spm,[status(thm)],[c_0_63,c_0_24]) ).
cnf(c_0_66,hypothesis,
product(additive_inverse(X1),X1,X1),
inference(spm,[status(thm)],[c_0_32,c_0_64]) ).
cnf(c_0_67,negated_conjecture,
~ sum(a,a,additive_identity),
prove_a_plus_a_is_id ).
cnf(c_0_68,hypothesis,
sum(X1,X1,additive_identity),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_18])]) ).
cnf(c_0_69,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : RNG007-1 : TPTP v8.1.2. Released v1.0.0.
% 0.13/0.15 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n014.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 2400
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon Oct 2 19:35:04 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.qnNG1JcrO1/E---3.1_2805.p
% 0.81/0.58 # Version: 3.1pre001
% 0.81/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.81/0.58 # Starting new_bool_3 with 300s (1) cores
% 0.81/0.58 # Starting new_bool_1 with 300s (1) cores
% 0.81/0.58 # Starting sh5l with 300s (1) cores
% 0.81/0.58 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2915 completed with status 0
% 0.81/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.81/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.81/0.58 # No SInE strategy applied
% 0.81/0.58 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.81/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.81/0.58 # Starting new_bool_3 with 136s (1) cores
% 0.81/0.58 # Starting new_bool_1 with 136s (1) cores
% 0.81/0.58 # Starting sh5l with 136s (1) cores
% 0.81/0.58 # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 2919 completed with status 0
% 0.81/0.58 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.81/0.58 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.81/0.58 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.81/0.58 # No SInE strategy applied
% 0.81/0.58 # Search class: FHUSM-FFMF21-SFFFFFNN
% 0.81/0.58 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.81/0.58 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 811s (1) cores
% 0.81/0.58 # Preprocessing time : 0.001 s
% 0.81/0.58 # Presaturation interreduction done
% 0.81/0.58
% 0.81/0.58 # Proof found!
% 0.81/0.58 # SZS status Unsatisfiable
% 0.81/0.58 # SZS output start CNFRefutation
% See solution above
% 0.81/0.58 # Parsed axioms : 19
% 0.81/0.58 # Removed by relevancy pruning/SinE : 0
% 0.81/0.58 # Initial clauses : 19
% 0.81/0.58 # Removed in clause preprocessing : 0
% 0.81/0.58 # Initial clauses in saturation : 19
% 0.81/0.58 # Processed clauses : 1052
% 0.81/0.58 # ...of these trivial : 89
% 0.81/0.58 # ...subsumed : 571
% 0.81/0.58 # ...remaining for further processing : 392
% 0.81/0.58 # Other redundant clauses eliminated : 0
% 0.81/0.58 # Clauses deleted for lack of memory : 0
% 0.81/0.58 # Backward-subsumed : 7
% 0.81/0.58 # Backward-rewritten : 21
% 0.81/0.58 # Generated clauses : 4368
% 0.81/0.58 # ...of the previous two non-redundant : 2464
% 0.81/0.58 # ...aggressively subsumed : 0
% 0.81/0.58 # Contextual simplify-reflections : 0
% 0.81/0.58 # Paramodulations : 4368
% 0.81/0.58 # Factorizations : 0
% 0.81/0.58 # NegExts : 0
% 0.81/0.58 # Equation resolutions : 0
% 0.81/0.58 # Total rewrite steps : 4182
% 0.81/0.58 # Propositional unsat checks : 0
% 0.81/0.58 # Propositional check models : 0
% 0.81/0.58 # Propositional check unsatisfiable : 0
% 0.81/0.58 # Propositional clauses : 0
% 0.81/0.58 # Propositional clauses after purity: 0
% 0.81/0.58 # Propositional unsat core size : 0
% 0.81/0.58 # Propositional preprocessing time : 0.000
% 0.81/0.58 # Propositional encoding time : 0.000
% 0.81/0.58 # Propositional solver time : 0.000
% 0.81/0.58 # Success case prop preproc time : 0.000
% 0.81/0.58 # Success case prop encoding time : 0.000
% 0.81/0.58 # Success case prop solver time : 0.000
% 0.81/0.58 # Current number of processed clauses : 345
% 0.81/0.58 # Positive orientable unit clauses : 44
% 0.81/0.58 # Positive unorientable unit clauses: 1
% 0.81/0.58 # Negative unit clauses : 0
% 0.81/0.58 # Non-unit-clauses : 300
% 0.81/0.58 # Current number of unprocessed clauses: 1278
% 0.81/0.58 # ...number of literals in the above : 2309
% 0.81/0.58 # Current number of archived formulas : 0
% 0.81/0.58 # Current number of archived clauses : 47
% 0.81/0.58 # Clause-clause subsumption calls (NU) : 30394
% 0.81/0.58 # Rec. Clause-clause subsumption calls : 23964
% 0.81/0.58 # Non-unit clause-clause subsumptions : 562
% 0.81/0.58 # Unit Clause-clause subsumption calls : 113
% 0.81/0.58 # Rewrite failures with RHS unbound : 0
% 0.81/0.58 # BW rewrite match attempts : 465
% 0.81/0.58 # BW rewrite match successes : 29
% 0.81/0.58 # Condensation attempts : 0
% 0.81/0.58 # Condensation successes : 0
% 0.81/0.58 # Termbank termtop insertions : 40395
% 0.81/0.58
% 0.81/0.58 # -------------------------------------------------
% 0.81/0.58 # User time : 0.067 s
% 0.81/0.58 # System time : 0.007 s
% 0.81/0.58 # Total time : 0.074 s
% 0.81/0.58 # Maximum resident set size: 1660 pages
% 0.81/0.58
% 0.81/0.58 # -------------------------------------------------
% 0.81/0.58 # User time : 0.340 s
% 0.81/0.58 # System time : 0.015 s
% 0.81/0.58 # Total time : 0.356 s
% 0.81/0.58 # Maximum resident set size: 1688 pages
% 0.81/0.58 % E---3.1 exiting
% 0.81/0.58 % E---3.1 exiting
%------------------------------------------------------------------------------