TSTP Solution File: SET906+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET906+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:17:38 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/SystemOnTPTP32174/SET906+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP32174/SET906+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32174/SET906+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 32270
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% 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]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(7, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(13, conjecture,![X1]:![X2]:![X3]:(subset(set_union2(unordered_pair(X1,X2),X3),X3)=>in(X1,X3)),file('/tmp/SRASS.s.p', t47_zfmisc_1)).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(set_union2(unordered_pair(X1,X2),X3),X3)=>in(X1,X3))),inference(assume_negation,[status(cth)],[13])).
% fof(22, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(23, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[25])).
% cnf(29,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[26])).
% fof(32, 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(33, 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)],[32])).
% fof(34, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[33])).
% fof(35, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[34])).
% fof(36, 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)))))&((((~(esk2_3(X5,X6,X7)=X5)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk2_3(X5,X6,X7)=X6)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[35])).
% cnf(41,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[36])).
% fof(43, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)|in(X4,X2)))&((~(in(X4,X1))&~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))&~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)|in(X4,X2))))|X3=set_union2(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(44, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))&~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)|in(X9,X6))))|X7=set_union2(X5,X6))),inference(variable_rename,[status(thm)],[43])).
% fof(45, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))&~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[44])).
% fof(46, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7)))|~(X7=set_union2(X5,X6)))&(((~(in(esk3_3(X5,X6,X7),X7))|(~(in(esk3_3(X5,X6,X7),X5))&~(in(esk3_3(X5,X6,X7),X6))))&(in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[45])).
% fof(47, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk3_3(X5,X6,X7),X5))|~(in(esk3_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk3_3(X5,X6,X7),X6))|~(in(esk3_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk3_3(X5,X6,X7),X7)|(in(esk3_3(X5,X6,X7),X5)|in(esk3_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[46])).
% cnf(51,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[47])).
% fof(56, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(57,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[56])).
% fof(72, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(set_union2(unordered_pair(X1,X2),X3),X3)&~(in(X1,X3))),inference(fof_nnf,[status(thm)],[14])).
% fof(73, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(set_union2(unordered_pair(X4,X5),X6),X6)&~(in(X4,X6))),inference(variable_rename,[status(thm)],[72])).
% fof(74, negated_conjecture,(subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0)&~(in(esk6_0,esk8_0))),inference(skolemize,[status(esa)],[73])).
% cnf(75,negated_conjecture,(~in(esk6_0,esk8_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(76,negated_conjecture,(subset(set_union2(unordered_pair(esk6_0,esk7_0),esk8_0),esk8_0)),inference(split_conjunct,[status(thm)],[74])).
% cnf(77,negated_conjecture,(subset(set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)),esk8_0)),inference(rw,[status(thm)],[76,57,theory(equality)])).
% cnf(79,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[41,theory(equality)])).
% cnf(87,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[79,theory(equality)])).
% cnf(90,negated_conjecture,(in(X1,esk8_0)|~in(X1,set_union2(esk8_0,unordered_pair(esk6_0,esk7_0)))),inference(spm,[status(thm)],[29,77,theory(equality)])).
% cnf(100,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(283,negated_conjecture,(in(X1,esk8_0)|~in(X1,unordered_pair(esk6_0,esk7_0))),inference(spm,[status(thm)],[90,100,theory(equality)])).
% cnf(326,negated_conjecture,(in(esk6_0,esk8_0)),inference(spm,[status(thm)],[283,87,theory(equality)])).
% cnf(327,negated_conjecture,($false),inference(sr,[status(thm)],[326,75,theory(equality)])).
% cnf(328,negated_conjecture,($false),327,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 2
% # ...subsumed : 8
% # ...remaining for further processing: 67
% # Other redundant clauses eliminated : 11
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 235
% # ...of the previous two non-trivial : 211
% # Contextual simplify-reflections : 0
% # Paramodulations : 216
% # Factorizations : 2
% # Equation resolutions : 17
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 6
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 186
% # ...number of literals in the above : 817
% # Clause-clause subsumption calls (NU) : 94
% # Rec. Clause-clause subsumption calls : 87
% # Unit Clause-clause subsumption calls : 12
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 14
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 39 leaves, 1.56+/-1.172 terms/leaf
% # Paramod-from index: 10 leaves, 1.70+/-0.781 terms/leaf
% # Paramod-into index: 32 leaves, 1.47+/-1.089 terms/leaf
% # -------------------------------------------------
% # User time : 0.019 s
% # System time : 0.006 s
% # Total time : 0.025 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.13 CPU 0.19 WC
% FINAL PrfWatch: 0.13 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP32174/SET906+1.tptp
%
%------------------------------------------------------------------------------