TSTP Solution File: SEU239+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU239+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 : art09.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:22:04 EST 2010
% Result : Theorem 16.64s
% Output : Solution 16.64s
% 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/SystemOnTPTP27963/SEU239+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27963/SEU239+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27963/SEU239+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 28059
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.89 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.88 CPU 10.03 WC
% # Preprocessing time : 0.063 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 11.72 CPU 12.06 WC
% # SZS output start CNFRefutation.
% fof(8, axiom,![X1]:(relation(X1)=>(reflexive(X1)<=>is_reflexive_in(X1,relation_field(X1)))),file('/tmp/SRASS.s.p', d9_relat_2)).
% fof(9, 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(194, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(234, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(283, conjecture,![X1]:(relation(X1)=>(reflexive(X1)<=>![X2]:(in(X2,relation_field(X1))=>in(ordered_pair(X2,X2),X1)))),file('/tmp/SRASS.s.p', l1_wellord1)).
% fof(284, negated_conjecture,~(![X1]:(relation(X1)=>(reflexive(X1)<=>![X2]:(in(X2,relation_field(X1))=>in(ordered_pair(X2,X2),X1))))),inference(assume_negation,[status(cth)],[283])).
% fof(361, 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)],[8])).
% fof(362, 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)],[361])).
% fof(363, 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)],[362])).
% cnf(364,plain,(reflexive(X1)|~relation(X1)|~is_reflexive_in(X1,relation_field(X1))),inference(split_conjunct,[status(thm)],[363])).
% cnf(365,plain,(is_reflexive_in(X1,relation_field(X1))|~relation(X1)|~reflexive(X1)),inference(split_conjunct,[status(thm)],[363])).
% fof(366, 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)],[9])).
% fof(367, 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)],[366])).
% fof(368, plain,![X4]:(~(relation(X4))|![X5]:((~(is_reflexive_in(X4,X5))|![X6]:(~(in(X6,X5))|in(ordered_pair(X6,X6),X4)))&((in(esk9_2(X4,X5),X5)&~(in(ordered_pair(esk9_2(X4,X5),esk9_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))),inference(skolemize,[status(esa)],[367])).
% fof(369, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))&((in(esk9_2(X4,X5),X5)&~(in(ordered_pair(esk9_2(X4,X5),esk9_2(X4,X5)),X4)))|is_reflexive_in(X4,X5)))|~(relation(X4))),inference(shift_quantors,[status(thm)],[368])).
% fof(370, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|in(ordered_pair(X6,X6),X4))|~(is_reflexive_in(X4,X5)))|~(relation(X4)))&(((in(esk9_2(X4,X5),X5)|is_reflexive_in(X4,X5))|~(relation(X4)))&((~(in(ordered_pair(esk9_2(X4,X5),esk9_2(X4,X5)),X4))|is_reflexive_in(X4,X5))|~(relation(X4))))),inference(distribute,[status(thm)],[369])).
% cnf(371,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(ordered_pair(esk9_2(X1,X2),esk9_2(X1,X2)),X1)),inference(split_conjunct,[status(thm)],[370])).
% cnf(372,plain,(is_reflexive_in(X1,X2)|in(esk9_2(X1,X2),X2)|~relation(X1)),inference(split_conjunct,[status(thm)],[370])).
% cnf(373,plain,(in(ordered_pair(X3,X3),X1)|~relation(X1)|~is_reflexive_in(X1,X2)|~in(X3,X2)),inference(split_conjunct,[status(thm)],[370])).
% fof(1253, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[194])).
% cnf(1254,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[1253])).
% fof(1423, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[234])).
% cnf(1424,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[1423])).
% fof(1574, negated_conjecture,?[X1]:(relation(X1)&((~(reflexive(X1))|?[X2]:(in(X2,relation_field(X1))&~(in(ordered_pair(X2,X2),X1))))&(reflexive(X1)|![X2]:(~(in(X2,relation_field(X1)))|in(ordered_pair(X2,X2),X1))))),inference(fof_nnf,[status(thm)],[284])).
% fof(1575, negated_conjecture,?[X3]:(relation(X3)&((~(reflexive(X3))|?[X4]:(in(X4,relation_field(X3))&~(in(ordered_pair(X4,X4),X3))))&(reflexive(X3)|![X5]:(~(in(X5,relation_field(X3)))|in(ordered_pair(X5,X5),X3))))),inference(variable_rename,[status(thm)],[1574])).
% fof(1576, negated_conjecture,(relation(esk101_0)&((~(reflexive(esk101_0))|(in(esk102_0,relation_field(esk101_0))&~(in(ordered_pair(esk102_0,esk102_0),esk101_0))))&(reflexive(esk101_0)|![X5]:(~(in(X5,relation_field(esk101_0)))|in(ordered_pair(X5,X5),esk101_0))))),inference(skolemize,[status(esa)],[1575])).
% fof(1577, negated_conjecture,![X5]:((((~(in(X5,relation_field(esk101_0)))|in(ordered_pair(X5,X5),esk101_0))|reflexive(esk101_0))&(~(reflexive(esk101_0))|(in(esk102_0,relation_field(esk101_0))&~(in(ordered_pair(esk102_0,esk102_0),esk101_0)))))&relation(esk101_0)),inference(shift_quantors,[status(thm)],[1576])).
% fof(1578, negated_conjecture,![X5]:((((~(in(X5,relation_field(esk101_0)))|in(ordered_pair(X5,X5),esk101_0))|reflexive(esk101_0))&((in(esk102_0,relation_field(esk101_0))|~(reflexive(esk101_0)))&(~(in(ordered_pair(esk102_0,esk102_0),esk101_0))|~(reflexive(esk101_0)))))&relation(esk101_0)),inference(distribute,[status(thm)],[1577])).
% cnf(1579,negated_conjecture,(relation(esk101_0)),inference(split_conjunct,[status(thm)],[1578])).
% cnf(1580,negated_conjecture,(~reflexive(esk101_0)|~in(ordered_pair(esk102_0,esk102_0),esk101_0)),inference(split_conjunct,[status(thm)],[1578])).
% cnf(1581,negated_conjecture,(in(esk102_0,relation_field(esk101_0))|~reflexive(esk101_0)),inference(split_conjunct,[status(thm)],[1578])).
% cnf(1582,negated_conjecture,(reflexive(esk101_0)|in(ordered_pair(X1,X1),esk101_0)|~in(X1,relation_field(esk101_0))),inference(split_conjunct,[status(thm)],[1578])).
% cnf(1588,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[1254,1424,theory(equality)]),['unfolding']).
% cnf(1660,negated_conjecture,(reflexive(esk101_0)|in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X1)),esk101_0)|~in(X1,relation_field(esk101_0))),inference(rw,[status(thm)],[1582,1588,theory(equality)]),['unfolding']).
% cnf(1676,plain,(is_reflexive_in(X1,X2)|~relation(X1)|~in(unordered_pair(unordered_pair(esk9_2(X1,X2),esk9_2(X1,X2)),unordered_pair(esk9_2(X1,X2),esk9_2(X1,X2))),X1)),inference(rw,[status(thm)],[371,1588,theory(equality)]),['unfolding']).
% cnf(1692,plain,(in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X3)),X1)|~relation(X1)|~in(X3,X2)|~is_reflexive_in(X1,X2)),inference(rw,[status(thm)],[373,1588,theory(equality)]),['unfolding']).
% cnf(1735,negated_conjecture,(~reflexive(esk101_0)|~in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)),inference(rw,[status(thm)],[1580,1588,theory(equality)]),['unfolding']).
% cnf(2819,negated_conjecture,(reflexive(esk101_0)|in(unordered_pair(unordered_pair(esk9_2(X1,relation_field(esk101_0)),esk9_2(X1,relation_field(esk101_0))),unordered_pair(esk9_2(X1,relation_field(esk101_0)),esk9_2(X1,relation_field(esk101_0)))),esk101_0)|is_reflexive_in(X1,relation_field(esk101_0))|~relation(X1)),inference(spm,[status(thm)],[1660,372,theory(equality)])).
% cnf(4088,plain,(in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X1)),X2)|~relation(X2)|~in(X1,relation_field(X2))|~reflexive(X2)),inference(spm,[status(thm)],[1692,365,theory(equality)])).
% cnf(71970,negated_conjecture,(is_reflexive_in(esk101_0,relation_field(esk101_0))|reflexive(esk101_0)|~relation(esk101_0)),inference(spm,[status(thm)],[1676,2819,theory(equality)])).
% cnf(72048,negated_conjecture,(is_reflexive_in(esk101_0,relation_field(esk101_0))|reflexive(esk101_0)|$false),inference(rw,[status(thm)],[71970,1579,theory(equality)])).
% cnf(72049,negated_conjecture,(is_reflexive_in(esk101_0,relation_field(esk101_0))|reflexive(esk101_0)),inference(cn,[status(thm)],[72048,theory(equality)])).
% cnf(72119,negated_conjecture,(reflexive(esk101_0)|~relation(esk101_0)),inference(spm,[status(thm)],[364,72049,theory(equality)])).
% cnf(72127,negated_conjecture,(reflexive(esk101_0)|$false),inference(rw,[status(thm)],[72119,1579,theory(equality)])).
% cnf(72128,negated_conjecture,(reflexive(esk101_0)),inference(cn,[status(thm)],[72127,theory(equality)])).
% cnf(72568,negated_conjecture,($false|~in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)),inference(rw,[status(thm)],[1735,72128,theory(equality)])).
% cnf(72569,negated_conjecture,(~in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)),inference(cn,[status(thm)],[72568,theory(equality)])).
% cnf(72571,negated_conjecture,(in(esk102_0,relation_field(esk101_0))|$false),inference(rw,[status(thm)],[1581,72128,theory(equality)])).
% cnf(72572,negated_conjecture,(in(esk102_0,relation_field(esk101_0))),inference(cn,[status(thm)],[72571,theory(equality)])).
% cnf(188027,negated_conjecture,(in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)|~reflexive(esk101_0)|~relation(esk101_0)),inference(spm,[status(thm)],[4088,72572,theory(equality)])).
% cnf(188206,negated_conjecture,(in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)|$false|~relation(esk101_0)),inference(rw,[status(thm)],[188027,72128,theory(equality)])).
% cnf(188207,negated_conjecture,(in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)|$false|$false),inference(rw,[status(thm)],[188206,1579,theory(equality)])).
% cnf(188208,negated_conjecture,(in(unordered_pair(unordered_pair(esk102_0,esk102_0),unordered_pair(esk102_0,esk102_0)),esk101_0)),inference(cn,[status(thm)],[188207,theory(equality)])).
% cnf(188209,negated_conjecture,($false),inference(sr,[status(thm)],[188208,72569,theory(equality)])).
% cnf(188210,negated_conjecture,($false),188209,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 17534
% # ...of these trivial : 50
% # ...subsumed : 11986
% # ...remaining for further processing: 5498
% # Other redundant clauses eliminated : 232
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 479
% # Backward-rewritten : 489
% # Generated clauses : 153148
% # ...of the previous two non-trivial : 147493
% # Contextual simplify-reflections : 3795
% # Paramodulations : 152743
% # Factorizations : 19
% # Equation resolutions : 383
% # Current number of processed clauses: 4019
% # Positive orientable unit clauses: 171
% # Positive unorientable unit clauses: 4
% # Negative unit clauses : 830
% # Non-unit-clauses : 3014
% # Current number of unprocessed clauses: 111089
% # ...number of literals in the above : 516338
% # Clause-clause subsumption calls (NU) : 839465
% # Rec. Clause-clause subsumption calls : 509293
% # Unit Clause-clause subsumption calls : 170528
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 212
% # Indexed BW rewrite successes : 79
% # Backwards rewriting index: 2824 leaves, 1.54+/-2.357 terms/leaf
% # Paramod-from index: 681 leaves, 1.21+/-1.681 terms/leaf
% # Paramod-into index: 2457 leaves, 1.48+/-2.144 terms/leaf
% # -------------------------------------------------
% # User time : 9.744 s
% # System time : 0.240 s
% # Total time : 9.983 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.12 CPU 13.68 WC
% FINAL PrfWatch: 13.12 CPU 13.68 WC
% SZS output end Solution for /tmp/SystemOnTPTP27963/SEU239+2.tptp
%
%------------------------------------------------------------------------------