%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU268+1 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art06.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:43:39 EST 2010
% Result : Theorem 1.44s
% Output : Solution 1.44s
% 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/SystemOnTPTP31833/SEU268+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31833/SEU268+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31833/SEU268+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 31929
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.016 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:relation(inclusion_relation(X1)),file('/tmp/SRASS.s.p', dt_k1_wellord2)).
% fof(2, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(3, axiom,![X1]:(relation(X1)=>(reflexive(X1)<=>is_reflexive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d9_relat_2)).
% fof(4, axiom,![X1]:(relation(X1)=>![X2]:(is_reflexive_in(X1,X2)<=>![X3]:(in(X3,X2)=>in(ordered_pair(X3,X3),X1)))),file('/tmp/SRASS.s.p', d1_relat_2)).
% fof(20, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(22, axiom,![X1]:![X2]:(relation(X2)=>(X2=inclusion_relation(X1)<=>(relation_field(X2)=X1&![X3]:![X4]:((in(X3,X1)&in(X4,X1))=>(in(ordered_pair(X3,X4),X2)<=>subset(X3,X4)))))),file('/tmp/SRASS.s.p', d1_wellord2)).
% fof(39, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(51, conjecture,![X1]:reflexive(inclusion_relation(X1)),file('/tmp/SRASS.s.p', t2_wellord2)).
% fof(52, negated_conjecture,~(![X1]:reflexive(inclusion_relation(X1))),inference(assume_negation,[status(cth)],[51])).
% fof(59, plain,![X2]:relation(inclusion_relation(X2)),inference(variable_rename,[status(thm)],[1])).
% cnf(60,plain,(relation(inclusion_relation(X1))),inference(split_conjunct,[status(thm)],[59])).
% fof(61, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(62,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:(~(relation(X1))|((~(reflexive(X1))|is_reflexive_in(X1,relation_field(X1)))&(~(is_reflexive_in(X1,relation_field(X1)))|reflexive(X1)))),inference(fof_nnf,[status(thm)],[3])).
% fof(64, plain,![X2]:(~(relation(X2))|((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))&(~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2)))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X2]:(((~(reflexive(X2))|is_reflexive_in(X2,relation_field(X2)))|~(relation(X2)))&((~(is_reflexive_in(X2,relation_field(X2)))|reflexive(X2))|~(relation(X2)))),inference(distribute,[status(thm)],[64])).
% cnf(66,plain,(reflexive(X1)|~relation(X1)|~is_reflexive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[65])).
% fof(68, plain,![X1]:(~(relation(X1))|![X2]:((~(is_reflexive_in(X1,X2))|![X3]:(~(in(X3,X2))|in(ordered_pair(X3,X3),X1)))&(?[X3]:(in(X3,X2)&~(in(ordered_pair(X3,X3),X1)))|is_reflexive_in(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(69, plain,![X4]:(~(relation(X4))|![X5]:((~(is_reflexive_in(X4,X5))|![X6]:(~(in(X6,X5))|in(ordered_pair(X6,X6),X4)))&(?[X7]:(in(X7,X5)&~(in(ordered_pair(X7,X7),X4)))|is_reflexive_in(X4,X5)))),inference(variable_rename,[status(thm)],[68])).
% fof(70, plain,![X4]:(~(relation(X4))|![X5]:((~(is_reflexive_in(X4,X5))|![X6]:(~(in(X6,X5))|in(ordered_pair(X6,X6),X4)))&((in(esk1_2(X4,X5),X5)&~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))),inference(skolemize,[status(esa)],[69])).
% fof(71, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))&((in(esk1_2(X4,X5),X5)&~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))|~(relation(X4))),inference(shift_quantors,[status(thm)],[70])).
% fof(72, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))|~(relation(X4)))&(((in(esk1_2(X4,X5),X5)|is_reflexive_in(X4,X5))|~(relation(X4)))&((~(in(ordered_pair(esk1_2(X4,X5),esk1_2(X4,X5)),X4))|is_reflexive_in(X4,X5))|~(relation(X4))))),inference(distribute,[status(thm)],[71])).
% cnf(73,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[72])).
% cnf(74,plain,(is_reflexive_in(X1,X2)|in(esk1_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[72])).
% fof(141, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[20])).
% cnf(142,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[141])).
% fof(146, plain,![X1]:![X2]:(~(relation(X2))|((~(X2=inclusion_relation(X1))|(relation_field(X2)=X1&![X3]:![X4]:((~(in(X3,X1))|~(in(X4,X1)))|((~(in(ordered_pair(X3,X4),X2))|subset(X3,X4))&(~(subset(X3,X4))|in(ordered_pair(X3,X4),X2))))))&((~(relation_field(X2)=X1)|?[X3]:?[X4]:((in(X3,X1)&in(X4,X1))&((~(in(ordered_pair(X3,X4),X2))|~(subset(X3,X4)))&(in(ordered_pair(X3,X4),X2)|subset(X3,X4)))))|X2=inclusion_relation(X1)))),inference(fof_nnf,[status(thm)],[22])).
% fof(147, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|?[X9]:?[X10]:((in(X9,X5)&in(X10,X5))&((~(in(ordered_pair(X9,X10),X6))|~(subset(X9,X10)))&(in(ordered_pair(X9,X10),X6)|subset(X9,X10)))))|X6=inclusion_relation(X5)))),inference(variable_rename,[status(thm)],[146])).
% fof(148, plain,![X5]:![X6]:(~(relation(X6))|((~(X6=inclusion_relation(X5))|(relation_field(X6)=X5&![X7]:![X8]:((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))))&((~(relation_field(X6)=X5)|((in(esk11_2(X5,X6),X5)&in(esk12_2(X5,X6),X5))&((~(in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6))|~(subset(esk11_2(X5,X6),esk12_2(X5,X6))))&(in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6)|subset(esk11_2(X5,X6),esk12_2(X5,X6))))))|X6=inclusion_relation(X5)))),inference(skolemize,[status(esa)],[147])).
% fof(149, plain,![X5]:![X6]:![X7]:![X8]:((((((~(in(X7,X5))|~(in(X8,X5)))|((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))&(~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))))&relation_field(X6)=X5)|~(X6=inclusion_relation(X5)))&((~(relation_field(X6)=X5)|((in(esk11_2(X5,X6),X5)&in(esk12_2(X5,X6),X5))&((~(in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6))|~(subset(esk11_2(X5,X6),esk12_2(X5,X6))))&(in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6)|subset(esk11_2(X5,X6),esk12_2(X5,X6))))))|X6=inclusion_relation(X5)))|~(relation(X6))),inference(shift_quantors,[status(thm)],[148])).
% fof(150, plain,![X5]:![X6]:![X7]:![X8]:(((((((~(in(ordered_pair(X7,X8),X6))|subset(X7,X8))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6)))&((((~(subset(X7,X8))|in(ordered_pair(X7,X8),X6))|(~(in(X7,X5))|~(in(X8,X5))))|~(X6=inclusion_relation(X5)))|~(relation(X6))))&((relation_field(X6)=X5|~(X6=inclusion_relation(X5)))|~(relation(X6))))&(((((in(esk11_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&(((in(esk12_2(X5,X6),X5)|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6))))&(((((~(in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6))|~(subset(esk11_2(X5,X6),esk12_2(X5,X6))))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))&((((in(ordered_pair(esk11_2(X5,X6),esk12_2(X5,X6)),X6)|subset(esk11_2(X5,X6),esk12_2(X5,X6)))|~(relation_field(X6)=X5))|X6=inclusion_relation(X5))|~(relation(X6)))))),inference(distribute,[status(thm)],[149])).
% cnf(155,plain,(relation_field(X1)=X2|~relation(X1)|X1!=inclusion_relation(X2)),inference(split_conjunct,[status(thm)],[150])).
% cnf(156,plain,(in(ordered_pair(X4,X3),X1)|~relation(X1)|X1!=inclusion_relation(X2)|~in(X3,X2)|~in(X4,X2)|~subset(X4,X3)),inference(split_conjunct,[status(thm)],[150])).
% fof(212, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[39])).
% cnf(213,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[212])).
% fof(227, negated_conjecture,?[X1]:~(reflexive(inclusion_relation(X1))),inference(fof_nnf,[status(thm)],[52])).
% fof(228, negated_conjecture,?[X2]:~(reflexive(inclusion_relation(X2))),inference(variable_rename,[status(thm)],[227])).
% fof(229, negated_conjecture,~(reflexive(inclusion_relation(esk14_0))),inference(skolemize,[status(esa)],[228])).
% cnf(230,negated_conjecture,(~reflexive(inclusion_relation(esk14_0))),inference(split_conjunct,[status(thm)],[229])).
% cnf(231,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[73,142,theory(equality)]),['unfolding']).
% cnf(236,plain,(in(unordered_pair(unordered_pair(X4,X3),singleton(X4)),X1)|inclusion_relation(X2)!=X1|~relation(X1)|~subset(X4,X3)|~in(X4,X2)|~in(X3,X2)),inference(rw,[status(thm)],[156,142,theory(equality)]),['unfolding']).
% cnf(238,plain,(relation_field(inclusion_relation(X1))=X1|~relation(inclusion_relation(X1))),inference(er,[status(thm)],[155,theory(equality)])).
% cnf(239,plain,(relation_field(inclusion_relation(X1))=X1|$false),inference(rw,[status(thm)],[238,60,theory(equality)])).
% cnf(240,plain,(relation_field(inclusion_relation(X1))=X1),inference(cn,[status(thm)],[239,theory(equality)])).
% cnf(315,plain,(in(unordered_pair(unordered_pair(esk1_2(X1,X2),X3),singleton(esk1_2(X1,X2))),X4)|is_reflexive_in(X1,X2)|inclusion_relation(X2)!=X4|~in(X3,X2)|~subset(esk1_2(X1,X2),X3)|~relation(X4)|~relation(X1)),inference(spm,[status(thm)],[236,74,theory(equality)])).
% cnf(316,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk1_2(X1,X2))),X1)),inference(rw,[status(thm)],[231,213,theory(equality)])).
% cnf(326,plain,(reflexive(inclusion_relation(X1))|~is_reflexive_in(inclusion_relation(X1),X1)|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[66,240,theory(equality)])).
% cnf(329,plain,(reflexive(inclusion_relation(X1))|~is_reflexive_in(inclusion_relation(X1),X1)|$false),inference(rw,[status(thm)],[326,60,theory(equality)])).
% cnf(330,plain,(reflexive(inclusion_relation(X1))|~is_reflexive_in(inclusion_relation(X1),X1)),inference(cn,[status(thm)],[329,theory(equality)])).
% cnf(719,plain,(in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),X3)),X4)|is_reflexive_in(X1,X2)|inclusion_relation(X2)!=X4|~in(X3,X2)|~subset(esk1_2(X1,X2),X3)|~relation(X4)|~relation(X1)),inference(spm,[status(thm)],[315,213,theory(equality)])).
% cnf(6372,plain,(is_reflexive_in(X1,X2)|~relation(X1)|inclusion_relation(X2)!=X1|~in(esk1_2(X1,X2),X2)|~subset(esk1_2(X1,X2),esk1_2(X1,X2))),inference(spm,[status(thm)],[316,719,theory(equality)])).
% cnf(6381,plain,(is_reflexive_in(X1,X2)|~relation(X1)|inclusion_relation(X2)!=X1|~in(esk1_2(X1,X2),X2)|$false),inference(rw,[status(thm)],[6372,62,theory(equality)])).
% cnf(6382,plain,(is_reflexive_in(X1,X2)|~relation(X1)|inclusion_relation(X2)!=X1|~in(esk1_2(X1,X2),X2)),inference(cn,[status(thm)],[6381,theory(equality)])).
% cnf(6386,plain,(is_reflexive_in(X1,X2)|inclusion_relation(X2)!=X1|~relation(X1)),inference(csr,[status(thm)],[6382,74])).
% cnf(6387,plain,(reflexive(inclusion_relation(X1))|~relation(inclusion_relation(X1))),inference(spm,[status(thm)],[330,6386,theory(equality)])).
% cnf(6390,plain,(reflexive(inclusion_relation(X1))|$false),inference(rw,[status(thm)],[6387,60,theory(equality)])).
% cnf(6391,plain,(reflexive(inclusion_relation(X1))),inference(cn,[status(thm)],[6390,theory(equality)])).
% cnf(6428,negated_conjecture,($false),inference(rw,[status(thm)],[230,6391,theory(equality)])).
% cnf(6429,negated_conjecture,($false),inference(cn,[status(thm)],[6428,theory(equality)])).
% cnf(6430,negated_conjecture,($false),6429,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1124
% # ...of these trivial : 6
% # ...subsumed : 644
% # ...remaining for further processing: 474
% # Other redundant clauses eliminated : 13
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 37
% # Backward-rewritten : 31
% # Generated clauses : 4116
% # ...of the previous two non-trivial : 3896
% # Contextual simplify-reflections : 420
% # Paramodulations : 4091
% # Factorizations : 0
% # Equation resolutions : 22
% # Current number of processed clauses: 405
% # Positive orientable unit clauses: 38
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 12
% # Non-unit-clauses : 353
% # Current number of unprocessed clauses: 2622
% # ...number of literals in the above : 22976
% # Clause-clause subsumption calls (NU) : 26182
% # Rec. Clause-clause subsumption calls : 9830
% # Unit Clause-clause subsumption calls : 208
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 18
% # Backwards rewriting index: 315 leaves, 2.03+/-1.969 terms/leaf
% # Paramod-from index: 108 leaves, 1.31+/-0.967 terms/leaf
% # Paramod-into index: 277 leaves, 1.72+/-1.488 terms/leaf
% # -------------------------------------------------
% # User time : 0.366 s
% # System time : 0.010 s
% # Total time : 0.376 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.57 CPU 0.66 WC
% FINAL PrfWatch: 0.57 CPU 0.66 WC
% SZS output end Solution for /tmp/SystemOnTPTP31833/SEU268+1.tptp
%
%------------------------------------------------------------------------------