TSTP Solution File: SEU159+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU159+3 : TPTP v5.0.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art05.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:21:26 EST 2010
% Result : Theorem 0.89s
% Output : Solution 0.89s
% 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/SystemOnTPTP20843/SEU159+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ... found
% SZS status THM for /tmp/SystemOnTPTP20843/SEU159+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20843/SEU159+3.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 20939
% 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]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(4, 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]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3))),file('/tmp/SRASS.s.p', t38_zfmisc_1)).
% fof(9, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3)))),inference(assume_negation,[status(cth)],[8])).
% fof(15, 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(16, 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)],[15])).
% fof(17, 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)],[16])).
% fof(18, 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)],[17])).
% fof(19, 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)],[18])).
% cnf(20,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[19])).
% cnf(21,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[19])).
% cnf(22,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[19])).
% fof(25, 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)],[4])).
% fof(26, 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)],[25])).
% 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))))&(((~(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)],[26])).
% fof(28, 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)],[27])).
% fof(29, 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)],[28])).
% cnf(33,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[29])).
% cnf(34,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[29])).
% cnf(35,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[29])).
% fof(44, negated_conjecture,?[X1]:?[X2]:?[X3]:((~(subset(unordered_pair(X1,X2),X3))|(~(in(X1,X3))|~(in(X2,X3))))&(subset(unordered_pair(X1,X2),X3)|(in(X1,X3)&in(X2,X3)))),inference(fof_nnf,[status(thm)],[9])).
% fof(45, negated_conjecture,?[X4]:?[X5]:?[X6]:((~(subset(unordered_pair(X4,X5),X6))|(~(in(X4,X6))|~(in(X5,X6))))&(subset(unordered_pair(X4,X5),X6)|(in(X4,X6)&in(X5,X6)))),inference(variable_rename,[status(thm)],[44])).
% fof(46, negated_conjecture,((~(subset(unordered_pair(esk5_0,esk6_0),esk7_0))|(~(in(esk5_0,esk7_0))|~(in(esk6_0,esk7_0))))&(subset(unordered_pair(esk5_0,esk6_0),esk7_0)|(in(esk5_0,esk7_0)&in(esk6_0,esk7_0)))),inference(skolemize,[status(esa)],[45])).
% fof(47, negated_conjecture,((~(subset(unordered_pair(esk5_0,esk6_0),esk7_0))|(~(in(esk5_0,esk7_0))|~(in(esk6_0,esk7_0))))&((in(esk5_0,esk7_0)|subset(unordered_pair(esk5_0,esk6_0),esk7_0))&(in(esk6_0,esk7_0)|subset(unordered_pair(esk5_0,esk6_0),esk7_0)))),inference(distribute,[status(thm)],[46])).
% cnf(48,negated_conjecture,(subset(unordered_pair(esk5_0,esk6_0),esk7_0)|in(esk6_0,esk7_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(49,negated_conjecture,(subset(unordered_pair(esk5_0,esk6_0),esk7_0)|in(esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(50,negated_conjecture,(~in(esk6_0,esk7_0)|~in(esk5_0,esk7_0)|~subset(unordered_pair(esk5_0,esk6_0),esk7_0)),inference(split_conjunct,[status(thm)],[47])).
% cnf(51,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(52,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[34,theory(equality)])).
% cnf(53,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[51,theory(equality)])).
% cnf(61,negated_conjecture,(in(X1,esk7_0)|in(esk5_0,esk7_0)|~in(X1,unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[22,49,theory(equality)])).
% cnf(62,negated_conjecture,(in(X1,esk7_0)|in(esk6_0,esk7_0)|~in(X1,unordered_pair(esk5_0,esk6_0))),inference(spm,[status(thm)],[22,48,theory(equality)])).
% cnf(64,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[52,theory(equality)])).
% cnf(67,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[35,theory(equality)])).
% cnf(90,negated_conjecture,(in(esk5_0,esk7_0)),inference(spm,[status(thm)],[61,64,theory(equality)])).
% cnf(93,negated_conjecture,(~subset(unordered_pair(esk5_0,esk6_0),esk7_0)|$false|~in(esk6_0,esk7_0)),inference(rw,[status(thm)],[50,90,theory(equality)])).
% cnf(94,negated_conjecture,(~subset(unordered_pair(esk5_0,esk6_0),esk7_0)|~in(esk6_0,esk7_0)),inference(cn,[status(thm)],[93,theory(equality)])).
% cnf(98,negated_conjecture,(in(esk6_0,esk7_0)),inference(spm,[status(thm)],[62,53,theory(equality)])).
% cnf(104,negated_conjecture,(~subset(unordered_pair(esk5_0,esk6_0),esk7_0)|$false),inference(rw,[status(thm)],[94,98,theory(equality)])).
% cnf(105,negated_conjecture,(~subset(unordered_pair(esk5_0,esk6_0),esk7_0)),inference(cn,[status(thm)],[104,theory(equality)])).
% cnf(110,plain,(X1=esk1_2(unordered_pair(X1,X2),X3)|X2=esk1_2(unordered_pair(X1,X2),X3)|subset(unordered_pair(X1,X2),X3)),inference(spm,[status(thm)],[67,21,theory(equality)])).
% cnf(114,plain,(subset(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X2|~in(X1,X3)),inference(spm,[status(thm)],[20,110,theory(equality)])).
% cnf(203,plain,(subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3)),inference(spm,[status(thm)],[20,114,theory(equality)])).
% cnf(209,negated_conjecture,(~in(esk6_0,esk7_0)|~in(esk5_0,esk7_0)),inference(spm,[status(thm)],[105,203,theory(equality)])).
% cnf(212,negated_conjecture,($false|~in(esk5_0,esk7_0)),inference(rw,[status(thm)],[209,98,theory(equality)])).
% cnf(213,negated_conjecture,($false|$false),inference(rw,[status(thm)],[212,90,theory(equality)])).
% cnf(214,negated_conjecture,($false),inference(cn,[status(thm)],[213,theory(equality)])).
% cnf(215,negated_conjecture,($false),214,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 83
% # ...of these trivial : 2
% # ...subsumed : 23
% # ...remaining for further processing: 58
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 133
% # ...of the previous two non-trivial : 94
% # Contextual simplify-reflections : 0
% # Paramodulations : 94
% # Factorizations : 14
% # Equation resolutions : 25
% # Current number of processed clauses: 33
% # Positive orientable unit clauses: 6
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 6
% # Non-unit-clauses : 20
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 161
% # Clause-clause subsumption calls (NU) : 153
% # Rec. Clause-clause subsumption calls : 116
% # Unit Clause-clause subsumption calls : 13
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 3
% # Indexed BW rewrite successes : 2
% # Backwards rewriting index: 27 leaves, 1.78+/-1.523 terms/leaf
% # Paramod-from index: 11 leaves, 1.36+/-0.481 terms/leaf
% # Paramod-into index: 26 leaves, 1.58+/-1.276 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.006 s
% # Total time : 0.020 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/SystemOnTPTP20843/SEU159+3.tptp
%
%------------------------------------------------------------------------------