TSTP Solution File: SET980+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET980+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 : 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 00:28:55 EST 2010
% Result : Theorem 0.92s
% Output : Solution 0.92s
% 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/SystemOnTPTP7680/SET980+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP7680/SET980+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP7680/SET980+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 7776
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:(cartesian_product2(X1,X2)=empty_set<=>(X1=empty_set|X2=empty_set)),file('/tmp/SRASS.s.p', t113_zfmisc_1)).
% fof(2, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(7, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(9, 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(10, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(12, conjecture,![X1]:![X2]:![X3]:![X4]:(cartesian_product2(X1,X2)=cartesian_product2(X3,X4)=>((X1=empty_set|X2=empty_set)|(X1=X3&X2=X4))),file('/tmp/SRASS.s.p', t134_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(cartesian_product2(X1,X2)=cartesian_product2(X3,X4)=>((X1=empty_set|X2=empty_set)|(X1=X3&X2=X4)))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(18, plain,![X1]:![X2]:((~(cartesian_product2(X1,X2)=empty_set)|(X1=empty_set|X2=empty_set))&((~(X1=empty_set)&~(X2=empty_set))|cartesian_product2(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[1])).
% fof(19, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)&~(X4=empty_set))|cartesian_product2(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X3]:![X4]:((~(cartesian_product2(X3,X4)=empty_set)|(X3=empty_set|X4=empty_set))&((~(X3=empty_set)|cartesian_product2(X3,X4)=empty_set)&(~(X4=empty_set)|cartesian_product2(X3,X4)=empty_set))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(cartesian_product2(X1,X2)=empty_set|X2!=empty_set),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(X1=empty_set|X2=empty_set|cartesian_product2(X2,X1)!=empty_set),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[14])).
% fof(25, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk1_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[26])).
% cnf(28,plain,(X1=empty_set|in(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(40, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[7])).
% fof(41, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[40])).
% fof(42, plain,![X4]:![X5]:(((~(in(esk4_2(X4,X5),X4))|~(in(esk4_2(X4,X5),X5)))&(in(esk4_2(X4,X5),X4)|in(esk4_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[41])).
% fof(43, plain,![X4]:![X5]:(((~(in(esk4_2(X4,X5),X4))|~(in(esk4_2(X4,X5),X5)))|X4=X5)&((in(esk4_2(X4,X5),X4)|in(esk4_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[42])).
% cnf(44,plain,(X1=X2|in(esk4_2(X1,X2),X2)|in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[43])).
% cnf(45,plain,(X1=X2|~in(esk4_2(X1,X2),X2)|~in(esk4_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[43])).
% fof(48, 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)],[9])).
% fof(49, 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)],[48])).
% fof(50, 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)],[49])).
% cnf(51,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[50])).
% cnf(52,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[50])).
% cnf(53,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[50])).
% fof(54, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[10])).
% cnf(55,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[54])).
% fof(58, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:(cartesian_product2(X1,X2)=cartesian_product2(X3,X4)&((~(X1=empty_set)&~(X2=empty_set))&(~(X1=X3)|~(X2=X4)))),inference(fof_nnf,[status(thm)],[13])).
% fof(59, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:(cartesian_product2(X5,X6)=cartesian_product2(X7,X8)&((~(X5=empty_set)&~(X6=empty_set))&(~(X5=X7)|~(X6=X8)))),inference(variable_rename,[status(thm)],[58])).
% fof(60, negated_conjecture,(cartesian_product2(esk5_0,esk6_0)=cartesian_product2(esk7_0,esk8_0)&((~(esk5_0=empty_set)&~(esk6_0=empty_set))&(~(esk5_0=esk7_0)|~(esk6_0=esk8_0)))),inference(skolemize,[status(esa)],[59])).
% cnf(61,negated_conjecture,(esk6_0!=esk8_0|esk5_0!=esk7_0),inference(split_conjunct,[status(thm)],[60])).
% cnf(62,negated_conjecture,(esk6_0!=empty_set),inference(split_conjunct,[status(thm)],[60])).
% cnf(63,negated_conjecture,(esk5_0!=empty_set),inference(split_conjunct,[status(thm)],[60])).
% cnf(64,negated_conjecture,(cartesian_product2(esk5_0,esk6_0)=cartesian_product2(esk7_0,esk8_0)),inference(split_conjunct,[status(thm)],[60])).
% cnf(65,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[52,55,theory(equality)]),['unfolding']).
% cnf(66,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[53,55,theory(equality)]),['unfolding']).
% cnf(67,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[51,55,theory(equality)]),['unfolding']).
% cnf(69,negated_conjecture,(empty_set=cartesian_product2(esk5_0,esk6_0)|empty_set!=esk8_0),inference(spm,[status(thm)],[64,21,theory(equality)])).
% cnf(86,negated_conjecture,(in(X1,esk8_0)|~in(unordered_pair(unordered_pair(X2,X1),singleton(X2)),cartesian_product2(esk5_0,esk6_0))),inference(spm,[status(thm)],[65,64,theory(equality)])).
% cnf(93,negated_conjecture,(in(X1,esk7_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk5_0,esk6_0))),inference(spm,[status(thm)],[66,64,theory(equality)])).
% cnf(105,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(esk5_0,esk6_0))|~in(X2,esk8_0)|~in(X1,esk7_0)),inference(spm,[status(thm)],[67,64,theory(equality)])).
% cnf(112,negated_conjecture,(empty_set=esk5_0|empty_set=esk6_0|esk8_0!=empty_set),inference(spm,[status(thm)],[23,69,theory(equality)])).
% cnf(116,negated_conjecture,(esk6_0=empty_set|esk8_0!=empty_set),inference(sr,[status(thm)],[112,63,theory(equality)])).
% cnf(117,negated_conjecture,(esk8_0!=empty_set),inference(sr,[status(thm)],[116,62,theory(equality)])).
% cnf(158,negated_conjecture,(in(X1,esk8_0)|~in(X1,esk6_0)|~in(X2,esk5_0)),inference(spm,[status(thm)],[86,67,theory(equality)])).
% cnf(163,negated_conjecture,(in(X1,esk8_0)|empty_set=esk5_0|~in(X1,esk6_0)),inference(spm,[status(thm)],[158,28,theory(equality)])).
% cnf(164,negated_conjecture,(in(X1,esk8_0)|~in(X1,esk6_0)),inference(sr,[status(thm)],[163,63,theory(equality)])).
% cnf(165,negated_conjecture,(X1=esk8_0|~in(esk4_2(X1,esk8_0),X1)|~in(esk4_2(X1,esk8_0),esk6_0)),inference(spm,[status(thm)],[45,164,theory(equality)])).
% cnf(217,negated_conjecture,(in(X1,esk7_0)|~in(X2,esk6_0)|~in(X1,esk5_0)),inference(spm,[status(thm)],[93,67,theory(equality)])).
% cnf(222,negated_conjecture,(in(X1,esk7_0)|empty_set=esk6_0|~in(X1,esk5_0)),inference(spm,[status(thm)],[217,28,theory(equality)])).
% cnf(223,negated_conjecture,(in(X1,esk7_0)|~in(X1,esk5_0)),inference(sr,[status(thm)],[222,62,theory(equality)])).
% cnf(225,negated_conjecture,(X1=esk7_0|~in(esk4_2(X1,esk7_0),X1)|~in(esk4_2(X1,esk7_0),esk5_0)),inference(spm,[status(thm)],[45,223,theory(equality)])).
% cnf(326,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk8_0)|~in(X2,esk7_0)),inference(spm,[status(thm)],[65,105,theory(equality)])).
% cnf(327,negated_conjecture,(in(X1,esk5_0)|~in(X2,esk8_0)|~in(X1,esk7_0)),inference(spm,[status(thm)],[66,105,theory(equality)])).
% cnf(408,negated_conjecture,(in(X1,esk5_0)|empty_set=esk8_0|~in(X1,esk7_0)),inference(spm,[status(thm)],[327,28,theory(equality)])).
% cnf(410,negated_conjecture,(in(X1,esk5_0)|~in(X1,esk7_0)),inference(sr,[status(thm)],[408,117,theory(equality)])).
% cnf(411,negated_conjecture,(in(esk4_2(X1,esk7_0),esk5_0)|X1=esk7_0|in(esk4_2(X1,esk7_0),X1)),inference(spm,[status(thm)],[410,44,theory(equality)])).
% cnf(473,negated_conjecture,(esk5_0=esk7_0|in(esk4_2(esk5_0,esk7_0),esk5_0)),inference(ef,[status(thm)],[411,theory(equality)])).
% cnf(483,negated_conjecture,(esk5_0=esk7_0|~in(esk4_2(esk5_0,esk7_0),esk5_0)),inference(spm,[status(thm)],[225,473,theory(equality)])).
% cnf(484,negated_conjecture,(esk7_0=esk5_0),inference(csr,[status(thm)],[483,473])).
% cnf(508,negated_conjecture,(in(X1,esk6_0)|~in(X1,esk8_0)|~in(X2,esk5_0)),inference(rw,[status(thm)],[326,484,theory(equality)])).
% cnf(520,negated_conjecture,($false|esk8_0!=esk6_0),inference(rw,[status(thm)],[61,484,theory(equality)])).
% cnf(521,negated_conjecture,(esk8_0!=esk6_0),inference(cn,[status(thm)],[520,theory(equality)])).
% cnf(544,negated_conjecture,(in(esk4_2(X1,esk8_0),esk6_0)|X1=esk8_0|in(esk4_2(X1,esk8_0),X1)|~in(X2,esk5_0)),inference(spm,[status(thm)],[508,44,theory(equality)])).
% cnf(768,negated_conjecture,(X1=esk8_0|in(esk4_2(X1,esk8_0),esk6_0)|in(esk4_2(X1,esk8_0),X1)|empty_set=esk5_0),inference(spm,[status(thm)],[544,28,theory(equality)])).
% cnf(770,negated_conjecture,(X1=esk8_0|in(esk4_2(X1,esk8_0),esk6_0)|in(esk4_2(X1,esk8_0),X1)),inference(sr,[status(thm)],[768,63,theory(equality)])).
% cnf(771,negated_conjecture,(esk6_0=esk8_0|in(esk4_2(esk6_0,esk8_0),esk6_0)),inference(ef,[status(thm)],[770,theory(equality)])).
% cnf(778,negated_conjecture,(in(esk4_2(esk6_0,esk8_0),esk6_0)),inference(sr,[status(thm)],[771,521,theory(equality)])).
% cnf(782,negated_conjecture,(esk6_0=esk8_0|~in(esk4_2(esk6_0,esk8_0),esk6_0)),inference(spm,[status(thm)],[165,778,theory(equality)])).
% cnf(783,negated_conjecture,(esk6_0=esk8_0|$false),inference(rw,[status(thm)],[782,778,theory(equality)])).
% cnf(784,negated_conjecture,(esk6_0=esk8_0),inference(cn,[status(thm)],[783,theory(equality)])).
% cnf(785,negated_conjecture,($false),inference(sr,[status(thm)],[784,521,theory(equality)])).
% cnf(786,negated_conjecture,($false),785,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 424
% # ...of these trivial : 2
% # ...subsumed : 272
% # ...remaining for further processing: 150
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 12
% # Backward-rewritten : 30
% # Generated clauses : 534
% # ...of the previous two non-trivial : 506
% # Contextual simplify-reflections : 68
% # Paramodulations : 519
% # Factorizations : 6
% # Equation resolutions : 1
% # Current number of processed clauses: 85
% # Positive orientable unit clauses: 10
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 20
% # Non-unit-clauses : 54
% # Current number of unprocessed clauses: 36
% # ...number of literals in the above : 107
% # Clause-clause subsumption calls (NU) : 2378
% # Rec. Clause-clause subsumption calls : 2075
% # Unit Clause-clause subsumption calls : 77
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 6
% # Backwards rewriting index: 64 leaves, 1.94+/-1.983 terms/leaf
% # Paramod-from index: 23 leaves, 1.22+/-0.412 terms/leaf
% # Paramod-into index: 61 leaves, 1.82+/-1.742 terms/leaf
% # -------------------------------------------------
% # User time : 0.038 s
% # System time : 0.006 s
% # Total time : 0.044 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.21 WC
% FINAL PrfWatch: 0.13 CPU 0.21 WC
% SZS output end Solution for /tmp/SystemOnTPTP7680/SET980+1.tptp
%
%------------------------------------------------------------------------------