TSTP Solution File: NUM583+3 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM583+3 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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:07:49 EDT 2023
% Result : Theorem 50.85s 7.21s
% Output : CNFRefutation 50.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 8 unt; 0 def)
% Number of atoms : 124 ( 16 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 134 ( 32 ~; 36 |; 50 &)
% ( 4 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 7 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn; 20 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.HXHnflM8lW/E---3.1_12276.p',m__) ).
fof(m__4037,hypothesis,
( ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> aElementOf0(X1,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
file('/export/starexec/sandbox/tmp/tmp.HXHnflM8lW/E---3.1_12276.p',m__4037) ).
fof(m__3989_02,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& aElementOf0(X1,sdtlpdtrp0(xN,xi))
& X1 != szmzizndt0(sdtlpdtrp0(xN,xi)) ) )
& aSet0(xQ)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
file('/export/starexec/sandbox/tmp/tmp.HXHnflM8lW/E---3.1_12276.p',m__3989_02) ).
fof(m__4007,hypothesis,
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ),
file('/export/starexec/sandbox/tmp/tmp.HXHnflM8lW/E---3.1_12276.p',m__4007) ).
fof(c_0_4,negated_conjecture,
~ ( ( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
=> sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X1) ) )
=> ( ( aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
<=> ( aElement0(X1)
& ( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi)) ) ) ) )
=> ( ! [X1] :
( aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
=> aElementOf0(X1,xS) )
| aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
! [X56] :
( ( ~ aElementOf0(X56,sdtlpdtrp0(xN,xi))
| aElementOf0(X56,xS) )
& aSubsetOf0(sdtlpdtrp0(xN,xi),xS) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4037])])]) ).
fof(c_0_6,hypothesis,
! [X51,X52,X53] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X51,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X51) )
& aSet0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X52)
| ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X52,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X52 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElement0(X52)
| ~ aElementOf0(X52,sdtlpdtrp0(xN,xi))
| X52 = szmzizndt0(sdtlpdtrp0(xN,xi))
| aElementOf0(X52,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSet0(xQ)
& ( ~ aElementOf0(X53,xQ)
| aElementOf0(X53,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aSubsetOf0(xQ,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
& sbrdtbr0(xQ) = xk
& aElementOf0(xQ,slbdtsldtrb0(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xk)) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3989_02])])])]) ).
fof(c_0_7,hypothesis,
! [X54,X55] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X54,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X54) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X55)
| ~ aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X55,xQ)
| X55 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X55,xQ)
| ~ aElement0(X55)
| aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X55 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X55)
| aElementOf0(X55,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& sbrdtbr0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) = xK ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4007])])])]) ).
fof(c_0_8,negated_conjecture,
! [X57,X58] :
( aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi))
& ( ~ aElementOf0(X57,sdtlpdtrp0(xN,xi))
| sdtlseqdt0(szmzizndt0(sdtlpdtrp0(xN,xi)),X57) )
& aSet0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ( aElement0(X58)
| ~ aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( aElementOf0(X58,xQ)
| X58 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( ~ aElementOf0(X58,xQ)
| ~ aElement0(X58)
| aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& ( X58 != szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElement0(X58)
| aElementOf0(X58,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(esk14_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))))
& ~ aElementOf0(esk14_0,xS)
& ~ aSubsetOf0(sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi))),xS) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])]) ).
cnf(c_0_9,hypothesis,
( aElementOf0(X1,xS)
| ~ aElementOf0(X1,sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,hypothesis,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),sdtlpdtrp0(xN,xi)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,hypothesis,
( aElementOf0(X1,xQ)
| X1 = szmzizndt0(sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X1,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
aElementOf0(esk14_0,sdtpldt0(xQ,szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
aElementOf0(szmzizndt0(sdtlpdtrp0(xN,xi)),xS),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( szmzizndt0(sdtlpdtrp0(xN,xi)) = esk14_0
| aElementOf0(esk14_0,xQ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(esk14_0,xS),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,hypothesis,
( aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| ~ aElementOf0(X1,xQ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,hypothesis,
aElementOf0(esk14_0,xQ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,hypothesis,
( aElementOf0(X1,sdtlpdtrp0(xN,xi))
| ~ aElementOf0(X1,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_19,hypothesis,
aElementOf0(esk14_0,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,hypothesis,
aElementOf0(esk14_0,sdtlpdtrp0(xN,xi)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_20]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.10 % Problem : NUM583+3 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n002.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 13:43:14 EDT 2023
% 0.11/0.31 % CPUTime :
% 0.15/0.43 Running first-order model finding
% 0.15/0.43 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.HXHnflM8lW/E---3.1_12276.p
% 50.85/7.21 # Version: 3.1pre001
% 50.85/7.21 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.85/7.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.85/7.21 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.85/7.21 # Starting new_bool_3 with 300s (1) cores
% 50.85/7.21 # Starting new_bool_1 with 300s (1) cores
% 50.85/7.21 # Starting sh5l with 300s (1) cores
% 50.85/7.21 # new_bool_1 with pid 12365 completed with status 0
% 50.85/7.21 # Result found by new_bool_1
% 50.85/7.21 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.85/7.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.85/7.21 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.85/7.21 # Starting new_bool_3 with 300s (1) cores
% 50.85/7.21 # Starting new_bool_1 with 300s (1) cores
% 50.85/7.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 50.85/7.21 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.85/7.21 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 50.85/7.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 50.85/7.21 # G-E--_208_C18_F1_SE_CS_SP_PS_S2o with pid 12371 completed with status 0
% 50.85/7.21 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2o
% 50.85/7.21 # Preprocessing class: FSLSSMSMSSSNFFN.
% 50.85/7.21 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 50.85/7.21 # Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 50.85/7.21 # Starting new_bool_3 with 300s (1) cores
% 50.85/7.21 # Starting new_bool_1 with 300s (1) cores
% 50.85/7.21 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 50.85/7.21 # Search class: FGHSF-SMLM32-MFFFFFNN
% 50.85/7.21 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 50.85/7.21 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2o with 163s (1) cores
% 50.85/7.21 # Preprocessing time : 0.145 s
% 50.85/7.21 # Presaturation interreduction done
% 50.85/7.21
% 50.85/7.21 # Proof found!
% 50.85/7.21 # SZS status Theorem
% 50.85/7.21 # SZS output start CNFRefutation
% See solution above
% 50.85/7.21 # Parsed axioms : 89
% 50.85/7.21 # Removed by relevancy pruning/SinE : 5
% 50.85/7.21 # Initial clauses : 4200
% 50.85/7.21 # Removed in clause preprocessing : 7
% 50.85/7.21 # Initial clauses in saturation : 4193
% 50.85/7.21 # Processed clauses : 6096
% 50.85/7.21 # ...of these trivial : 4
% 50.85/7.21 # ...subsumed : 609
% 50.85/7.21 # ...remaining for further processing : 5483
% 50.85/7.21 # Other redundant clauses eliminated : 1930
% 50.85/7.21 # Clauses deleted for lack of memory : 0
% 50.85/7.21 # Backward-subsumed : 0
% 50.85/7.21 # Backward-rewritten : 3
% 50.85/7.21 # Generated clauses : 1950
% 50.85/7.21 # ...of the previous two non-redundant : 1924
% 50.85/7.21 # ...aggressively subsumed : 0
% 50.85/7.21 # Contextual simplify-reflections : 38
% 50.85/7.21 # Paramodulations : 213
% 50.85/7.21 # Factorizations : 0
% 50.85/7.21 # NegExts : 0
% 50.85/7.21 # Equation resolutions : 1930
% 50.85/7.21 # Total rewrite steps : 130
% 50.85/7.21 # Propositional unsat checks : 0
% 50.85/7.21 # Propositional check models : 0
% 50.85/7.21 # Propositional check unsatisfiable : 0
% 50.85/7.21 # Propositional clauses : 0
% 50.85/7.21 # Propositional clauses after purity: 0
% 50.85/7.21 # Propositional unsat core size : 0
% 50.85/7.21 # Propositional preprocessing time : 0.000
% 50.85/7.21 # Propositional encoding time : 0.000
% 50.85/7.21 # Propositional solver time : 0.000
% 50.85/7.21 # Success case prop preproc time : 0.000
% 50.85/7.21 # Success case prop encoding time : 0.000
% 50.85/7.21 # Success case prop solver time : 0.000
% 50.85/7.21 # Current number of processed clauses : 151
% 50.85/7.21 # Positive orientable unit clauses : 73
% 50.85/7.21 # Positive unorientable unit clauses: 0
% 50.85/7.21 # Negative unit clauses : 18
% 50.85/7.21 # Non-unit-clauses : 60
% 50.85/7.21 # Current number of unprocessed clauses: 3591
% 50.85/7.21 # ...number of literals in the above : 41824
% 50.85/7.21 # Current number of archived formulas : 0
% 50.85/7.21 # Current number of archived clauses : 3595
% 50.85/7.21 # Clause-clause subsumption calls (NU) : 10194799
% 50.85/7.21 # Rec. Clause-clause subsumption calls : 66589
% 50.85/7.21 # Non-unit clause-clause subsumptions : 637
% 50.85/7.21 # Unit Clause-clause subsumption calls : 396
% 50.85/7.21 # Rewrite failures with RHS unbound : 0
% 50.85/7.21 # BW rewrite match attempts : 3
% 50.85/7.21 # BW rewrite match successes : 3
% 50.85/7.21 # Condensation attempts : 0
% 50.85/7.21 # Condensation successes : 0
% 50.85/7.21 # Termbank termtop insertions : 602020
% 50.85/7.21
% 50.85/7.21 # -------------------------------------------------
% 50.85/7.21 # User time : 6.726 s
% 50.85/7.21 # System time : 0.036 s
% 50.85/7.21 # Total time : 6.762 s
% 50.85/7.21 # Maximum resident set size: 13268 pages
% 50.85/7.21
% 50.85/7.21 # -------------------------------------------------
% 50.85/7.21 # User time : 6.730 s
% 50.85/7.21 # System time : 0.039 s
% 50.85/7.21 # Total time : 6.769 s
% 50.85/7.21 # Maximum resident set size: 1816 pages
% 50.85/7.21 % E---3.1 exiting
%------------------------------------------------------------------------------