TSTP Solution File: SET886+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET886+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 : art04.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:15:20 EST 2010
% Result : Theorem 0.86s
% Output : Solution 0.86s
% 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/SystemOnTPTP32595/SET886+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP32595/SET886+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP32595/SET886+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 32691
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.010 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(3, axiom,![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),singleton(X3))=>X1=X3),file('/tmp/SRASS.s.p', t26_zfmisc_1)).
% fof(4, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(7, conjecture,![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),singleton(X3))=>unordered_pair(X1,X2)=singleton(X3)),file('/tmp/SRASS.s.p', t27_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),singleton(X3))=>unordered_pair(X1,X2)=singleton(X3))),inference(assume_negation,[status(cth)],[7])).
% fof(10, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(11,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[10])).
% fof(14, plain,![X1]:![X2]:![X3]:(~(subset(unordered_pair(X1,X2),singleton(X3)))|X1=X3),inference(fof_nnf,[status(thm)],[3])).
% fof(15, plain,![X4]:![X5]:![X6]:(~(subset(unordered_pair(X4,X5),singleton(X6)))|X4=X6),inference(variable_rename,[status(thm)],[14])).
% cnf(16,plain,(X1=X2|~subset(unordered_pair(X1,X3),singleton(X2))),inference(split_conjunct,[status(thm)],[15])).
% fof(17, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[4])).
% cnf(18,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(25, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(unordered_pair(X1,X2),singleton(X3))&~(unordered_pair(X1,X2)=singleton(X3))),inference(fof_nnf,[status(thm)],[8])).
% fof(26, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(unordered_pair(X4,X5),singleton(X6))&~(unordered_pair(X4,X5)=singleton(X6))),inference(variable_rename,[status(thm)],[25])).
% fof(27, negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),singleton(esk5_0))&~(unordered_pair(esk3_0,esk4_0)=singleton(esk5_0))),inference(skolemize,[status(esa)],[26])).
% cnf(28,negated_conjecture,(unordered_pair(esk3_0,esk4_0)!=singleton(esk5_0)),inference(split_conjunct,[status(thm)],[27])).
% cnf(29,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),singleton(esk5_0))),inference(split_conjunct,[status(thm)],[27])).
% cnf(30,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),unordered_pair(esk5_0,esk5_0))),inference(rw,[status(thm)],[29,18,theory(equality)]),['unfolding']).
% cnf(31,plain,(X1=X2|~subset(unordered_pair(X1,X3),unordered_pair(X2,X2))),inference(rw,[status(thm)],[16,18,theory(equality)]),['unfolding']).
% cnf(32,negated_conjecture,(unordered_pair(esk3_0,esk4_0)!=unordered_pair(esk5_0,esk5_0)),inference(rw,[status(thm)],[28,18,theory(equality)]),['unfolding']).
% cnf(39,plain,(X1=X2|~subset(unordered_pair(X3,X1),unordered_pair(X2,X2))),inference(spm,[status(thm)],[31,11,theory(equality)])).
% cnf(41,negated_conjecture,(esk3_0=esk5_0),inference(spm,[status(thm)],[31,30,theory(equality)])).
% cnf(42,negated_conjecture,(subset(unordered_pair(esk5_0,esk4_0),unordered_pair(esk5_0,esk5_0))),inference(rw,[status(thm)],[30,41,theory(equality)])).
% cnf(43,negated_conjecture,(unordered_pair(esk5_0,esk4_0)!=unordered_pair(esk5_0,esk5_0)),inference(rw,[status(thm)],[32,41,theory(equality)])).
% cnf(52,negated_conjecture,(esk4_0=esk5_0),inference(spm,[status(thm)],[39,42,theory(equality)])).
% cnf(54,negated_conjecture,($false),inference(rw,[status(thm)],[43,52,theory(equality)])).
% cnf(55,negated_conjecture,($false),inference(cn,[status(thm)],[54,theory(equality)])).
% cnf(56,negated_conjecture,($false),55,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 21
% # ...of these trivial : 0
% # ...subsumed : 2
% # ...remaining for further processing: 19
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 4
% # Generated clauses : 14
% # ...of the previous two non-trivial : 12
% # Contextual simplify-reflections : 0
% # Paramodulations : 14
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 8
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 1
% # Non-unit-clauses : 2
% # Current number of unprocessed clauses: 5
% # ...number of literals in the above : 10
% # Clause-clause subsumption calls (NU) : 4
% # Rec. Clause-clause subsumption calls : 4
% # Unit Clause-clause subsumption calls : 0
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 10
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 11 leaves, 1.45+/-1.157 terms/leaf
% # Paramod-from index: 5 leaves, 1.20+/-0.400 terms/leaf
% # Paramod-into index: 9 leaves, 1.56+/-1.257 terms/leaf
% # -------------------------------------------------
% # User time : 0.010 s
% # System time : 0.002 s
% # Total time : 0.012 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/SystemOnTPTP32595/SET886+1.tptp
%
%------------------------------------------------------------------------------