TSTP Solution File: SEU142+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU142+1 : TPTP v5.0.0. Released v3.3.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 01:15:49 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/SystemOnTPTP18903/SEU142+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP18903/SEU142+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP18903/SEU142+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 18999
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(3, 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(8, conjecture,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(9, negated_conjecture,~(![X1]:unordered_pair(X1,X1)=singleton(X1)),inference(assume_negation,[status(cth)],[8])).
% fof(13, 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)],[2])).
% fof(14, 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)],[13])).
% fof(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% cnf(20,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[17])).
% cnf(21,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(22, 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)],[3])).
% fof(23, 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)],[22])).
% fof(24, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[23])).
% fof(25, 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(esk2_3(X5,X6,X7),X7))|(~(esk2_3(X5,X6,X7)=X5)&~(esk2_3(X5,X6,X7)=X6)))&(in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[24])).
% fof(26, 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)))))&((((~(esk2_3(X5,X6,X7)=X5)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk2_3(X5,X6,X7)=X6)|~(in(esk2_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk2_3(X5,X6,X7),X7)|(esk2_3(X5,X6,X7)=X5|esk2_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[25])).
% cnf(27,plain,(X1=unordered_pair(X2,X3)|esk2_3(X2,X3,X1)=X3|esk2_3(X2,X3,X1)=X2|in(esk2_3(X2,X3,X1),X1)),inference(split_conjunct,[status(thm)],[26])).
% cnf(28,plain,(X1=unordered_pair(X2,X3)|~in(esk2_3(X2,X3,X1),X1)|esk2_3(X2,X3,X1)!=X3),inference(split_conjunct,[status(thm)],[26])).
% fof(44, negated_conjecture,?[X1]:~(unordered_pair(X1,X1)=singleton(X1)),inference(fof_nnf,[status(thm)],[9])).
% fof(45, negated_conjecture,?[X2]:~(unordered_pair(X2,X2)=singleton(X2)),inference(variable_rename,[status(thm)],[44])).
% fof(46, negated_conjecture,~(unordered_pair(esk4_0,esk4_0)=singleton(esk4_0)),inference(skolemize,[status(esa)],[45])).
% cnf(47,negated_conjecture,(unordered_pair(esk4_0,esk4_0)!=singleton(esk4_0)),inference(split_conjunct,[status(thm)],[46])).
% cnf(54,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[20,theory(equality)])).
% cnf(55,plain,(X1=X2|~in(X2,singleton(X1))),inference(er,[status(thm)],[21,theory(equality)])).
% cnf(64,plain,(X1=esk2_3(X2,X3,singleton(X1))|esk2_3(X2,X3,singleton(X1))=X2|esk2_3(X2,X3,singleton(X1))=X3|unordered_pair(X2,X3)=singleton(X1)),inference(spm,[status(thm)],[55,27,theory(equality)])).
% cnf(66,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[54,theory(equality)])).
% cnf(238,plain,(esk2_3(X4,X5,singleton(X6))=X4|esk2_3(X4,X5,singleton(X6))=X6|unordered_pair(X4,X5)=singleton(X6)|X5!=X4),inference(ef,[status(thm)],[64,theory(equality)])).
% cnf(255,plain,(esk2_3(X1,X1,singleton(X2))=X1|esk2_3(X1,X1,singleton(X2))=X2|unordered_pair(X1,X1)=singleton(X2)),inference(er,[status(thm)],[238,theory(equality)])).
% cnf(270,plain,(esk2_3(X3,X3,singleton(X4))=X3|unordered_pair(X3,X3)=singleton(X4)|X4!=X3),inference(ef,[status(thm)],[255,theory(equality)])).
% cnf(280,plain,(esk2_3(X1,X1,singleton(X1))=X1|unordered_pair(X1,X1)=singleton(X1)),inference(er,[status(thm)],[270,theory(equality)])).
% cnf(289,plain,(unordered_pair(X1,X1)=singleton(X1)|~in(X1,singleton(X1))),inference(spm,[status(thm)],[28,280,theory(equality)])).
% cnf(292,plain,(unordered_pair(X1,X1)=singleton(X1)|$false),inference(rw,[status(thm)],[289,66,theory(equality)])).
% cnf(293,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(cn,[status(thm)],[292,theory(equality)])).
% cnf(330,negated_conjecture,($false),inference(rw,[status(thm)],[47,293,theory(equality)])).
% cnf(331,negated_conjecture,($false),inference(cn,[status(thm)],[330,theory(equality)])).
% cnf(332,negated_conjecture,($false),331,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 82
% # ...of these trivial : 2
% # ...subsumed : 27
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 1
% # Generated clauses : 234
% # ...of the previous two non-trivial : 155
% # Contextual simplify-reflections : 4
% # Paramodulations : 192
% # Factorizations : 14
% # Equation resolutions : 28
% # Current number of processed clauses: 45
% # Positive orientable unit clauses: 3
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 3
% # Non-unit-clauses : 37
% # Current number of unprocessed clauses: 79
% # ...number of literals in the above : 350
% # Clause-clause subsumption calls (NU) : 276
% # Rec. Clause-clause subsumption calls : 194
% # Unit Clause-clause subsumption calls : 11
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 16
% # Indexed BW rewrite successes : 9
% # Backwards rewriting index: 33 leaves, 1.61+/-1.179 terms/leaf
% # Paramod-from index: 15 leaves, 1.33+/-0.596 terms/leaf
% # Paramod-into index: 31 leaves, 1.55+/-1.131 terms/leaf
% # -------------------------------------------------
% # User time : 0.018 s
% # System time : 0.004 s
% # Total time : 0.022 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.10 CPU 0.18 WC
% FINAL PrfWatch: 0.10 CPU 0.18 WC
% SZS output end Solution for /tmp/SystemOnTPTP18903/SEU142+1.tptp
%
%------------------------------------------------------------------------------