TSTP Solution File: SET959+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET959+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:24:00 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/SystemOnTPTP11322/SET959+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP11322/SET959+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP11322/SET959+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 11418
% 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(2, axiom,![X1]:![X2]:(![X3]:(in(X3,X1)<=>in(X3,X2))=>X1=X2),file('/tmp/SRASS.s.p', t2_tarski)).
% fof(6, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(7, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(8, conjecture,![X1]:![X2]:(((![X3]:~((in(X3,X1)&![X4]:![X5]:~(X3=ordered_pair(X4,X5))))&![X3]:~((in(X3,X2)&![X4]:![X5]:~(X3=ordered_pair(X4,X5)))))&![X3]:![X4]:(in(ordered_pair(X3,X4),X1)<=>in(ordered_pair(X3,X4),X2)))=>X1=X2),file('/tmp/SRASS.s.p', t112_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:(((![X3]:~((in(X3,X1)&![X4]:![X5]:~(X3=ordered_pair(X4,X5))))&![X3]:~((in(X3,X2)&![X4]:![X5]:~(X3=ordered_pair(X4,X5)))))&![X3]:![X4]:(in(ordered_pair(X3,X4),X1)<=>in(ordered_pair(X3,X4),X2)))=>X1=X2)),inference(assume_negation,[status(cth)],[8])).
% fof(16, plain,![X1]:![X2]:(?[X3]:((~(in(X3,X1))|~(in(X3,X2)))&(in(X3,X1)|in(X3,X2)))|X1=X2),inference(fof_nnf,[status(thm)],[2])).
% fof(17, plain,![X4]:![X5]:(?[X6]:((~(in(X6,X4))|~(in(X6,X5)))&(in(X6,X4)|in(X6,X5)))|X4=X5),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:(((~(in(esk1_2(X4,X5),X4))|~(in(esk1_2(X4,X5),X5)))&(in(esk1_2(X4,X5),X4)|in(esk1_2(X4,X5),X5)))|X4=X5),inference(skolemize,[status(esa)],[17])).
% fof(19, plain,![X4]:![X5]:(((~(in(esk1_2(X4,X5),X4))|~(in(esk1_2(X4,X5),X5)))|X4=X5)&((in(esk1_2(X4,X5),X4)|in(esk1_2(X4,X5),X5))|X4=X5)),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(X1=X2|in(esk1_2(X1,X2),X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(X1=X2|~in(esk1_2(X1,X2),X2)|~in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(30, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[6])).
% cnf(31,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[30])).
% fof(32, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[7])).
% cnf(33,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(34, negated_conjecture,?[X1]:?[X2]:(((![X3]:(~(in(X3,X1))|?[X4]:?[X5]:X3=ordered_pair(X4,X5))&![X3]:(~(in(X3,X2))|?[X4]:?[X5]:X3=ordered_pair(X4,X5)))&![X3]:![X4]:((~(in(ordered_pair(X3,X4),X1))|in(ordered_pair(X3,X4),X2))&(~(in(ordered_pair(X3,X4),X2))|in(ordered_pair(X3,X4),X1))))&~(X1=X2)),inference(fof_nnf,[status(thm)],[9])).
% fof(35, negated_conjecture,?[X6]:?[X7]:(((![X8]:(~(in(X8,X6))|?[X9]:?[X10]:X8=ordered_pair(X9,X10))&![X11]:(~(in(X11,X7))|?[X12]:?[X13]:X11=ordered_pair(X12,X13)))&![X14]:![X15]:((~(in(ordered_pair(X14,X15),X6))|in(ordered_pair(X14,X15),X7))&(~(in(ordered_pair(X14,X15),X7))|in(ordered_pair(X14,X15),X6))))&~(X6=X7)),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,(((![X8]:(~(in(X8,esk4_0))|X8=ordered_pair(esk6_1(X8),esk7_1(X8)))&![X11]:(~(in(X11,esk5_0))|X11=ordered_pair(esk8_1(X11),esk9_1(X11))))&![X14]:![X15]:((~(in(ordered_pair(X14,X15),esk4_0))|in(ordered_pair(X14,X15),esk5_0))&(~(in(ordered_pair(X14,X15),esk5_0))|in(ordered_pair(X14,X15),esk4_0))))&~(esk4_0=esk5_0)),inference(skolemize,[status(esa)],[35])).
% fof(37, negated_conjecture,![X8]:![X11]:![X14]:![X15]:((((~(in(ordered_pair(X14,X15),esk4_0))|in(ordered_pair(X14,X15),esk5_0))&(~(in(ordered_pair(X14,X15),esk5_0))|in(ordered_pair(X14,X15),esk4_0)))&((~(in(X11,esk5_0))|X11=ordered_pair(esk8_1(X11),esk9_1(X11)))&(~(in(X8,esk4_0))|X8=ordered_pair(esk6_1(X8),esk7_1(X8)))))&~(esk4_0=esk5_0)),inference(shift_quantors,[status(thm)],[36])).
% cnf(38,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(X1=ordered_pair(esk6_1(X1),esk7_1(X1))|~in(X1,esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(X1=ordered_pair(esk8_1(X1),esk9_1(X1))|~in(X1,esk5_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(41,negated_conjecture,(in(ordered_pair(X1,X2),esk4_0)|~in(ordered_pair(X1,X2),esk5_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,negated_conjecture,(in(ordered_pair(X1,X2),esk5_0)|~in(ordered_pair(X1,X2),esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(43,negated_conjecture,(unordered_pair(unordered_pair(esk6_1(X1),esk7_1(X1)),singleton(esk6_1(X1)))=X1|~in(X1,esk4_0)),inference(rw,[status(thm)],[39,31,theory(equality)]),['unfolding']).
% cnf(44,negated_conjecture,(unordered_pair(unordered_pair(esk8_1(X1),esk9_1(X1)),singleton(esk8_1(X1)))=X1|~in(X1,esk5_0)),inference(rw,[status(thm)],[40,31,theory(equality)]),['unfolding']).
% cnf(45,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[41,31,theory(equality)]),31,theory(equality)]),['unfolding']).
% cnf(46,negated_conjecture,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[42,31,theory(equality)]),31,theory(equality)]),['unfolding']).
% cnf(56,negated_conjecture,(unordered_pair(singleton(esk6_1(X1)),unordered_pair(esk6_1(X1),esk7_1(X1)))=X1|~in(X1,esk4_0)),inference(rw,[status(thm)],[43,33,theory(equality)])).
% cnf(57,negated_conjecture,(unordered_pair(singleton(esk6_1(esk1_2(X1,esk4_0))),unordered_pair(esk6_1(esk1_2(X1,esk4_0)),esk7_1(esk1_2(X1,esk4_0))))=esk1_2(X1,esk4_0)|X1=esk4_0|in(esk1_2(X1,esk4_0),X1)),inference(spm,[status(thm)],[56,20,theory(equality)])).
% cnf(59,negated_conjecture,(unordered_pair(singleton(esk8_1(X1)),unordered_pair(esk8_1(X1),esk9_1(X1)))=X1|~in(X1,esk5_0)),inference(rw,[status(thm)],[44,33,theory(equality)])).
% cnf(64,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0)),inference(spm,[status(thm)],[46,33,theory(equality)])).
% cnf(69,negated_conjecture,(in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk4_0)|~in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)),inference(spm,[status(thm)],[45,33,theory(equality)])).
% cnf(105,negated_conjecture,(in(esk1_2(X1,esk4_0),esk5_0)|X1=esk4_0|in(esk1_2(X1,esk4_0),X1)|~in(esk1_2(X1,esk4_0),esk4_0)),inference(spm,[status(thm)],[64,57,theory(equality)])).
% cnf(137,negated_conjecture,(X1=esk4_0|in(esk1_2(X1,esk4_0),esk5_0)|in(esk1_2(X1,esk4_0),X1)),inference(csr,[status(thm)],[105,20])).
% cnf(138,negated_conjecture,(esk5_0=esk4_0|in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(ef,[status(thm)],[137,theory(equality)])).
% cnf(143,negated_conjecture,(in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(sr,[status(thm)],[138,38,theory(equality)])).
% cnf(146,negated_conjecture,(unordered_pair(singleton(esk8_1(esk1_2(esk5_0,esk4_0))),unordered_pair(esk8_1(esk1_2(esk5_0,esk4_0)),esk9_1(esk1_2(esk5_0,esk4_0))))=esk1_2(esk5_0,esk4_0)),inference(spm,[status(thm)],[59,143,theory(equality)])).
% cnf(162,negated_conjecture,(in(esk1_2(esk5_0,esk4_0),esk4_0)|~in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[69,146,theory(equality)])).
% cnf(164,negated_conjecture,(in(esk1_2(esk5_0,esk4_0),esk4_0)|$false),inference(rw,[status(thm)],[162,143,theory(equality)])).
% cnf(165,negated_conjecture,(in(esk1_2(esk5_0,esk4_0),esk4_0)),inference(cn,[status(thm)],[164,theory(equality)])).
% cnf(169,negated_conjecture,(esk5_0=esk4_0|~in(esk1_2(esk5_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[21,165,theory(equality)])).
% cnf(170,negated_conjecture,(esk5_0=esk4_0|$false),inference(rw,[status(thm)],[169,143,theory(equality)])).
% cnf(171,negated_conjecture,(esk5_0=esk4_0),inference(cn,[status(thm)],[170,theory(equality)])).
% cnf(172,negated_conjecture,($false),inference(sr,[status(thm)],[171,38,theory(equality)])).
% cnf(173,negated_conjecture,($false),172,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 64
% # ...of these trivial : 1
% # ...subsumed : 27
% # ...remaining for further processing: 36
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 112
% # ...of the previous two non-trivial : 107
% # Contextual simplify-reflections : 1
% # Paramodulations : 108
% # Factorizations : 4
% # Equation resolutions : 0
% # Current number of processed clauses: 36
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 9
% # Non-unit-clauses : 22
% # Current number of unprocessed clauses: 55
% # ...number of literals in the above : 155
% # Clause-clause subsumption calls (NU) : 106
% # Rec. Clause-clause subsumption calls : 97
% # Unit Clause-clause subsumption calls : 8
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 5
% # Indexed BW rewrite successes : 4
% # Backwards rewriting index: 60 leaves, 1.30+/-0.493 terms/leaf
% # Paramod-from index: 9 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 50 leaves, 1.30+/-0.458 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.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP11322/SET959+1.tptp
%
%------------------------------------------------------------------------------