TSTP Solution File: SET927+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET927+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 : art01.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:19:53 EST 2010
% Result : Theorem 1.05s
% Output : Solution 1.05s
% 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/SystemOnTPTP1019/SET927+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP1019/SET927+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP1019/SET927+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 1115
% 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(3, 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(6, conjecture,![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', t70_zfmisc_1)).
% fof(7, negated_conjecture,~(![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)<=>(~(in(X1,X3))&(in(X2,X3)|X1=X2)))),inference(assume_negation,[status(cth)],[6])).
% fof(9, 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)],[3,theory(equality)])).
% fof(11, negated_conjecture,~(![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)],[7,theory(equality)])).
% 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)],[9])).
% 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])).
% cnf(22,plain,(X1=X2|in(X2,X3)|set_difference(unordered_pair(X1,X2),X3)!=singleton(X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(23,plain,(set_difference(unordered_pair(X1,X2),X3)!=singleton(X1)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[19])).
% fof(30, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(set_difference(unordered_pair(X1,X2),X3)=singleton(X1))|(in(X1,X3)|(~(in(X2,X3))&~(X1=X2))))&(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)|(~(in(X1,X3))&(in(X2,X3)|X1=X2)))),inference(fof_nnf,[status(thm)],[11])).
% fof(31, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(set_difference(unordered_pair(X4,X5),X6)=singleton(X4))|(in(X4,X6)|(~(in(X5,X6))&~(X4=X5))))&(set_difference(unordered_pair(X4,X5),X6)=singleton(X4)|(~(in(X4,X6))&(in(X5,X6)|X4=X5)))),inference(variable_rename,[status(thm)],[30])).
% fof(32, negated_conjecture,((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0))|(in(esk3_0,esk5_0)|(~(in(esk4_0,esk5_0))&~(esk3_0=esk4_0))))&(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)|(~(in(esk3_0,esk5_0))&(in(esk4_0,esk5_0)|esk3_0=esk4_0)))),inference(skolemize,[status(esa)],[31])).
% fof(33, negated_conjecture,((((~(in(esk4_0,esk5_0))|in(esk3_0,esk5_0))|~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)))&((~(esk3_0=esk4_0)|in(esk3_0,esk5_0))|~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0))))&((~(in(esk3_0,esk5_0))|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0))&((in(esk4_0,esk5_0)|esk3_0=esk4_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)))),inference(distribute,[status(thm)],[32])).
% cnf(34,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)|esk3_0=esk4_0|in(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)|~in(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(36,negated_conjecture,(in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=singleton(esk3_0)|esk3_0!=esk4_0),inference(split_conjunct,[status(thm)],[33])).
% cnf(37,negated_conjecture,(in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=singleton(esk3_0)|~in(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[33])).
% cnf(38,plain,(set_difference(unordered_pair(X1,X1),X2)=singleton(X1)|in(X1,X2)),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(44,negated_conjecture,(~in(esk3_0,esk5_0)),inference(spm,[status(thm)],[23,35,theory(equality)])).
% cnf(45,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=singleton(esk3_0)|~in(esk4_0,esk5_0)),inference(csr,[status(thm)],[37,23])).
% cnf(56,negated_conjecture,(in(esk3_0,esk5_0)|~in(esk4_0,esk5_0)),inference(spm,[status(thm)],[45,21,theory(equality)])).
% cnf(67,negated_conjecture,(~in(esk4_0,esk5_0)),inference(sr,[status(thm)],[56,44,theory(equality)])).
% cnf(68,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=singleton(esk3_0)|esk4_0=esk3_0),inference(sr,[status(thm)],[34,67,theory(equality)])).
% cnf(69,negated_conjecture,(esk3_0=esk4_0|in(esk4_0,esk5_0)),inference(spm,[status(thm)],[22,68,theory(equality)])).
% cnf(74,negated_conjecture,(esk4_0=esk3_0),inference(sr,[status(thm)],[69,67,theory(equality)])).
% cnf(78,negated_conjecture,(in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)!=singleton(esk3_0)|esk4_0!=esk3_0),inference(rw,[status(thm)],[36,74,theory(equality)])).
% cnf(79,negated_conjecture,(in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)!=singleton(esk3_0)|$false),inference(rw,[status(thm)],[78,74,theory(equality)])).
% cnf(80,negated_conjecture,(in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)!=singleton(esk3_0)),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)!=singleton(esk3_0)),inference(sr,[status(thm)],[80,44,theory(equality)])).
% cnf(82,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)=singleton(esk3_0)|~in(esk3_0,esk5_0)),inference(rw,[status(thm)],[35,74,theory(equality)])).
% cnf(85,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk3_0),esk5_0)=singleton(esk3_0)),inference(csr,[status(thm)],[82,38])).
% cnf(94,negated_conjecture,($false),inference(rw,[status(thm)],[81,85,theory(equality)])).
% cnf(95,negated_conjecture,($false),inference(cn,[status(thm)],[94,theory(equality)])).
% cnf(96,negated_conjecture,($false),95,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 39
% # ...of these trivial : 0
% # ...subsumed : 7
% # ...remaining for further processing: 32
% # Other redundant clauses eliminated : 1
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 5
% # Generated clauses : 38
% # ...of the previous two non-trivial : 31
% # Contextual simplify-reflections : 2
% # Paramodulations : 36
% # Factorizations : 0
% # Equation resolutions : 1
% # Current number of processed clauses: 12
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 8
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 23
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 3
% # Backwards rewriting index: 16 leaves, 1.44+/-0.864 terms/leaf
% # Paramod-from index: 5 leaves, 1.40+/-0.490 terms/leaf
% # Paramod-into index: 13 leaves, 1.23+/-0.576 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.004 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.12 CPU 0.18 WC
% FINAL PrfWatch: 0.12 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP1019/SET927+1.tptp
%
%------------------------------------------------------------------------------