TSTP Solution File: RNG025-7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : RNG025-7 : TPTP v8.2.0. 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 : 300s
% WCLimit : 300s
% DateTime : Tue May 21 02:35:54 EDT 2024
% Result : Unsatisfiable 17.92s 2.71s
% Output : CNFRefutation 17.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 15
% 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 : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 130 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_for_addition,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).
cnf(right_additive_inverse,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_inverse) ).
cnf(left_additive_identity,axiom,
add(additive_identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_additive_identity) ).
cnf(additive_inverse_additive_inverse,axiom,
additive_inverse(additive_inverse(X1)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',additive_inverse_additive_inverse) ).
cnf(commutativity_for_addition,axiom,
add(X1,X2) = add(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).
cnf(inverse_product1,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product1) ).
cnf(inverse_product2,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',inverse_product2) ).
cnf(associator,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',associator) ).
cnf(distribute2,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute2) ).
cnf(right_alternative,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_alternative) ).
cnf(left_alternative,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',left_alternative) ).
cnf(distribute1,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',distribute1) ).
cnf(right_multiplicative_zero,axiom,
multiply(X1,additive_identity) = additive_identity,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_multiplicative_zero) ).
cnf(right_additive_identity,axiom,
add(X1,additive_identity) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/RNG003-0.ax',right_additive_identity) ).
cnf(prove_flexible_law,negated_conjecture,
associator(x,y,x) != additive_identity,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_flexible_law) ).
cnf(c_0_15,axiom,
add(X1,add(X2,X3)) = add(add(X1,X2),X3),
associativity_for_addition ).
cnf(c_0_16,axiom,
add(X1,additive_inverse(X1)) = additive_identity,
right_additive_inverse ).
cnf(c_0_17,axiom,
add(additive_identity,X1) = X1,
left_additive_identity ).
cnf(c_0_18,plain,
add(X1,add(additive_inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,axiom,
additive_inverse(additive_inverse(X1)) = X1,
additive_inverse_additive_inverse ).
cnf(c_0_20,plain,
add(additive_inverse(X1),add(X1,X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,axiom,
add(X1,X2) = add(X2,X1),
commutativity_for_addition ).
cnf(c_0_22,axiom,
multiply(additive_inverse(X1),X2) = additive_inverse(multiply(X1,X2)),
inverse_product1 ).
cnf(c_0_23,axiom,
multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
inverse_product2 ).
cnf(c_0_24,plain,
add(additive_inverse(X1),add(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,axiom,
associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
associator ).
cnf(c_0_26,plain,
multiply(additive_inverse(X1),X2) = multiply(X1,additive_inverse(X2)),
inference(rw,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
add(X1,additive_inverse(add(X1,X2))) = additive_inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_24]),c_0_21]) ).
cnf(c_0_28,plain,
add(multiply(X1,multiply(X2,additive_inverse(X3))),multiply(multiply(X1,X2),X3)) = associator(X1,X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_23]),c_0_23]),c_0_21]) ).
cnf(c_0_29,plain,
multiply(multiply(X1,additive_inverse(X2)),X3) = multiply(multiply(X1,X2),additive_inverse(X3)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,plain,
additive_inverse(add(X1,X2)) = add(additive_inverse(X1),additive_inverse(X2)),
inference(spm,[status(thm)],[c_0_20,c_0_27]) ).
cnf(c_0_31,plain,
add(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),additive_inverse(X3))) = associator(additive_inverse(X1),X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_26]),c_0_23]),c_0_19]),c_0_29]) ).
cnf(c_0_32,plain,
additive_inverse(associator(additive_inverse(X1),X2,X3)) = associator(X1,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_30,c_0_31]),c_0_23]),c_0_23]),c_0_23]),c_0_19]),c_0_28]) ).
cnf(c_0_33,axiom,
multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
distribute2 ).
cnf(c_0_34,axiom,
multiply(multiply(X1,X2),X2) = multiply(X1,multiply(X2,X2)),
right_alternative ).
cnf(c_0_35,plain,
additive_inverse(associator(X1,X2,X3)) = associator(additive_inverse(X1),X2,X3),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_36,plain,
associator(additive_inverse(X1),X2,additive_inverse(X3)) = associator(X1,X2,X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_19]),c_0_28]) ).
cnf(c_0_37,plain,
add(multiply(X1,X2),multiply(X3,multiply(X2,X2))) = multiply(add(X1,multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_38,axiom,
multiply(multiply(X1,X1),X2) = multiply(X1,multiply(X1,X2)),
left_alternative ).
cnf(c_0_39,plain,
associator(additive_inverse(X1),X2,X3) = associator(X1,X2,additive_inverse(X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_35]),c_0_19]) ).
cnf(c_0_40,axiom,
multiply(X1,add(X2,X3)) = add(multiply(X1,X2),multiply(X1,X3)),
distribute1 ).
cnf(c_0_41,plain,
add(multiply(X1,multiply(X1,X2)),multiply(X3,multiply(X2,X2))) = multiply(add(multiply(X1,X1),multiply(X3,X2)),X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
add(multiply(X1,multiply(X2,X3)),multiply(multiply(X1,X2),additive_inverse(X3))) = associator(X1,X2,additive_inverse(X3)),
inference(rw,[status(thm)],[c_0_31,c_0_39]) ).
cnf(c_0_43,plain,
multiply(multiply(X1,add(X1,X2)),X2) = multiply(X1,multiply(add(X1,X2),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_40]),c_0_33]) ).
cnf(c_0_44,axiom,
multiply(X1,additive_identity) = additive_identity,
right_multiplicative_zero ).
cnf(c_0_45,plain,
associator(X1,additive_inverse(X2),additive_inverse(X3)) = associator(X1,X2,X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_29]),c_0_26]),c_0_19]),c_0_28]) ).
cnf(c_0_46,plain,
associator(X1,add(X1,X2),X2) = additive_identity,
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_28,c_0_43]),c_0_40]),c_0_40]),c_0_21]),c_0_16]),c_0_44]),c_0_44]) ).
cnf(c_0_47,plain,
add(X1,add(X2,additive_inverse(X1))) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_48,plain,
add(multiply(X1,multiply(X2,additive_inverse(X3))),add(multiply(multiply(X1,X2),X3),X4)) = add(associator(X1,X2,X3),X4),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_49,plain,
associator(X1,additive_inverse(X2),X3) = associator(X1,X2,additive_inverse(X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_45]),c_0_39]),c_0_19]) ).
cnf(c_0_50,plain,
associator(X1,X2,add(additive_inverse(X1),X2)) = additive_identity,
inference(spm,[status(thm)],[c_0_46,c_0_18]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,X2),additive_inverse(X2)) = multiply(X1,multiply(X2,additive_inverse(X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_34]),c_0_23]),c_0_23]) ).
cnf(c_0_52,plain,
add(associator(X1,X2,X3),multiply(X1,multiply(X2,X3))) = multiply(multiply(X1,X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_23]),c_0_23]),c_0_19]) ).
cnf(c_0_53,plain,
associator(X1,X2,add(X1,X2)) = additive_identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_30]),c_0_19]),c_0_19]) ).
cnf(c_0_54,plain,
add(multiply(multiply(X1,X2),X3),multiply(X1,multiply(X2,additive_inverse(X2)))) = multiply(multiply(X1,X2),add(X3,additive_inverse(X2))),
inference(spm,[status(thm)],[c_0_40,c_0_51]) ).
cnf(c_0_55,plain,
multiply(multiply(X1,X2),add(X1,X2)) = multiply(X1,multiply(X2,add(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_17]) ).
cnf(c_0_56,axiom,
add(X1,additive_identity) = X1,
right_additive_identity ).
cnf(c_0_57,negated_conjecture,
associator(x,y,x) != additive_identity,
inference(fof_simplification,[status(thm)],[prove_flexible_law]) ).
cnf(c_0_58,plain,
multiply(multiply(X1,X2),X1) = multiply(X1,multiply(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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_40]),c_0_40]),c_0_15]),c_0_16]),c_0_56]),c_0_15]),c_0_16]),c_0_56]) ).
cnf(c_0_59,negated_conjecture,
associator(x,y,x) != additive_identity,
c_0_57 ).
cnf(c_0_60,plain,
associator(X1,X2,X1) = additive_identity,
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(rw,[status(thm)],[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_42,c_0_58]),c_0_26]),c_0_23]),c_0_26]),c_0_23]),c_0_19]),c_0_40]),c_0_40]),c_0_21]),c_0_16]),c_0_44]),c_0_44]),c_0_39]),c_0_19]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_60])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : RNG025-7 : TPTP v8.2.0. Released v1.0.0.
% 0.10/0.13 % Command : run_E %s %d THM
% 0.13/0.33 % Computer : n014.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 : Sat May 18 12:01:23 EDT 2024
% 0.13/0.33 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 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/benchmark/theBenchmark.p
% 17.92/2.71 # Version: 3.1.0
% 17.92/2.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.92/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.92/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.92/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.92/2.71 # Starting new_bool_1 with 300s (1) cores
% 17.92/2.71 # Starting sh5l with 300s (1) cores
% 17.92/2.71 # new_bool_1 with pid 24700 completed with status 0
% 17.92/2.71 # Result found by new_bool_1
% 17.92/2.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.92/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.92/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.92/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.92/2.71 # Starting new_bool_1 with 300s (1) cores
% 17.92/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.92/2.71 # Search class: FUUPM-FFMF32-MFFFFFNN
% 17.92/2.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 17.92/2.71 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 17.92/2.71 # G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with pid 24705 completed with status 0
% 17.92/2.71 # Result found by G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y
% 17.92/2.71 # Preprocessing class: FSMSSMSSSSSNFFN.
% 17.92/2.71 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 17.92/2.71 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 17.92/2.71 # Starting new_bool_3 with 300s (1) cores
% 17.92/2.71 # Starting new_bool_1 with 300s (1) cores
% 17.92/2.71 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 17.92/2.71 # Search class: FUUPM-FFMF32-MFFFFFNN
% 17.92/2.71 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 17.92/2.71 # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 117s (1) cores
% 17.92/2.71 # Preprocessing time : 0.001 s
% 17.92/2.71
% 17.92/2.71 # Proof found!
% 17.92/2.71 # SZS status Unsatisfiable
% 17.92/2.71 # SZS output start CNFRefutation
% See solution above
% 17.92/2.71 # Parsed axioms : 23
% 17.92/2.71 # Removed by relevancy pruning/SinE : 1
% 17.92/2.71 # Initial clauses : 22
% 17.92/2.71 # Removed in clause preprocessing : 0
% 17.92/2.71 # Initial clauses in saturation : 22
% 17.92/2.71 # Processed clauses : 3717
% 17.92/2.71 # ...of these trivial : 2370
% 17.92/2.71 # ...subsumed : 627
% 17.92/2.71 # ...remaining for further processing : 720
% 17.92/2.71 # Other redundant clauses eliminated : 0
% 17.92/2.71 # Clauses deleted for lack of memory : 0
% 17.92/2.71 # Backward-subsumed : 1
% 17.92/2.71 # Backward-rewritten : 103
% 17.92/2.71 # Generated clauses : 184328
% 17.92/2.71 # ...of the previous two non-redundant : 126904
% 17.92/2.71 # ...aggressively subsumed : 0
% 17.92/2.71 # Contextual simplify-reflections : 0
% 17.92/2.71 # Paramodulations : 184328
% 17.92/2.71 # Factorizations : 0
% 17.92/2.71 # NegExts : 0
% 17.92/2.71 # Equation resolutions : 0
% 17.92/2.71 # Disequality decompositions : 0
% 17.92/2.71 # Total rewrite steps : 907725
% 17.92/2.71 # ...of those cached : 831816
% 17.92/2.71 # Propositional unsat checks : 0
% 17.92/2.71 # Propositional check models : 0
% 17.92/2.71 # Propositional check unsatisfiable : 0
% 17.92/2.71 # Propositional clauses : 0
% 17.92/2.71 # Propositional clauses after purity: 0
% 17.92/2.71 # Propositional unsat core size : 0
% 17.92/2.71 # Propositional preprocessing time : 0.000
% 17.92/2.71 # Propositional encoding time : 0.000
% 17.92/2.71 # Propositional solver time : 0.000
% 17.92/2.71 # Success case prop preproc time : 0.000
% 17.92/2.71 # Success case prop encoding time : 0.000
% 17.92/2.71 # Success case prop solver time : 0.000
% 17.92/2.71 # Current number of processed clauses : 616
% 17.92/2.71 # Positive orientable unit clauses : 590
% 17.92/2.71 # Positive unorientable unit clauses: 26
% 17.92/2.71 # Negative unit clauses : 0
% 17.92/2.71 # Non-unit-clauses : 0
% 17.92/2.71 # Current number of unprocessed clauses: 122620
% 17.92/2.71 # ...number of literals in the above : 122620
% 17.92/2.71 # Current number of archived formulas : 0
% 17.92/2.71 # Current number of archived clauses : 104
% 17.92/2.71 # Clause-clause subsumption calls (NU) : 0
% 17.92/2.71 # Rec. Clause-clause subsumption calls : 0
% 17.92/2.71 # Non-unit clause-clause subsumptions : 0
% 17.92/2.71 # Unit Clause-clause subsumption calls : 486
% 17.92/2.71 # Rewrite failures with RHS unbound : 0
% 17.92/2.71 # BW rewrite match attempts : 12796
% 17.92/2.71 # BW rewrite match successes : 234
% 17.92/2.71 # Condensation attempts : 0
% 17.92/2.71 # Condensation successes : 0
% 17.92/2.71 # Termbank termtop insertions : 4332233
% 17.92/2.71 # Search garbage collected termcells : 6
% 17.92/2.71
% 17.92/2.71 # -------------------------------------------------
% 17.92/2.71 # User time : 2.096 s
% 17.92/2.71 # System time : 0.098 s
% 17.92/2.71 # Total time : 2.194 s
% 17.92/2.71 # Maximum resident set size: 1640 pages
% 17.92/2.71
% 17.92/2.71 # -------------------------------------------------
% 17.92/2.71 # User time : 2.096 s
% 17.92/2.71 # System time : 0.101 s
% 17.92/2.71 # Total time : 2.197 s
% 17.92/2.71 # Maximum resident set size: 1708 pages
% 17.92/2.71 % E---3.1 exiting
% 17.92/2.71 % E exiting
%------------------------------------------------------------------------------