TSTP Solution File: SET887+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET887+1 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art01.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:15:29 EST 2010
% Result : Theorem 1.07s
% Output : Solution 1.07s
% 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/SystemOnTPTP31132/SET887+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31132/SET887+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31132/SET887+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 31228
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:![X3]:![X4]:~(((unordered_pair(X1,X2)=unordered_pair(X3,X4)&~(X1=X3))&~(X1=X4))),file('/tmp/SRASS.s.p', t10_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(5, axiom,![X1]:![X2]:![X3]:(singleton(X1)=unordered_pair(X2,X3)=>X1=X2),file('/tmp/SRASS.s.p', t8_zfmisc_1)).
% fof(6, axiom,![X1]:![X2]:![X3]:(subset(X1,unordered_pair(X2,X3))<=>~((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3))))),file('/tmp/SRASS.s.p', l46_zfmisc_1)).
% fof(10, axiom,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(12, conjecture,![X1]:![X2]:![X3]:![X4]:~(((subset(unordered_pair(X1,X2),unordered_pair(X3,X4))&~(X1=X3))&~(X1=X4))),file('/tmp/SRASS.s.p', t28_zfmisc_1)).
% fof(13, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:~(((subset(unordered_pair(X1,X2),unordered_pair(X3,X4))&~(X1=X3))&~(X1=X4)))),inference(assume_negation,[status(cth)],[12])).
% fof(16, plain,![X1]:(X1=empty_set<=>![X2]:~(in(X2,X1))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(21, plain,![X1]:![X2]:![X3]:![X4]:((~(unordered_pair(X1,X2)=unordered_pair(X3,X4))|X1=X3)|X1=X4),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X5]:![X6]:![X7]:![X8]:((~(unordered_pair(X5,X6)=unordered_pair(X7,X8))|X5=X7)|X5=X8),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(X1=X2|X1=X3|unordered_pair(X1,X4)!=unordered_pair(X3,X2)),inference(split_conjunct,[status(thm)],[22])).
% fof(24, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[25])).
% fof(27, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[26])).
% fof(28, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[27])).
% cnf(32,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[28])).
% cnf(33,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[28])).
% cnf(34,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[28])).
% fof(35, plain,![X1]:![X2]:![X3]:(~(singleton(X1)=unordered_pair(X2,X3))|X1=X2),inference(fof_nnf,[status(thm)],[5])).
% fof(36, plain,![X4]:![X5]:![X6]:(~(singleton(X4)=unordered_pair(X5,X6))|X4=X5),inference(variable_rename,[status(thm)],[35])).
% cnf(37,plain,(X1=X2|singleton(X1)!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[36])).
% fof(38, plain,![X1]:![X2]:![X3]:((~(subset(X1,unordered_pair(X2,X3)))|(((X1=empty_set|X1=singleton(X2))|X1=singleton(X3))|X1=unordered_pair(X2,X3)))&((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3)))|subset(X1,unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[6])).
% fof(39, plain,![X4]:![X5]:![X6]:((~(subset(X4,unordered_pair(X5,X6)))|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))&((((~(X4=empty_set)&~(X4=singleton(X5)))&~(X4=singleton(X6)))&~(X4=unordered_pair(X5,X6)))|subset(X4,unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:((~(subset(X4,unordered_pair(X5,X6)))|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))&((((~(X4=empty_set)|subset(X4,unordered_pair(X5,X6)))&(~(X4=singleton(X5))|subset(X4,unordered_pair(X5,X6))))&(~(X4=singleton(X6))|subset(X4,unordered_pair(X5,X6))))&(~(X4=unordered_pair(X5,X6))|subset(X4,unordered_pair(X5,X6))))),inference(distribute,[status(thm)],[39])).
% cnf(45,plain,(X1=unordered_pair(X2,X3)|X1=singleton(X3)|X1=singleton(X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[40])).
% fof(55, plain,![X1]:((~(X1=empty_set)|![X2]:~(in(X2,X1)))&(?[X2]:in(X2,X1)|X1=empty_set)),inference(fof_nnf,[status(thm)],[16])).
% fof(56, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(?[X5]:in(X5,X3)|X3=empty_set)),inference(variable_rename,[status(thm)],[55])).
% fof(57, plain,![X3]:((~(X3=empty_set)|![X4]:~(in(X4,X3)))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X3]:![X4]:((~(in(X4,X3))|~(X3=empty_set))&(in(esk4_1(X3),X3)|X3=empty_set)),inference(shift_quantors,[status(thm)],[57])).
% cnf(60,plain,(X1!=empty_set|~in(X2,X1)),inference(split_conjunct,[status(thm)],[58])).
% fof(62, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((subset(unordered_pair(X1,X2),unordered_pair(X3,X4))&~(X1=X3))&~(X1=X4)),inference(fof_nnf,[status(thm)],[13])).
% fof(63, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((subset(unordered_pair(X5,X6),unordered_pair(X7,X8))&~(X5=X7))&~(X5=X8)),inference(variable_rename,[status(thm)],[62])).
% fof(64, negated_conjecture,((subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0))&~(esk5_0=esk7_0))&~(esk5_0=esk8_0)),inference(skolemize,[status(esa)],[63])).
% cnf(65,negated_conjecture,(esk5_0!=esk8_0),inference(split_conjunct,[status(thm)],[64])).
% cnf(66,negated_conjecture,(esk5_0!=esk7_0),inference(split_conjunct,[status(thm)],[64])).
% cnf(67,negated_conjecture,(subset(unordered_pair(esk5_0,esk6_0),unordered_pair(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[64])).
% cnf(68,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[32,theory(equality)])).
% cnf(69,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(81,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[68,theory(equality)])).
% cnf(84,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[69,theory(equality)])).
% cnf(93,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[34,theory(equality)])).
% cnf(98,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk7_0)=unordered_pair(esk5_0,esk6_0)|empty_set=unordered_pair(esk5_0,esk6_0)),inference(spm,[status(thm)],[45,67,theory(equality)])).
% cnf(107,plain,(empty_set!=unordered_pair(X1,X2)),inference(spm,[status(thm)],[60,81,theory(equality)])).
% cnf(187,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk7_0)=unordered_pair(esk5_0,esk6_0)),inference(sr,[status(thm)],[98,107,theory(equality)])).
% cnf(188,negated_conjecture,(esk8_0=X1|unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk7_0)=unordered_pair(esk5_0,esk6_0)|unordered_pair(X1,X2)!=unordered_pair(esk5_0,esk6_0)),inference(spm,[status(thm)],[37,187,theory(equality)])).
% cnf(190,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk7_0)=unordered_pair(esk5_0,esk6_0)|esk8_0=esk5_0),inference(er,[status(thm)],[188,theory(equality)])).
% cnf(193,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|singleton(esk7_0)=unordered_pair(esk5_0,esk6_0)),inference(sr,[status(thm)],[190,65,theory(equality)])).
% cnf(194,negated_conjecture,(esk7_0=X1|unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|unordered_pair(X1,X2)!=unordered_pair(esk5_0,esk6_0)),inference(spm,[status(thm)],[37,193,theory(equality)])).
% cnf(196,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)|esk7_0=esk5_0),inference(er,[status(thm)],[194,theory(equality)])).
% cnf(199,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk6_0)),inference(sr,[status(thm)],[196,66,theory(equality)])).
% cnf(202,negated_conjecture,(in(esk7_0,unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[84,199,theory(equality)])).
% cnf(224,negated_conjecture,(esk5_0=esk7_0|esk6_0=esk7_0),inference(spm,[status(thm)],[93,202,theory(equality)])).
% cnf(225,negated_conjecture,(esk6_0=esk7_0),inference(sr,[status(thm)],[224,66,theory(equality)])).
% cnf(227,negated_conjecture,(unordered_pair(esk7_0,esk8_0)=unordered_pair(esk5_0,esk7_0)),inference(rw,[status(thm)],[199,225,theory(equality)])).
% cnf(234,negated_conjecture,(in(esk8_0,unordered_pair(esk5_0,esk7_0))),inference(spm,[status(thm)],[81,227,theory(equality)])).
% cnf(250,negated_conjecture,(esk5_0=esk8_0|esk7_0=esk8_0),inference(spm,[status(thm)],[93,234,theory(equality)])).
% cnf(251,negated_conjecture,(esk8_0=esk7_0),inference(sr,[status(thm)],[250,65,theory(equality)])).
% cnf(254,negated_conjecture,(unordered_pair(esk7_0,esk7_0)=unordered_pair(esk5_0,esk7_0)),inference(rw,[status(thm)],[227,251,theory(equality)])).
% cnf(267,negated_conjecture,(X1=esk7_0|unordered_pair(X1,X2)!=unordered_pair(esk5_0,esk7_0)),inference(spm,[status(thm)],[23,254,theory(equality)])).
% cnf(347,negated_conjecture,(esk5_0=esk7_0),inference(er,[status(thm)],[267,theory(equality)])).
% cnf(350,negated_conjecture,($false),inference(sr,[status(thm)],[347,66,theory(equality)])).
% cnf(351,negated_conjecture,($false),350,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 145
% # ...of these trivial : 6
% # ...subsumed : 58
% # ...remaining for further processing: 81
% # Other redundant clauses eliminated : 26
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 9
% # Generated clauses : 226
% # ...of the previous two non-trivial : 179
% # Contextual simplify-reflections : 0
% # Paramodulations : 175
% # Factorizations : 16
% # Equation resolutions : 35
% # Current number of processed clauses: 44
% # Positive orientable unit clauses: 11
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 26
% # Current number of unprocessed clauses: 41
% # ...number of literals in the above : 169
% # Clause-clause subsumption calls (NU) : 126
% # Rec. Clause-clause subsumption calls : 107
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 7
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 29 leaves, 1.72+/-1.760 terms/leaf
% # Paramod-from index: 14 leaves, 1.36+/-0.610 terms/leaf
% # Paramod-into index: 28 leaves, 1.64+/-1.757 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.004 s
% # Total time : 0.023 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.19 WC
% FINAL PrfWatch: 0.12 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP31132/SET887+1.tptp
%
%------------------------------------------------------------------------------