TSTP Solution File: SET901+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET901+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 : art06.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:17:11 EST 2010
% Result : Theorem 0.88s
% Output : Solution 0.88s
% 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/SystemOnTPTP2636/SET901+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2636/SET901+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2636/SET901+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 2732
% 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(3, 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(7, conjecture,![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', t42_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,unordered_pair(X2,X3))<=>~((((~(X1=empty_set)&~(X1=singleton(X2)))&~(X1=singleton(X3)))&~(X1=unordered_pair(X2,X3)))))),inference(assume_negation,[status(cth)],[7])).
% fof(14, 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)],[3])).
% 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)&~(X4=singleton(X5)))&~(X4=singleton(X6)))&~(X4=unordered_pair(X5,X6)))|subset(X4,unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[14])).
% fof(16, 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)],[15])).
% cnf(17,plain,(subset(X1,unordered_pair(X2,X3))|X1!=unordered_pair(X2,X3)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(subset(X1,unordered_pair(X2,X3))|X1!=singleton(X3)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(subset(X1,unordered_pair(X2,X3))|X1!=singleton(X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(20,plain,(subset(X1,unordered_pair(X2,X3))|X1!=empty_set),inference(split_conjunct,[status(thm)],[16])).
% cnf(21,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)],[16])).
% fof(29, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(subset(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))|(((X1=empty_set|X1=singleton(X2))|X1=singleton(X3))|X1=unordered_pair(X2,X3)))),inference(fof_nnf,[status(thm)],[8])).
% fof(30, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(subset(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))|(((X4=empty_set|X4=singleton(X5))|X4=singleton(X6))|X4=unordered_pair(X5,X6)))),inference(variable_rename,[status(thm)],[29])).
% fof(31, negated_conjecture,((~(subset(esk3_0,unordered_pair(esk4_0,esk5_0)))|(((~(esk3_0=empty_set)&~(esk3_0=singleton(esk4_0)))&~(esk3_0=singleton(esk5_0)))&~(esk3_0=unordered_pair(esk4_0,esk5_0))))&(subset(esk3_0,unordered_pair(esk4_0,esk5_0))|(((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)],[30])).
% fof(32, negated_conjecture,(((((~(esk3_0=empty_set)|~(subset(esk3_0,unordered_pair(esk4_0,esk5_0))))&(~(esk3_0=singleton(esk4_0))|~(subset(esk3_0,unordered_pair(esk4_0,esk5_0)))))&(~(esk3_0=singleton(esk5_0))|~(subset(esk3_0,unordered_pair(esk4_0,esk5_0)))))&(~(esk3_0=unordered_pair(esk4_0,esk5_0))|~(subset(esk3_0,unordered_pair(esk4_0,esk5_0)))))&(subset(esk3_0,unordered_pair(esk4_0,esk5_0))|(((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)],[31])).
% cnf(33,negated_conjecture,(esk3_0=unordered_pair(esk4_0,esk5_0)|esk3_0=singleton(esk5_0)|esk3_0=singleton(esk4_0)|esk3_0=empty_set|subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,negated_conjecture,(~subset(esk3_0,unordered_pair(esk4_0,esk5_0))|esk3_0!=unordered_pair(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,negated_conjecture,(~subset(esk3_0,unordered_pair(esk4_0,esk5_0))|esk3_0!=singleton(esk5_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(36,negated_conjecture,(~subset(esk3_0,unordered_pair(esk4_0,esk5_0))|esk3_0!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[32])).
% cnf(37,negated_conjecture,(~subset(esk3_0,unordered_pair(esk4_0,esk5_0))|esk3_0!=empty_set),inference(split_conjunct,[status(thm)],[32])).
% cnf(42,negated_conjecture,(empty_set!=esk3_0),inference(spm,[status(thm)],[37,20,theory(equality)])).
% cnf(50,negated_conjecture,(singleton(esk5_0)!=esk3_0),inference(spm,[status(thm)],[35,18,theory(equality)])).
% cnf(55,negated_conjecture,(singleton(esk4_0)!=esk3_0),inference(spm,[status(thm)],[36,19,theory(equality)])).
% cnf(63,negated_conjecture,(unordered_pair(esk4_0,esk5_0)!=esk3_0),inference(spm,[status(thm)],[34,17,theory(equality)])).
% cnf(73,negated_conjecture,(unordered_pair(esk4_0,esk5_0)=esk3_0|singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(sr,[status(thm)],[33,42,theory(equality)])).
% cnf(74,negated_conjecture,(singleton(esk5_0)=esk3_0|singleton(esk4_0)=esk3_0|subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(sr,[status(thm)],[73,63,theory(equality)])).
% cnf(75,negated_conjecture,(singleton(esk4_0)=esk3_0|subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(sr,[status(thm)],[74,50,theory(equality)])).
% cnf(76,negated_conjecture,(subset(esk3_0,unordered_pair(esk4_0,esk5_0))),inference(sr,[status(thm)],[75,55,theory(equality)])).
% cnf(77,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)],[21,76,theory(equality)])).
% cnf(86,negated_conjecture,(singleton(esk4_0)=esk3_0|singleton(esk5_0)=esk3_0|empty_set=esk3_0),inference(sr,[status(thm)],[77,63,theory(equality)])).
% cnf(87,negated_conjecture,(singleton(esk5_0)=esk3_0|empty_set=esk3_0),inference(sr,[status(thm)],[86,55,theory(equality)])).
% cnf(88,negated_conjecture,(empty_set=esk3_0),inference(sr,[status(thm)],[87,50,theory(equality)])).
% cnf(89,negated_conjecture,($false),inference(sr,[status(thm)],[88,42,theory(equality)])).
% cnf(90,negated_conjecture,($false),89,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 0
% # ...subsumed : 13
% # ...remaining for further processing: 20
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 37
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 0
% # Paramodulations : 36
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 15
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 5
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 28
% # Clause-clause subsumption calls (NU) : 3
% # Rec. Clause-clause subsumption calls : 3
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 18 leaves, 1.28+/-0.650 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 16 leaves, 1.19+/-0.527 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.002 s
% # Total time : 0.013 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.09 CPU 0.17 WC
% FINAL PrfWatch: 0.09 CPU 0.17 WC
% SZS output end Solution for /tmp/SystemOnTPTP2636/SET901+1.tptp
%
%------------------------------------------------------------------------------