TSTP Solution File: SET928+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET928+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:19:59 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/SystemOnTPTP2734/SET928+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP2734/SET928+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP2734/SET928+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 2830
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% # Preprocessing time : 0.012 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(3, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(4, axiom,![X1]:![X2]:![X3]:~((disjoint(unordered_pair(X1,X2),X3)&in(X1,X3))),file('/tmp/SRASS.s.p', t55_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:![X3]:~(((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2)))),file('/tmp/SRASS.s.p', t57_zfmisc_1)).
% fof(9, conjecture,![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)<=>(~(in(X1,X3))&~(in(X2,X3)))),file('/tmp/SRASS.s.p', t72_zfmisc_1)).
% fof(10, negated_conjecture,~(![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)<=>(~(in(X1,X3))&~(in(X2,X3))))),inference(assume_negation,[status(cth)],[9])).
% fof(12, plain,![X1]:![X2]:![X3]:~(((~(in(X1,X2))&~(in(X3,X2)))&~(disjoint(unordered_pair(X1,X3),X2)))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(14, negated_conjecture,~(![X1]:![X2]:![X3]:(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)<=>(~(in(X1,X3))&~(in(X2,X3))))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(18, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(19,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[18])).
% fof(20, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(21, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[20])).
% cnf(22,plain,(disjoint(X1,X2)|set_difference(X1,X2)!=X1),inference(split_conjunct,[status(thm)],[21])).
% cnf(23,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[21])).
% fof(24, plain,![X1]:![X2]:![X3]:(~(disjoint(unordered_pair(X1,X2),X3))|~(in(X1,X3))),inference(fof_nnf,[status(thm)],[4])).
% fof(25, plain,![X4]:![X5]:![X6]:(~(disjoint(unordered_pair(X4,X5),X6))|~(in(X4,X6))),inference(variable_rename,[status(thm)],[24])).
% cnf(26,plain,(~in(X1,X2)|~disjoint(unordered_pair(X1,X3),X2)),inference(split_conjunct,[status(thm)],[25])).
% fof(27, plain,![X1]:![X2]:![X3]:((in(X1,X2)|in(X3,X2))|disjoint(unordered_pair(X1,X3),X2)),inference(fof_nnf,[status(thm)],[12])).
% fof(28, plain,![X4]:![X5]:![X6]:((in(X4,X5)|in(X6,X5))|disjoint(unordered_pair(X4,X6),X5)),inference(variable_rename,[status(thm)],[27])).
% cnf(29,plain,(disjoint(unordered_pair(X1,X2),X3)|in(X2,X3)|in(X1,X3)),inference(split_conjunct,[status(thm)],[28])).
% fof(39, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2))|(in(X1,X3)|in(X2,X3)))&(set_difference(unordered_pair(X1,X2),X3)=unordered_pair(X1,X2)|(~(in(X1,X3))&~(in(X2,X3))))),inference(fof_nnf,[status(thm)],[14])).
% fof(40, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5))|(in(X4,X6)|in(X5,X6)))&(set_difference(unordered_pair(X4,X5),X6)=unordered_pair(X4,X5)|(~(in(X4,X6))&~(in(X5,X6))))),inference(variable_rename,[status(thm)],[39])).
% fof(41, negated_conjecture,((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0))|(in(esk3_0,esk5_0)|in(esk4_0,esk5_0)))&(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0)|(~(in(esk3_0,esk5_0))&~(in(esk4_0,esk5_0))))),inference(skolemize,[status(esa)],[40])).
% fof(42, negated_conjecture,((~(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0))|(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)=unordered_pair(esk3_0,esk4_0))&(~(in(esk4_0,esk5_0))|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0)))),inference(distribute,[status(thm)],[41])).
% cnf(43,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0)|~in(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,negated_conjecture,(set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)=unordered_pair(esk3_0,esk4_0)|~in(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(45,negated_conjecture,(in(esk4_0,esk5_0)|in(esk3_0,esk5_0)|set_difference(unordered_pair(esk3_0,esk4_0),esk5_0)!=unordered_pair(esk3_0,esk4_0)),inference(split_conjunct,[status(thm)],[42])).
% cnf(46,negated_conjecture,(disjoint(unordered_pair(esk3_0,esk4_0),esk5_0)|~in(esk3_0,esk5_0)),inference(spm,[status(thm)],[22,44,theory(equality)])).
% cnf(47,negated_conjecture,(disjoint(unordered_pair(esk3_0,esk4_0),esk5_0)|~in(esk4_0,esk5_0)),inference(spm,[status(thm)],[22,43,theory(equality)])).
% cnf(49,plain,(~disjoint(unordered_pair(X2,X1),X3)|~in(X1,X3)),inference(spm,[status(thm)],[26,19,theory(equality)])).
% cnf(51,negated_conjecture,(in(esk3_0,esk5_0)|in(esk4_0,esk5_0)|~disjoint(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(spm,[status(thm)],[45,23,theory(equality)])).
% cnf(58,negated_conjecture,(~in(esk3_0,esk5_0)),inference(csr,[status(thm)],[46,26])).
% cnf(63,negated_conjecture,(~in(esk4_0,esk5_0)),inference(spm,[status(thm)],[49,47,theory(equality)])).
% cnf(65,negated_conjecture,(in(esk4_0,esk5_0)|~disjoint(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(sr,[status(thm)],[51,58,theory(equality)])).
% cnf(66,negated_conjecture,(~disjoint(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(sr,[status(thm)],[65,63,theory(equality)])).
% cnf(67,negated_conjecture,(in(esk4_0,esk5_0)|in(esk3_0,esk5_0)),inference(spm,[status(thm)],[66,29,theory(equality)])).
% cnf(69,negated_conjecture,(in(esk3_0,esk5_0)),inference(sr,[status(thm)],[67,63,theory(equality)])).
% cnf(70,negated_conjecture,($false),inference(sr,[status(thm)],[69,58,theory(equality)])).
% cnf(71,negated_conjecture,($false),70,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 33
% # ...of these trivial : 0
% # ...subsumed : 4
% # ...remaining for further processing: 29
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 20
% # ...of the previous two non-trivial : 13
% # Contextual simplify-reflections : 1
% # Paramodulations : 20
% # Factorizations : 0
% # Equation resolutions : 0
% # Current number of processed clauses: 17
% # Positive orientable unit clauses: 1
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 4
% # ...number of literals in the above : 11
% # Clause-clause subsumption calls (NU) : 9
% # Rec. Clause-clause subsumption calls : 9
% # Unit Clause-clause subsumption calls : 3
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 18 leaves, 1.28+/-0.731 terms/leaf
% # Paramod-from index: 6 leaves, 1.17+/-0.373 terms/leaf
% # Paramod-into index: 17 leaves, 1.06+/-0.235 terms/leaf
% # -------------------------------------------------
% # User time : 0.009 s
% # System time : 0.005 s
% # Total time : 0.014 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.08 CPU 0.16 WC
% FINAL PrfWatch: 0.08 CPU 0.16 WC
% SZS output end Solution for /tmp/SystemOnTPTP2734/SET928+1.tptp
%
%------------------------------------------------------------------------------