TSTP Solution File: SET930+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET930+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 : 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:20:11 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/SystemOnTPTP8732/SET930+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP8732/SET930+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP8732/SET930+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 8828
% 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(1, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(2, axiom,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)<=>(~(in(X1,X3))&(in(X2,X3)|X1=X2))),file('/tmp/SRASS.s.p', l39_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=empty_set<=>(in(X1,X3)&in(X2,X3))),file('/tmp/SRASS.s.p', t73_zfmisc_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)<=>(~(in(X1,X3))&~(in(X2,X3)))),file('/tmp/SRASS.s.p', t72_zfmisc_1)).
% fof(6, axiom,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),file('/tmp/SRASS.s.p', antisymmetry_r2_hidden)).
% fof(9, conjecture,![X1]:![X2]:![X3]:~((((~(set_difference(unordered_pair(X1,X2),X3)=empty_set)&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)))&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X2)))&~(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)))),file('/tmp/SRASS.s.p', t74_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:~((((~(set_difference(unordered_pair(X1,X2),X3)=empty_set)&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)))&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X2)))&~(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2))))),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)<=>(~(in(X1,X3))&(in(X2,X3)|X1=X2))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)<=>(~(in(X1,X3))&~(in(X2,X3)))),inference(fof_simplification,[status(thm)],[4,theory(equality)])).
% fof(13, plain,![X1]:![X2]:(in(X1,X2)=>~(in(X2,X1))),inference(fof_simplification,[status(thm)],[6,theory(equality)])).
% fof(15, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(16,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X1]:![X2]:![X3]:((~(set_difference(unordered_pair(X1,X2),X3)=singleton(X1))|(~(in(X1,X3))&(in(X2,X3)|X1=X2)))&((in(X1,X3)|(~(in(X2,X3))&~(X1=X2)))|set_difference(unordered_pair(X1,X2),X3)=singleton(X1))),inference(fof_nnf,[status(thm)],[11])).
% fof(18, plain,![X4]:![X5]:![X6]:((~(set_difference(unordered_pair(X4,X5),X6)=singleton(X4))|(~(in(X4,X6))&(in(X5,X6)|X4=X5)))&((in(X4,X6)|(~(in(X5,X6))&~(X4=X5)))|set_difference(unordered_pair(X4,X5),X6)=singleton(X4))),inference(variable_rename,[status(thm)],[17])).
% fof(19, plain,![X4]:![X5]:![X6]:(((~(in(X4,X6))|~(set_difference(unordered_pair(X4,X5),X6)=singleton(X4)))&((in(X5,X6)|X4=X5)|~(set_difference(unordered_pair(X4,X5),X6)=singleton(X4))))&(((~(in(X5,X6))|in(X4,X6))|set_difference(unordered_pair(X4,X5),X6)=singleton(X4))&((~(X4=X5)|in(X4,X6))|set_difference(unordered_pair(X4,X5),X6)=singleton(X4)))),inference(distribute,[status(thm)],[18])).
% cnf(20,plain,(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)|in(X1,X3)|X1!=X2),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)|in(X1,X3)|~in(X2,X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(24, plain,![X1]:![X2]:![X3]:((~(set_difference(unordered_pair(X1,X2),X3)=empty_set)|(in(X1,X3)&in(X2,X3)))&((~(in(X1,X3))|~(in(X2,X3)))|set_difference(unordered_pair(X1,X2),X3)=empty_set)),inference(fof_nnf,[status(thm)],[3])).
% fof(25, plain,![X4]:![X5]:![X6]:((~(set_difference(unordered_pair(X4,X5),X6)=empty_set)|(in(X4,X6)&in(X5,X6)))&((~(in(X4,X6))|~(in(X5,X6)))|set_difference(unordered_pair(X4,X5),X6)=empty_set)),inference(variable_rename,[status(thm)],[24])).
% fof(26, plain,![X4]:![X5]:![X6]:(((in(X4,X6)|~(set_difference(unordered_pair(X4,X5),X6)=empty_set))&(in(X5,X6)|~(set_difference(unordered_pair(X4,X5),X6)=empty_set)))&((~(in(X4,X6))|~(in(X5,X6)))|set_difference(unordered_pair(X4,X5),X6)=empty_set)),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(set_difference(unordered_pair(X1,X2),X3)=empty_set|~in(X2,X3)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[26])).
% fof(30, plain,![X1]:![X2]:![X3]:((~(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2))|(~(in(X1,X3))&~(in(X2,X3))))&((in(X1,X3)|in(X2,X3))|set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[12])).
% fof(31, plain,![X4]:![X5]:![X6]:((~(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))|(~(in(X4,X6))&~(in(X5,X6))))&((in(X4,X6)|in(X5,X6))|set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))),inference(variable_rename,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(in(X4,X6))|~(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5)))&(~(in(X5,X6))|~(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))))&((in(X4,X6)|in(X5,X6))|set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)|in(X2,X3)|in(X1,X3)),inference(split_conjunct,[status(thm)],[32])).
% fof(37, plain,![X1]:![X2]:(~(in(X1,X2))|~(in(X2,X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(38, plain,![X3]:![X4]:(~(in(X3,X4))|~(in(X4,X3))),inference(variable_rename,[status(thm)],[37])).
% cnf(39,plain,(~in(X1,X2)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[38])).
% fof(46, negated_conjecture,?[X1]:?[X2]:?[X3]:(((~(set_difference(unordered_pair(X1,X2),X3)=empty_set)&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)))&~(set_difference(unordered_pair(X1,X2),X3)=singleton(X2)))&~(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[10])).
% fof(47, negated_conjecture,?[X4]:?[X5]:?[X6]:(((~(set_difference(unordered_pair(X4,X5),X6)=empty_set)&~(set_difference(unordered_pair(X4,X5),X6)=singleton(X4)))&~(set_difference(unordered_pair(X4,X5),X6)=singleton(X5)))&~(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))),inference(variable_rename,[status(thm)],[46])).
% fof(48, negated_conjecture,(((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set)&~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)))&~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk4_0)))&~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0))),inference(skolemize,[status(esa)],[47])).
% cnf(49,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=unordered_pair(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=singleton(esk3_0)),inference(split_conjunct,[status(thm)],[48])).
% cnf(52,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set),inference(split_conjunct,[status(thm)],[48])).
% cnf(53,plain,(set_difference(unordered_pair(X1,X1),X2)=singleton(X1)|in(X1,X2)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(67,negated_conjecture,(~in(esk4_0,esk5_0)|~in(esk3_0,esk5_0)),inference(spm,[status(thm)],[52,27,theory(equality)])).
% cnf(87,negated_conjecture,(in(esk3_0,esk5_0)|~in(esk4_0,esk5_0)),inference(spm,[status(thm)],[51,21,theory(equality)])).
% cnf(97,plain,(set_difference(unordered_pair(X2,X1),X3)=singleton(X1)|in(X1,X3)|~in(X2,X3)),inference(spm,[status(thm)],[21,16,theory(equality)])).
% cnf(102,negated_conjecture,(in(esk4_0,esk5_0)|in(esk3_0,esk5_0)),inference(spm,[status(thm)],[49,33,theory(equality)])).
% cnf(111,plain,(unordered_pair(X1,X1)=singleton(X1)|in(X1,X2)),inference(spm,[status(thm)],[53,33,theory(equality)])).
% cnf(117,negated_conjecture,(in(esk3_0,esk5_0)),inference(csr,[status(thm)],[87,102])).
% cnf(120,negated_conjecture,(~in(esk4_0,esk5_0)|$false),inference(rw,[status(thm)],[67,117,theory(equality)])).
% cnf(121,negated_conjecture,(~in(esk4_0,esk5_0)),inference(cn,[status(thm)],[120,theory(equality)])).
% cnf(125,plain,(unordered_pair(X1,X1)=singleton(X1)|~in(X2,X1)),inference(spm,[status(thm)],[39,111,theory(equality)])).
% cnf(140,plain,(unordered_pair(X1,X1)=singleton(X1)|unordered_pair(X2,X2)=singleton(X2)),inference(spm,[status(thm)],[125,111,theory(equality)])).
% cnf(147,plain,(unordered_pair(X3,X3)=singleton(X3)),inference(ef,[status(thm)],[140,theory(equality)])).
% cnf(188,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=unordered_pair(esk4_0,esk4_0)),inference(rw,[status(thm)],[50,147,theory(equality)])).
% cnf(272,negated_conjecture,(in(esk4_0,esk5_0)|singleton(esk4_0)!=unordered_pair(esk4_0,esk4_0)|~in(esk3_0,esk5_0)),inference(spm,[status(thm)],[188,97,theory(equality)])).
% cnf(298,negated_conjecture,(in(esk4_0,esk5_0)|$false|~in(esk3_0,esk5_0)),inference(rw,[status(thm)],[272,147,theory(equality)])).
% cnf(299,negated_conjecture,(in(esk4_0,esk5_0)|$false|$false),inference(rw,[status(thm)],[298,117,theory(equality)])).
% cnf(300,negated_conjecture,(in(esk4_0,esk5_0)),inference(cn,[status(thm)],[299,theory(equality)])).
% cnf(301,negated_conjecture,($false),inference(sr,[status(thm)],[300,121,theory(equality)])).
% cnf(302,negated_conjecture,($false),301,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 131
% # ...of these trivial : 3
% # ...subsumed : 61
% # ...remaining for further processing: 67
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 5
% # Generated clauses : 204
% # ...of the previous two non-trivial : 145
% # Contextual simplify-reflections : 9
% # Paramodulations : 199
% # Factorizations : 4
% # Equation resolutions : 1
% # Current number of processed clauses: 38
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 10
% # Non-unit-clauses : 23
% # Current number of unprocessed clauses: 12
% # ...number of literals in the above : 35
% # Clause-clause subsumption calls (NU) : 130
% # Rec. Clause-clause subsumption calls : 121
% # Unit Clause-clause subsumption calls : 24
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 18
% # Indexed BW rewrite successes : 13
% # Backwards rewriting index: 24 leaves, 1.50+/-1.225 terms/leaf
% # Paramod-from index: 8 leaves, 1.38+/-0.696 terms/leaf
% # Paramod-into index: 21 leaves, 1.38+/-1.174 terms/leaf
% # -------------------------------------------------
% # User time : 0.017 s
% # System time : 0.004 s
% # Total time : 0.021 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP8732/SET930+1.tptp
%
%------------------------------------------------------------------------------