TSTP Solution File: SET175+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET175+3 : 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:07:39 EST 2010
% Result : Theorem 4.11s
% Output : Solution 4.11s
% 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/SystemOnTPTP27916/SET175+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP27916/SET175+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP27916/SET175+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 28012
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:union(X1,X2)=union(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_union)).
% fof(2, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(3, axiom,![X1]:![X2]:![X3]:(member(X3,union(X1,X2))<=>(member(X3,X1)|member(X3,X2))),file('/tmp/SRASS.s.p', union_defn)).
% fof(4, axiom,![X1]:![X2]:![X3]:(member(X3,intersection(X1,X2))<=>(member(X3,X1)&member(X3,X2))),file('/tmp/SRASS.s.p', intersection_defn)).
% fof(6, axiom,![X1]:![X2]:(X1=X2<=>![X3]:(member(X3,X1)<=>member(X3,X2))),file('/tmp/SRASS.s.p', equal_member_defn)).
% fof(7, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(8, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(9, conjecture,![X1]:![X2]:union(X1,intersection(X1,X2))=X1,file('/tmp/SRASS.s.p', prove_absorbtion_for_union)).
% fof(10, negated_conjecture,~(![X1]:![X2]:union(X1,intersection(X1,X2))=X1),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(12,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[11])).
% fof(13, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[2])).
% cnf(14,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[13])).
% fof(15, plain,![X1]:![X2]:![X3]:((~(member(X3,union(X1,X2)))|(member(X3,X1)|member(X3,X2)))&((~(member(X3,X1))&~(member(X3,X2)))|member(X3,union(X1,X2)))),inference(fof_nnf,[status(thm)],[3])).
% fof(16, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))&~(member(X6,X5)))|member(X6,union(X4,X5)))),inference(variable_rename,[status(thm)],[15])).
% fof(17, plain,![X4]:![X5]:![X6]:((~(member(X6,union(X4,X5)))|(member(X6,X4)|member(X6,X5)))&((~(member(X6,X4))|member(X6,union(X4,X5)))&(~(member(X6,X5))|member(X6,union(X4,X5))))),inference(distribute,[status(thm)],[16])).
% cnf(18,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[17])).
% cnf(20,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[17])).
% fof(21, plain,![X1]:![X2]:![X3]:((~(member(X3,intersection(X1,X2)))|(member(X3,X1)&member(X3,X2)))&((~(member(X3,X1))|~(member(X3,X2)))|member(X3,intersection(X1,X2)))),inference(fof_nnf,[status(thm)],[4])).
% fof(22, plain,![X4]:![X5]:![X6]:((~(member(X6,intersection(X4,X5)))|(member(X6,X4)&member(X6,X5)))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(variable_rename,[status(thm)],[21])).
% fof(23, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,intersection(X4,X5))))&(member(X6,X5)|~(member(X6,intersection(X4,X5)))))&((~(member(X6,X4))|~(member(X6,X5)))|member(X6,intersection(X4,X5)))),inference(distribute,[status(thm)],[22])).
% cnf(24,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[23])).
% cnf(25,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[23])).
% cnf(26,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[23])).
% fof(29, plain,![X1]:![X2]:((~(X1=X2)|![X3]:((~(member(X3,X1))|member(X3,X2))&(~(member(X3,X2))|member(X3,X1))))&(?[X3]:((~(member(X3,X1))|~(member(X3,X2)))&(member(X3,X1)|member(X3,X2)))|X1=X2)),inference(fof_nnf,[status(thm)],[6])).
% fof(30, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(?[X7]:((~(member(X7,X4))|~(member(X7,X5)))&(member(X7,X4)|member(X7,X5)))|X4=X5)),inference(variable_rename,[status(thm)],[29])).
% fof(31, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))&(member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5)))|X4=X5)),inference(skolemize,[status(esa)],[30])).
% fof(32, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4)))|~(X4=X5))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))&(member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5)))|X4=X5)),inference(shift_quantors,[status(thm)],[31])).
% fof(33, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))|~(X4=X5))&((~(member(X6,X5))|member(X6,X4))|~(X4=X5)))&(((~(member(esk1_2(X4,X5),X4))|~(member(esk1_2(X4,X5),X5)))|X4=X5)&((member(esk1_2(X4,X5),X4)|member(esk1_2(X4,X5),X5))|X4=X5))),inference(distribute,[status(thm)],[32])).
% cnf(34,plain,(X1=X2|member(esk1_2(X1,X2),X2)|member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% cnf(35,plain,(X1=X2|~member(esk1_2(X1,X2),X2)|~member(esk1_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[33])).
% fof(38, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[7])).
% fof(39, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[38])).
% fof(40, plain,![X3]:![X4]:(((subset(X3,X4)|~(X3=X4))&(subset(X4,X3)|~(X3=X4)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(distribute,[status(thm)],[39])).
% cnf(41,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[40])).
% fof(44, plain,![X1]:![X2]:((~(subset(X1,X2))|![X3]:(~(member(X3,X1))|member(X3,X2)))&(?[X3]:(member(X3,X1)&~(member(X3,X2)))|subset(X1,X2))),inference(fof_nnf,[status(thm)],[8])).
% fof(45, 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)],[44])).
% fof(46, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[45])).
% fof(47, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)&~(member(esk2_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[46])).
% fof(48, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk2_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk2_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[47])).
% cnf(49,plain,(subset(X1,X2)|~member(esk2_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[48])).
% cnf(50,plain,(subset(X1,X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[48])).
% cnf(51,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[48])).
% fof(52, negated_conjecture,?[X1]:?[X2]:~(union(X1,intersection(X1,X2))=X1),inference(fof_nnf,[status(thm)],[10])).
% fof(53, negated_conjecture,?[X3]:?[X4]:~(union(X3,intersection(X3,X4))=X3),inference(variable_rename,[status(thm)],[52])).
% fof(54, negated_conjecture,~(union(esk3_0,intersection(esk3_0,esk4_0))=esk3_0),inference(skolemize,[status(esa)],[53])).
% cnf(55,negated_conjecture,(union(esk3_0,intersection(esk3_0,esk4_0))!=esk3_0),inference(split_conjunct,[status(thm)],[54])).
% cnf(66,plain,(member(esk2_2(intersection(X1,X2),X3),X2)|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[25,50,theory(equality)])).
% cnf(70,plain,(subset(X1,union(X2,X3))|~member(esk2_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[49,18,theory(equality)])).
% cnf(75,plain,(subset(X1,intersection(X2,X3))|~member(esk2_2(X1,intersection(X2,X3)),X3)|~member(esk2_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[49,24,theory(equality)])).
% cnf(87,plain,(member(esk1_2(X1,intersection(X2,X3)),X2)|X1=intersection(X2,X3)|member(esk1_2(X1,intersection(X2,X3)),X1)),inference(spm,[status(thm)],[26,34,theory(equality)])).
% cnf(93,plain,(X1=intersection(X2,X3)|~member(esk1_2(X1,intersection(X2,X3)),X1)|~member(esk1_2(X1,intersection(X2,X3)),X3)|~member(esk1_2(X1,intersection(X2,X3)),X2)),inference(spm,[status(thm)],[35,24,theory(equality)])).
% cnf(100,plain,(subset(intersection(X1,X2),X2)),inference(spm,[status(thm)],[49,66,theory(equality)])).
% cnf(105,plain,(subset(intersection(X2,X1),X2)),inference(spm,[status(thm)],[100,14,theory(equality)])).
% cnf(130,plain,(subset(intersection(X1,X2),union(X3,X2))),inference(spm,[status(thm)],[70,66,theory(equality)])).
% cnf(152,plain,(member(X1,union(X2,X3))|~member(X1,intersection(X4,X3))),inference(spm,[status(thm)],[51,130,theory(equality)])).
% cnf(192,plain,(subset(X1,intersection(X2,X1))|~member(esk2_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[75,50,theory(equality)])).
% cnf(225,plain,(X4=intersection(X4,X5)|member(esk1_2(X4,intersection(X4,X5)),X4)),inference(ef,[status(thm)],[87,theory(equality)])).
% cnf(239,plain,(member(esk1_2(union(X1,X2),intersection(union(X1,X2),X3)),X2)|member(esk1_2(union(X1,X2),intersection(union(X1,X2),X3)),X1)|intersection(union(X1,X2),X3)=union(X1,X2)),inference(spm,[status(thm)],[20,225,theory(equality)])).
% cnf(240,plain,(intersection(X2,X1)=X1|member(esk1_2(X1,intersection(X2,X1)),X1)),inference(spm,[status(thm)],[225,14,theory(equality)])).
% cnf(257,plain,(member(esk2_2(intersection(X1,X2),X3),union(X4,X2))|subset(intersection(X1,X2),X3)),inference(spm,[status(thm)],[152,50,theory(equality)])).
% cnf(564,plain,(X1=intersection(X1,X2)|~member(esk1_2(X1,intersection(X1,X2)),X2)|~member(esk1_2(X1,intersection(X1,X2)),X1)),inference(spm,[status(thm)],[93,225,theory(equality)])).
% cnf(565,plain,(X1=intersection(X2,X1)|~member(esk1_2(X1,intersection(X2,X1)),X1)|~member(esk1_2(X1,intersection(X2,X1)),X2)),inference(spm,[status(thm)],[93,240,theory(equality)])).
% cnf(1255,plain,(subset(intersection(X1,X2),intersection(union(X3,X2),intersection(X1,X2)))),inference(spm,[status(thm)],[192,257,theory(equality)])).
% cnf(1271,plain,(subset(X1,intersection(X1,X1))),inference(spm,[status(thm)],[192,50,theory(equality)])).
% cnf(1272,plain,(intersection(X1,X1)=X1|~subset(intersection(X1,X1),X1)),inference(spm,[status(thm)],[41,1271,theory(equality)])).
% cnf(1278,plain,(intersection(X1,X1)=X1|$false),inference(rw,[status(thm)],[1272,105,theory(equality)])).
% cnf(1279,plain,(intersection(X1,X1)=X1),inference(cn,[status(thm)],[1278,theory(equality)])).
% cnf(1784,plain,(intersection(union(X1,X2),intersection(X3,X2))=intersection(X3,X2)|~subset(intersection(union(X1,X2),intersection(X3,X2)),intersection(X3,X2))),inference(spm,[status(thm)],[41,1255,theory(equality)])).
% cnf(1802,plain,(intersection(union(X1,X2),intersection(X3,X2))=intersection(X3,X2)|$false),inference(rw,[status(thm)],[1784,100,theory(equality)])).
% cnf(1803,plain,(intersection(union(X1,X2),intersection(X3,X2))=intersection(X3,X2)),inference(cn,[status(thm)],[1802,theory(equality)])).
% cnf(1901,plain,(intersection(union(X1,X2),X2)=X2),inference(spm,[status(thm)],[1803,1279,theory(equality)])).
% cnf(1971,plain,(intersection(X2,union(X1,X2))=X2),inference(rw,[status(thm)],[1901,14,theory(equality)])).
% cnf(76942,plain,(intersection(X1,X2)=X1|~member(esk1_2(X1,intersection(X1,X2)),X2)),inference(csr,[status(thm)],[564,225])).
% cnf(77002,plain,(intersection(union(X1,X2),X2)=union(X1,X2)|member(esk1_2(union(X1,X2),intersection(union(X1,X2),X2)),X1)),inference(spm,[status(thm)],[76942,239,theory(equality)])).
% cnf(77059,plain,(X2=union(X1,X2)|member(esk1_2(union(X1,X2),intersection(union(X1,X2),X2)),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77002,14,theory(equality)]),1971,theory(equality)])).
% cnf(77060,plain,(X2=union(X1,X2)|member(esk1_2(union(X1,X2),X2),X1)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[77059,14,theory(equality)]),1971,theory(equality)])).
% cnf(77098,plain,(intersection(X2,X1)=X1|~member(esk1_2(X1,intersection(X2,X1)),X2)),inference(csr,[status(thm)],[565,240])).
% cnf(77139,plain,(X1=union(X2,X1)|~member(esk1_2(union(X2,X1),X1),X1)),inference(spm,[status(thm)],[77098,1971,theory(equality)])).
% cnf(131917,plain,(member(esk1_2(union(intersection(X1,X2),X3),X3),X1)|union(intersection(X1,X2),X3)=X3),inference(spm,[status(thm)],[26,77060,theory(equality)])).
% cnf(132516,plain,(union(intersection(X1,X2),X1)=X1),inference(spm,[status(thm)],[77139,131917,theory(equality)])).
% cnf(132520,plain,(union(X1,intersection(X1,X2))=X1),inference(rw,[status(thm)],[132516,12,theory(equality)])).
% cnf(133436,negated_conjecture,($false),inference(rw,[status(thm)],[55,132520,theory(equality)])).
% cnf(133437,negated_conjecture,($false),inference(cn,[status(thm)],[133436,theory(equality)])).
% cnf(133438,negated_conjecture,($false),133437,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 2903
% # ...of these trivial : 902
% # ...subsumed : 1289
% # ...remaining for further processing: 712
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 2
% # Backward-rewritten : 29
% # Generated clauses : 97978
% # ...of the previous two non-trivial : 63744
% # Contextual simplify-reflections : 20
% # Paramodulations : 97490
% # Factorizations : 486
% # Equation resolutions : 2
% # Current number of processed clauses: 679
% # Positive orientable unit clauses: 387
% # Positive unorientable unit clauses: 2
% # Negative unit clauses : 0
% # Non-unit-clauses : 290
% # Current number of unprocessed clauses: 59907
% # ...number of literals in the above : 144916
% # Clause-clause subsumption calls (NU) : 23042
% # Rec. Clause-clause subsumption calls : 10397
% # Unit Clause-clause subsumption calls : 4929
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 4217
% # Indexed BW rewrite successes : 32
% # Backwards rewriting index: 195 leaves, 6.08+/-7.480 terms/leaf
% # Paramod-from index: 92 leaves, 7.02+/-6.711 terms/leaf
% # Paramod-into index: 184 leaves, 6.20+/-7.616 terms/leaf
% # -------------------------------------------------
% # User time : 1.845 s
% # System time : 0.068 s
% # Total time : 1.913 s
% # Maximum resident set size: 0 pages
% PrfWatch: 3.33 CPU 3.69 WC
% FINAL PrfWatch: 3.33 CPU 3.69 WC
% SZS output end Solution for /tmp/SystemOnTPTP27916/SET175+3.tptp
%
%------------------------------------------------------------------------------