TSTP Solution File: SEU236+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU236+2 : TPTP v5.0.0. Released v3.3.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 02:20:06 EST 2010
% Result : Theorem 4.20s
% Output : Solution 4.20s
% 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/SystemOnTPTP29385/SEU236+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP29385/SEU236+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP29385/SEU236+2.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 29481
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.062 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(2, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),file('/tmp/SRASS.s.p', connectedness_r1_ordinal1)).
% fof(4, axiom,![X1]:in(X1,succ(X1)),file('/tmp/SRASS.s.p', t10_ordinal1)).
% fof(9, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(24, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(28, axiom,![X1]:(ordinal(X1)=>(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),file('/tmp/SRASS.s.p', fc3_ordinal1)).
% fof(52, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(70, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(144, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X3,X2))=>subset(set_union2(X1,X3),X2)),file('/tmp/SRASS.s.p', t8_xboole_1)).
% fof(198, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(276, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(in(X1,X2)<=>ordinal_subset(succ(X1),X2)))),file('/tmp/SRASS.s.p', t33_ordinal1)).
% fof(277, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(in(X1,X2)<=>ordinal_subset(succ(X1),X2))))),inference(assume_negation,[status(cth)],[276])).
% fof(278, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[1,theory(equality)])).
% fof(284, plain,![X1]:(ordinal(X1)=>(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),inference(fof_simplification,[status(thm)],[28,theory(equality)])).
% fof(310, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[278])).
% fof(311, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[310])).
% cnf(312,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[311])).
% fof(313, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|(ordinal_subset(X1,X2)|ordinal_subset(X2,X1))),inference(fof_nnf,[status(thm)],[2])).
% fof(314, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|(ordinal_subset(X3,X4)|ordinal_subset(X4,X3))),inference(variable_rename,[status(thm)],[313])).
% cnf(315,plain,(ordinal_subset(X1,X2)|ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[314])).
% fof(319, plain,![X2]:in(X2,succ(X2)),inference(variable_rename,[status(thm)],[4])).
% cnf(320,plain,(in(X1,succ(X1))),inference(split_conjunct,[status(thm)],[319])).
% fof(338, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|((~(ordinal_subset(X1,X2))|subset(X1,X2))&(~(subset(X1,X2))|ordinal_subset(X1,X2)))),inference(fof_nnf,[status(thm)],[9])).
% fof(339, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|((~(ordinal_subset(X3,X4))|subset(X3,X4))&(~(subset(X3,X4))|ordinal_subset(X3,X4)))),inference(variable_rename,[status(thm)],[338])).
% fof(340, plain,![X3]:![X4]:(((~(ordinal_subset(X3,X4))|subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))&((~(subset(X3,X4))|ordinal_subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))),inference(distribute,[status(thm)],[339])).
% cnf(341,plain,(ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~subset(X2,X1)),inference(split_conjunct,[status(thm)],[340])).
% cnf(342,plain,(subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~ordinal_subset(X2,X1)),inference(split_conjunct,[status(thm)],[340])).
% fof(392, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[24])).
% fof(393, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[392])).
% fof(394, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk8_2(X4,X5),X4)&~(in(esk8_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[393])).
% fof(395, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk8_2(X4,X5),X4)&~(in(esk8_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[394])).
% fof(396, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk8_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk8_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[395])).
% cnf(399,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[396])).
% fof(410, plain,![X1]:(~(ordinal(X1))|(((~(empty(succ(X1)))&epsilon_transitive(succ(X1)))&epsilon_connected(succ(X1)))&ordinal(succ(X1)))),inference(fof_nnf,[status(thm)],[284])).
% fof(411, plain,![X2]:(~(ordinal(X2))|(((~(empty(succ(X2)))&epsilon_transitive(succ(X2)))&epsilon_connected(succ(X2)))&ordinal(succ(X2)))),inference(variable_rename,[status(thm)],[410])).
% fof(412, plain,![X2]:((((~(empty(succ(X2)))|~(ordinal(X2)))&(epsilon_transitive(succ(X2))|~(ordinal(X2))))&(epsilon_connected(succ(X2))|~(ordinal(X2))))&(ordinal(succ(X2))|~(ordinal(X2)))),inference(distribute,[status(thm)],[411])).
% cnf(413,plain,(ordinal(succ(X1))|~ordinal(X1)),inference(split_conjunct,[status(thm)],[412])).
% fof(527, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[52])).
% fof(528, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[527])).
% cnf(529,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[528])).
% fof(603, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[70])).
% cnf(604,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[603])).
% fof(1004, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X3,X2)))|subset(set_union2(X1,X3),X2)),inference(fof_nnf,[status(thm)],[144])).
% fof(1005, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X6,X5)))|subset(set_union2(X4,X6),X5)),inference(variable_rename,[status(thm)],[1004])).
% cnf(1006,plain,(subset(set_union2(X1,X2),X3)|~subset(X2,X3)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[1005])).
% fof(1222, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[198])).
% cnf(1223,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[1222])).
% fof(1520, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&((~(in(X1,X2))|~(ordinal_subset(succ(X1),X2)))&(in(X1,X2)|ordinal_subset(succ(X1),X2))))),inference(fof_nnf,[status(thm)],[277])).
% fof(1521, negated_conjecture,?[X3]:(ordinal(X3)&?[X4]:(ordinal(X4)&((~(in(X3,X4))|~(ordinal_subset(succ(X3),X4)))&(in(X3,X4)|ordinal_subset(succ(X3),X4))))),inference(variable_rename,[status(thm)],[1520])).
% fof(1522, negated_conjecture,(ordinal(esk98_0)&(ordinal(esk99_0)&((~(in(esk98_0,esk99_0))|~(ordinal_subset(succ(esk98_0),esk99_0)))&(in(esk98_0,esk99_0)|ordinal_subset(succ(esk98_0),esk99_0))))),inference(skolemize,[status(esa)],[1521])).
% cnf(1523,negated_conjecture,(ordinal_subset(succ(esk98_0),esk99_0)|in(esk98_0,esk99_0)),inference(split_conjunct,[status(thm)],[1522])).
% cnf(1524,negated_conjecture,(~ordinal_subset(succ(esk98_0),esk99_0)|~in(esk98_0,esk99_0)),inference(split_conjunct,[status(thm)],[1522])).
% cnf(1525,negated_conjecture,(ordinal(esk99_0)),inference(split_conjunct,[status(thm)],[1522])).
% cnf(1526,negated_conjecture,(ordinal(esk98_0)),inference(split_conjunct,[status(thm)],[1522])).
% cnf(1531,plain,(set_union2(X1,unordered_pair(X1,X1))=succ(X1)),inference(rw,[status(thm)],[604,1223,theory(equality)]),['unfolding']).
% cnf(1547,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[529,1223,theory(equality)]),['unfolding']).
% cnf(1559,plain,(in(X1,set_union2(X1,unordered_pair(X1,X1)))),inference(rw,[status(thm)],[320,1531,theory(equality)]),['unfolding']).
% cnf(1560,negated_conjecture,(in(esk98_0,esk99_0)|ordinal_subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)),inference(rw,[status(thm)],[1523,1531,theory(equality)]),['unfolding']).
% cnf(1561,plain,(ordinal(set_union2(X1,unordered_pair(X1,X1)))|~ordinal(X1)),inference(rw,[status(thm)],[413,1531,theory(equality)]),['unfolding']).
% cnf(1566,negated_conjecture,(~in(esk98_0,esk99_0)|~ordinal_subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)),inference(rw,[status(thm)],[1524,1531,theory(equality)]),['unfolding']).
% cnf(1993,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))|~ordinal(esk99_0)),inference(spm,[status(thm)],[342,1560,theory(equality)])).
% cnf(1994,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))|$false),inference(rw,[status(thm)],[1993,1525,theory(equality)])).
% cnf(1995,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))),inference(cn,[status(thm)],[1994,theory(equality)])).
% cnf(2019,negated_conjecture,(~in(esk98_0,esk99_0)|~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))|~ordinal(esk99_0)),inference(spm,[status(thm)],[1566,341,theory(equality)])).
% cnf(2021,negated_conjecture,(~in(esk98_0,esk99_0)|~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))|$false),inference(rw,[status(thm)],[2019,1525,theory(equality)])).
% cnf(2022,negated_conjecture,(~in(esk98_0,esk99_0)|~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~ordinal(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))),inference(cn,[status(thm)],[2021,theory(equality)])).
% cnf(2193,negated_conjecture,(ordinal_subset(esk99_0,X1)|ordinal_subset(X1,esk99_0)|~ordinal(X1)),inference(spm,[status(thm)],[315,1525,theory(equality)])).
% cnf(8869,negated_conjecture,(~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~in(esk98_0,esk99_0)|~ordinal(esk98_0)),inference(spm,[status(thm)],[2022,1561,theory(equality)])).
% cnf(8870,negated_conjecture,(~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~in(esk98_0,esk99_0)|$false),inference(rw,[status(thm)],[8869,1526,theory(equality)])).
% cnf(8871,negated_conjecture,(~subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|~in(esk98_0,esk99_0)),inference(cn,[status(thm)],[8870,theory(equality)])).
% cnf(8878,negated_conjecture,(~in(esk98_0,esk99_0)|~subset(unordered_pair(esk98_0,esk98_0),esk99_0)|~subset(esk98_0,esk99_0)),inference(spm,[status(thm)],[8871,1006,theory(equality)])).
% cnf(8991,negated_conjecture,(~subset(esk98_0,esk99_0)|~in(esk98_0,esk99_0)),inference(csr,[status(thm)],[8878,1547])).
% cnf(9025,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)|~ordinal(esk98_0)),inference(spm,[status(thm)],[1995,1561,theory(equality)])).
% cnf(9026,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)|$false),inference(rw,[status(thm)],[9025,1526,theory(equality)])).
% cnf(9027,negated_conjecture,(subset(set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)),esk99_0)|in(esk98_0,esk99_0)),inference(cn,[status(thm)],[9026,theory(equality)])).
% cnf(9029,negated_conjecture,(in(X1,esk99_0)|in(esk98_0,esk99_0)|~in(X1,set_union2(esk98_0,unordered_pair(esk98_0,esk98_0)))),inference(spm,[status(thm)],[399,9027,theory(equality)])).
% cnf(9493,negated_conjecture,(in(esk98_0,esk99_0)),inference(spm,[status(thm)],[9029,1559,theory(equality)])).
% cnf(9521,negated_conjecture,(~subset(esk98_0,esk99_0)|$false),inference(rw,[status(thm)],[8991,9493,theory(equality)])).
% cnf(9522,negated_conjecture,(~subset(esk98_0,esk99_0)),inference(cn,[status(thm)],[9521,theory(equality)])).
% cnf(10703,negated_conjecture,(ordinal_subset(esk98_0,esk99_0)|ordinal_subset(esk99_0,esk98_0)),inference(spm,[status(thm)],[2193,1526,theory(equality)])).
% cnf(10716,negated_conjecture,(subset(esk99_0,esk98_0)|ordinal_subset(esk98_0,esk99_0)|~ordinal(esk99_0)|~ordinal(esk98_0)),inference(spm,[status(thm)],[342,10703,theory(equality)])).
% cnf(10717,negated_conjecture,(subset(esk99_0,esk98_0)|ordinal_subset(esk98_0,esk99_0)|$false|~ordinal(esk98_0)),inference(rw,[status(thm)],[10716,1525,theory(equality)])).
% cnf(10718,negated_conjecture,(subset(esk99_0,esk98_0)|ordinal_subset(esk98_0,esk99_0)|$false|$false),inference(rw,[status(thm)],[10717,1526,theory(equality)])).
% cnf(10719,negated_conjecture,(subset(esk99_0,esk98_0)|ordinal_subset(esk98_0,esk99_0)),inference(cn,[status(thm)],[10718,theory(equality)])).
% cnf(10720,negated_conjecture,(subset(esk98_0,esk99_0)|subset(esk99_0,esk98_0)|~ordinal(esk98_0)|~ordinal(esk99_0)),inference(spm,[status(thm)],[342,10719,theory(equality)])).
% cnf(10721,negated_conjecture,(subset(esk98_0,esk99_0)|subset(esk99_0,esk98_0)|$false|~ordinal(esk99_0)),inference(rw,[status(thm)],[10720,1526,theory(equality)])).
% cnf(10722,negated_conjecture,(subset(esk98_0,esk99_0)|subset(esk99_0,esk98_0)|$false|$false),inference(rw,[status(thm)],[10721,1525,theory(equality)])).
% cnf(10723,negated_conjecture,(subset(esk98_0,esk99_0)|subset(esk99_0,esk98_0)),inference(cn,[status(thm)],[10722,theory(equality)])).
% cnf(10724,negated_conjecture,(subset(esk99_0,esk98_0)),inference(sr,[status(thm)],[10723,9522,theory(equality)])).
% cnf(10726,negated_conjecture,(in(X1,esk98_0)|~in(X1,esk99_0)),inference(spm,[status(thm)],[399,10724,theory(equality)])).
% cnf(10783,negated_conjecture,(in(esk98_0,esk98_0)),inference(spm,[status(thm)],[10726,9493,theory(equality)])).
% cnf(10849,negated_conjecture,(~in(esk98_0,esk98_0)),inference(spm,[status(thm)],[312,10783,theory(equality)])).
% cnf(10862,negated_conjecture,($false),inference(rw,[status(thm)],[10849,10783,theory(equality)])).
% cnf(10863,negated_conjecture,($false),inference(cn,[status(thm)],[10862,theory(equality)])).
% cnf(10864,negated_conjecture,($false),10863,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1382
% # ...of these trivial : 17
% # ...subsumed : 256
% # ...remaining for further processing: 1109
% # Other redundant clauses eliminated : 88
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 7
% # Backward-rewritten : 31
% # Generated clauses : 7927
% # ...of the previous two non-trivial : 7495
% # Contextual simplify-reflections : 30
% # Paramodulations : 7787
% # Factorizations : 14
% # Equation resolutions : 126
% # Current number of processed clauses: 580
% # Positive orientable unit clauses: 78
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 45
% # Non-unit-clauses : 454
% # Current number of unprocessed clauses: 6677
% # ...number of literals in the above : 32666
% # Clause-clause subsumption calls (NU) : 17984
% # Rec. Clause-clause subsumption calls : 5874
% # Unit Clause-clause subsumption calls : 1021
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 74
% # Indexed BW rewrite successes : 59
% # Backwards rewriting index: 593 leaves, 1.55+/-2.599 terms/leaf
% # Paramod-from index: 253 leaves, 1.15+/-1.061 terms/leaf
% # Paramod-into index: 524 leaves, 1.42+/-2.087 terms/leaf
% # -------------------------------------------------
% # User time : 0.495 s
% # System time : 0.017 s
% # Total time : 0.512 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.83 CPU 0.91 WC
% FINAL PrfWatch: 0.83 CPU 0.91 WC
% SZS output end Solution for /tmp/SystemOnTPTP29385/SEU236+2.tptp
%
%------------------------------------------------------------------------------