TSTP Solution File: SWC018+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SWC018+1 : TPTP v5.0.0. Released v2.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 06:50:53 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% Reading problem from /tmp/SystemOnTPTP14851/SWC018+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP14851/SWC018+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP14851/SWC018+1.tptp
% TreeLimitedRun: ----------------------------------------------------------
% TreeLimitedRun: /home/graph/tptp/Systems/EP---1.2/eproof --print-statistics -xAuto -tAuto --cpu-limit=60 --proof-time-unlimited --memory-limit=Auto --tstp-in --tstp-out /tmp/SRASS.s.p
% TreeLimitedRun: CPU time limit is 60s
% TreeLimitedRun: WC time limit is 120s
% TreeLimitedRun: PID is 14947
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.032 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(frontsegP(X1,X2)<=>?[X3]:(ssList(X3)&app(X2,X3)=X1)))),file('/tmp/SRASS.s.p', ax5)).
% fof(5, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(neq(X1,X2)<=>~(X1=X2)))),file('/tmp/SRASS.s.p', ax15)).
% fof(7, axiom,ssList(nil),file('/tmp/SRASS.s.p', ax17)).
% fof(17, axiom,![X1]:(ssList(X1)=>frontsegP(X1,X1)),file('/tmp/SRASS.s.p', ax42)).
% fof(28, axiom,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>(nil=app(X1,X2)<=>(nil=X2&nil=X1)))),file('/tmp/SRASS.s.p', ax83)).
% fof(96, conjecture,![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X9]:(((ssList(X9)&neq(X9,nil))&frontsegP(X2,X9))&frontsegP(X1,X9))))))))),file('/tmp/SRASS.s.p', co1)).
% fof(97, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X9]:(((ssList(X9)&neq(X9,nil))&frontsegP(X2,X9))&frontsegP(X1,X9)))))))))),inference(assume_negation,[status(cth)],[96])).
% fof(103, negated_conjecture,~(![X1]:(ssList(X1)=>![X2]:(ssList(X2)=>![X3]:(ssList(X3)=>![X4]:(ssList(X4)=>((((~(X2=X4)|~(X1=X3))|![X5]:(ssList(X5)=>((~(app(X3,X5)=X4)|~(equalelemsP(X3)))|?[X6]:(ssItem(X6)&?[X7]:((ssList(X7)&app(cons(X6,nil),X7)=X5)&?[X8]:(ssList(X8)&app(X8,cons(X6,nil))=X3))))))|(~(nil=X4)&nil=X3))|((~(nil=X2)|nil=X1)&(~(neq(X2,nil))|?[X9]:(((ssList(X9)&neq(X9,nil))&frontsegP(X2,X9))&frontsegP(X1,X9)))))))))),inference(fof_simplification,[status(thm)],[97,theory(equality)])).
% fof(115, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(frontsegP(X1,X2))|?[X3]:(ssList(X3)&app(X2,X3)=X1))&(![X3]:(~(ssList(X3))|~(app(X2,X3)=X1))|frontsegP(X1,X2))))),inference(fof_nnf,[status(thm)],[3])).
% fof(116, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|?[X6]:(ssList(X6)&app(X5,X6)=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(variable_rename,[status(thm)],[115])).
% fof(117, plain,![X4]:(~(ssList(X4))|![X5]:(~(ssList(X5))|((~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4))&(![X7]:(~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))))),inference(skolemize,[status(esa)],[116])).
% fof(118, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))&(~(frontsegP(X4,X5))|(ssList(esk3_2(X4,X5))&app(X5,esk3_2(X4,X5))=X4)))|~(ssList(X5)))|~(ssList(X4))),inference(shift_quantors,[status(thm)],[117])).
% fof(119, plain,![X4]:![X5]:![X7]:(((((~(ssList(X7))|~(app(X5,X7)=X4))|frontsegP(X4,X5))|~(ssList(X5)))|~(ssList(X4)))&((((ssList(esk3_2(X4,X5))|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4)))&(((app(X5,esk3_2(X4,X5))=X4|~(frontsegP(X4,X5)))|~(ssList(X5)))|~(ssList(X4))))),inference(distribute,[status(thm)],[118])).
% cnf(122,plain,(frontsegP(X1,X2)|~ssList(X1)|~ssList(X2)|app(X2,X3)!=X1|~ssList(X3)),inference(split_conjunct,[status(thm)],[119])).
% fof(135, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(neq(X1,X2))|~(X1=X2))&(X1=X2|neq(X1,X2))))),inference(fof_nnf,[status(thm)],[5])).
% fof(136, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))),inference(variable_rename,[status(thm)],[135])).
% fof(137, plain,![X3]:![X4]:((~(ssList(X4))|((~(neq(X3,X4))|~(X3=X4))&(X3=X4|neq(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[136])).
% fof(138, plain,![X3]:![X4]:((((~(neq(X3,X4))|~(X3=X4))|~(ssList(X4)))|~(ssList(X3)))&(((X3=X4|neq(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[137])).
% cnf(139,plain,(neq(X1,X2)|X1=X2|~ssList(X1)|~ssList(X2)),inference(split_conjunct,[status(thm)],[138])).
% cnf(140,plain,(~ssList(X1)|~ssList(X2)|X1!=X2|~neq(X1,X2)),inference(split_conjunct,[status(thm)],[138])).
% cnf(145,plain,(ssList(nil)),inference(split_conjunct,[status(thm)],[7])).
% fof(186, plain,![X1]:(~(ssList(X1))|frontsegP(X1,X1)),inference(fof_nnf,[status(thm)],[17])).
% fof(187, plain,![X2]:(~(ssList(X2))|frontsegP(X2,X2)),inference(variable_rename,[status(thm)],[186])).
% cnf(188,plain,(frontsegP(X1,X1)|~ssList(X1)),inference(split_conjunct,[status(thm)],[187])).
% fof(228, plain,![X1]:(~(ssList(X1))|![X2]:(~(ssList(X2))|((~(nil=app(X1,X2))|(nil=X2&nil=X1))&((~(nil=X2)|~(nil=X1))|nil=app(X1,X2))))),inference(fof_nnf,[status(thm)],[28])).
% fof(229, plain,![X3]:(~(ssList(X3))|![X4]:(~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))),inference(variable_rename,[status(thm)],[228])).
% fof(230, plain,![X3]:![X4]:((~(ssList(X4))|((~(nil=app(X3,X4))|(nil=X4&nil=X3))&((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))))|~(ssList(X3))),inference(shift_quantors,[status(thm)],[229])).
% fof(231, plain,![X3]:![X4]:(((((nil=X4|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3)))&(((nil=X3|~(nil=app(X3,X4)))|~(ssList(X4)))|~(ssList(X3))))&((((~(nil=X4)|~(nil=X3))|nil=app(X3,X4))|~(ssList(X4)))|~(ssList(X3)))),inference(distribute,[status(thm)],[230])).
% cnf(233,plain,(nil=X1|~ssList(X1)|~ssList(X2)|nil!=app(X1,X2)),inference(split_conjunct,[status(thm)],[231])).
% fof(568, negated_conjecture,?[X1]:(ssList(X1)&?[X2]:(ssList(X2)&?[X3]:(ssList(X3)&?[X4]:(ssList(X4)&((((X2=X4&X1=X3)&?[X5]:(ssList(X5)&((app(X3,X5)=X4&equalelemsP(X3))&![X6]:(~(ssItem(X6))|![X7]:((~(ssList(X7))|~(app(cons(X6,nil),X7)=X5))|![X8]:(~(ssList(X8))|~(app(X8,cons(X6,nil))=X3)))))))&(nil=X4|~(nil=X3)))&((nil=X2&~(nil=X1))|(neq(X2,nil)&![X9]:(((~(ssList(X9))|~(neq(X9,nil)))|~(frontsegP(X2,X9)))|~(frontsegP(X1,X9)))))))))),inference(fof_nnf,[status(thm)],[103])).
% fof(569, negated_conjecture,?[X10]:(ssList(X10)&?[X11]:(ssList(X11)&?[X12]:(ssList(X12)&?[X13]:(ssList(X13)&((((X11=X13&X10=X12)&?[X14]:(ssList(X14)&((app(X12,X14)=X13&equalelemsP(X12))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=X14))|![X17]:(~(ssList(X17))|~(app(X17,cons(X15,nil))=X12)))))))&(nil=X13|~(nil=X12)))&((nil=X11&~(nil=X10))|(neq(X11,nil)&![X18]:(((~(ssList(X18))|~(neq(X18,nil)))|~(frontsegP(X11,X18)))|~(frontsegP(X10,X18)))))))))),inference(variable_rename,[status(thm)],[568])).
% fof(570, negated_conjecture,(ssList(esk48_0)&(ssList(esk49_0)&(ssList(esk50_0)&(ssList(esk51_0)&((((esk49_0=esk51_0&esk48_0=esk50_0)&(ssList(esk52_0)&((app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0))&![X15]:(~(ssItem(X15))|![X16]:((~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0))|![X17]:(~(ssList(X17))|~(app(X17,cons(X15,nil))=esk50_0)))))))&(nil=esk51_0|~(nil=esk50_0)))&((nil=esk49_0&~(nil=esk48_0))|(neq(esk49_0,nil)&![X18]:(((~(ssList(X18))|~(neq(X18,nil)))|~(frontsegP(esk49_0,X18)))|~(frontsegP(esk48_0,X18)))))))))),inference(skolemize,[status(esa)],[569])).
% fof(571, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((((~(ssList(X18))|~(neq(X18,nil)))|~(frontsegP(esk49_0,X18)))|~(frontsegP(esk48_0,X18)))&neq(esk49_0,nil))|(nil=esk49_0&~(nil=esk48_0)))&(((((((~(ssList(X17))|~(app(X17,cons(X15,nil))=esk50_0))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(shift_quantors,[status(thm)],[570])).
% fof(572, negated_conjecture,![X15]:![X16]:![X17]:![X18]:((((((((nil=esk49_0|(((~(ssList(X18))|~(neq(X18,nil)))|~(frontsegP(esk49_0,X18)))|~(frontsegP(esk48_0,X18))))&(~(nil=esk48_0)|(((~(ssList(X18))|~(neq(X18,nil)))|~(frontsegP(esk49_0,X18)))|~(frontsegP(esk48_0,X18)))))&((nil=esk49_0|neq(esk49_0,nil))&(~(nil=esk48_0)|neq(esk49_0,nil))))&(((((((~(ssList(X17))|~(app(X17,cons(X15,nil))=esk50_0))|(~(ssList(X16))|~(app(cons(X15,nil),X16)=esk52_0)))|~(ssItem(X15)))&(app(esk50_0,esk52_0)=esk51_0&equalelemsP(esk50_0)))&ssList(esk52_0))&(esk49_0=esk51_0&esk48_0=esk50_0))&(nil=esk51_0|~(nil=esk50_0))))&ssList(esk51_0))&ssList(esk50_0))&ssList(esk49_0))&ssList(esk48_0)),inference(distribute,[status(thm)],[571])).
% cnf(573,negated_conjecture,(ssList(esk48_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(574,negated_conjecture,(ssList(esk49_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(577,negated_conjecture,(nil=esk51_0|nil!=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(578,negated_conjecture,(esk48_0=esk50_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(579,negated_conjecture,(esk49_0=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(580,negated_conjecture,(ssList(esk52_0)),inference(split_conjunct,[status(thm)],[572])).
% cnf(582,negated_conjecture,(app(esk50_0,esk52_0)=esk51_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(584,negated_conjecture,(neq(esk49_0,nil)|nil!=esk48_0),inference(split_conjunct,[status(thm)],[572])).
% cnf(587,negated_conjecture,(nil=esk49_0|~frontsegP(esk48_0,X1)|~frontsegP(esk49_0,X1)|~neq(X1,nil)|~ssList(X1)),inference(split_conjunct,[status(thm)],[572])).
% cnf(591,negated_conjecture,(esk49_0=nil|esk50_0!=nil),inference(rw,[status(thm)],[577,579,theory(equality)])).
% cnf(592,negated_conjecture,(esk49_0=nil|esk48_0!=nil),inference(rw,[status(thm)],[591,578,theory(equality)])).
% cnf(593,negated_conjecture,(app(esk48_0,esk52_0)=esk51_0),inference(rw,[status(thm)],[582,578,theory(equality)])).
% cnf(594,negated_conjecture,(app(esk48_0,esk52_0)=esk49_0),inference(rw,[status(thm)],[593,579,theory(equality)])).
% cnf(599,negated_conjecture,(esk49_0=nil|~frontsegP(esk49_0,esk48_0)|~ssList(esk48_0)|~neq(esk48_0,nil)),inference(spm,[status(thm)],[587,188,theory(equality)])).
% cnf(603,negated_conjecture,(esk49_0=nil|~frontsegP(esk49_0,esk48_0)|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[599,573,theory(equality)])).
% cnf(604,negated_conjecture,(esk49_0=nil|~frontsegP(esk49_0,esk48_0)|~neq(esk48_0,nil)),inference(cn,[status(thm)],[603,theory(equality)])).
% cnf(631,negated_conjecture,(nil=esk48_0|esk49_0!=nil|~ssList(esk52_0)|~ssList(esk48_0)),inference(spm,[status(thm)],[233,594,theory(equality)])).
% cnf(633,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[631,580,theory(equality)])).
% cnf(634,negated_conjecture,(nil=esk48_0|esk49_0!=nil|$false|$false),inference(rw,[status(thm)],[633,573,theory(equality)])).
% cnf(635,negated_conjecture,(nil=esk48_0|esk49_0!=nil),inference(cn,[status(thm)],[634,theory(equality)])).
% cnf(639,plain,(~ssList(X1)|~neq(X1,X1)),inference(er,[status(thm)],[140,theory(equality)])).
% cnf(701,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(esk52_0)|~ssList(esk48_0)|~ssList(X1)),inference(spm,[status(thm)],[122,594,theory(equality)])).
% cnf(705,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|$false|~ssList(esk48_0)|~ssList(X1)),inference(rw,[status(thm)],[701,580,theory(equality)])).
% cnf(706,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|$false|$false|~ssList(X1)),inference(rw,[status(thm)],[705,573,theory(equality)])).
% cnf(707,negated_conjecture,(frontsegP(X1,esk48_0)|esk49_0!=X1|~ssList(X1)),inference(cn,[status(thm)],[706,theory(equality)])).
% cnf(1853,negated_conjecture,(frontsegP(esk49_0,esk48_0)|~ssList(esk49_0)),inference(er,[status(thm)],[707,theory(equality)])).
% cnf(1854,negated_conjecture,(frontsegP(esk49_0,esk48_0)|$false),inference(rw,[status(thm)],[1853,574,theory(equality)])).
% cnf(1855,negated_conjecture,(frontsegP(esk49_0,esk48_0)),inference(cn,[status(thm)],[1854,theory(equality)])).
% cnf(1861,negated_conjecture,(esk49_0=nil|$false|~neq(esk48_0,nil)),inference(rw,[status(thm)],[604,1855,theory(equality)])).
% cnf(1862,negated_conjecture,(esk49_0=nil|~neq(esk48_0,nil)),inference(cn,[status(thm)],[1861,theory(equality)])).
% cnf(1879,negated_conjecture,(esk49_0=nil|esk48_0=nil|~ssList(nil)|~ssList(esk48_0)),inference(spm,[status(thm)],[1862,139,theory(equality)])).
% cnf(1880,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|~ssList(esk48_0)),inference(rw,[status(thm)],[1879,145,theory(equality)])).
% cnf(1881,negated_conjecture,(esk49_0=nil|esk48_0=nil|$false|$false),inference(rw,[status(thm)],[1880,573,theory(equality)])).
% cnf(1882,negated_conjecture,(esk49_0=nil|esk48_0=nil),inference(cn,[status(thm)],[1881,theory(equality)])).
% cnf(1883,negated_conjecture,(esk49_0=nil),inference(csr,[status(thm)],[1882,592])).
% cnf(1899,negated_conjecture,(esk48_0=nil|$false),inference(rw,[status(thm)],[635,1883,theory(equality)])).
% cnf(1900,negated_conjecture,(esk48_0=nil),inference(cn,[status(thm)],[1899,theory(equality)])).
% cnf(1905,negated_conjecture,(neq(nil,nil)|esk48_0!=nil),inference(rw,[status(thm)],[584,1883,theory(equality)])).
% cnf(1931,negated_conjecture,(neq(nil,nil)|$false),inference(rw,[status(thm)],[1905,1900,theory(equality)])).
% cnf(1932,negated_conjecture,(neq(nil,nil)),inference(cn,[status(thm)],[1931,theory(equality)])).
% cnf(1933,negated_conjecture,(~ssList(nil)),inference(spm,[status(thm)],[639,1932,theory(equality)])).
% cnf(1935,negated_conjecture,($false),inference(rw,[status(thm)],[1933,145,theory(equality)])).
% cnf(1936,negated_conjecture,($false),inference(cn,[status(thm)],[1935,theory(equality)])).
% cnf(1937,negated_conjecture,($false),1936,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 269
% # ...of these trivial : 6
% # ...subsumed : 12
% # ...remaining for further processing: 251
% # Other redundant clauses eliminated : 69
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 41
% # Generated clauses : 713
% # ...of the previous two non-trivial : 612
% # Contextual simplify-reflections : 3
% # Paramodulations : 620
% # Factorizations : 0
% # Equation resolutions : 93
% # Current number of processed clauses: 202
% # Positive orientable unit clauses: 24
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 2
% # Non-unit-clauses : 176
% # Current number of unprocessed clauses: 451
% # ...number of literals in the above : 3213
% # Clause-clause subsumption calls (NU) : 1011
% # Rec. Clause-clause subsumption calls : 256
% # Unit Clause-clause subsumption calls : 25
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 9
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 234 leaves, 1.35+/-1.134 terms/leaf
% # Paramod-from index: 108 leaves, 1.00+/-0.000 terms/leaf
% # Paramod-into index: 198 leaves, 1.24+/-0.979 terms/leaf
% # -------------------------------------------------
% # User time : 0.079 s
% # System time : 0.004 s
% # Total time : 0.083 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.20 CPU 0.29 WC
% FINAL PrfWatch: 0.20 CPU 0.29 WC
% SZS output end Solution for /tmp/SystemOnTPTP14851/SWC018+1.tptp
%
%------------------------------------------------------------------------------