TSTP Solution File: SEU159+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU159+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 : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz @ 3000MHz
% Memory : 2006MB
% OS : Linux 2.6.31.5-127.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Thu Dec 30 01:25:56 EST 2010
% Result : Theorem 1.10s
% Output : Solution 1.10s
% 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/SystemOnTPTP24996/SEU159+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP24996/SEU159+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP24996/SEU159+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 25128
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.010 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(7, 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(8, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3)))),inference(assume_negation,[status(cth)],[7])).
% fof(13, 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(14, 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)],[13])).
% fof(15, 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)],[14])).
% fof(16, 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)],[15])).
% fof(17, 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)],[16])).
% cnf(18,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[17])).
% cnf(19,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[17])).
% cnf(20,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[17])).
% fof(23, 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(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))))&(?[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)],[23])).
% fof(25, 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)],[24])).
% fof(26, 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)],[25])).
% fof(27, 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)],[26])).
% cnf(31,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[27])).
% cnf(32,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[27])).
% cnf(33,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[27])).
% fof(37, 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)],[8])).
% fof(38, 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)],[37])).
% fof(39, negated_conjecture,((~(subset(unordered_pair(esk3_0,esk4_0),esk5_0))|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk5_0))))&(subset(unordered_pair(esk3_0,esk4_0),esk5_0)|(in(esk3_0,esk5_0)&in(esk4_0,esk5_0)))),inference(skolemize,[status(esa)],[38])).
% fof(40, negated_conjecture,((~(subset(unordered_pair(esk3_0,esk4_0),esk5_0))|(~(in(esk3_0,esk5_0))|~(in(esk4_0,esk5_0))))&((in(esk3_0,esk5_0)|subset(unordered_pair(esk3_0,esk4_0),esk5_0))&(in(esk4_0,esk5_0)|subset(unordered_pair(esk3_0,esk4_0),esk5_0)))),inference(distribute,[status(thm)],[39])).
% cnf(41,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),esk5_0)|in(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(42,negated_conjecture,(subset(unordered_pair(esk3_0,esk4_0),esk5_0)|in(esk3_0,esk5_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(43,negated_conjecture,(~in(esk4_0,esk5_0)|~in(esk3_0,esk5_0)|~subset(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(split_conjunct,[status(thm)],[40])).
% cnf(44,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[31,theory(equality)])).
% cnf(45,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[32,theory(equality)])).
% cnf(46,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[44,theory(equality)])).
% cnf(49,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[45,theory(equality)])).
% cnf(52,negated_conjecture,(in(X1,esk5_0)|in(esk3_0,esk5_0)|~in(X1,unordered_pair(esk3_0,esk4_0))),inference(spm,[status(thm)],[20,42,theory(equality)])).
% cnf(53,negated_conjecture,(in(X1,esk5_0)|in(esk4_0,esk5_0)|~in(X1,unordered_pair(esk3_0,esk4_0))),inference(spm,[status(thm)],[20,41,theory(equality)])).
% cnf(60,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[33,theory(equality)])).
% cnf(83,negated_conjecture,(in(esk3_0,esk5_0)),inference(spm,[status(thm)],[52,49,theory(equality)])).
% cnf(86,negated_conjecture,(~subset(unordered_pair(esk3_0,esk4_0),esk5_0)|$false|~in(esk4_0,esk5_0)),inference(rw,[status(thm)],[43,83,theory(equality)])).
% cnf(87,negated_conjecture,(~subset(unordered_pair(esk3_0,esk4_0),esk5_0)|~in(esk4_0,esk5_0)),inference(cn,[status(thm)],[86,theory(equality)])).
% cnf(92,negated_conjecture,(in(esk4_0,esk5_0)),inference(spm,[status(thm)],[53,46,theory(equality)])).
% cnf(97,negated_conjecture,(~subset(unordered_pair(esk3_0,esk4_0),esk5_0)|$false),inference(rw,[status(thm)],[87,92,theory(equality)])).
% cnf(98,negated_conjecture,(~subset(unordered_pair(esk3_0,esk4_0),esk5_0)),inference(cn,[status(thm)],[97,theory(equality)])).
% cnf(103,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)],[60,19,theory(equality)])).
% cnf(108,plain,(subset(unordered_pair(X1,X2),X3)|esk1_2(unordered_pair(X1,X2),X3)=X2|~in(X1,X3)),inference(spm,[status(thm)],[18,103,theory(equality)])).
% cnf(191,plain,(subset(unordered_pair(X1,X2),X3)|~in(X2,X3)|~in(X1,X3)),inference(spm,[status(thm)],[18,108,theory(equality)])).
% cnf(196,negated_conjecture,(~in(esk4_0,esk5_0)|~in(esk3_0,esk5_0)),inference(spm,[status(thm)],[98,191,theory(equality)])).
% cnf(199,negated_conjecture,($false|~in(esk3_0,esk5_0)),inference(rw,[status(thm)],[196,92,theory(equality)])).
% cnf(200,negated_conjecture,($false|$false),inference(rw,[status(thm)],[199,83,theory(equality)])).
% cnf(201,negated_conjecture,($false),inference(cn,[status(thm)],[200,theory(equality)])).
% cnf(202,negated_conjecture,($false),201,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 75
% # ...of these trivial : 2
% # ...subsumed : 20
% # ...remaining for further processing: 53
% # Other redundant clauses eliminated : 22
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 0
% # Backward-rewritten : 6
% # Generated clauses : 127
% # ...of the previous two non-trivial : 90
% # Contextual simplify-reflections : 0
% # Paramodulations : 88
% # Factorizations : 14
% # Equation resolutions : 25
% # Current number of processed clauses: 30
% # Positive orientable unit clauses: 5
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 5
% # Non-unit-clauses : 19
% # Current number of unprocessed clauses: 40
% # ...number of literals in the above : 158
% # Clause-clause subsumption calls (NU) : 131
% # Rec. Clause-clause subsumption calls : 95
% # 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: 23 leaves, 1.78+/-1.317 terms/leaf
% # Paramod-from index: 10 leaves, 1.40+/-0.490 terms/leaf
% # Paramod-into index: 22 leaves, 1.59+/-1.114 terms/leaf
% # -------------------------------------------------
% # User time : 0.014 s
% # System time : 0.002 s
% # Total time : 0.016 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/SystemOnTPTP24996/SEU159+1.tptp
%
%------------------------------------------------------------------------------