%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:27:08 PM UTC 2026
% Result : Theorem 0.14s 0.41s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 16 unt; 0 def)
% Number of atoms : 159 ( 6 equ)
% Maximal formula atoms : 10 ( 3 avg)
% Number of connectives : 188 ( 75 ~; 66 |; 39 &)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 110 ( 0 sgn 65 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t12_FOL,conjecture,
! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_FOL) ).
fof(mp10,axiom,
! [X1,X6,X7,X8,X9] :
( ( class(X1,X9,X7)
& class(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> X8 = X9 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp10) ).
fof(mp9,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X5] : class(X1,X5,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp9) ).
fof(a12_FOL,hypothesis,
! [X1,X4,X5,X8,X9,X10,X11,X6,X7] :
( ( greater(X9,X8)
& inertia(X4,X11,X7)
& inertia(X1,X10,X6)
& complexity(X4,X9,X7)
& complexity(X1,X8,X6)
& class(X4,X5,X7)
& class(X1,X5,X6)
& organization(X4,X7)
& organization(X1,X6) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a12_FOL) ).
fof(t2_FOL,hypothesis,
! [X1,X10,X11,X6,X7] :
( ( greater(X7,X6)
& inertia(X1,X11,X7)
& inertia(X1,X10,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> greater(X11,X10) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_FOL) ).
fof(mp5,axiom,
! [X1,X2] :
( organization(X1,X2)
=> ? [X3] : inertia(X1,X3,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp5) ).
fof(mp6_2,axiom,
! [X1,X4] :
~ ( greater(X4,X1)
& greater(X1,X4) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mp6_2) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
inference(assume_negation,[status(cth)],[t12_FOL]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1,X8,X9,X6,X7] :
( ( greater(X7,X6)
& complexity(X1,X9,X7)
& complexity(X1,X8,X6)
& reorganization_free(X1,X6,X7)
& organization(X1,X7)
& organization(X1,X6) )
=> ~ greater(X8,X9) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X22,X23,X24,X25,X26] :
( X25 = X26
| ~ class(X22,X26,X24)
| ~ class(X22,X25,X23)
| ~ reorganization_free(X22,X23,X24)
| ~ organization(X22,X24)
| ~ organization(X22,X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp10])])]) ).
fof(c_0_10,negated_conjecture,
( greater(esk4_0,esk5_0)
& greater(esk7_0,esk6_0)
& complexity(esk3_0,esk5_0,esk7_0)
& complexity(esk3_0,esk4_0,esk6_0)
& reorganization_free(esk3_0,esk6_0,esk7_0)
& organization(esk3_0,esk7_0)
& organization(esk3_0,esk6_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
fof(c_0_11,plain,
! [X19,X20] :
( class(X19,esk2_2(X19,X20),X20)
| ~ organization(X19,X20) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp9])])])]) ).
cnf(c_0_12,plain,
( ~ class(X1,X5,X3)
| ~ class(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
reorganization_free(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
organization(esk3_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
organization(esk3_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ organization(X1,X2)
| class(X1,esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,hypothesis,
! [X27,X28,X29,X30,X31,X32,X33,X34,X35] :
( greater(X33,X32)
| ~ greater(X31,X30)
| ~ inertia(X28,X33,X35)
| ~ inertia(X27,X32,X34)
| ~ complexity(X28,X31,X35)
| ~ complexity(X27,X30,X34)
| ~ class(X28,X29,X35)
| ~ class(X27,X29,X34)
| ~ organization(X28,X35)
| ~ organization(X27,X34) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[a12_FOL])])]) ).
cnf(c_0_18,negated_conjecture,
( ~ class(esk3_0,X1,esk6_0)
| ~ class(esk3_0,X2,esk7_0)
| X1 = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]) ).
cnf(c_0_19,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
fof(c_0_20,hypothesis,
! [X36,X37,X38,X39,X40] :
( greater(X38,X37)
| ~ greater(X40,X39)
| ~ inertia(X36,X38,X40)
| ~ inertia(X36,X37,X39)
| ~ reorganization_free(X36,X39,X40)
| ~ organization(X36,X40)
| ~ organization(X36,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_FOL])])]) ).
fof(c_0_21,plain,
! [X12,X13] :
( inertia(X12,esk1_2(X12,X13),X13)
| ~ organization(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp5])])])]) ).
cnf(c_0_22,hypothesis,
( ~ greater(X7,X6)
| ~ inertia(X3,X9,X4)
| ~ inertia(X1,X8,X2)
| ~ complexity(X3,X7,X4)
| ~ complexity(X1,X6,X2)
| ~ class(X3,X5,X4)
| ~ class(X1,X5,X2)
| ~ organization(X3,X4)
| ~ organization(X1,X2)
| greater(X9,X8) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
complexity(esk3_0,esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_24,negated_conjecture,
( ~ class(esk3_0,X1,esk6_0)
| X1 = esk2_2(esk3_0,esk7_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_26,hypothesis,
( ~ greater(X3,X2)
| ~ inertia(X1,X5,X3)
| ~ inertia(X1,X4,X2)
| ~ reorganization_free(X1,X2,X3)
| ~ organization(X1,X3)
| ~ organization(X1,X2)
| greater(X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,negated_conjecture,
greater(esk7_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_28,plain,
( ~ organization(X1,X2)
| inertia(X1,esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ organization(X3,X5)
| ~ inertia(X3,X2,X5)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ greater(esk4_0,X4)
| ~ class(X3,X6,X5)
| ~ class(esk3_0,X6,esk6_0)
| ~ complexity(X3,X4,X5)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15])]) ).
cnf(c_0_30,negated_conjecture,
complexity(esk3_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
greater(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_32,negated_conjecture,
esk2_2(esk3_0,esk7_0) = esk2_2(esk3_0,esk6_0),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_33,negated_conjecture,
( ~ inertia(esk3_0,X2,esk6_0)
| ~ inertia(esk3_0,X1,esk7_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_13]),c_0_27]),c_0_14]),c_0_15])]) ).
cnf(c_0_34,negated_conjecture,
inertia(esk3_0,esk1_2(esk3_0,esk7_0),esk7_0),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( ~ inertia(esk3_0,X2,esk7_0)
| ~ inertia(esk3_0,X1,esk6_0)
| ~ class(esk3_0,X3,esk7_0)
| ~ class(esk3_0,X3,esk6_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_14])]) ).
cnf(c_0_36,negated_conjecture,
class(esk3_0,esk2_2(esk3_0,esk6_0),esk7_0),
inference(rw,[status(thm)],[c_0_19,c_0_32]) ).
fof(c_0_37,plain,
! [X17,X18] :
( ~ greater(X18,X17)
| ~ greater(X17,X18) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mp6_2])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ inertia(esk3_0,X1,esk6_0)
| greater(esk1_2(esk3_0,esk7_0),X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
inertia(esk3_0,esk1_2(esk3_0,esk6_0),esk6_0),
inference(spm,[status(thm)],[c_0_28,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
( ~ inertia(esk3_0,X2,esk7_0)
| ~ inertia(esk3_0,X1,esk6_0)
| greater(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_25]),c_0_36])]) ).
cnf(c_0_41,plain,
( ~ greater(X2,X1)
| ~ greater(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_42,negated_conjecture,
greater(esk1_2(esk3_0,esk7_0),esk1_2(esk3_0,esk6_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( ~ inertia(esk3_0,X1,esk7_0)
| greater(esk1_2(esk3_0,esk6_0),X1) ),
inference(spm,[status(thm)],[c_0_40,c_0_39]) ).
cnf(c_0_44,negated_conjecture,
~ greater(esk1_2(esk3_0,esk6_0),esk1_2(esk3_0,esk7_0)),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : MGT012+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n010.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 01:21:26 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.10/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.39 Running first-order theorem proving
% 0.14/0.39 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
% 0.14/0.41 % Version: 3.5.1
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.41 % Starting sh5l with 300s (1) cores
% 0.14/0.41 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3946491 completed with status 0
% 0.14/0.41 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % new_bool_1 with pid 3946499 completed with status 0
% 0.14/0.41 % Result found by new_bool_1
% 0.14/0.41 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.41 % No SInE strategy applied
% 0.14/0.41 % Search class: FHHSF-FFSM22-SFFFFFNN
% 0.14/0.41 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.41 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.41 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.14/0.41 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.41 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.41 % Preprocessing time : 0.001 s
% 0.14/0.41 % Presaturation interreduction done
% 0.14/0.41
% 0.14/0.41 % Proof found!
% 0.14/0.41 % SZS status Theorem
% 0.14/0.41 % SZS output start CNFRefutation
% See solution above
% 0.14/0.41 % Parsed axioms : 8
% 0.14/0.41 % Removed by relevancy pruning/SinE : 0
% 0.14/0.41 % Initial clauses : 14
% 0.14/0.41 % Removed in clause preprocessing : 0
% 0.14/0.41 % Initial clauses in saturation : 14
% 0.14/0.41 % Processed clauses : 52
% 0.14/0.41 % ...of these trivial : 0
% 0.14/0.41 % ...subsumed : 3
% 0.14/0.41 % ...remaining for further processing : 49
% 0.14/0.41 % Other redundant clauses eliminated : 1
% 0.14/0.41 % Clauses deleted for lack of memory : 0
% 0.14/0.41 % Backward-subsumed : 1
% 0.14/0.41 % Backward-rewritten : 2
% 0.14/0.41 % Generated clauses : 24
% 0.14/0.41 % ...of the previous two non-redundant : 25
% 0.14/0.41 % ...aggressively subsumed : 0
% 0.14/0.41 % Contextual simplify-reflections : 0
% 0.14/0.41 % Paramodulations : 23
% 0.14/0.41 % Factorizations : 0
% 0.14/0.41 % NegExts : 0
% 0.14/0.41 % Equation resolutions : 1
% 0.14/0.41 % Disequality decompositions : 0
% 0.14/0.41 % Total rewrite steps : 15
% 0.14/0.41 % ...of those cached : 9
% 0.14/0.41 % Propositional unsat checks : 0
% 0.14/0.41 % Propositional check models : 0
% 0.14/0.41 % Propositional check unsatisfiable : 0
% 0.14/0.41 % Propositional clauses : 0
% 0.14/0.41 % Propositional clauses after purity: 0
% 0.14/0.41 % Propositional unsat core size : 0
% 0.14/0.41 % Propositional preprocessing time : 0.000
% 0.14/0.41 % Propositional encoding time : 0.000
% 0.14/0.41 % Propositional solver time : 0.000
% 0.14/0.41 % Success case prop preproc time : 0.000
% 0.14/0.41 % Success case prop encoding time : 0.000
% 0.14/0.41 % Success case prop solver time : 0.000
% 0.14/0.41 % Current number of processed clauses : 31
% 0.14/0.41 % Positive orientable unit clauses : 13
% 0.14/0.41 % Positive unorientable unit clauses: 0
% 0.14/0.41 % Negative unit clauses : 4
% 0.14/0.41 % Non-unit-clauses : 14
% 0.14/0.41 % Current number of unprocessed clauses: 1
% 0.14/0.41 % ...number of literals in the above : 5
% 0.14/0.41 % Current number of archived formulas : 0
% 0.14/0.41 % Current number of archived clauses : 17
% 0.14/0.41 % Clause-clause subsumption calls (NU) : 188
% 0.14/0.41 % Rec. Clause-clause subsumption calls : 19
% 0.14/0.41 % Non-unit clause-clause subsumptions : 2
% 0.14/0.41 % Unit Clause-clause subsumption calls : 7
% 0.14/0.41 % Rewrite failures with RHS unbound : 0
% 0.14/0.41 % BW rewrite match attempts : 2
% 0.14/0.41 % BW rewrite match successes : 1
% 0.14/0.41 % Condensation attempts : 0
% 0.14/0.41 % Condensation successes : 0
% 0.14/0.41 % Termbank termtop insertions : 1985
% 0.14/0.41 % Search garbage collected termcells : 332
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.004 s
% 0.14/0.41 % System time : 0.002 s
% 0.14/0.41 % Total time : 0.006 s
% 0.14/0.41 % Maximum resident set size: 3644 pages
% 0.14/0.41
% 0.14/0.41 % -------------------------------------------------
% 0.14/0.41 % User time : 0.019 s
% 0.14/0.41 % System time : 0.011 s
% 0.14/0.41 % Total time : 0.030 s
% 0.14/0.41 % Maximum resident set size: 4864 pages
% 0.14/0.41 % E exiting
%------------------------------------------------------------------------------