TSTP Solution File: SET884+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET884+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:05 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP30614/SET884+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30614/SET884+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30614/SET884+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 30710
% 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(3, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_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]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(9, conjecture,![X1]:![X2]:![X3]:~(((subset(singleton(X1),unordered_pair(X2,X3))&~(X1=X2))&~(X1=X3))),file('/tmp/SRASS.s.p', t25_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:~(((subset(singleton(X1),unordered_pair(X2,X3))&~(X1=X2))&~(X1=X3)))),inference(assume_negation,[status(cth)],[9])).
% fof(17, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(18, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[19])).
% fof(21, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[20])).
% cnf(24,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[21])).
% fof(26, 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(27, 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)],[26])).
% fof(28, 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)],[27])).
% fof(29, 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)],[28])).
% fof(30, 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)],[29])).
% cnf(36,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[30])).
% fof(37, 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)],[5])).
% fof(38, 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)],[37])).
% fof(39, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk3_2(X4,X5),X4)&~(in(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[38])).
% fof(40, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk3_2(X4,X5),X4)&~(in(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk3_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk3_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[40])).
% cnf(44,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[41])).
% fof(54, negated_conjecture,?[X1]:?[X2]:?[X3]:((subset(singleton(X1),unordered_pair(X2,X3))&~(X1=X2))&~(X1=X3)),inference(fof_nnf,[status(thm)],[10])).
% fof(55, negated_conjecture,?[X4]:?[X5]:?[X6]:((subset(singleton(X4),unordered_pair(X5,X6))&~(X4=X5))&~(X4=X6)),inference(variable_rename,[status(thm)],[54])).
% fof(56, negated_conjecture,((subset(singleton(esk6_0),unordered_pair(esk7_0,esk8_0))&~(esk6_0=esk7_0))&~(esk6_0=esk8_0)),inference(skolemize,[status(esa)],[55])).
% cnf(57,negated_conjecture,(esk6_0!=esk8_0),inference(split_conjunct,[status(thm)],[56])).
% cnf(58,negated_conjecture,(esk6_0!=esk7_0),inference(split_conjunct,[status(thm)],[56])).
% cnf(59,negated_conjecture,(subset(singleton(esk6_0),unordered_pair(esk7_0,esk8_0))),inference(split_conjunct,[status(thm)],[56])).
% cnf(60,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[24,theory(equality)])).
% cnf(63,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[60,theory(equality)])).
% cnf(74,negated_conjecture,(in(X1,unordered_pair(esk7_0,esk8_0))|~in(X1,singleton(esk6_0))),inference(spm,[status(thm)],[44,59,theory(equality)])).
% cnf(76,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[36,theory(equality)])).
% cnf(112,negated_conjecture,(in(esk6_0,unordered_pair(esk7_0,esk8_0))),inference(spm,[status(thm)],[74,63,theory(equality)])).
% cnf(121,negated_conjecture,(esk7_0=esk6_0|esk8_0=esk6_0),inference(spm,[status(thm)],[76,112,theory(equality)])).
% cnf(126,negated_conjecture,(esk8_0=esk6_0),inference(sr,[status(thm)],[121,58,theory(equality)])).
% cnf(127,negated_conjecture,($false),inference(sr,[status(thm)],[126,57,theory(equality)])).
% cnf(128,negated_conjecture,($false),127,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 77
% # ...of these trivial : 2
% # ...subsumed : 12
% # ...remaining for further processing: 63
% # Other redundant clauses eliminated : 3
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 60
% # ...of the previous two non-trivial : 46
% # Contextual simplify-reflections : 0
% # Paramodulations : 52
% # Factorizations : 0
% # Equation resolutions : 8
% # Current number of processed clauses: 39
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 7
% # Non-unit-clauses : 24
% # Current number of unprocessed clauses: 11
% # ...number of literals in the above : 38
% # Clause-clause subsumption calls (NU) : 56
% # Rec. Clause-clause subsumption calls : 54
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 35 leaves, 1.46+/-1.130 terms/leaf
% # Paramod-from index: 11 leaves, 1.18+/-0.386 terms/leaf
% # Paramod-into index: 32 leaves, 1.38+/-0.960 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.005 s
% # Total time : 0.018 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.19 WC
% FINAL PrfWatch: 0.11 CPU 0.19 WC
% SZS output end Solution for /tmp/SystemOnTPTP30614/SET884+1.tptp
%
%------------------------------------------------------------------------------