TSTP Solution File: SET611+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET611+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 : art04.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:15:53 EST 2010
% Result : Theorem 14.19s
% Output : Solution 14.19s
% 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/SystemOnTPTP28863/SET611+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP28863/SET611+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP28863/SET611+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 28959
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.54 CPU 4.03 WC
% PrfWatch: 5.16 CPU 6.03 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 7.14 CPU 8.04 WC
% PrfWatch: 9.14 CPU 10.04 WC
% PrfWatch: 11.12 CPU 12.05 WC
% PrfWatch: 13.12 CPU 14.05 WC
% # SZS output start CNFRefutation.
% fof(1, axiom,![X1]:![X2]:intersection(X1,X2)=intersection(X2,X1),file('/tmp/SRASS.s.p', commutativity_of_intersection)).
% fof(2, axiom,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% fof(3, axiom,![X1]:~(member(X1,empty_set)),file('/tmp/SRASS.s.p', empty_set_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(8, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', equal_defn)).
% fof(9, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(member(X3,X1)=>member(X3,X2))),file('/tmp/SRASS.s.p', subset_defn)).
% fof(10, axiom,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),file('/tmp/SRASS.s.p', empty_defn)).
% fof(11, conjecture,![X1]:![X2]:(intersection(X1,X2)=empty_set<=>difference(X1,X2)=X1),file('/tmp/SRASS.s.p', prove_th84)).
% fof(12, negated_conjecture,~(![X1]:![X2]:(intersection(X1,X2)=empty_set<=>difference(X1,X2)=X1)),inference(assume_negation,[status(cth)],[11])).
% fof(13, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(14, plain,![X1]:~(member(X1,empty_set)),inference(fof_simplification,[status(thm)],[3,theory(equality)])).
% fof(15, plain,![X1]:(empty(X1)<=>![X2]:~(member(X2,X1))),inference(fof_simplification,[status(thm)],[10,theory(equality)])).
% fof(16, plain,![X3]:![X4]:intersection(X3,X4)=intersection(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(17,plain,(intersection(X1,X2)=intersection(X2,X1)),inference(split_conjunct,[status(thm)],[16])).
% fof(18, plain,![X1]:![X2]:![X3]:((~(member(X3,difference(X1,X2)))|(member(X3,X1)&~(member(X3,X2))))&((~(member(X3,X1))|member(X3,X2))|member(X3,difference(X1,X2)))),inference(fof_nnf,[status(thm)],[13])).
% fof(19, plain,![X4]:![X5]:![X6]:((~(member(X6,difference(X4,X5)))|(member(X6,X4)&~(member(X6,X5))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(variable_rename,[status(thm)],[18])).
% fof(20, plain,![X4]:![X5]:![X6]:(((member(X6,X4)|~(member(X6,difference(X4,X5))))&(~(member(X6,X5))|~(member(X6,difference(X4,X5)))))&((~(member(X6,X4))|member(X6,X5))|member(X6,difference(X4,X5)))),inference(distribute,[status(thm)],[19])).
% cnf(21,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[20])).
% cnf(22,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[20])).
% cnf(23,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[20])).
% fof(24, plain,![X2]:~(member(X2,empty_set)),inference(variable_rename,[status(thm)],[14])).
% cnf(25,plain,(~member(X1,empty_set)),inference(split_conjunct,[status(thm)],[24])).
% fof(26, 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(27, 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)],[26])).
% fof(28, 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)],[27])).
% cnf(29,plain,(member(X1,intersection(X2,X3))|~member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[28])).
% cnf(30,plain,(member(X1,X3)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% cnf(31,plain,(member(X1,X2)|~member(X1,intersection(X2,X3))),inference(split_conjunct,[status(thm)],[28])).
% fof(38, 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(39, 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)],[38])).
% fof(40, plain,![X4]:![X5]:((~(X4=X5)|![X6]:((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4))))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))&(member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5)))|X4=X5)),inference(skolemize,[status(esa)],[39])).
% fof(41, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))&(~(member(X6,X5))|member(X6,X4)))|~(X4=X5))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))&(member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5)))|X4=X5)),inference(shift_quantors,[status(thm)],[40])).
% fof(42, plain,![X4]:![X5]:![X6]:((((~(member(X6,X4))|member(X6,X5))|~(X4=X5))&((~(member(X6,X5))|member(X6,X4))|~(X4=X5)))&(((~(member(esk2_2(X4,X5),X4))|~(member(esk2_2(X4,X5),X5)))|X4=X5)&((member(esk2_2(X4,X5),X4)|member(esk2_2(X4,X5),X5))|X4=X5))),inference(distribute,[status(thm)],[41])).
% cnf(43,plain,(X1=X2|member(esk2_2(X1,X2),X2)|member(esk2_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(49, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(50, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[49])).
% fof(51, 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)],[50])).
% cnf(52,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[51])).
% fof(55, 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)],[9])).
% fof(56, 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)],[55])).
% fof(57, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(member(X6,X4))|member(X6,X5)))&((member(esk3_2(X4,X5),X4)&~(member(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[56])).
% fof(58, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk3_2(X4,X5),X4)&~(member(esk3_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[57])).
% fof(59, plain,![X4]:![X5]:![X6]:(((~(member(X6,X4))|member(X6,X5))|~(subset(X4,X5)))&((member(esk3_2(X4,X5),X4)|subset(X4,X5))&(~(member(esk3_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[58])).
% cnf(60,plain,(subset(X1,X2)|~member(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,plain,(subset(X1,X2)|member(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[59])).
% fof(63, plain,![X1]:((~(empty(X1))|![X2]:~(member(X2,X1)))&(?[X2]:member(X2,X1)|empty(X1))),inference(fof_nnf,[status(thm)],[15])).
% fof(64, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(?[X5]:member(X5,X3)|empty(X3))),inference(variable_rename,[status(thm)],[63])).
% fof(65, plain,![X3]:((~(empty(X3))|![X4]:~(member(X4,X3)))&(member(esk4_1(X3),X3)|empty(X3))),inference(skolemize,[status(esa)],[64])).
% fof(66, plain,![X3]:![X4]:((~(member(X4,X3))|~(empty(X3)))&(member(esk4_1(X3),X3)|empty(X3))),inference(shift_quantors,[status(thm)],[65])).
% cnf(67,plain,(empty(X1)|member(esk4_1(X1),X1)),inference(split_conjunct,[status(thm)],[66])).
% cnf(68,plain,(~empty(X1)|~member(X2,X1)),inference(split_conjunct,[status(thm)],[66])).
% fof(69, negated_conjecture,?[X1]:?[X2]:((~(intersection(X1,X2)=empty_set)|~(difference(X1,X2)=X1))&(intersection(X1,X2)=empty_set|difference(X1,X2)=X1)),inference(fof_nnf,[status(thm)],[12])).
% fof(70, negated_conjecture,?[X3]:?[X4]:((~(intersection(X3,X4)=empty_set)|~(difference(X3,X4)=X3))&(intersection(X3,X4)=empty_set|difference(X3,X4)=X3)),inference(variable_rename,[status(thm)],[69])).
% fof(71, negated_conjecture,((~(intersection(esk5_0,esk6_0)=empty_set)|~(difference(esk5_0,esk6_0)=esk5_0))&(intersection(esk5_0,esk6_0)=empty_set|difference(esk5_0,esk6_0)=esk5_0)),inference(skolemize,[status(esa)],[70])).
% cnf(72,negated_conjecture,(difference(esk5_0,esk6_0)=esk5_0|intersection(esk5_0,esk6_0)=empty_set),inference(split_conjunct,[status(thm)],[71])).
% cnf(73,negated_conjecture,(difference(esk5_0,esk6_0)!=esk5_0|intersection(esk5_0,esk6_0)!=empty_set),inference(split_conjunct,[status(thm)],[71])).
% cnf(84,plain,(empty(empty_set)),inference(spm,[status(thm)],[25,67,theory(equality)])).
% cnf(89,plain,(member(esk3_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[23,61,theory(equality)])).
% cnf(96,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set|~member(X1,esk5_0)|~member(X1,esk6_0)),inference(spm,[status(thm)],[22,72,theory(equality)])).
% cnf(99,plain,(subset(X1,difference(X2,X3))|member(esk3_2(X1,difference(X2,X3)),X3)|~member(esk3_2(X1,difference(X2,X3)),X2)),inference(spm,[status(thm)],[60,21,theory(equality)])).
% cnf(105,plain,(~empty(intersection(X1,X2))|~member(X3,X2)|~member(X3,X1)),inference(spm,[status(thm)],[68,29,theory(equality)])).
% cnf(127,plain,(empty_set=X1|member(esk2_2(empty_set,X1),X1)),inference(spm,[status(thm)],[25,43,theory(equality)])).
% cnf(245,plain,(member(esk2_2(empty_set,intersection(X1,X2)),X1)|empty_set=intersection(X1,X2)),inference(spm,[status(thm)],[31,127,theory(equality)])).
% cnf(246,plain,(member(esk2_2(empty_set,intersection(X1,X2)),X2)|empty_set=intersection(X1,X2)),inference(spm,[status(thm)],[30,127,theory(equality)])).
% cnf(277,plain,(member(esk2_2(empty_set,intersection(X1,difference(X2,X3))),X2)|intersection(X1,difference(X2,X3))=empty_set),inference(spm,[status(thm)],[23,246,theory(equality)])).
% cnf(530,plain,(subset(difference(X1,X2),X1)),inference(spm,[status(thm)],[60,89,theory(equality)])).
% cnf(748,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set|intersection(esk6_0,X1)=empty_set|~member(esk2_2(empty_set,intersection(esk6_0,X1)),esk5_0)),inference(spm,[status(thm)],[96,245,theory(equality)])).
% cnf(887,plain,(subset(difference(X1,X2),difference(X1,X3))|member(esk3_2(difference(X1,X2),difference(X1,X3)),X3)),inference(spm,[status(thm)],[99,89,theory(equality)])).
% cnf(890,plain,(subset(X1,difference(X1,X2))|member(esk3_2(X1,difference(X1,X2)),X2)),inference(spm,[status(thm)],[99,61,theory(equality)])).
% cnf(3447,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set|intersection(esk6_0,esk5_0)=empty_set),inference(spm,[status(thm)],[748,246,theory(equality)])).
% cnf(3451,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set|intersection(esk5_0,esk6_0)=empty_set),inference(rw,[status(thm)],[3447,17,theory(equality)])).
% cnf(3452,negated_conjecture,(intersection(esk5_0,esk6_0)=empty_set),inference(cn,[status(thm)],[3451,theory(equality)])).
% cnf(3457,negated_conjecture,(~empty(empty_set)|~member(X1,esk6_0)|~member(X1,esk5_0)),inference(spm,[status(thm)],[105,3452,theory(equality)])).
% cnf(3518,negated_conjecture,($false|difference(esk5_0,esk6_0)!=esk5_0),inference(rw,[status(thm)],[73,3452,theory(equality)])).
% cnf(3519,negated_conjecture,(difference(esk5_0,esk6_0)!=esk5_0),inference(cn,[status(thm)],[3518,theory(equality)])).
% cnf(3525,negated_conjecture,($false|~member(X1,esk6_0)|~member(X1,esk5_0)),inference(rw,[status(thm)],[3457,84,theory(equality)])).
% cnf(3526,negated_conjecture,(~member(X1,esk6_0)|~member(X1,esk5_0)),inference(cn,[status(thm)],[3525,theory(equality)])).
% cnf(3651,negated_conjecture,(intersection(esk6_0,X1)=empty_set|~member(esk2_2(empty_set,intersection(esk6_0,X1)),esk5_0)),inference(spm,[status(thm)],[3526,245,theory(equality)])).
% cnf(3765,negated_conjecture,(intersection(esk6_0,difference(esk5_0,X1))=empty_set),inference(spm,[status(thm)],[3651,277,theory(equality)])).
% cnf(3773,negated_conjecture,(~empty(empty_set)|~member(X2,difference(esk5_0,X1))|~member(X2,esk6_0)),inference(spm,[status(thm)],[105,3765,theory(equality)])).
% cnf(3831,negated_conjecture,($false|~member(X2,difference(esk5_0,X1))|~member(X2,esk6_0)),inference(rw,[status(thm)],[3773,84,theory(equality)])).
% cnf(3832,negated_conjecture,(~member(X2,difference(esk5_0,X1))|~member(X2,esk6_0)),inference(cn,[status(thm)],[3831,theory(equality)])).
% cnf(4259,negated_conjecture,(subset(difference(difference(esk5_0,X1),X2),X3)|~member(esk3_2(difference(difference(esk5_0,X1),X2),X3),esk6_0)),inference(spm,[status(thm)],[3832,89,theory(equality)])).
% cnf(23419,plain,(subset(X1,difference(X1,empty_set))),inference(spm,[status(thm)],[25,890,theory(equality)])).
% cnf(23634,plain,(difference(X1,empty_set)=X1|~subset(difference(X1,empty_set),X1)),inference(spm,[status(thm)],[52,23419,theory(equality)])).
% cnf(23659,plain,(difference(X1,empty_set)=X1|$false),inference(rw,[status(thm)],[23634,530,theory(equality)])).
% cnf(23660,plain,(difference(X1,empty_set)=X1),inference(cn,[status(thm)],[23659,theory(equality)])).
% cnf(674036,negated_conjecture,(subset(difference(difference(esk5_0,X1),X2),difference(difference(esk5_0,X1),esk6_0))),inference(spm,[status(thm)],[4259,887,theory(equality)])).
% cnf(674046,negated_conjecture,(subset(difference(esk5_0,X1),difference(esk5_0,esk6_0))),inference(spm,[status(thm)],[674036,23660,theory(equality)])).
% cnf(674082,negated_conjecture,(subset(esk5_0,difference(esk5_0,esk6_0))),inference(spm,[status(thm)],[674046,23660,theory(equality)])).
% cnf(674088,negated_conjecture,(difference(esk5_0,esk6_0)=esk5_0|~subset(difference(esk5_0,esk6_0),esk5_0)),inference(spm,[status(thm)],[52,674082,theory(equality)])).
% cnf(674093,negated_conjecture,(difference(esk5_0,esk6_0)=esk5_0|$false),inference(rw,[status(thm)],[674088,530,theory(equality)])).
% cnf(674094,negated_conjecture,(difference(esk5_0,esk6_0)=esk5_0),inference(cn,[status(thm)],[674093,theory(equality)])).
% cnf(674095,negated_conjecture,($false),inference(sr,[status(thm)],[674094,3519,theory(equality)])).
% cnf(674096,negated_conjecture,($false),674095,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 11274
% # ...of these trivial : 1099
% # ...subsumed : 8996
% # ...remaining for further processing: 1179
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 30
% # Generated clauses : 335742
% # ...of the previous two non-trivial : 132306
% # Contextual simplify-reflections : 1060
% # Paramodulations : 335604
% # Factorizations : 136
% # Equation resolutions : 2
% # Current number of processed clauses: 1110
% # Positive orientable unit clauses: 429
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 2
% # Non-unit-clauses : 678
% # Current number of unprocessed clauses: 118278
% # ...number of literals in the above : 345900
% # Clause-clause subsumption calls (NU) : 68416
% # Rec. Clause-clause subsumption calls : 62973
% # Unit Clause-clause subsumption calls : 2897
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 876
% # Indexed BW rewrite successes : 16
% # Backwards rewriting index: 595 leaves, 2.76+/-4.026 terms/leaf
% # Paramod-from index: 275 leaves, 2.86+/-3.748 terms/leaf
% # Paramod-into index: 560 leaves, 2.75+/-3.908 terms/leaf
% # -------------------------------------------------
% # User time : 6.104 s
% # System time : 0.270 s
% # Total time : 6.374 s
% # Maximum resident set size: 0 pages
% PrfWatch: 13.37 CPU 14.30 WC
% FINAL PrfWatch: 13.37 CPU 14.30 WC
% SZS output end Solution for /tmp/SystemOnTPTP28863/SET611+3.tptp
%
%------------------------------------------------------------------------------