TSTP Solution File: SET874+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET874+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:13:52 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/SystemOnTPTP31818/SET874+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP31818/SET874+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31818/SET874+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 31914
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 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]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(4, axiom,![X1]:![X2]:(in(X1,X2)=>set_union2(singleton(X1),X2)=X2),file('/tmp/SRASS.s.p', l23_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(11, conjecture,![X1]:![X2]:set_union2(singleton(X1),unordered_pair(X1,X2))=unordered_pair(X1,X2),file('/tmp/SRASS.s.p', t14_zfmisc_1)).
% fof(12, negated_conjecture,~(![X1]:![X2]:set_union2(singleton(X1),unordered_pair(X1,X2))=unordered_pair(X1,X2)),inference(assume_negation,[status(cth)],[11])).
% fof(19, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(20,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(23, plain,![X1]:![X2]:(~(in(X1,X2))|set_union2(singleton(X1),X2)=X2),inference(fof_nnf,[status(thm)],[4])).
% fof(24, plain,![X3]:![X4]:(~(in(X3,X4))|set_union2(singleton(X3),X4)=X4),inference(variable_rename,[status(thm)],[23])).
% cnf(25,plain,(set_union2(singleton(X1),X2)=X2|~in(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, plain,![X1]:![X2]:![X3]:((~(X3=unordered_pair(X1,X2))|![X4]:((~(in(X4,X3))|(X4=X1|X4=X2))&((~(X4=X1)&~(X4=X2))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(X4=X1)&~(X4=X2)))&(in(X4,X3)|(X4=X1|X4=X2)))|X3=unordered_pair(X1,X2))),inference(fof_nnf,[status(thm)],[5])).
% fof(27, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(X9=X5)&~(X9=X6)))&(in(X9,X7)|(X9=X5|X9=X6)))|X7=unordered_pair(X5,X6))),inference(variable_rename,[status(thm)],[26])).
% fof(28, plain,![X5]:![X6]:![X7]:((~(X7=unordered_pair(X5,X6))|![X8]:((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7))))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[27])).
% fof(29, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))&((~(X8=X5)&~(X8=X6))|in(X8,X7)))|~(X7=unordered_pair(X5,X6)))&(((~(in(esk1_3(X5,X6,X7),X7))|(~(esk1_3(X5,X6,X7)=X5)&~(esk1_3(X5,X6,X7)=X6)))&(in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[28])).
% fof(30, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(X8=X5|X8=X6))|~(X7=unordered_pair(X5,X6)))&(((~(X8=X5)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))&((~(X8=X6)|in(X8,X7))|~(X7=unordered_pair(X5,X6)))))&((((~(esk1_3(X5,X6,X7)=X5)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk1_3(X5,X6,X7)=X6)|~(in(esk1_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk1_3(X5,X6,X7),X7)|(esk1_3(X5,X6,X7)=X5|esk1_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[29])).
% cnf(35,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[30])).
% fof(52, negated_conjecture,?[X1]:?[X2]:~(set_union2(singleton(X1),unordered_pair(X1,X2))=unordered_pair(X1,X2)),inference(fof_nnf,[status(thm)],[12])).
% fof(53, negated_conjecture,?[X3]:?[X4]:~(set_union2(singleton(X3),unordered_pair(X3,X4))=unordered_pair(X3,X4)),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,~(set_union2(singleton(esk4_0),unordered_pair(esk4_0,esk5_0))=unordered_pair(esk4_0,esk5_0)),inference(skolemize,[status(esa)],[53])).
% cnf(55,negated_conjecture,(set_union2(singleton(esk4_0),unordered_pair(esk4_0,esk5_0))!=unordered_pair(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[54])).
% cnf(57,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[35,theory(equality)])).
% cnf(58,negated_conjecture,(set_union2(unordered_pair(esk4_0,esk5_0),singleton(esk4_0))!=unordered_pair(esk4_0,esk5_0)),inference(rw,[status(thm)],[55,20,theory(equality)])).
% cnf(63,plain,(X2=set_union2(X2,singleton(X1))|~in(X1,X2)),inference(spm,[status(thm)],[20,25,theory(equality)])).
% cnf(79,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[57,theory(equality)])).
% cnf(89,negated_conjecture,(~in(esk4_0,unordered_pair(esk4_0,esk5_0))),inference(spm,[status(thm)],[58,63,theory(equality)])).
% cnf(101,negated_conjecture,($false),inference(rw,[status(thm)],[89,79,theory(equality)])).
% cnf(102,negated_conjecture,($false),inference(cn,[status(thm)],[101,theory(equality)])).
% cnf(103,negated_conjecture,($false),102,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 41
% # ...of these trivial : 0
% # ...subsumed : 1
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 1
% # Generated clauses : 42
% # ...of the previous two non-trivial : 31
% # Contextual simplify-reflections : 0
% # Paramodulations : 37
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 21
% # Positive orientable unit clauses: 4
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 4
% # Non-unit-clauses : 11
% # Current number of unprocessed clauses: 22
% # ...number of literals in the above : 50
% # Clause-clause subsumption calls (NU) : 16
% # Rec. Clause-clause subsumption calls : 16
% # Unit Clause-clause subsumption calls : 7
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 6
% # Indexed BW rewrite successes : 5
% # Backwards rewriting index: 22 leaves, 1.50+/-0.839 terms/leaf
% # Paramod-from index: 7 leaves, 1.57+/-0.728 terms/leaf
% # Paramod-into index: 20 leaves, 1.45+/-0.805 terms/leaf
% # -------------------------------------------------
% # User time : 0.011 s
% # System time : 0.004 s
% # Total time : 0.015 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/SystemOnTPTP31818/SET874+1.tptp
%
%------------------------------------------------------------------------------