TSTP Solution File: SEU159+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU159+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 : 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:16 EST 2010
% Result : Theorem 2.04s
% Output : Solution 2.04s
% 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/SystemOnTPTP20584/SEU159+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20584/SEU159+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20584/SEU159+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 20680
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.024 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]:![X3]:(X3=unordered_pair(X1,X2)<=>![X4]:(in(X4,X3)<=>(X4=X1|X4=X2))),file('/tmp/SRASS.s.p', d2_tarski)).
% fof(55, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(89, 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(90, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(unordered_pair(X1,X2),X3)<=>(in(X1,X3)&in(X2,X3)))),inference(assume_negation,[status(cth)],[89])).
% fof(106, 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(107, 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)],[106])).
% fof(108, 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)],[107])).
% fof(109, 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)],[108])).
% fof(110, 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)],[109])).
% cnf(111,plain,(subset(X1,X2)|~in(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[110])).
% cnf(112,plain,(subset(X1,X2)|in(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[110])).
% cnf(113,plain,(in(X3,X2)|~subset(X1,X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[110])).
% fof(119, 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)],[5])).
% fof(120, 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)],[119])).
% fof(121, 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)],[120])).
% fof(122, 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)],[121])).
% fof(123, 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)],[122])).
% cnf(127,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[123])).
% cnf(128,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[123])).
% cnf(129,plain,(X4=X3|X4=X2|X1!=unordered_pair(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[123])).
% fof(332, plain,![X1]:![X2]:((~(set_difference(X1,X2)=empty_set)|subset(X1,X2))&(~(subset(X1,X2))|set_difference(X1,X2)=empty_set)),inference(fof_nnf,[status(thm)],[55])).
% fof(333, plain,![X3]:![X4]:((~(set_difference(X3,X4)=empty_set)|subset(X3,X4))&(~(subset(X3,X4))|set_difference(X3,X4)=empty_set)),inference(variable_rename,[status(thm)],[332])).
% cnf(334,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[333])).
% cnf(335,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[333])).
% fof(422, 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)],[90])).
% fof(423, 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)],[422])).
% fof(424, negated_conjecture,((~(subset(unordered_pair(esk22_0,esk23_0),esk24_0))|(~(in(esk22_0,esk24_0))|~(in(esk23_0,esk24_0))))&(subset(unordered_pair(esk22_0,esk23_0),esk24_0)|(in(esk22_0,esk24_0)&in(esk23_0,esk24_0)))),inference(skolemize,[status(esa)],[423])).
% fof(425, negated_conjecture,((~(subset(unordered_pair(esk22_0,esk23_0),esk24_0))|(~(in(esk22_0,esk24_0))|~(in(esk23_0,esk24_0))))&((in(esk22_0,esk24_0)|subset(unordered_pair(esk22_0,esk23_0),esk24_0))&(in(esk23_0,esk24_0)|subset(unordered_pair(esk22_0,esk23_0),esk24_0)))),inference(distribute,[status(thm)],[424])).
% cnf(426,negated_conjecture,(subset(unordered_pair(esk22_0,esk23_0),esk24_0)|in(esk23_0,esk24_0)),inference(split_conjunct,[status(thm)],[425])).
% cnf(427,negated_conjecture,(subset(unordered_pair(esk22_0,esk23_0),esk24_0)|in(esk22_0,esk24_0)),inference(split_conjunct,[status(thm)],[425])).
% cnf(428,negated_conjecture,(~in(esk23_0,esk24_0)|~in(esk22_0,esk24_0)|~subset(unordered_pair(esk22_0,esk23_0),esk24_0)),inference(split_conjunct,[status(thm)],[425])).
% cnf(482,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[127,theory(equality)])).
% cnf(484,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[128,theory(equality)])).
% cnf(611,plain,(set_difference(X1,X2)=empty_set|~in(esk1_2(X1,X2),X2)),inference(spm,[status(thm)],[334,111,theory(equality)])).
% cnf(646,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[482,theory(equality)])).
% cnf(650,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[484,theory(equality)])).
% cnf(681,negated_conjecture,(in(X1,esk24_0)|in(esk22_0,esk24_0)|~in(X1,unordered_pair(esk22_0,esk23_0))),inference(spm,[status(thm)],[113,427,theory(equality)])).
% cnf(682,negated_conjecture,(in(X1,esk24_0)|in(esk23_0,esk24_0)|~in(X1,unordered_pair(esk22_0,esk23_0))),inference(spm,[status(thm)],[113,426,theory(equality)])).
% cnf(895,plain,(X1=X2|X3=X2|~in(X2,unordered_pair(X3,X1))),inference(er,[status(thm)],[129,theory(equality)])).
% cnf(2679,negated_conjecture,(in(esk22_0,esk24_0)),inference(spm,[status(thm)],[681,650,theory(equality)])).
% cnf(2697,negated_conjecture,(~subset(unordered_pair(esk22_0,esk23_0),esk24_0)|$false|~in(esk23_0,esk24_0)),inference(rw,[status(thm)],[428,2679,theory(equality)])).
% cnf(2698,negated_conjecture,(~subset(unordered_pair(esk22_0,esk23_0),esk24_0)|~in(esk23_0,esk24_0)),inference(cn,[status(thm)],[2697,theory(equality)])).
% cnf(3011,negated_conjecture,(in(esk23_0,esk24_0)),inference(spm,[status(thm)],[682,646,theory(equality)])).
% cnf(3032,negated_conjecture,(~subset(unordered_pair(esk22_0,esk23_0),esk24_0)|$false),inference(rw,[status(thm)],[2698,3011,theory(equality)])).
% cnf(3033,negated_conjecture,(~subset(unordered_pair(esk22_0,esk23_0),esk24_0)),inference(cn,[status(thm)],[3032,theory(equality)])).
% cnf(3045,negated_conjecture,(set_difference(unordered_pair(esk22_0,esk23_0),esk24_0)!=empty_set),inference(spm,[status(thm)],[3033,335,theory(equality)])).
% cnf(3047,negated_conjecture,(in(esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0),unordered_pair(esk22_0,esk23_0))),inference(spm,[status(thm)],[3033,112,theory(equality)])).
% cnf(3048,negated_conjecture,(~in(esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0),esk24_0)),inference(spm,[status(thm)],[3033,111,theory(equality)])).
% cnf(24795,negated_conjecture,(esk22_0=esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)|esk23_0=esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)),inference(spm,[status(thm)],[895,3047,theory(equality)])).
% cnf(24964,negated_conjecture,(set_difference(unordered_pair(esk22_0,esk23_0),esk24_0)=empty_set|esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)=esk22_0|~in(esk23_0,esk24_0)),inference(spm,[status(thm)],[611,24795,theory(equality)])).
% cnf(25011,negated_conjecture,(set_difference(unordered_pair(esk22_0,esk23_0),esk24_0)=empty_set|esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)=esk22_0|$false),inference(rw,[status(thm)],[24964,3011,theory(equality)])).
% cnf(25012,negated_conjecture,(set_difference(unordered_pair(esk22_0,esk23_0),esk24_0)=empty_set|esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)=esk22_0),inference(cn,[status(thm)],[25011,theory(equality)])).
% cnf(25013,negated_conjecture,(esk1_2(unordered_pair(esk22_0,esk23_0),esk24_0)=esk22_0),inference(sr,[status(thm)],[25012,3045,theory(equality)])).
% cnf(25082,negated_conjecture,($false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[3048,25013,theory(equality)]),2679,theory(equality)])).
% cnf(25083,negated_conjecture,($false),inference(cn,[status(thm)],[25082,theory(equality)])).
% cnf(25084,negated_conjecture,($false),25083,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2342
% # ...of these trivial : 54
% # ...subsumed : 1448
% # ...remaining for further processing: 840
% # Other redundant clauses eliminated : 129
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 8
% # Backward-rewritten : 50
% # Generated clauses : 19886
% # ...of the previous two non-trivial : 17078
% # Contextual simplify-reflections : 101
% # Paramodulations : 19704
% # Factorizations : 18
% # Equation resolutions : 164
% # Current number of processed clauses: 649
% # Positive orientable unit clauses: 118
% # Positive unorientable unit clauses: 6
% # Negative unit clauses : 87
% # Non-unit-clauses : 438
% # Current number of unprocessed clauses: 13659
% # ...number of literals in the above : 40208
% # Clause-clause subsumption calls (NU) : 7064
% # Rec. Clause-clause subsumption calls : 6524
% # Unit Clause-clause subsumption calls : 438
% # Rewrite failures with RHS unbound : 16
% # Indexed BW rewrite attempts : 154
% # Indexed BW rewrite successes : 57
% # Backwards rewriting index: 433 leaves, 1.43+/-1.450 terms/leaf
% # Paramod-from index: 206 leaves, 1.25+/-0.532 terms/leaf
% # Paramod-into index: 399 leaves, 1.40+/-1.228 terms/leaf
% # -------------------------------------------------
% # User time : 0.623 s
% # System time : 0.023 s
% # Total time : 0.646 s
% # Maximum resident set size: 0 pages
% PrfWatch: 1.03 CPU 1.12 WC
% FINAL PrfWatch: 1.03 CPU 1.12 WC
% SZS output end Solution for /tmp/SystemOnTPTP20584/SEU159+2.tptp
%
%------------------------------------------------------------------------------