TSTP Solution File: SET975+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET975+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 : 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:05 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/SystemOnTPTP6901/SET975+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP6901/SET975+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP6901/SET975+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 6999
% 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(2, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(3, 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(4, axiom,![X1]:![X2]:ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1)),file('/tmp/SRASS.s.p', d5_tarski)).
% fof(9, conjecture,![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))<=>(X1=X3&in(X2,X4))),file('/tmp/SRASS.s.p', t128_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:![X4]:(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))<=>(X1=X3&in(X2,X4)))),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)],[2])).
% 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])).
% cnf(25,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[21])).
% fof(26, 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)],[3])).
% fof(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(in(ordered_pair(X1,X2),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(in(X2,X4)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(in(X1,X3)|~in(ordered_pair(X1,X2),cartesian_product2(X3,X4))),inference(split_conjunct,[status(thm)],[28])).
% fof(32, plain,![X3]:![X4]:ordered_pair(X3,X4)=unordered_pair(unordered_pair(X3,X4),singleton(X3)),inference(variable_rename,[status(thm)],[4])).
% cnf(33,plain,(ordered_pair(X1,X2)=unordered_pair(unordered_pair(X1,X2),singleton(X1))),inference(split_conjunct,[status(thm)],[32])).
% fof(44, negated_conjecture,?[X1]:?[X2]:?[X3]:?[X4]:((~(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4)))|(~(X1=X3)|~(in(X2,X4))))&(in(ordered_pair(X1,X2),cartesian_product2(singleton(X3),X4))|(X1=X3&in(X2,X4)))),inference(fof_nnf,[status(thm)],[10])).
% fof(45, negated_conjecture,?[X5]:?[X6]:?[X7]:?[X8]:((~(in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8)))|(~(X5=X7)|~(in(X6,X8))))&(in(ordered_pair(X5,X6),cartesian_product2(singleton(X7),X8))|(X5=X7&in(X6,X8)))),inference(variable_rename,[status(thm)],[44])).
% fof(46, negated_conjecture,((~(in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0)))|(~(esk4_0=esk6_0)|~(in(esk5_0,esk7_0))))&(in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0))|(esk4_0=esk6_0&in(esk5_0,esk7_0)))),inference(skolemize,[status(esa)],[45])).
% fof(47, negated_conjecture,((~(in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0)))|(~(esk4_0=esk6_0)|~(in(esk5_0,esk7_0))))&((esk4_0=esk6_0|in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0)))&(in(esk5_0,esk7_0)|in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0))))),inference(distribute,[status(thm)],[46])).
% cnf(48,negated_conjecture,(in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0))|in(esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,negated_conjecture,(in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0))|esk4_0=esk6_0),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,negated_conjecture,(~in(esk5_0,esk7_0)|esk4_0!=esk6_0|~in(ordered_pair(esk4_0,esk5_0),cartesian_product2(singleton(esk6_0),esk7_0))),inference(split_conjunct,[status(thm)],[47])).
% cnf(51,negated_conjecture,(esk6_0=esk4_0|in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),esk7_0))),inference(rw,[status(thm)],[49,33,theory(equality)]),['unfolding']).
% cnf(52,negated_conjecture,(in(esk5_0,esk7_0)|in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),esk7_0))),inference(rw,[status(thm)],[48,33,theory(equality)]),['unfolding']).
% cnf(53,plain,(in(X2,X4)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[30,33,theory(equality)]),['unfolding']).
% cnf(54,plain,(in(X1,X3)|~in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))),inference(rw,[status(thm)],[31,33,theory(equality)]),['unfolding']).
% cnf(55,plain,(in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),cartesian_product2(X3,X4))|~in(X2,X4)|~in(X1,X3)),inference(rw,[status(thm)],[29,33,theory(equality)]),['unfolding']).
% cnf(57,negated_conjecture,(esk6_0!=esk4_0|~in(esk5_0,esk7_0)|~in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),esk7_0))),inference(rw,[status(thm)],[50,33,theory(equality)]),['unfolding']).
% cnf(58,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[24,theory(equality)])).
% cnf(59,negated_conjecture,(esk6_0!=esk4_0|~in(unordered_pair(unordered_pair(esk4_0,esk5_0),singleton(esk4_0)),cartesian_product2(singleton(esk6_0),esk7_0))),inference(csr,[status(thm)],[57,53])).
% cnf(64,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[58,theory(equality)])).
% cnf(74,negated_conjecture,(in(esk5_0,esk7_0)),inference(spm,[status(thm)],[53,52,theory(equality)])).
% cnf(84,negated_conjecture,(in(esk4_0,singleton(esk6_0))|esk6_0=esk4_0),inference(spm,[status(thm)],[54,51,theory(equality)])).
% cnf(88,negated_conjecture,(esk6_0!=esk4_0|~in(esk5_0,esk7_0)|~in(esk4_0,singleton(esk6_0))),inference(spm,[status(thm)],[59,55,theory(equality)])).
% cnf(100,negated_conjecture,(X1=esk4_0|esk6_0=esk4_0|singleton(X1)!=singleton(esk6_0)),inference(spm,[status(thm)],[25,84,theory(equality)])).
% cnf(105,negated_conjecture,(esk6_0!=esk4_0|$false|~in(esk4_0,singleton(esk6_0))),inference(rw,[status(thm)],[88,74,theory(equality)])).
% cnf(106,negated_conjecture,(esk6_0!=esk4_0|~in(esk4_0,singleton(esk6_0))),inference(cn,[status(thm)],[105,theory(equality)])).
% cnf(114,negated_conjecture,(esk6_0=esk4_0),inference(er,[status(thm)],[100,theory(equality)])).
% cnf(115,negated_conjecture,($false|~in(esk4_0,singleton(esk6_0))),inference(rw,[status(thm)],[106,114,theory(equality)])).
% cnf(116,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[115,114,theory(equality)]),64,theory(equality)])).
% cnf(117,negated_conjecture,($false),inference(cn,[status(thm)],[116,theory(equality)])).
% cnf(118,negated_conjecture,($false),117,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 44
% # ...of these trivial : 1
% # ...subsumed : 1
% # ...remaining for further processing: 42
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 7
% # Generated clauses : 52
% # ...of the previous two non-trivial : 47
% # Contextual simplify-reflections : 1
% # Paramodulations : 49
% # Factorizations : 0
% # Equation resolutions : 3
% # Current number of processed clauses: 19
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 9
% # Current number of unprocessed clauses: 27
% # ...number of literals in the above : 54
% # Clause-clause subsumption calls (NU) : 25
% # Rec. Clause-clause subsumption calls : 25
% # Unit Clause-clause subsumption calls : 9
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 23 leaves, 1.74+/-1.224 terms/leaf
% # Paramod-from index: 7 leaves, 1.14+/-0.350 terms/leaf
% # Paramod-into index: 21 leaves, 1.67+/-1.039 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.006 s
% # Total time : 0.016 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.18 WC
% FINAL PrfWatch: 0.09 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP6901/SET975+1.tptp
%
%------------------------------------------------------------------------------