TSTP Solution File: SEU144+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU144+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 : 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:17:08 EST 2010
% Result : Theorem 1.08s
% Output : Solution 1.08s
% 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/SystemOnTPTP19939/SEU144+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP19939/SEU144+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP19939/SEU144+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 20035
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.020 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(5, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(38, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(39, 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(65, conjecture,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(66, negated_conjecture,~(![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2))),inference(assume_negation,[status(cth)],[65])).
% fof(80, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(in(X3,X1))|in(X3,X2)))&(?[X3]:(in(X3,X1)&~(in(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[2])).
% fof(81, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&(?[X7]:(in(X7,X4)&~(in(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[81])).
% fof(83, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)&~(in(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[82])).
% fof(84, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[83])).
% cnf(85,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[84])).
% cnf(86,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[84])).
% cnf(87,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[84])).
% fof(93, 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)],[5])).
% fof(94, 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)],[93])).
% fof(95, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[94])).
% fof(96, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[96])).
% cnf(101,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[97])).
% fof(228, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[38])).
% cnf(229,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[228])).
% fof(230, 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)],[39])).
% fof(231, 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)],[230])).
% fof(232, 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(esk12_3(X5,X6,X7),X7))|(~(esk12_3(X5,X6,X7)=X5)&~(esk12_3(X5,X6,X7)=X6)))&(in(esk12_3(X5,X6,X7),X7)|(esk12_3(X5,X6,X7)=X5|esk12_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[231])).
% fof(233, 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(esk12_3(X5,X6,X7),X7))|(~(esk12_3(X5,X6,X7)=X5)&~(esk12_3(X5,X6,X7)=X6)))&(in(esk12_3(X5,X6,X7),X7)|(esk12_3(X5,X6,X7)=X5|esk12_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[232])).
% fof(234, 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)))))&((((~(esk12_3(X5,X6,X7)=X5)|~(in(esk12_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk12_3(X5,X6,X7)=X6)|~(in(esk12_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk12_3(X5,X6,X7),X7)|(esk12_3(X5,X6,X7)=X5|esk12_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[233])).
% cnf(238,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[234])).
% fof(302, negated_conjecture,?[X1]:?[X2]:((~(subset(singleton(X1),X2))|~(in(X1,X2)))&(subset(singleton(X1),X2)|in(X1,X2))),inference(fof_nnf,[status(thm)],[66])).
% fof(303, negated_conjecture,?[X3]:?[X4]:((~(subset(singleton(X3),X4))|~(in(X3,X4)))&(subset(singleton(X3),X4)|in(X3,X4))),inference(variable_rename,[status(thm)],[302])).
% fof(304, negated_conjecture,((~(subset(singleton(esk13_0),esk14_0))|~(in(esk13_0,esk14_0)))&(subset(singleton(esk13_0),esk14_0)|in(esk13_0,esk14_0))),inference(skolemize,[status(esa)],[303])).
% cnf(305,negated_conjecture,(in(esk13_0,esk14_0)|subset(singleton(esk13_0),esk14_0)),inference(split_conjunct,[status(thm)],[304])).
% cnf(306,negated_conjecture,(~in(esk13_0,esk14_0)|~subset(singleton(esk13_0),esk14_0)),inference(split_conjunct,[status(thm)],[304])).
% cnf(307,negated_conjecture,(in(esk13_0,esk14_0)|subset(unordered_pair(esk13_0,esk13_0),esk14_0)),inference(rw,[status(thm)],[305,229,theory(equality)]),['unfolding']).
% cnf(309,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[101,229,theory(equality)]),['unfolding']).
% cnf(313,negated_conjecture,(~in(esk13_0,esk14_0)|~subset(unordered_pair(esk13_0,esk13_0),esk14_0)),inference(rw,[status(thm)],[306,229,theory(equality)]),['unfolding']).
% cnf(336,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[238,theory(equality)])).
% cnf(426,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[336,theory(equality)])).
% cnf(455,negated_conjecture,(in(X1,esk14_0)|in(esk13_0,esk14_0)|~in(X1,unordered_pair(esk13_0,esk13_0))),inference(spm,[status(thm)],[87,307,theory(equality)])).
% cnf(506,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[309,theory(equality)])).
% cnf(1832,negated_conjecture,(in(esk13_0,esk14_0)),inference(spm,[status(thm)],[455,426,theory(equality)])).
% cnf(1849,negated_conjecture,(~subset(unordered_pair(esk13_0,esk13_0),esk14_0)|$false),inference(rw,[status(thm)],[313,1832,theory(equality)])).
% cnf(1850,negated_conjecture,(~subset(unordered_pair(esk13_0,esk13_0),esk14_0)),inference(cn,[status(thm)],[1849,theory(equality)])).
% cnf(1868,negated_conjecture,(in(esk1_2(unordered_pair(esk13_0,esk13_0),esk14_0),unordered_pair(esk13_0,esk13_0))),inference(spm,[status(thm)],[1850,86,theory(equality)])).
% cnf(1869,negated_conjecture,(~in(esk1_2(unordered_pair(esk13_0,esk13_0),esk14_0),esk14_0)),inference(spm,[status(thm)],[1850,85,theory(equality)])).
% cnf(2028,negated_conjecture,(esk13_0=esk1_2(unordered_pair(esk13_0,esk13_0),esk14_0)),inference(spm,[status(thm)],[506,1868,theory(equality)])).
% cnf(2277,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1869,2028,theory(equality)]),1832,theory(equality)])).
% cnf(2278,negated_conjecture,($false),inference(cn,[status(thm)],[2277,theory(equality)])).
% cnf(2279,negated_conjecture,($false),2278,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 354
% # ...of these trivial : 6
% # ...subsumed : 96
% # ...remaining for further processing: 252
% # Other redundant clauses eliminated : 50
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 4
% # Backward-rewritten : 13
% # Generated clauses : 1563
% # ...of the previous two non-trivial : 1246
% # Contextual simplify-reflections : 5
% # Paramodulations : 1487
% # Factorizations : 14
% # Equation resolutions : 62
% # Current number of processed clauses: 141
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 17
% # Non-unit-clauses : 86
% # Current number of unprocessed clauses: 875
% # ...number of literals in the above : 2647
% # Clause-clause subsumption calls (NU) : 376
% # Rec. Clause-clause subsumption calls : 355
% # Unit Clause-clause subsumption calls : 58
% # Rewrite failures with RHS unbound : 14
% # Indexed BW rewrite attempts : 99
% # Indexed BW rewrite successes : 44
% # Backwards rewriting index: 86 leaves, 1.67+/-1.581 terms/leaf
% # Paramod-from index: 47 leaves, 1.47+/-0.710 terms/leaf
% # Paramod-into index: 81 leaves, 1.58+/-1.275 terms/leaf
% # -------------------------------------------------
% # User time : 0.067 s
% # System time : 0.004 s
% # Total time : 0.071 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.18 CPU 0.27 WC
% FINAL PrfWatch: 0.18 CPU 0.27 WC
% SZS output end Solution for /tmp/SystemOnTPTP19939/SEU144+2.tptp
%
%------------------------------------------------------------------------------