TSTP Solution File: SET931+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET931+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 : art07.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:17 EST 2010
% Result : Theorem 0.87s
% Output : Solution 0.87s
% 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/SystemOnTPTP2993/SET931+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2993/SET931+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2993/SET931+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 3089
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 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]:(subset(X1,unordered_pair(X2,X3))<=>~((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3))))),file('/tmp/SRASS.s.p', l46_zfmisc_1)).
% fof(3, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(8, conjecture,![X1]:![X2]:![X3]:(set_difference(X1,unordered_pair(X2,X3))=empty_set<=>~((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3))))),file('/tmp/SRASS.s.p', t75_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:(set_difference(X1,unordered_pair(X2,X3))=empty_set<=>~((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3)))))),inference(assume_negation,[status(cth)],[8])).
% fof(13, plain,![X1]:![X2]:![X3]:((~(subset(X1,unordered_pair(X2,X3)))|(((X1=empty_set|X1=singleton(X2))|X1=singleton(X3))|X1=unordered_pair(X2,X3)))&((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3)))|subset(X1,unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[2])).
% fof(14, plain,![X4]:![X5]:![X6]:((~(subset(X4,unordered_pair(X5,X6)))|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))&((((~(X4=empty_set)&~(X4=singleton(X5)))&~(X4=singleton(X6)))&~(X4=unordered_pair(X5,X6)))|subset(X4,unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[13])).
% fof(15, plain,![X4]:![X5]:![X6]:((~(subset(X4,unordered_pair(X5,X6)))|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))&((((~(X4=empty_set)|subset(X4,unordered_pair(X5,X6)))&(~(X4=singleton(X5))|subset(X4,unordered_pair(X5,X6))))&(~(X4=singleton(X6))|subset(X4,unordered_pair(X5,X6))))&(~(X4=unordered_pair(X5,X6))|subset(X4,unordered_pair(X5,X6))))),inference(distribute,[status(thm)],[14])).
% cnf(16,plain,(subset(X1,unordered_pair(X2,X3))|X1!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[15])).
% cnf(17,plain,(subset(X1,unordered_pair(X2,X3))|X1!=singleton(X3)),inference(split_conjunct,[status(thm)],[15])).
% cnf(18,plain,(subset(X1,unordered_pair(X2,X3))|X1!=singleton(X2)),inference(split_conjunct,[status(thm)],[15])).
% cnf(19,plain,(subset(X1,unordered_pair(X2,X3))|X1!=empty_set),inference(split_conjunct,[status(thm)],[15])).
% cnf(20,plain,(X1=unordered_pair(X2,X3)|X1=singleton(X3)|X1=singleton(X2)|X1=empty_set|~subset(X1,unordered_pair(X2,X3))),inference(split_conjunct,[status(thm)],[15])).
% fof(21, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[21])).
% cnf(23,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[22])).
% fof(34, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(set_difference(X1,unordered_pair(X2,X3))=empty_set)|(((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3))))&(set_difference(X1,unordered_pair(X2,X3))=empty_set|(((X1=empty_set|X1=singleton(X2))|X1=singleton(X3))|X1=unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[9])).
% fof(35, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(set_difference(X4,unordered_pair(X5,X6))=empty_set)|(((~(X4=empty_set)&~(X4=singleton(X5)))&~(X4=singleton(X6)))&~(X4=unordered_pair(X5,X6))))&(set_difference(X4,unordered_pair(X5,X6))=empty_set|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[34])).
% fof(36, negated_conjecture,((~(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set)|(((~(esk3_0=empty_set)&~(esk3_0=singleton(esk4_0)))&~(esk3_0=singleton(esk5_0)))&~(esk3_0=unordered_pair(esk4_0,esk5_0))))&(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|(((esk3_0=empty_set|esk3_0=singleton(esk4_0))|esk3_0=singleton(esk5_0))|esk3_0=unordered_pair(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[35])).
% fof(37, negated_conjecture,(((((~(esk3_0=empty_set)|~(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set))&(~(esk3_0=singleton(esk4_0))|~(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set)))&(~(esk3_0=singleton(esk5_0))|~(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set)))&(~(esk3_0=unordered_pair(esk4_0,esk5_0))|~(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set)))&(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|(((esk3_0=empty_set|esk3_0=singleton(esk4_0))|esk3_0=singleton(esk5_0))|esk3_0=unordered_pair(esk4_0,esk5_0)))),inference(distribute,[status(thm)],[36])).
% cnf(38,negated_conjecture,(esk3_0=unordered_pair(esk4_0,esk5_0)|esk3_0=singleton(esk5_0)|esk3_0=singleton(esk4_0)|esk3_0=empty_set|set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set),inference(split_conjunct,[status(thm)],[37])).
% cnf(39,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=unordered_pair(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(40,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=singleton(esk5_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(41,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[37])).
% cnf(42,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))!=empty_set|esk3_0!=empty_set),inference(split_conjunct,[status(thm)],[37])).
% cnf(47,negated_conjecture,(empty_set!=esk3_0|~subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[42,23,theory(equality)])).
% cnf(48,negated_conjecture,(singleton(esk4_0)!=esk3_0|~subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[41,23,theory(equality)])).
% cnf(49,negated_conjecture,(singleton(esk5_0)!=esk3_0|~subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[40,23,theory(equality)])).
% cnf(50,negated_conjecture,(unordered_pair(esk4_0,esk5_0)!=esk3_0|~subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[39,23,theory(equality)])).
% cnf(67,negated_conjecture,(empty_set!=esk3_0),inference(csr,[status(thm)],[47,19])).
% cnf(68,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0),inference(sr,[status(thm)],[38,67,theory(equality)])).
% cnf(74,negated_conjecture,(singleton(esk4_0)!=esk3_0),inference(csr,[status(thm)],[48,18])).
% cnf(75,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0),inference(sr,[status(thm)],[68,74,theory(equality)])).
% cnf(81,negated_conjecture,(singleton(esk5_0)!=esk3_0),inference(csr,[status(thm)],[49,17])).
% cnf(82,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set|unordered_pair(esk4_0,esk5_0)=esk3_0),inference(sr,[status(thm)],[75,81,theory(equality)])).
% cnf(88,negated_conjecture,(unordered_pair(esk4_0,esk5_0)!=esk3_0),inference(csr,[status(thm)],[50,16])).
% cnf(89,negated_conjecture,(set_difference(esk3_0,unordered_pair(esk4_0,esk5_0))=empty_set),inference(sr,[status(thm)],[82,88,theory(equality)])).
% cnf(90,negated_conjecture,(subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[24,89,theory(equality)])).
% cnf(99,negated_conjecture,(unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|singleton(esk5_0)=esk3_0|empty_set=esk3_0),inference(spm,[status(thm)],[20,90,theory(equality)])).
% cnf(100,negated_conjecture,(singleton(esk4_0)=esk3_0|singleton(esk5_0)=esk3_0|empty_set=esk3_0),inference(sr,[status(thm)],[99,88,theory(equality)])).
% cnf(101,negated_conjecture,(singleton(esk5_0)=esk3_0|empty_set=esk3_0),inference(sr,[status(thm)],[100,74,theory(equality)])).
% cnf(102,negated_conjecture,(empty_set=esk3_0),inference(sr,[status(thm)],[101,81,theory(equality)])).
% cnf(103,negated_conjecture,($false),inference(sr,[status(thm)],[102,67,theory(equality)])).
% cnf(104,negated_conjecture,($false),103,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 34
% # ...of these trivial : 0
% # ...subsumed : 8
% # ...remaining for further processing: 26
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 45
% # ...of the previous two non-trivial : 33
% # Contextual simplify-reflections : 4
% # Paramodulations : 41
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 18
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 7
% # Current number of unprocessed clauses: 10
% # ...number of literals in the above : 26
% # Clause-clause subsumption calls (NU) : 7
% # Rec. Clause-clause subsumption calls : 7
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 20 leaves, 1.30+/-0.640 terms/leaf
% # Paramod-from index: 8 leaves, 1.12+/-0.331 terms/leaf
% # Paramod-into index: 18 leaves, 1.17+/-0.500 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.003 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.16 WC
% FINAL PrfWatch: 0.09 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP2993/SET931+1.tptp
%
%------------------------------------------------------------------------------