TSTP Solution File: SEU148+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU148+2 : TPTP v5.0.0. Released v3.3.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art03.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:18:51 EST 2010
% Result : Theorem 1.30s
% Output : Solution 1.30s
% 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/SystemOnTPTP28512/SEU148+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28512/SEU148+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28512/SEU148+2.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 28608
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.021 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(4, axiom,![X1]:![X2]:(subset(X1,singleton(X2))<=>(X1=empty_set|X1=singleton(X2))),file('/tmp/SRASS.s.p', l4_zfmisc_1)).
% fof(6, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(7, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(9, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(43, 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(71, conjecture,![X1]:![X2]:(subset(singleton(X1),singleton(X2))=>X1=X2),file('/tmp/SRASS.s.p', t6_zfmisc_1)).
% fof(72, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),singleton(X2))=>X1=X2)),inference(assume_negation,[status(cth)],[71])).
% fof(94, plain,![X1]:![X2]:((~(subset(X1,singleton(X2)))|(X1=empty_set|X1=singleton(X2)))&((~(X1=empty_set)&~(X1=singleton(X2)))|subset(X1,singleton(X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(95, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)&~(X3=singleton(X4)))|subset(X3,singleton(X4)))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X3]:![X4]:((~(subset(X3,singleton(X4)))|(X3=empty_set|X3=singleton(X4)))&((~(X3=empty_set)|subset(X3,singleton(X4)))&(~(X3=singleton(X4))|subset(X3,singleton(X4))))),inference(distribute,[status(thm)],[95])).
% cnf(99,plain,(X1=singleton(X2)|X1=empty_set|~subset(X1,singleton(X2))),inference(split_conjunct,[status(thm)],[96])).
% fof(104, 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)],[6])).
% fof(105, 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)],[104])).
% fof(106, 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)],[105])).
% fof(107, 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)],[106])).
% fof(108, 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)],[107])).
% cnf(112,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[108])).
% fof(113, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[7])).
% cnf(114,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[113])).
% fof(118, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[9])).
% cnf(119,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[118])).
% fof(226, 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)],[43])).
% fof(227, 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)],[226])).
% fof(228, 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(esk7_3(X5,X6,X7),X7))|(~(esk7_3(X5,X6,X7)=X5)&~(esk7_3(X5,X6,X7)=X6)))&(in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[227])).
% fof(229, 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(esk7_3(X5,X6,X7),X7))|(~(esk7_3(X5,X6,X7)=X5)&~(esk7_3(X5,X6,X7)=X6)))&(in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[228])).
% fof(230, 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)))))&((((~(esk7_3(X5,X6,X7)=X5)|~(in(esk7_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk7_3(X5,X6,X7)=X6)|~(in(esk7_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[229])).
% cnf(234,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[230])).
% fof(332, negated_conjecture,?[X1]:?[X2]:(subset(singleton(X1),singleton(X2))&~(X1=X2)),inference(fof_nnf,[status(thm)],[72])).
% fof(333, negated_conjecture,?[X3]:?[X4]:(subset(singleton(X3),singleton(X4))&~(X3=X4)),inference(variable_rename,[status(thm)],[332])).
% fof(334, negated_conjecture,(subset(singleton(esk14_0),singleton(esk15_0))&~(esk14_0=esk15_0)),inference(skolemize,[status(esa)],[333])).
% cnf(335,negated_conjecture,(esk14_0!=esk15_0),inference(split_conjunct,[status(thm)],[334])).
% cnf(336,negated_conjecture,(subset(singleton(esk14_0),singleton(esk15_0))),inference(split_conjunct,[status(thm)],[334])).
% cnf(338,negated_conjecture,(subset(unordered_pair(esk14_0,esk14_0),unordered_pair(esk15_0,esk15_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[336,119,theory(equality)]),119,theory(equality)]),['unfolding']).
% cnf(344,plain,(empty_set=X1|unordered_pair(X2,X2)=X1|~subset(X1,unordered_pair(X2,X2))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[99,119,theory(equality)]),119,theory(equality)]),['unfolding']).
% cnf(346,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[112,119,theory(equality)]),['unfolding']).
% cnf(349,plain,(unordered_pair(X1,X1)!=empty_set),inference(rw,[status(thm)],[114,119,theory(equality)]),['unfolding']).
% cnf(374,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[234,theory(equality)])).
% cnf(566,negated_conjecture,(unordered_pair(esk15_0,esk15_0)=unordered_pair(esk14_0,esk14_0)|empty_set=unordered_pair(esk14_0,esk14_0)),inference(spm,[status(thm)],[344,338,theory(equality)])).
% cnf(574,negated_conjecture,(unordered_pair(esk15_0,esk15_0)=unordered_pair(esk14_0,esk14_0)),inference(sr,[status(thm)],[566,349,theory(equality)])).
% cnf(578,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[374,theory(equality)])).
% cnf(618,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[346,theory(equality)])).
% cnf(1487,negated_conjecture,(in(esk15_0,unordered_pair(esk14_0,esk14_0))),inference(spm,[status(thm)],[578,574,theory(equality)])).
% cnf(7866,negated_conjecture,(esk14_0=esk15_0),inference(spm,[status(thm)],[618,1487,theory(equality)])).
% cnf(7894,negated_conjecture,($false),inference(sr,[status(thm)],[7866,335,theory(equality)])).
% cnf(7895,negated_conjecture,($false),7894,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 1152
% # ...of these trivial : 41
% # ...subsumed : 693
% # ...remaining for further processing: 418
% # Other redundant clauses eliminated : 118
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 4
% # Generated clauses : 5867
% # ...of the previous two non-trivial : 4495
% # Contextual simplify-reflections : 28
% # Paramodulations : 5716
% # Factorizations : 15
% # Equation resolutions : 136
% # Current number of processed clauses: 308
% # Positive orientable unit clauses: 64
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 37
% # Non-unit-clauses : 201
% # Current number of unprocessed clauses: 3470
% # ...number of literals in the above : 9891
% # Clause-clause subsumption calls (NU) : 1564
% # Rec. Clause-clause subsumption calls : 1531
% # Unit Clause-clause subsumption calls : 95
% # Rewrite failures with RHS unbound : 16
% # Indexed BW rewrite attempts : 109
% # Indexed BW rewrite successes : 48
% # Backwards rewriting index: 187 leaves, 1.50+/-1.318 terms/leaf
% # Paramod-from index: 115 leaves, 1.25+/-0.572 terms/leaf
% # Paramod-into index: 181 leaves, 1.45+/-1.104 terms/leaf
% # -------------------------------------------------
% # User time : 0.187 s
% # System time : 0.012 s
% # Total time : 0.199 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.38 CPU 0.47 WC
% FINAL PrfWatch: 0.38 CPU 0.47 WC
% SZS output end Solution for /tmp/SystemOnTPTP28512/SEU148+2.tptp
%
%------------------------------------------------------------------------------