TSTP Solution File: SEU165+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU165+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 : art02.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 01:23:20 EST 2010
% Result : Theorem 2.34s
% Output : Solution 2.34s
% 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/SystemOnTPTP23078/SEU165+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP23078/SEU165+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP23078/SEU165+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 23174
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.025 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', l55_zfmisc_1)).
% fof(15, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(43, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(76, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(95, conjecture,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4))),file('/tmp/SRASS.s.p', t106_zfmisc_1)).
% fof(96, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))<=>(in(X1,X3)&in(X2,X4)))),inference(assume_negation,[status(cth)],[95])).
% fof(113, plain,![X1]:![X2]:![X3]:![X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(in(X1,X3)&in(X2,X4)))&((~(in(X1,X3))|~(in(X2,X4)))|in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))),inference(fof_nnf,[status(thm)],[2])).
% fof(114, plain,![X5]:![X6]:![X7]:![X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(in(X5,X7)&in(X6,X8)))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(variable_rename,[status(thm)],[113])).
% fof(115, plain,![X5]:![X6]:![X7]:![X8]:(((in(X5,X7)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))))&(in(X6,X8)|~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))))&((~(in(X5,X7))|~(in(X6,X8)))|in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))),inference(distribute,[status(thm)],[114])).
% cnf(116,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[115])).
% cnf(117,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[115])).
% cnf(118,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[115])).
% fof(178, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[15])).
% cnf(179,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[178])).
% fof(320, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[43])).
% cnf(321,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[320])).
% fof(409, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[76])).
% cnf(410,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[409])).
% fof(453, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(X3,X4)))|(~(in(X1,X3))|~(in(X2,X4))))&(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|(in(X1,X3)&in(X2,X4)))),inference(fof_nnf,[status(thm)],[96])).
% fof(454, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(X7,X8)))|(~(in(X5,X7))|~(in(X6,X8))))&(in(ordered_pair(X5,X6),cartesian_product2(X7,X8))|(in(X5,X7)&in(X6,X8)))),inference(variable_rename,[status(thm)],[453])).
% fof(455, negated_conjecture,((~(in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0)))|(~(in(esk22_0,esk24_0))|~(in(esk23_0,esk25_0))))&(in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0))|(in(esk22_0,esk24_0)&in(esk23_0,esk25_0)))),inference(skolemize,[status(esa)],[454])).
% fof(456, negated_conjecture,((~(in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0)))|(~(in(esk22_0,esk24_0))|~(in(esk23_0,esk25_0))))&((in(esk22_0,esk24_0)|in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0)))&(in(esk23_0,esk25_0)|in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0))))),inference(distribute,[status(thm)],[455])).
% cnf(457,negated_conjecture,(in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0))|in(esk23_0,esk25_0)),inference(split_conjunct,[status(thm)],[456])).
% cnf(458,negated_conjecture,(in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0))|in(esk22_0,esk24_0)),inference(split_conjunct,[status(thm)],[456])).
% cnf(459,negated_conjecture,(~in(esk23_0,esk25_0)|~in(esk22_0,esk24_0)|~in(ordered_pair(esk22_0,esk23_0),cartesian_product2(esk24_0,esk25_0))),inference(split_conjunct,[status(thm)],[456])).
% cnf(461,plain,(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1))=ordered_pair(X1,X2)),inference(rw,[status(thm)],[321,410,theory(equality)]),['unfolding']).
% cnf(504,negated_conjecture,(in(esk22_0,esk24_0)|in(unordered_pair(unordered_pair(esk22_0,esk23_0),unordered_pair(esk22_0,esk22_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[458,461,theory(equality)]),['unfolding']).
% cnf(505,negated_conjecture,(in(esk23_0,esk25_0)|in(unordered_pair(unordered_pair(esk22_0,esk23_0),unordered_pair(esk22_0,esk22_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[457,461,theory(equality)]),['unfolding']).
% cnf(509,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[117,461,theory(equality)]),['unfolding']).
% cnf(510,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[118,461,theory(equality)]),['unfolding']).
% cnf(511,plain,(in(unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[116,461,theory(equality)]),['unfolding']).
% cnf(516,negated_conjecture,(~in(esk22_0,esk24_0)|~in(esk23_0,esk25_0)|~in(unordered_pair(unordered_pair(esk22_0,esk23_0),unordered_pair(esk22_0,esk22_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[459,461,theory(equality)]),['unfolding']).
% cnf(521,negated_conjecture,(in(esk22_0,esk24_0)|in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[504,179,theory(equality)])).
% cnf(523,negated_conjecture,(in(esk23_0,esk25_0)|in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[505,179,theory(equality)])).
% cnf(530,negated_conjecture,(~in(esk22_0,esk24_0)|~in(esk23_0,esk25_0)|~in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))),inference(rw,[status(thm)],[516,179,theory(equality)])).
% cnf(891,plain,(in(X1,X2)|~in(unordered_pair(unordered_pair(X3,X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2))),inference(spm,[status(thm)],[509,179,theory(equality)])).
% cnf(902,plain,(in(X1,X2)|~in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X3)),cartesian_product2(X2,X4))),inference(spm,[status(thm)],[510,179,theory(equality)])).
% cnf(981,plain,(in(unordered_pair(unordered_pair(X1,X1),unordered_pair(X1,X2)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(spm,[status(thm)],[511,179,theory(equality)])).
% cnf(17911,negated_conjecture,(in(esk23_0,esk25_0)),inference(spm,[status(thm)],[891,523,theory(equality)])).
% cnf(17972,negated_conjecture,(~in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))|~in(esk22_0,esk24_0)|$false),inference(rw,[status(thm)],[530,17911,theory(equality)])).
% cnf(17973,negated_conjecture,(~in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))|~in(esk22_0,esk24_0)),inference(cn,[status(thm)],[17972,theory(equality)])).
% cnf(19363,negated_conjecture,(in(esk22_0,esk24_0)),inference(spm,[status(thm)],[902,521,theory(equality)])).
% cnf(19458,negated_conjecture,(~in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))|$false),inference(rw,[status(thm)],[17973,19363,theory(equality)])).
% cnf(19459,negated_conjecture,(~in(unordered_pair(unordered_pair(esk22_0,esk22_0),unordered_pair(esk22_0,esk23_0)),cartesian_product2(esk24_0,esk25_0))),inference(cn,[status(thm)],[19458,theory(equality)])).
% cnf(29683,negated_conjecture,(~in(esk23_0,esk25_0)|~in(esk22_0,esk24_0)),inference(spm,[status(thm)],[19459,981,theory(equality)])).
% cnf(29732,negated_conjecture,($false|~in(esk22_0,esk24_0)),inference(rw,[status(thm)],[29683,17911,theory(equality)])).
% cnf(29733,negated_conjecture,($false|$false),inference(rw,[status(thm)],[29732,19363,theory(equality)])).
% cnf(29734,negated_conjecture,($false),inference(cn,[status(thm)],[29733,theory(equality)])).
% cnf(29735,negated_conjecture,($false),29734,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2529
% # ...of these trivial : 110
% # ...subsumed : 1554
% # ...remaining for further processing: 865
% # Other redundant clauses eliminated : 181
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 6
% # Backward-rewritten : 83
% # Generated clauses : 24327
% # ...of the previous two non-trivial : 21584
% # Contextual simplify-reflections : 33
% # Paramodulations : 24081
% # Factorizations : 17
% # Equation resolutions : 229
% # Current number of processed clauses: 638
% # Positive orientable unit clauses: 195
% # Positive unorientable unit clauses: 5
% # Negative unit clauses : 110
% # Non-unit-clauses : 328
% # Current number of unprocessed clauses: 15485
% # ...number of literals in the above : 47844
% # Clause-clause subsumption calls (NU) : 5920
% # Rec. Clause-clause subsumption calls : 5400
% # Unit Clause-clause subsumption calls : 481
% # Rewrite failures with RHS unbound : 18
% # Indexed BW rewrite attempts : 150
% # Indexed BW rewrite successes : 43
% # Backwards rewriting index: 493 leaves, 1.48+/-1.711 terms/leaf
% # Paramod-from index: 247 leaves, 1.27+/-0.637 terms/leaf
% # Paramod-into index: 448 leaves, 1.46+/-1.497 terms/leaf
% # -------------------------------------------------
% # User time : 0.798 s
% # System time : 0.030 s
% # Total time : 0.828 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.29 CPU 1.36 WC
% FINAL PrfWatch: 1.29 CPU 1.36 WC
% SZS output end Solution for /tmp/SystemOnTPTP23078/SEU165+2.tptp
%
%------------------------------------------------------------------------------