TSTP Solution File: SET957+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET957+1 : TPTP v5.0.0. Bugfixed v4.0.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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 00:23:32 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP10804/SET957+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP10804/SET957+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10804/SET957+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 10900
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:~(((subset(X1,cartesian_product2(X2,X3))&in(X4,X1))&![X5]:![X6]:~(((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6))))),file('/tmp/SRASS.s.p', t103_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(8, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(9, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(10, conjecture,![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(((subset(X1,cartesian_product2(X2,X3))&subset(X4,cartesian_product2(X5,X6)))&![X7]:![X8]:(in(ordered_pair(X7,X8),X1)<=>in(ordered_pair(X7,X8),X4)))=>X1=X4),file('/tmp/SRASS.s.p', t110_zfmisc_1)).
% fof(11, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:![X5]:![X6]:(((subset(X1,cartesian_product2(X2,X3))&subset(X4,cartesian_product2(X5,X6)))&![X7]:![X8]:(in(ordered_pair(X7,X8),X1)<=>in(ordered_pair(X7,X8),X4)))=>X1=X4)),inference(assume_negation,[status(cth)],[10])).
% fof(20, plain,![X1]:![X2]:![X3]:![X4]:((~(subset(X1,cartesian_product2(X2,X3)))|~(in(X4,X1)))|?[X5]:?[X6]:((in(X5,X2)&in(X6,X3))&X4=ordered_pair(X5,X6))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,![X7]:![X8]:![X9]:![X10]:((~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))|?[X11]:?[X12]:((in(X11,X8)&in(X12,X9))&X10=ordered_pair(X11,X12))),inference(variable_rename,[status(thm)],[20])).
% fof(22, plain,![X7]:![X8]:![X9]:![X10]:((~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))|((in(esk1_4(X7,X8,X9,X10),X8)&in(esk2_4(X7,X8,X9,X10),X9))&X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10)))),inference(skolemize,[status(esa)],[21])).
% fof(23, plain,![X7]:![X8]:![X9]:![X10]:(((in(esk1_4(X7,X8,X9,X10),X8)|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7))))&(in(esk2_4(X7,X8,X9,X10),X9)|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7)))))&(X10=ordered_pair(esk1_4(X7,X8,X9,X10),esk2_4(X7,X8,X9,X10))|(~(subset(X7,cartesian_product2(X8,X9)))|~(in(X10,X7))))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(X1=ordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1))|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[23])).
% fof(27, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[4])).
% fof(28, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[27])).
% fof(29, plain,![X4]:![X5]:(((~(in(esk3_2(X4,X5),X4))|~(in(esk3_2(X4,X5),X5)))&(in(esk3_2(X4,X5),X4)|in(esk3_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[28])).
% fof(30, plain,![X4]:![X5]:(((~(in(esk3_2(X4,X5),X4))|~(in(esk3_2(X4,X5),X5)))|X4=X5)&((in(esk3_2(X4,X5),X4)|in(esk3_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[29])).
% cnf(31,plain,(X1=X2|in(esk3_2(X1,X2),X2)|in(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[30])).
% cnf(32,plain,(X1=X2|~in(esk3_2(X1,X2),X2)|~in(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(41, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[8])).
% cnf(42,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(43, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[9])).
% cnf(44,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[43])).
% fof(45, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:?[X5]:?[X6]:(((subset(X1,cartesian_product2(X2,X3))&subset(X4,cartesian_product2(X5,X6)))&![X7]:![X8]:((~(in(ordered_pair(X7,X8),X1))|in(ordered_pair(X7,X8),X4))&(~(in(ordered_pair(X7,X8),X4))|in(ordered_pair(X7,X8),X1))))&~(X1=X4)),inference(fof_nnf,[status(thm)],[11])).
% fof(46, negated_conjecture,?[X9]:?[X10]:?[X11]:?[X12]:?[X13]:?[X14]:(((subset(X9,cartesian_product2(X10,X11))&subset(X12,cartesian_product2(X13,X14)))&![X15]:![X16]:((~(in(ordered_pair(X15,X16),X9))|in(ordered_pair(X15,X16),X12))&(~(in(ordered_pair(X15,X16),X12))|in(ordered_pair(X15,X16),X9))))&~(X9=X12)),inference(variable_rename,[status(thm)],[45])).
% fof(47, negated_conjecture,(((subset(esk6_0,cartesian_product2(esk7_0,esk8_0))&subset(esk9_0,cartesian_product2(esk10_0,esk11_0)))&![X15]:![X16]:((~(in(ordered_pair(X15,X16),esk6_0))|in(ordered_pair(X15,X16),esk9_0))&(~(in(ordered_pair(X15,X16),esk9_0))|in(ordered_pair(X15,X16),esk6_0))))&~(esk6_0=esk9_0)),inference(skolemize,[status(esa)],[46])).
% fof(48, negated_conjecture,![X15]:![X16]:((((~(in(ordered_pair(X15,X16),esk6_0))|in(ordered_pair(X15,X16),esk9_0))&(~(in(ordered_pair(X15,X16),esk9_0))|in(ordered_pair(X15,X16),esk6_0)))&(subset(esk6_0,cartesian_product2(esk7_0,esk8_0))&subset(esk9_0,cartesian_product2(esk10_0,esk11_0))))&~(esk6_0=esk9_0)),inference(shift_quantors,[status(thm)],[47])).
% cnf(49,negated_conjecture,(esk6_0!=esk9_0),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,negated_conjecture,(subset(esk9_0,cartesian_product2(esk10_0,esk11_0))),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,negated_conjecture,(subset(esk6_0,cartesian_product2(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,negated_conjecture,(in(ordered_pair(X1,X2),esk6_0)|~in(ordered_pair(X1,X2),esk9_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(53,negated_conjecture,(in(ordered_pair(X1,X2),esk9_0)|~in(ordered_pair(X1,X2),esk6_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(54,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk6_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[52,44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(55,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk9_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk6_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[53,44,theory(equality)]),44,theory(equality)]),['unfolding']).
% cnf(56,plain,(unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1)))=X1|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(rw,[status(thm)],[24,44,theory(equality)]),['unfolding']).
% cnf(58,plain,(unordered_pair(singleton(esk1_4(X2,X3,X4,X1)),unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)))=X1|~in(X1,X2)|~subset(X2,cartesian_product2(X3,X4))),inference(rw,[status(thm)],[56,42,theory(equality)])).
% cnf(61,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk6_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0)),inference(spm,[status(thm)],[54,42,theory(equality)])).
% cnf(66,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk9_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk6_0)),inference(spm,[status(thm)],[55,42,theory(equality)])).
% cnf(99,negated_conjecture,(in(X4,esk6_0)|~in(X4,esk9_0)|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1)),inference(spm,[status(thm)],[61,58,theory(equality)])).
% cnf(106,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk9_0)),inference(spm,[status(thm)],[99,50,theory(equality)])).
% cnf(110,negated_conjecture,(in(esk3_2(esk9_0,X1),esk6_0)|esk9_0=X1|in(esk3_2(esk9_0,X1),X1)),inference(spm,[status(thm)],[106,31,theory(equality)])).
% cnf(134,negated_conjecture,(esk9_0=esk6_0|in(esk3_2(esk9_0,esk6_0),esk6_0)),inference(ef,[status(thm)],[110,theory(equality)])).
% cnf(139,negated_conjecture,(in(esk3_2(esk9_0,esk6_0),esk6_0)),inference(sr,[status(thm)],[134,49,theory(equality)])).
% cnf(142,negated_conjecture,(esk9_0=esk6_0|~in(esk3_2(esk9_0,esk6_0),esk9_0)),inference(spm,[status(thm)],[32,139,theory(equality)])).
% cnf(143,negated_conjecture,(~in(esk3_2(esk9_0,esk6_0),esk9_0)),inference(sr,[status(thm)],[142,49,theory(equality)])).
% cnf(158,negated_conjecture,(in(X4,esk9_0)|~in(X4,esk6_0)|~subset(X1,cartesian_product2(X2,X3))|~in(X4,X1)),inference(spm,[status(thm)],[66,58,theory(equality)])).
% cnf(161,negated_conjecture,(in(X1,esk9_0)|~in(X1,esk6_0)),inference(spm,[status(thm)],[158,51,theory(equality)])).
% cnf(164,negated_conjecture,(~in(esk3_2(esk9_0,esk6_0),esk6_0)),inference(spm,[status(thm)],[143,161,theory(equality)])).
% cnf(168,negated_conjecture,($false),inference(rw,[status(thm)],[164,139,theory(equality)])).
% cnf(169,negated_conjecture,($false),inference(cn,[status(thm)],[168,theory(equality)])).
% cnf(170,negated_conjecture,($false),169,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 70
% # ...of these trivial : 2
% # ...subsumed : 15
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 0
% # Generated clauses : 100
% # ...of the previous two non-trivial : 85
% # Contextual simplify-reflections : 1
% # Paramodulations : 94
% # Factorizations : 6
% # Equation resolutions : 0
% # Current number of processed clauses: 29
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 13
% # Current number of unprocessed clauses: 18
% # ...number of literals in the above : 52
% # Clause-clause subsumption calls (NU) : 77
% # Rec. Clause-clause subsumption calls : 64
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 52 leaves, 1.17+/-0.426 terms/leaf
% # Paramod-from index: 16 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 46 leaves, 1.15+/-0.359 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.003 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP10804/SET957+1.tptp
%
%------------------------------------------------------------------------------