TSTP Solution File: SET701+4 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET701+4 : TPTP v5.0.0. Released v2.2.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art02.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 : Wed Dec 29 23:32:14 EST 2010
% Result : Theorem 41.64s
% Output : Solution 41.64s
% 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/SystemOnTPTP10529/SET701+4.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP10529/SET701+4.tptp
% SZS output start Solution for /tmp/SystemOnTPTP10529/SET701+4.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 10625
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.91 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.90 CPU 6.02 WC
% PrfWatch: 7.89 CPU 8.02 WC
% PrfWatch: 9.89 CPU 10.03 WC
% PrfWatch: 11.88 CPU 12.03 WC
% PrfWatch: 13.87 CPU 14.04 WC
% PrfWatch: 15.67 CPU 16.05 WC
% PrfWatch: 17.26 CPU 18.13 WC
% PrfWatch: 19.21 CPU 20.13 WC
% PrfWatch: 21.21 CPU 22.14 WC
% PrfWatch: 23.20 CPU 24.14 WC
% PrfWatch: 25.19 CPU 26.15 WC
% PrfWatch: 27.19 CPU 28.15 WC
% PrfWatch: 29.18 CPU 30.16 WC
% PrfWatch: 31.17 CPU 32.16 WC
% PrfWatch: 33.16 CPU 34.16 WC
% PrfWatch: 35.16 CPU 36.17 WC
% PrfWatch: 37.15 CPU 38.17 WC
% # Preprocessing time : 0.014 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 39.14 CPU 40.18 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:![X3]:(member(X1,intersection(X2,X3))<=>(member(X1,X2)&member(X1,X3))),file('/tmp/SRASS.s.p', intersection)).
% fof(2, axiom,![X3]:![X2]:![X4]:(member(X3,difference(X4,X2))<=>(member(X3,X4)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference)).
% fof(3, axiom,![X2]:![X3]:(subset(X2,X3)<=>![X1]:(member(X1,X2)=>member(X1,X3))),file('/tmp/SRASS.s.p', subset)).
% fof(7, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set)).
% fof(8, axiom,![X1]:![X2]:(member(X1,sum(X2))<=>?[X5]:(member(X5,X2)&member(X1,X5))),file('/tmp/SRASS.s.p', sum)).
% fof(12, conjecture,![X2]:![X3]:![X6]:![X4]:((subset(X2,X4)&subset(X3,X4))=>(subset(X2,X3)<=>subset(intersection(X2,difference(X4,X3)),intersection(X6,difference(X4,X6))))),file('/tmp/SRASS.s.p', thI35)).
% fof(13, negated_conjecture,~(![X2]:![X3]:![X6]:![X4]:((subset(X2,X4)&subset(X3,X4))=>(subset(X2,X3)<=>subset(intersection(X2,difference(X4,X3)),intersection(X6,difference(X4,X6)))))),inference(assume_negation,[status(cth)],[12])).
% fof(14, plain,![X3]:![X2]:![X4]:(member(X3,difference(X4,X2))<=>(member(X3,X4)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(15, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[7,theory(equality)])).
% fof(16, plain,![X1]:![X2]:![X3]:((~(member(X1,intersection(X2,X3)))|(member(X1,X2)&member(X1,X3)))&((~(member(X1,X2))|~(member(X1,X3)))|member(X1,intersection(X2,X3)))),inference(fof_nnf,[status(thm)],[1])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X4,intersection(X5,X6)))|(member(X4,X5)&member(X4,X6)))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(variable_rename,[status(thm)],[16])).
% fof(18, plain,![X4]:![X5]:![X6]:(((member(X4,X5)|~(member(X4,intersection(X5,X6))))&(member(X4,X6)|~(member(X4,intersection(X5,X6)))))&((~(member(X4,X5))|~(member(X4,X6)))|member(X4,intersection(X5,X6)))),inference(distribute,[status(thm)],[17])).
% cnf(19,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[18])).
% cnf(20,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% cnf(21,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[18])).
% fof(22, plain,![X3]:![X2]:![X4]:((~(member(X3,difference(X4,X2)))|(member(X3,X4)&~(member(X3,X2))))&((~(member(X3,X4))|member(X3,X2))|member(X3,difference(X4,X2)))),inference(fof_nnf,[status(thm)],[14])).
% fof(23, plain,![X5]:![X6]:![X7]:((~(member(X5,difference(X7,X6)))|(member(X5,X7)&~(member(X5,X6))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),inference(variable_rename,[status(thm)],[22])).
% fof(24, plain,![X5]:![X6]:![X7]:(((member(X5,X7)|~(member(X5,difference(X7,X6))))&(~(member(X5,X6))|~(member(X5,difference(X7,X6)))))&((~(member(X5,X7))|member(X5,X6))|member(X5,difference(X7,X6)))),inference(distribute,[status(thm)],[23])).
% cnf(25,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[24])).
% cnf(26,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[24])).
% cnf(27,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[24])).
% fof(28, plain,![X2]:![X3]:((~(subset(X2,X3))|![X1]:(~(member(X1,X2))|member(X1,X3)))&(?[X1]:(member(X1,X2)&~(member(X1,X3)))|subset(X2,X3))),inference(fof_nnf,[status(thm)],[3])).
% fof(29, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&(?[X7]:(member(X7,X4)&~(member(X7,X5)))|subset(X4,X5))),inference(variable_rename,[status(thm)],[28])).
% fof(30, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[29])).
% fof(31, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)&~(member(esk1_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk1_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk1_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[31])).
% cnf(33,plain,(subset(X1,X2)|~member(esk1_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[32])).
% cnf(34,plain,(subset(X1,X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[32])).
% cnf(35,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[32])).
% fof(52, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[15])).
% cnf(53,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[52])).
% fof(54, plain,![X1]:![X2]:((~(member(X1,sum(X2)))|?[X5]:(member(X5,X2)&member(X1,X5)))&(![X5]:(~(member(X5,X2))|~(member(X1,X5)))|member(X1,sum(X2)))),inference(fof_nnf,[status(thm)],[8])).
% fof(55, plain,![X6]:![X7]:((~(member(X6,sum(X7)))|?[X8]:(member(X8,X7)&member(X6,X8)))&(![X9]:(~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))),inference(variable_rename,[status(thm)],[54])).
% fof(56, plain,![X6]:![X7]:((~(member(X6,sum(X7)))|(member(esk2_2(X6,X7),X7)&member(X6,esk2_2(X6,X7))))&(![X9]:(~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))),inference(skolemize,[status(esa)],[55])).
% fof(57, plain,![X6]:![X7]:![X9]:(((~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))&(~(member(X6,sum(X7)))|(member(esk2_2(X6,X7),X7)&member(X6,esk2_2(X6,X7))))),inference(shift_quantors,[status(thm)],[56])).
% fof(58, plain,![X6]:![X7]:![X9]:(((~(member(X9,X7))|~(member(X6,X9)))|member(X6,sum(X7)))&((member(esk2_2(X6,X7),X7)|~(member(X6,sum(X7))))&(member(X6,esk2_2(X6,X7))|~(member(X6,sum(X7)))))),inference(distribute,[status(thm)],[57])).
% cnf(60,plain,(member(esk2_2(X1,X2),X2)|~member(X1,sum(X2))),inference(split_conjunct,[status(thm)],[58])).
% fof(80, negated_conjecture,?[X2]:?[X3]:?[X6]:?[X4]:((subset(X2,X4)&subset(X3,X4))&((~(subset(X2,X3))|~(subset(intersection(X2,difference(X4,X3)),intersection(X6,difference(X4,X6)))))&(subset(X2,X3)|subset(intersection(X2,difference(X4,X3)),intersection(X6,difference(X4,X6)))))),inference(fof_nnf,[status(thm)],[13])).
% fof(81, negated_conjecture,?[X7]:?[X8]:?[X9]:?[X10]:((subset(X7,X10)&subset(X8,X10))&((~(subset(X7,X8))|~(subset(intersection(X7,difference(X10,X8)),intersection(X9,difference(X10,X9)))))&(subset(X7,X8)|subset(intersection(X7,difference(X10,X8)),intersection(X9,difference(X10,X9)))))),inference(variable_rename,[status(thm)],[80])).
% fof(82, negated_conjecture,((subset(esk4_0,esk7_0)&subset(esk5_0,esk7_0))&((~(subset(esk4_0,esk5_0))|~(subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))))&(subset(esk4_0,esk5_0)|subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))))),inference(skolemize,[status(esa)],[81])).
% cnf(83,negated_conjecture,(subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,negated_conjecture,(~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|~subset(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(85,negated_conjecture,(subset(esk5_0,esk7_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(86,negated_conjecture,(subset(esk4_0,esk7_0)),inference(split_conjunct,[status(thm)],[82])).
% cnf(96,plain,(member(esk1_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[27,34,theory(equality)])).
% cnf(97,plain,(subset(difference(X1,X2),X3)|~member(esk1_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[26,34,theory(equality)])).
% cnf(98,plain,(member(esk1_2(intersection(X1,X2),X3),X1)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[21,34,theory(equality)])).
% cnf(99,plain,(member(esk1_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[20,34,theory(equality)])).
% cnf(105,negated_conjecture,(member(X1,esk7_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[35,85,theory(equality)])).
% cnf(106,negated_conjecture,(member(X1,esk7_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[35,86,theory(equality)])).
% cnf(107,negated_conjecture,(member(X1,intersection(esk6_0,difference(esk7_0,esk6_0)))|subset(esk4_0,esk5_0)|~member(X1,intersection(esk4_0,difference(esk7_0,esk5_0)))),inference(spm,[status(thm)],[35,83,theory(equality)])).
% cnf(109,plain,(subset(X1,difference(X2,X3))|member(esk1_2(X1,difference(X2,X3)),X3)|~member(esk1_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[33,25,theory(equality)])).
% cnf(125,plain,(~member(X1,sum(empty_set))),inference(spm,[status(thm)],[53,60,theory(equality)])).
% cnf(159,plain,(~member(X1,sum(sum(empty_set)))),inference(spm,[status(thm)],[125,60,theory(equality)])).
% cnf(175,plain,(subset(difference(X1,difference(X2,X3)),X4)|member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)|~member(esk1_2(difference(X1,difference(X2,X3)),X4),X2)),inference(spm,[status(thm)],[97,25,theory(equality)])).
% cnf(185,negated_conjecture,(member(esk1_2(esk5_0,X1),esk7_0)|subset(esk5_0,X1)),inference(spm,[status(thm)],[105,34,theory(equality)])).
% cnf(235,negated_conjecture,(member(esk1_2(difference(esk4_0,X1),X2),esk7_0)|subset(difference(esk4_0,X1),X2)),inference(spm,[status(thm)],[106,96,theory(equality)])).
% cnf(252,plain,(subset(difference(X1,X1),X2)),inference(spm,[status(thm)],[97,96,theory(equality)])).
% cnf(253,plain,(member(X1,X2)|~member(X1,difference(X3,X3))),inference(spm,[status(thm)],[35,252,theory(equality)])).
% cnf(393,plain,(subset(intersection(X1,difference(X2,X3)),X4)|~member(esk1_2(intersection(X1,difference(X2,X3)),X4),X3)),inference(spm,[status(thm)],[26,99,theory(equality)])).
% cnf(853,negated_conjecture,(subset(esk5_0,difference(esk7_0,X1))|member(esk1_2(esk5_0,difference(esk7_0,X1)),X1)),inference(spm,[status(thm)],[109,185,theory(equality)])).
% cnf(862,plain,(subset(intersection(X1,X2),difference(X1,X3))|member(esk1_2(intersection(X1,X2),difference(X1,X3)),X3)),inference(spm,[status(thm)],[109,98,theory(equality)])).
% cnf(1101,negated_conjecture,(member(esk1_2(esk5_0,difference(esk7_0,difference(X1,X1))),X2)|subset(esk5_0,difference(esk7_0,difference(X1,X1)))),inference(spm,[status(thm)],[253,853,theory(equality)])).
% cnf(4844,negated_conjecture,(subset(difference(esk4_0,difference(esk7_0,X1)),X2)|member(esk1_2(difference(esk4_0,difference(esk7_0,X1)),X2),X1)),inference(spm,[status(thm)],[175,235,theory(equality)])).
% cnf(6405,negated_conjecture,(subset(esk5_0,difference(esk7_0,difference(X1,X1)))),inference(spm,[status(thm)],[159,1101,theory(equality)])).
% cnf(6476,negated_conjecture,(member(X1,difference(esk7_0,difference(X2,X2)))|~member(X1,esk5_0)),inference(spm,[status(thm)],[35,6405,theory(equality)])).
% cnf(6508,negated_conjecture,(~member(X1,difference(X2,X2))|~member(X1,esk5_0)),inference(spm,[status(thm)],[26,6476,theory(equality)])).
% cnf(6509,negated_conjecture,(~member(X1,difference(X2,X2))),inference(csr,[status(thm)],[6508,253])).
% cnf(9603,negated_conjecture,(subset(difference(esk4_0,difference(esk7_0,X1)),X1)),inference(spm,[status(thm)],[33,4844,theory(equality)])).
% cnf(9605,negated_conjecture,(member(X1,X2)|~member(X1,difference(esk4_0,difference(esk7_0,X2)))),inference(spm,[status(thm)],[35,9603,theory(equality)])).
% cnf(10910,negated_conjecture,(member(X1,X2)|member(X1,difference(esk7_0,X2))|~member(X1,esk4_0)),inference(spm,[status(thm)],[9605,25,theory(equality)])).
% cnf(47256,plain,(subset(intersection(X1,difference(X2,X3)),difference(X1,X3))),inference(spm,[status(thm)],[393,862,theory(equality)])).
% cnf(47269,plain,(member(X1,difference(X2,X3))|~member(X1,intersection(X2,difference(X4,X3)))),inference(spm,[status(thm)],[35,47256,theory(equality)])).
% cnf(189135,negated_conjecture,(member(X1,difference(esk6_0,esk6_0))|subset(esk4_0,esk5_0)|~member(X1,intersection(esk4_0,difference(esk7_0,esk5_0)))),inference(spm,[status(thm)],[47269,107,theory(equality)])).
% cnf(189138,negated_conjecture,(subset(esk4_0,esk5_0)|~member(X1,intersection(esk4_0,difference(esk7_0,esk5_0)))),inference(sr,[status(thm)],[189135,6509,theory(equality)])).
% cnf(189255,negated_conjecture,(subset(esk4_0,esk5_0)|~member(X1,difference(esk7_0,esk5_0))|~member(X1,esk4_0)),inference(spm,[status(thm)],[189138,19,theory(equality)])).
% cnf(190253,negated_conjecture,(subset(esk4_0,esk5_0)|member(X1,esk5_0)|~member(X1,esk4_0)),inference(spm,[status(thm)],[189255,10910,theory(equality)])).
% cnf(190256,negated_conjecture,(member(X1,esk5_0)|~member(X1,esk4_0)),inference(csr,[status(thm)],[190253,35])).
% cnf(190334,negated_conjecture,(member(esk1_2(intersection(esk4_0,X1),X2),esk5_0)|subset(intersection(esk4_0,X1),X2)),inference(spm,[status(thm)],[190256,98,theory(equality)])).
% cnf(190372,negated_conjecture,(member(esk1_2(esk4_0,X1),esk5_0)|subset(esk4_0,X1)),inference(spm,[status(thm)],[190256,34,theory(equality)])).
% cnf(190449,negated_conjecture,(subset(esk4_0,esk5_0)),inference(spm,[status(thm)],[33,190372,theory(equality)])).
% cnf(190510,negated_conjecture,(~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))|$false),inference(rw,[status(thm)],[84,190449,theory(equality)])).
% cnf(190511,negated_conjecture,(~subset(intersection(esk4_0,difference(esk7_0,esk5_0)),intersection(esk6_0,difference(esk7_0,esk6_0)))),inference(cn,[status(thm)],[190510,theory(equality)])).
% cnf(191890,negated_conjecture,(subset(intersection(esk4_0,difference(X1,esk5_0)),X2)),inference(spm,[status(thm)],[393,190334,theory(equality)])).
% cnf(191912,negated_conjecture,($false),inference(rw,[status(thm)],[190511,191890,theory(equality)])).
% cnf(191913,negated_conjecture,($false),inference(cn,[status(thm)],[191912,theory(equality)])).
% cnf(191914,negated_conjecture,($false),191913,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11293
% # ...of these trivial : 193
% # ...subsumed : 592
% # ...remaining for further processing: 10508
% # Other redundant clauses eliminated : 39
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 51
% # Backward-rewritten : 214
% # Generated clauses : 189384
% # ...of the previous two non-trivial : 187531
% # Contextual simplify-reflections : 57
% # Paramodulations : 189291
% # Factorizations : 54
% # Equation resolutions : 39
% # Current number of processed clauses: 10207
% # Positive orientable unit clauses: 9398
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 156
% # Non-unit-clauses : 653
% # Current number of unprocessed clauses: 126743
% # ...number of literals in the above : 221389
% # Clause-clause subsumption calls (NU) : 16234
% # Rec. Clause-clause subsumption calls : 15176
% # Unit Clause-clause subsumption calls : 14803
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 1048721
% # Indexed BW rewrite successes : 163
% # Backwards rewriting index: 1571 leaves, 12.25+/-33.957 terms/leaf
% # Paramod-from index: 608 leaves, 15.90+/-44.548 terms/leaf
% # Paramod-into index: 1439 leaves, 13.08+/-35.093 terms/leaf
% # -------------------------------------------------
% # User time : 37.587 s
% # System time : 0.266 s
% # Total time : 37.853 s
% # Maximum resident set size: 0 pages
% PrfWatch: 40.74 CPU 41.79 WC
% FINAL PrfWatch: 40.74 CPU 41.79 WC
% SZS output end Solution for /tmp/SystemOnTPTP10529/SET701+4.tptp
%
%------------------------------------------------------------------------------