TSTP Solution File: SET882+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET882+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:14:53 EST 2010
% Result : Theorem 1.06s
% Output : Solution 1.06s
% 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/SystemOnTPTP30352/SET882+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP30352/SET882+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP30352/SET882+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 30448
% 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(1, axiom,![X1]:![X2]:unordered_pair(X1,X2)=unordered_pair(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_tarski)).
% fof(2, 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(3, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(7, conjecture,![X1]:![X2]:(~(X1=X2)=>set_difference(unordered_pair(X1,X2),singleton(X2))=singleton(X1)),file('/tmp/SRASS.s.p', t23_zfmisc_1)).
% fof(8, negated_conjecture,~(![X1]:![X2]:(~(X1=X2)=>set_difference(unordered_pair(X1,X2),singleton(X2))=singleton(X1))),inference(assume_negation,[status(cth)],[7])).
% 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)],[2,theory(equality)])).
% fof(12, plain,![X3]:![X4]:unordered_pair(X3,X4)=unordered_pair(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(13,plain,(unordered_pair(X1,X2)=unordered_pair(X2,X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, 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(15, 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)],[14])).
% fof(16, 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)],[15])).
% cnf(18,plain,(set_difference(unordered_pair(X1,X2),X3)=singleton(X1)|in(X1,X3)|~in(X2,X3)),inference(split_conjunct,[status(thm)],[16])).
% fof(21, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(22, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[22])).
% fof(24, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[23])).
% fof(25, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[24])).
% cnf(28,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[25])).
% cnf(29,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[25])).
% fof(39, negated_conjecture,?[X1]:?[X2]:(~(X1=X2)&~(set_difference(unordered_pair(X1,X2),singleton(X2))=singleton(X1))),inference(fof_nnf,[status(thm)],[8])).
% fof(40, negated_conjecture,?[X3]:?[X4]:(~(X3=X4)&~(set_difference(unordered_pair(X3,X4),singleton(X4))=singleton(X3))),inference(variable_rename,[status(thm)],[39])).
% fof(41, negated_conjecture,(~(esk4_0=esk5_0)&~(set_difference(unordered_pair(esk4_0,esk5_0),singleton(esk5_0))=singleton(esk4_0))),inference(skolemize,[status(esa)],[40])).
% cnf(42,negated_conjecture,(set_difference(unordered_pair(esk4_0,esk5_0),singleton(esk5_0))!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[41])).
% cnf(43,negated_conjecture,(esk4_0!=esk5_0),inference(split_conjunct,[status(thm)],[41])).
% cnf(44,negated_conjecture,(set_difference(unordered_pair(esk5_0,esk4_0),singleton(esk5_0))!=singleton(esk4_0)),inference(rw,[status(thm)],[42,13,theory(equality)])).
% cnf(45,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[28,theory(equality)])).
% cnf(49,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(58,plain,(set_difference(unordered_pair(X2,X1),X3)=singleton(X1)|in(X1,X3)|~in(X2,X3)),inference(spm,[status(thm)],[18,13,theory(equality)])).
% cnf(76,negated_conjecture,(in(esk4_0,singleton(esk5_0))|~in(esk5_0,singleton(esk5_0))),inference(spm,[status(thm)],[44,58,theory(equality)])).
% cnf(84,negated_conjecture,(in(esk4_0,singleton(esk5_0))|$false),inference(rw,[status(thm)],[76,49,theory(equality)])).
% cnf(85,negated_conjecture,(in(esk4_0,singleton(esk5_0))),inference(cn,[status(thm)],[84,theory(equality)])).
% cnf(87,negated_conjecture,(X1=esk4_0|singleton(X1)!=singleton(esk5_0)),inference(spm,[status(thm)],[29,85,theory(equality)])).
% cnf(89,negated_conjecture,(esk5_0=esk4_0),inference(er,[status(thm)],[87,theory(equality)])).
% cnf(90,negated_conjecture,($false),inference(sr,[status(thm)],[89,43,theory(equality)])).
% cnf(91,negated_conjecture,($false),90,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 47
% # ...of these trivial : 1
% # ...subsumed : 6
% # ...remaining for further processing: 40
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 0
% # Generated clauses : 42
% # ...of the previous two non-trivial : 32
% # Contextual simplify-reflections : 0
% # Paramodulations : 37
% # Factorizations : 0
% # Equation resolutions : 5
% # Current number of processed clauses: 24
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 4
% # Non-unit-clauses : 16
% # Current number of unprocessed clauses: 13
% # ...number of literals in the above : 39
% # Clause-clause subsumption calls (NU) : 71
% # Rec. Clause-clause subsumption calls : 65
% # Unit Clause-clause subsumption calls : 10
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 0
% # Indexed BW rewrite successes : 0
% # Backwards rewriting index: 21 leaves, 1.48+/-1.052 terms/leaf
% # Paramod-from index: 6 leaves, 1.33+/-0.471 terms/leaf
% # Paramod-into index: 19 leaves, 1.37+/-0.741 terms/leaf
% # -------------------------------------------------
% # User time : 0.013 s
% # System time : 0.002 s
% # Total time : 0.015 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.11 CPU 0.18 WC
% FINAL PrfWatch: 0.11 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP30352/SET882+1.tptp
%
%------------------------------------------------------------------------------