TSTP Solution File: PUZ086^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PUZ086^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:25:08 EDT 2024
% Result : Theorem 0.36s 0.57s
% Output : CNFRefutation 0.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 30
% Syntax : Number of formulae : 63 ( 25 unt; 17 typ; 0 def)
% Number of atoms : 148 ( 16 equ; 0 cnn)
% Maximal formula atoms : 18 ( 3 avg)
% Number of connectives : 294 ( 57 ~; 50 |; 8 &; 179 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 66 ( 66 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 6 con; 0-3 aty)
% Number of variables : 87 ( 36 ^ 51 !; 0 ?; 87 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_39,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
peter: $i > $i > $o ).
thf(decl_54,type,
john: $i > $i > $o ).
thf(decl_56,type,
time: $i > $o ).
thf(decl_57,type,
place: $i > $o ).
thf(decl_58,type,
appointment: $i > $o ).
thf(decl_63,type,
esk5_0: $i ).
thf(decl_64,type,
esk6_0: $i ).
thf(decl_65,type,
esk7_0: $i ).
thf(decl_66,type,
esk8_0: $i ).
thf(decl_67,type,
esk9_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mand) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(ax_d,axiom,
mvalid @ ( mbox @ peter @ ( mbox @ john @ ( mimplies @ ( mand @ place @ time ) @ appointment ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_d) ).
thf(ax_b,axiom,
mvalid @ ( mbox @ peter @ ( mbox @ john @ place ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_b) ).
thf(ax_a,axiom,
mvalid @ ( mbox @ peter @ time ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax_a) ).
thf(refl_peter,axiom,
mreflexive @ peter,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',refl_peter) ).
thf(refl_john,axiom,
mreflexive @ john,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',refl_john) ).
thf(conj,conjecture,
mvalid @ ( mand @ ( mbox @ peter @ ( mbox @ john @ appointment ) ) @ ( mbox @ john @ ( mbox @ peter @ appointment ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_13,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_14,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_15,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_16,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_17,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
thf(c_0_18,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_16,c_0_14]),c_0_15]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_22,plain,
! [X55: $i,X54: $i] :
( ~ ( peter @ X55 @ X54 )
| ! [X53: $i] :
( ~ ( john @ X54 @ X53 )
| ~ ~ ( ~ ( place @ X53 )
| ~ ( time @ X53 ) )
| ( appointment @ X53 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_d,c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_23,plain,
! [X48: $i,X47: $i] :
( ~ ( peter @ X48 @ X47 )
| ! [X46: $i] :
( ~ ( john @ X47 @ X46 )
| ( place @ X46 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_b,c_0_19]),c_0_20])]) ).
thf(c_0_24,plain,
! [X45: $i,X44: $i] :
( ~ ( peter @ X45 @ X44 )
| ( time @ X44 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax_a,c_0_19]),c_0_20])]) ).
thf(c_0_25,plain,
! [X22: $i] : ( peter @ X22 @ X22 ),
inference(apply_def,[status(thm)],[refl_peter,c_0_21]) ).
thf(c_0_26,plain,
! [X92: $i,X93: $i,X94: $i] :
( ~ ( peter @ X92 @ X93 )
| ~ ( john @ X93 @ X94 )
| ~ ( place @ X94 )
| ~ ( time @ X94 )
| ( appointment @ X94 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])])]) ).
thf(c_0_27,plain,
! [X85: $i,X86: $i,X87: $i] :
( ~ ( peter @ X85 @ X86 )
| ~ ( john @ X86 @ X87 )
| ( place @ X87 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])])]) ).
thf(c_0_28,plain,
! [X83: $i,X84: $i] :
( ~ ( peter @ X83 @ X84 )
| ( time @ X84 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
thf(c_0_29,plain,
! [X61: $i] : ( peter @ X61 @ X61 ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
thf(c_0_30,plain,
! [X14: $i,X3: $i,X15: $i] :
( ( appointment @ X15 )
| ~ ( peter @ X3 @ X14 )
| ~ ( john @ X14 @ X15 )
| ~ ( place @ X15 )
| ~ ( time @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
thf(c_0_31,plain,
! [X14: $i,X3: $i,X15: $i] :
( ( place @ X15 )
| ~ ( peter @ X3 @ X14 )
| ~ ( john @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_32,plain,
! [X3: $i,X14: $i] :
( ( time @ X14 )
| ~ ( peter @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
thf(c_0_33,plain,
! [X3: $i] : ( peter @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_34,plain,
! [X14: $i,X15: $i,X3: $i] :
( ( appointment @ X3 )
| ~ ( peter @ X14 @ X15 )
| ~ ( john @ X15 @ X3 )
| ~ ( time @ X3 ) ),
inference(csr,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_35,plain,
! [X3: $i] : ( time @ X3 ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_36,plain,
! [X23: $i] : ( john @ X23 @ X23 ),
inference(apply_def,[status(thm)],[refl_john,c_0_21]) ).
thf(c_0_37,negated_conjecture,
~ ! [X60: $i] :
~ ( ~ ! [X57: $i] :
( ~ ( peter @ X60 @ X57 )
| ! [X56: $i] :
( ~ ( john @ X57 @ X56 )
| ( appointment @ X56 ) ) )
| ~ ! [X59: $i] :
( ~ ( john @ X60 @ X59 )
| ! [X58: $i] :
( ~ ( peter @ X59 @ X58 )
| ( appointment @ X58 ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_17]),c_0_19]),c_0_20])]) ).
thf(c_0_38,plain,
! [X14: $i,X15: $i,X3: $i] :
( ( appointment @ X3 )
| ~ ( peter @ X14 @ X15 )
| ~ ( john @ X15 @ X3 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_35])]) ).
thf(c_0_39,plain,
! [X62: $i] : ( john @ X62 @ X62 ),
inference(variable_rename,[status(thm)],[c_0_36]) ).
thf(c_0_40,negated_conjecture,
( ( ( john @ esk5_0 @ esk8_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ( peter @ esk5_0 @ esk6_0 ) )
& ( ( john @ esk5_0 @ esk8_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ( john @ esk6_0 @ esk7_0 ) )
& ( ( john @ esk5_0 @ esk8_0 )
| ~ ( appointment @ esk7_0 ) )
& ( ( peter @ esk8_0 @ esk9_0 )
| ~ ( appointment @ esk7_0 ) )
& ( ~ ( appointment @ esk9_0 )
| ~ ( appointment @ esk7_0 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])]) ).
thf(c_0_41,plain,
! [X14: $i,X3: $i] :
( ( appointment @ X3 )
| ~ ( john @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
thf(c_0_42,plain,
! [X3: $i] : ( john @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
thf(c_0_43,negated_conjecture,
( ~ ( appointment @ esk9_0 )
| ~ ( appointment @ esk7_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
thf(c_0_44,plain,
! [X3: $i] : ( appointment @ X3 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
thf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.16 % Problem : PUZ086^1 : TPTP v8.2.0. Released v4.0.0.
% 0.13/0.17 % Command : run_E %s %d THM
% 0.15/0.38 % Computer : n020.cluster.edu
% 0.15/0.38 % Model : x86_64 x86_64
% 0.15/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.38 % Memory : 8042.1875MB
% 0.15/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.38 % CPULimit : 300
% 0.15/0.38 % WCLimit : 300
% 0.15/0.38 % DateTime : Sat May 18 10:37:38 EDT 2024
% 0.15/0.39 % CPUTime :
% 0.22/0.54 Running higher-order theorem proving
% 0.22/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/benchmark/theBenchmark.p
% 0.36/0.57 # Version: 3.1.0-ho
% 0.36/0.57 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.36/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.57 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.36/0.57 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.36/0.57 # Starting almost_fo_3_lam with 300s (1) cores
% 0.36/0.57 # Starting post_as_ho1 with 300s (1) cores
% 0.36/0.57 # almost_fo_3_lam with pid 28954 completed with status 0
% 0.36/0.57 # Result found by almost_fo_3_lam
% 0.36/0.57 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.36/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.57 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.36/0.57 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.36/0.57 # Starting almost_fo_3_lam with 300s (1) cores
% 0.36/0.57 # No SInE strategy applied
% 0.36/0.57 # Search class: HGHNS-FFMS22-SHSSMSBN
% 0.36/0.57 # partial match(3): HGHNF-FFMF21-SHSSMSBN
% 0.36/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.57 # Starting new_ho_9 with 163s (1) cores
% 0.36/0.57 # new_ho_9 with pid 28958 completed with status 0
% 0.36/0.57 # Result found by new_ho_9
% 0.36/0.57 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.36/0.57 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.36/0.57 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.36/0.57 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.36/0.57 # Starting almost_fo_3_lam with 300s (1) cores
% 0.36/0.57 # No SInE strategy applied
% 0.36/0.57 # Search class: HGHNS-FFMS22-SHSSMSBN
% 0.36/0.57 # partial match(3): HGHNF-FFMF21-SHSSMSBN
% 0.36/0.57 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.36/0.57 # Starting new_ho_9 with 163s (1) cores
% 0.36/0.57 # Preprocessing time : 0.004 s
% 0.36/0.57 # Presaturation interreduction done
% 0.36/0.57
% 0.36/0.57 # Proof found!
% 0.36/0.57 # SZS status Theorem
% 0.36/0.57 # SZS output start CNFRefutation
% See solution above
% 0.36/0.57 # Parsed axioms : 82
% 0.36/0.57 # Removed by relevancy pruning/SinE : 0
% 0.36/0.57 # Initial clauses : 63
% 0.36/0.57 # Removed in clause preprocessing : 38
% 0.36/0.57 # Initial clauses in saturation : 25
% 0.36/0.57 # Processed clauses : 60
% 0.36/0.57 # ...of these trivial : 1
% 0.36/0.57 # ...subsumed : 2
% 0.36/0.57 # ...remaining for further processing : 57
% 0.36/0.57 # Other redundant clauses eliminated : 0
% 0.36/0.57 # Clauses deleted for lack of memory : 0
% 0.36/0.57 # Backward-subsumed : 3
% 0.36/0.57 # Backward-rewritten : 12
% 0.36/0.57 # Generated clauses : 34
% 0.36/0.57 # ...of the previous two non-redundant : 26
% 0.36/0.57 # ...aggressively subsumed : 0
% 0.36/0.57 # Contextual simplify-reflections : 3
% 0.36/0.57 # Paramodulations : 34
% 0.36/0.57 # Factorizations : 0
% 0.36/0.57 # NegExts : 0
% 0.36/0.57 # Equation resolutions : 0
% 0.36/0.57 # Disequality decompositions : 0
% 0.36/0.57 # Total rewrite steps : 17
% 0.36/0.57 # ...of those cached : 7
% 0.36/0.57 # Propositional unsat checks : 0
% 0.36/0.57 # Propositional check models : 0
% 0.36/0.57 # Propositional check unsatisfiable : 0
% 0.36/0.57 # Propositional clauses : 0
% 0.36/0.57 # Propositional clauses after purity: 0
% 0.36/0.57 # Propositional unsat core size : 0
% 0.36/0.57 # Propositional preprocessing time : 0.000
% 0.36/0.57 # Propositional encoding time : 0.000
% 0.36/0.57 # Propositional solver time : 0.000
% 0.36/0.57 # Success case prop preproc time : 0.000
% 0.36/0.57 # Success case prop encoding time : 0.000
% 0.36/0.57 # Success case prop solver time : 0.000
% 0.36/0.57 # Current number of processed clauses : 17
% 0.36/0.57 # Positive orientable unit clauses : 7
% 0.36/0.57 # Positive unorientable unit clauses: 0
% 0.36/0.57 # Negative unit clauses : 0
% 0.36/0.57 # Non-unit-clauses : 10
% 0.36/0.57 # Current number of unprocessed clauses: 15
% 0.36/0.57 # ...number of literals in the above : 41
% 0.36/0.57 # Current number of archived formulas : 0
% 0.36/0.57 # Current number of archived clauses : 40
% 0.36/0.57 # Clause-clause subsumption calls (NU) : 143
% 0.36/0.57 # Rec. Clause-clause subsumption calls : 72
% 0.36/0.57 # Non-unit clause-clause subsumptions : 6
% 0.36/0.57 # Unit Clause-clause subsumption calls : 17
% 0.36/0.57 # Rewrite failures with RHS unbound : 0
% 0.36/0.57 # BW rewrite match attempts : 13
% 0.36/0.57 # BW rewrite match successes : 8
% 0.36/0.57 # Condensation attempts : 62
% 0.36/0.57 # Condensation successes : 0
% 0.36/0.57 # Termbank termtop insertions : 5227
% 0.36/0.57 # Search garbage collected termcells : 1456
% 0.36/0.57
% 0.36/0.57 # -------------------------------------------------
% 0.36/0.57 # User time : 0.009 s
% 0.36/0.57 # System time : 0.006 s
% 0.36/0.57 # Total time : 0.015 s
% 0.36/0.57 # Maximum resident set size: 2112 pages
% 0.36/0.57
% 0.36/0.57 # -------------------------------------------------
% 0.36/0.57 # User time : 0.013 s
% 0.36/0.57 # System time : 0.007 s
% 0.36/0.57 # Total time : 0.020 s
% 0.36/0.57 # Maximum resident set size: 1808 pages
% 0.36/0.57 % E---3.1 exiting
% 0.36/0.57 % E exiting
%------------------------------------------------------------------------------