TSTP Solution File: SET929+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET929+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 : art02.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:05 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/SystemOnTPTP4496/SET929+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP4496/SET929+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP4496/SET929+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 4592
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.010 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', t37_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3))),file('/tmp/SRASS.s.p', t38_zfmisc_1)).
% fof(9, conjecture,![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(10, negated_conjecture,~(![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=empty_set<=>(in(X1,X3)&in(X2,X3)))),inference(assume_negation,[status(cth)],[9])).
% fof(18, 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(19, 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)],[18])).
% cnf(20,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[19])).
% fof(22, plain,![X1]:![X2]:![X3]:((~(subset(unordered_pair(X1,X2),X3))|(in(X1,X3)&in(X2,X3)))&((~(in(X1,X3))|~(in(X2,X3)))|subset(unordered_pair(X1,X2),X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(23, plain,![X4]:![X5]:![X6]:((~(subset(unordered_pair(X4,X5),X6))|(in(X4,X6)&in(X5,X6)))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:(((in(X4,X6)|~(subset(unordered_pair(X4,X5),X6)))&(in(X5,X6)|~(subset(unordered_pair(X4,X5),X6))))&((~(in(X4,X6))|~(in(X5,X6)))|subset(unordered_pair(X4,X5),X6))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(in(X2,X3)|~subset(unordered_pair(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(in(X1,X3)|~subset(unordered_pair(X1,X2),X3)),inference(split_conjunct,[status(thm)],[24])).
% fof(37, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(set_difference(unordered_pair(X1,X2),X3)=empty_set)|(~(in(X1,X3))|~(in(X2,X3))))&(set_difference(unordered_pair(X1,X2),X3)=empty_set|(in(X1,X3)&in(X2,X3)))),inference(fof_nnf,[status(thm)],[10])).
% fof(38, negated_conjecture,?[X4]:?[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|(in(X4,X6)&in(X5,X6)))),inference(variable_rename,[status(thm)],[37])).
% fof(39, negated_conjecture,((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set)|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk5_0))))&(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|(in(esk3_0,esk5_0)&in(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[38])).
% fof(40, negated_conjecture,((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set)|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk5_0))))&((in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set)&(in(esk4_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set))),inference(distribute,[status(thm)],[39])).
% cnf(41,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=empty_set|in(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(~in(esk4_0,esk5_0)|~in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=empty_set),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),esk5_0)|in(esk3_0,esk5_0)),inference(spm,[status(thm)],[21,42,theory(equality)])).
% cnf(45,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),esk5_0)|in(esk4_0,esk5_0)),inference(spm,[status(thm)],[21,41,theory(equality)])).
% cnf(53,negated_conjecture,(~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0)|~subset(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[43,20,theory(equality)])).
% cnf(60,negated_conjecture,(~in(esk3_0,esk5_0)|~in(esk4_0,esk5_0)),inference(csr,[status(thm)],[53,25])).
% cnf(71,negated_conjecture,(in(esk3_0,esk5_0)),inference(csr,[status(thm)],[44,27])).
% cnf(73,negated_conjecture,($false|~in(esk4_0,esk5_0)),inference(rw,[status(thm)],[60,71,theory(equality)])).
% cnf(74,negated_conjecture,(~in(esk4_0,esk5_0)),inference(cn,[status(thm)],[73,theory(equality)])).
% cnf(76,negated_conjecture,(in(esk4_0,esk5_0)),inference(csr,[status(thm)],[45,26])).
% cnf(79,negated_conjecture,($false),inference(rw,[status(thm)],[74,76,theory(equality)])).
% cnf(80,negated_conjecture,($false),inference(cn,[status(thm)],[79,theory(equality)])).
% cnf(81,negated_conjecture,($false),80,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 35
% # ...of these trivial : 0
% # ...subsumed : 0
% # ...remaining for further processing: 35
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 1
% # Backward-rewritten : 3
% # Generated clauses : 26
% # ...of the previous two non-trivial : 20
% # Contextual simplify-reflections : 3
% # Paramodulations : 26
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 16
% # Positive orientable unit clauses: 7
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 6
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 21
% # Clause-clause subsumption calls (NU) : 19
% # Rec. Clause-clause subsumption calls : 19
% # Unit Clause-clause subsumption calls : 5
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 19 leaves, 1.53+/-0.993 terms/leaf
% # Paramod-from index: 9 leaves, 1.22+/-0.416 terms/leaf
% # Paramod-into index: 18 leaves, 1.33+/-0.816 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.003 s
% # Total time : 0.012 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.16 WC
% FINAL PrfWatch: 0.10 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP4496/SET929+1.tptp
%
%------------------------------------------------------------------------------