TSTP Solution File: GEO094+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : GEO094+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 : Wed Dec 29 04:23:08 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP12549/GEO094+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12549/GEO094+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12549/GEO094+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 12645
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X5]:![X1]:(end_point(X5,X1)<=>(incident_c(X5,X1)&![X2]:![X3]:((((part_of(X2,X1)&part_of(X3,X1))&incident_c(X5,X2))&incident_c(X5,X3))=>(part_of(X2,X3)|part_of(X3,X2))))),file('/tmp/SRASS.s.p', end_point_defn)).
% fof(3, axiom,![X5]:![X1]:![X2]:(meet(X5,X1,X2)<=>((incident_c(X5,X1)&incident_c(X5,X2))&![X6]:((incident_c(X6,X1)&incident_c(X6,X2))=>(end_point(X6,X1)&end_point(X6,X2))))),file('/tmp/SRASS.s.p', meet_defn)).
% fof(4, axiom,![X1]:![X2]:(part_of(X2,X1)<=>![X5]:(incident_c(X5,X2)=>incident_c(X5,X1))),file('/tmp/SRASS.s.p', part_of_defn)).
% fof(12, axiom,![X1]:?[X5]:inner_point(X5,X1),file('/tmp/SRASS.s.p', c3)).
% fof(13, axiom,![X5]:![X1]:(inner_point(X5,X1)<=>(incident_c(X5,X1)&~(end_point(X5,X1)))),file('/tmp/SRASS.s.p', inner_point_defn)).
% fof(17, conjecture,![X1]:![X2]:![X3]:![X5]:(((meet(X5,X2,X3)&part_of(X2,X1))&part_of(X3,X1))=>~(end_point(X5,X1))),file('/tmp/SRASS.s.p', proposition_2_14_3)).
% fof(18, negated_conjecture,~(![X1]:![X2]:![X3]:![X5]:(((meet(X5,X2,X3)&part_of(X2,X1))&part_of(X3,X1))=>~(end_point(X5,X1)))),inference(assume_negation,[status(cth)],[17])).
% fof(19, plain,![X5]:![X1]:(inner_point(X5,X1)<=>(incident_c(X5,X1)&~(end_point(X5,X1)))),inference(fof_simplification,[status(thm)],[13,theory(equality)])).
% fof(20, negated_conjecture,~(![X1]:![X2]:![X3]:![X5]:(((meet(X5,X2,X3)&part_of(X2,X1))&part_of(X3,X1))=>~(end_point(X5,X1)))),inference(fof_simplification,[status(thm)],[18,theory(equality)])).
% fof(25, plain,![X5]:![X1]:((~(end_point(X5,X1))|(incident_c(X5,X1)&![X2]:![X3]:((((~(part_of(X2,X1))|~(part_of(X3,X1)))|~(incident_c(X5,X2)))|~(incident_c(X5,X3)))|(part_of(X2,X3)|part_of(X3,X2)))))&((~(incident_c(X5,X1))|?[X2]:?[X3]:((((part_of(X2,X1)&part_of(X3,X1))&incident_c(X5,X2))&incident_c(X5,X3))&(~(part_of(X2,X3))&~(part_of(X3,X2)))))|end_point(X5,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(26, plain,![X6]:![X7]:((~(end_point(X6,X7))|(incident_c(X6,X7)&![X8]:![X9]:((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))))&((~(incident_c(X6,X7))|?[X10]:?[X11]:((((part_of(X10,X7)&part_of(X11,X7))&incident_c(X6,X10))&incident_c(X6,X11))&(~(part_of(X10,X11))&~(part_of(X11,X10)))))|end_point(X6,X7))),inference(variable_rename,[status(thm)],[25])).
% fof(27, plain,![X6]:![X7]:((~(end_point(X6,X7))|(incident_c(X6,X7)&![X8]:![X9]:((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))))&((~(incident_c(X6,X7))|((((part_of(esk1_2(X6,X7),X7)&part_of(esk2_2(X6,X7),X7))&incident_c(X6,esk1_2(X6,X7)))&incident_c(X6,esk2_2(X6,X7)))&(~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))&~(part_of(esk2_2(X6,X7),esk1_2(X6,X7))))))|end_point(X6,X7))),inference(skolemize,[status(esa)],[26])).
% fof(28, plain,![X6]:![X7]:![X8]:![X9]:(((((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))&incident_c(X6,X7))|~(end_point(X6,X7)))&((~(incident_c(X6,X7))|((((part_of(esk1_2(X6,X7),X7)&part_of(esk2_2(X6,X7),X7))&incident_c(X6,esk1_2(X6,X7)))&incident_c(X6,esk2_2(X6,X7)))&(~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))&~(part_of(esk2_2(X6,X7),esk1_2(X6,X7))))))|end_point(X6,X7))),inference(shift_quantors,[status(thm)],[27])).
% fof(29, plain,![X6]:![X7]:![X8]:![X9]:(((((((~(part_of(X8,X7))|~(part_of(X9,X7)))|~(incident_c(X6,X8)))|~(incident_c(X6,X9)))|(part_of(X8,X9)|part_of(X9,X8)))|~(end_point(X6,X7)))&(incident_c(X6,X7)|~(end_point(X6,X7))))&((((((part_of(esk1_2(X6,X7),X7)|~(incident_c(X6,X7)))|end_point(X6,X7))&((part_of(esk2_2(X6,X7),X7)|~(incident_c(X6,X7)))|end_point(X6,X7)))&((incident_c(X6,esk1_2(X6,X7))|~(incident_c(X6,X7)))|end_point(X6,X7)))&((incident_c(X6,esk2_2(X6,X7))|~(incident_c(X6,X7)))|end_point(X6,X7)))&(((~(part_of(esk1_2(X6,X7),esk2_2(X6,X7)))|~(incident_c(X6,X7)))|end_point(X6,X7))&((~(part_of(esk2_2(X6,X7),esk1_2(X6,X7)))|~(incident_c(X6,X7)))|end_point(X6,X7))))),inference(distribute,[status(thm)],[28])).
% cnf(37,plain,(part_of(X3,X4)|part_of(X4,X3)|~end_point(X1,X2)|~incident_c(X1,X3)|~incident_c(X1,X4)|~part_of(X3,X2)|~part_of(X4,X2)),inference(split_conjunct,[status(thm)],[29])).
% fof(38, plain,![X5]:![X1]:![X2]:((~(meet(X5,X1,X2))|((incident_c(X5,X1)&incident_c(X5,X2))&![X6]:((~(incident_c(X6,X1))|~(incident_c(X6,X2)))|(end_point(X6,X1)&end_point(X6,X2)))))&(((~(incident_c(X5,X1))|~(incident_c(X5,X2)))|?[X6]:((incident_c(X6,X1)&incident_c(X6,X2))&(~(end_point(X6,X1))|~(end_point(X6,X2)))))|meet(X5,X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(39, plain,![X7]:![X8]:![X9]:((~(meet(X7,X8,X9))|((incident_c(X7,X8)&incident_c(X7,X9))&![X10]:((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|?[X11]:((incident_c(X11,X8)&incident_c(X11,X9))&(~(end_point(X11,X8))|~(end_point(X11,X9)))))|meet(X7,X8,X9))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X7]:![X8]:![X9]:((~(meet(X7,X8,X9))|((incident_c(X7,X8)&incident_c(X7,X9))&![X10]:((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|((incident_c(esk3_3(X7,X8,X9),X8)&incident_c(esk3_3(X7,X8,X9),X9))&(~(end_point(esk3_3(X7,X8,X9),X8))|~(end_point(esk3_3(X7,X8,X9),X9)))))|meet(X7,X8,X9))),inference(skolemize,[status(esa)],[39])).
% fof(41, plain,![X7]:![X8]:![X9]:![X10]:(((((~(incident_c(X10,X8))|~(incident_c(X10,X9)))|(end_point(X10,X8)&end_point(X10,X9)))&(incident_c(X7,X8)&incident_c(X7,X9)))|~(meet(X7,X8,X9)))&(((~(incident_c(X7,X8))|~(incident_c(X7,X9)))|((incident_c(esk3_3(X7,X8,X9),X8)&incident_c(esk3_3(X7,X8,X9),X9))&(~(end_point(esk3_3(X7,X8,X9),X8))|~(end_point(esk3_3(X7,X8,X9),X9)))))|meet(X7,X8,X9))),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X7]:![X8]:![X9]:![X10]:(((((end_point(X10,X8)|(~(incident_c(X10,X8))|~(incident_c(X10,X9))))|~(meet(X7,X8,X9)))&((end_point(X10,X9)|(~(incident_c(X10,X8))|~(incident_c(X10,X9))))|~(meet(X7,X8,X9))))&((incident_c(X7,X8)|~(meet(X7,X8,X9)))&(incident_c(X7,X9)|~(meet(X7,X8,X9)))))&((((incident_c(esk3_3(X7,X8,X9),X8)|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9))&((incident_c(esk3_3(X7,X8,X9),X9)|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9)))&(((~(end_point(esk3_3(X7,X8,X9),X8))|~(end_point(esk3_3(X7,X8,X9),X9)))|(~(incident_c(X7,X8))|~(incident_c(X7,X9))))|meet(X7,X8,X9)))),inference(distribute,[status(thm)],[41])).
% cnf(46,plain,(incident_c(X1,X3)|~meet(X1,X2,X3)),inference(split_conjunct,[status(thm)],[42])).
% cnf(47,plain,(incident_c(X1,X2)|~meet(X1,X2,X3)),inference(split_conjunct,[status(thm)],[42])).
% cnf(48,plain,(end_point(X4,X3)|~meet(X1,X2,X3)|~incident_c(X4,X3)|~incident_c(X4,X2)),inference(split_conjunct,[status(thm)],[42])).
% cnf(49,plain,(end_point(X4,X2)|~meet(X1,X2,X3)|~incident_c(X4,X3)|~incident_c(X4,X2)),inference(split_conjunct,[status(thm)],[42])).
% fof(50, plain,![X1]:![X2]:((~(part_of(X2,X1))|![X5]:(~(incident_c(X5,X2))|incident_c(X5,X1)))&(?[X5]:(incident_c(X5,X2)&~(incident_c(X5,X1)))|part_of(X2,X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(51, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&(?[X9]:(incident_c(X9,X7)&~(incident_c(X9,X6)))|part_of(X7,X6))),inference(variable_rename,[status(thm)],[50])).
% fof(52, plain,![X6]:![X7]:((~(part_of(X7,X6))|![X8]:(~(incident_c(X8,X7))|incident_c(X8,X6)))&((incident_c(esk4_2(X6,X7),X7)&~(incident_c(esk4_2(X6,X7),X6)))|part_of(X7,X6))),inference(skolemize,[status(esa)],[51])).
% fof(53, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk4_2(X6,X7),X7)&~(incident_c(esk4_2(X6,X7),X6)))|part_of(X7,X6))),inference(shift_quantors,[status(thm)],[52])).
% fof(54, plain,![X6]:![X7]:![X8]:(((~(incident_c(X8,X7))|incident_c(X8,X6))|~(part_of(X7,X6)))&((incident_c(esk4_2(X6,X7),X7)|part_of(X7,X6))&(~(incident_c(esk4_2(X6,X7),X6))|part_of(X7,X6)))),inference(distribute,[status(thm)],[53])).
% cnf(57,plain,(incident_c(X3,X2)|~part_of(X1,X2)|~incident_c(X3,X1)),inference(split_conjunct,[status(thm)],[54])).
% fof(91, plain,![X6]:?[X7]:inner_point(X7,X6),inference(variable_rename,[status(thm)],[12])).
% fof(92, plain,![X6]:inner_point(esk9_1(X6),X6),inference(skolemize,[status(esa)],[91])).
% cnf(93,plain,(inner_point(esk9_1(X1),X1)),inference(split_conjunct,[status(thm)],[92])).
% fof(94, plain,![X5]:![X1]:((~(inner_point(X5,X1))|(incident_c(X5,X1)&~(end_point(X5,X1))))&((~(incident_c(X5,X1))|end_point(X5,X1))|inner_point(X5,X1))),inference(fof_nnf,[status(thm)],[19])).
% fof(95, plain,![X6]:![X7]:((~(inner_point(X6,X7))|(incident_c(X6,X7)&~(end_point(X6,X7))))&((~(incident_c(X6,X7))|end_point(X6,X7))|inner_point(X6,X7))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X6]:![X7]:(((incident_c(X6,X7)|~(inner_point(X6,X7)))&(~(end_point(X6,X7))|~(inner_point(X6,X7))))&((~(incident_c(X6,X7))|end_point(X6,X7))|inner_point(X6,X7))),inference(distribute,[status(thm)],[95])).
% cnf(98,plain,(~inner_point(X1,X2)|~end_point(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% cnf(99,plain,(incident_c(X1,X2)|~inner_point(X1,X2)),inference(split_conjunct,[status(thm)],[96])).
% fof(123, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X5]:(((meet(X5,X2,X3)&part_of(X2,X1))&part_of(X3,X1))&end_point(X5,X1)),inference(fof_nnf,[status(thm)],[20])).
% fof(124, negated_conjecture,?[X6]:?[X7]:?[X8]:?[X9]:(((meet(X9,X7,X8)&part_of(X7,X6))&part_of(X8,X6))&end_point(X9,X6)),inference(variable_rename,[status(thm)],[123])).
% fof(125, negated_conjecture,(((meet(esk17_0,esk15_0,esk16_0)&part_of(esk15_0,esk14_0))&part_of(esk16_0,esk14_0))&end_point(esk17_0,esk14_0)),inference(skolemize,[status(esa)],[124])).
% cnf(126,negated_conjecture,(end_point(esk17_0,esk14_0)),inference(split_conjunct,[status(thm)],[125])).
% cnf(127,negated_conjecture,(part_of(esk16_0,esk14_0)),inference(split_conjunct,[status(thm)],[125])).
% cnf(128,negated_conjecture,(part_of(esk15_0,esk14_0)),inference(split_conjunct,[status(thm)],[125])).
% cnf(129,negated_conjecture,(meet(esk17_0,esk15_0,esk16_0)),inference(split_conjunct,[status(thm)],[125])).
% cnf(137,negated_conjecture,(incident_c(esk17_0,esk16_0)),inference(spm,[status(thm)],[46,129,theory(equality)])).
% cnf(138,negated_conjecture,(incident_c(esk17_0,esk15_0)),inference(spm,[status(thm)],[47,129,theory(equality)])).
% cnf(154,plain,(incident_c(esk9_1(X1),X1)),inference(spm,[status(thm)],[99,93,theory(equality)])).
% cnf(180,negated_conjecture,(end_point(X1,esk16_0)|~incident_c(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[48,129,theory(equality)])).
% cnf(182,negated_conjecture,(end_point(X1,esk15_0)|~incident_c(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[49,129,theory(equality)])).
% cnf(253,negated_conjecture,(part_of(esk16_0,X1)|part_of(X1,esk16_0)|~incident_c(esk17_0,X1)|~end_point(esk17_0,X2)|~part_of(esk16_0,X2)|~part_of(X1,X2)),inference(spm,[status(thm)],[37,137,theory(equality)])).
% cnf(463,negated_conjecture,(~inner_point(X1,esk16_0)|~incident_c(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[98,180,theory(equality)])).
% cnf(472,negated_conjecture,(~inner_point(X1,esk15_0)|~incident_c(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[98,182,theory(equality)])).
% cnf(500,negated_conjecture,(~inner_point(X1,esk16_0)|~incident_c(X1,esk15_0)),inference(csr,[status(thm)],[463,99])).
% cnf(501,negated_conjecture,(~incident_c(esk9_1(esk16_0),esk15_0)),inference(spm,[status(thm)],[500,93,theory(equality)])).
% cnf(502,negated_conjecture,(~inner_point(X1,esk15_0)|~incident_c(X1,esk16_0)),inference(csr,[status(thm)],[472,99])).
% cnf(503,negated_conjecture,(~incident_c(esk9_1(esk15_0),esk16_0)),inference(spm,[status(thm)],[502,93,theory(equality)])).
% cnf(3372,negated_conjecture,(part_of(X1,esk16_0)|part_of(esk16_0,X1)|~incident_c(esk17_0,X1)|~part_of(esk16_0,esk14_0)|~part_of(X1,esk14_0)),inference(spm,[status(thm)],[253,126,theory(equality)])).
% cnf(3388,negated_conjecture,(part_of(X1,esk16_0)|part_of(esk16_0,X1)|~incident_c(esk17_0,X1)|$false|~part_of(X1,esk14_0)),inference(rw,[status(thm)],[3372,127,theory(equality)])).
% cnf(3389,negated_conjecture,(part_of(X1,esk16_0)|part_of(esk16_0,X1)|~incident_c(esk17_0,X1)|~part_of(X1,esk14_0)),inference(cn,[status(thm)],[3388,theory(equality)])).
% cnf(3422,negated_conjecture,(part_of(esk16_0,esk15_0)|part_of(esk15_0,esk16_0)|~part_of(esk15_0,esk14_0)),inference(spm,[status(thm)],[3389,138,theory(equality)])).
% cnf(3433,negated_conjecture,(part_of(esk16_0,esk15_0)|part_of(esk15_0,esk16_0)|$false),inference(rw,[status(thm)],[3422,128,theory(equality)])).
% cnf(3434,negated_conjecture,(part_of(esk16_0,esk15_0)|part_of(esk15_0,esk16_0)),inference(cn,[status(thm)],[3433,theory(equality)])).
% cnf(3439,negated_conjecture,(incident_c(X1,esk16_0)|part_of(esk16_0,esk15_0)|~incident_c(X1,esk15_0)),inference(spm,[status(thm)],[57,3434,theory(equality)])).
% cnf(3451,negated_conjecture,(incident_c(esk9_1(esk15_0),esk16_0)|part_of(esk16_0,esk15_0)),inference(spm,[status(thm)],[3439,154,theory(equality)])).
% cnf(3482,negated_conjecture,(part_of(esk16_0,esk15_0)),inference(sr,[status(thm)],[3451,503,theory(equality)])).
% cnf(3509,negated_conjecture,(incident_c(X1,esk15_0)|~incident_c(X1,esk16_0)),inference(spm,[status(thm)],[57,3482,theory(equality)])).
% cnf(3594,negated_conjecture,(~incident_c(esk9_1(esk16_0),esk16_0)),inference(spm,[status(thm)],[501,3509,theory(equality)])).
% cnf(3613,negated_conjecture,($false),inference(rw,[status(thm)],[3594,154,theory(equality)])).
% cnf(3614,negated_conjecture,($false),inference(cn,[status(thm)],[3613,theory(equality)])).
% cnf(3615,negated_conjecture,($false),3614,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 478
% # ...of these trivial : 7
% # ...subsumed : 86
% # ...remaining for further processing: 385
% # Other redundant clauses eliminated : 4
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 14
% # Backward-rewritten : 11
% # Generated clauses : 2838
% # ...of the previous two non-trivial : 2455
% # Contextual simplify-reflections : 35
% # Paramodulations : 2812
% # Factorizations : 14
% # Equation resolutions : 8
% # Current number of processed clauses: 309
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 7
% # Non-unit-clauses : 270
% # Current number of unprocessed clauses: 1948
% # ...number of literals in the above : 8861
% # Clause-clause subsumption calls (NU) : 1028
% # Rec. Clause-clause subsumption calls : 783
% # Unit Clause-clause subsumption calls : 136
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 20
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 349 leaves, 1.27+/-1.000 terms/leaf
% # Paramod-from index: 148 leaves, 1.10+/-0.344 terms/leaf
% # Paramod-into index: 243 leaves, 1.21+/-0.698 terms/leaf
% # -------------------------------------------------
% # User time : 0.130 s
% # System time : 0.009 s
% # Total time : 0.139 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.27 CPU 0.36 WC
% FINAL PrfWatch: 0.27 CPU 0.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP12549/GEO094+1.tptp
%
%------------------------------------------------------------------------------