TSTP Solution File: SET610+3 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SET610+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 : 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 : Wed Dec 29 23:20:29 EST 2010
% Result : Theorem 51.83s
% Output : Solution 51.83s
% 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/SystemOnTPTP12690/SET610+3.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP12690/SET610+3.tptp
% SZS output start Solution for /tmp/SystemOnTPTP12690/SET610+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 12822
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.93 CPU 2.01 WC
% PrfWatch: 3.75 CPU 4.02 WC
% PrfWatch: 5.60 CPU 6.03 WC
% PrfWatch: 7.59 CPU 8.03 WC
% PrfWatch: 9.58 CPU 10.04 WC
% PrfWatch: 11.57 CPU 12.05 WC
% PrfWatch: 13.57 CPU 14.05 WC
% PrfWatch: 15.56 CPU 16.06 WC
% PrfWatch: 17.55 CPU 18.07 WC
% PrfWatch: 19.54 CPU 20.07 WC
% PrfWatch: 21.51 CPU 22.08 WC
% PrfWatch: 23.49 CPU 24.09 WC
% PrfWatch: 25.46 CPU 26.09 WC
% PrfWatch: 27.45 CPU 28.10 WC
% # Preprocessing time : 0.011 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 29.44 CPU 30.11 WC
% PrfWatch: 31.44 CPU 32.11 WC
% PrfWatch: 33.44 CPU 34.12 WC
% PrfWatch: 35.43 CPU 36.13 WC
% PrfWatch: 37.43 CPU 38.13 WC
% PrfWatch: 39.41 CPU 40.14 WC
% PrfWatch: 41.41 CPU 42.14 WC
% PrfWatch: 43.40 CPU 44.15 WC
% PrfWatch: 45.39 CPU 46.16 WC
% PrfWatch: 47.39 CPU 48.16 WC
% PrfWatch: 49.38 CPU 50.17 WC
% # 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]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),file('/tmp/SRASS.s.p', difference_defn)).
% 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(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]:difference(union(X1,X2),X2)=difference(X1,X2),file('/tmp/SRASS.s.p', prove_th83)).
% fof(10, negated_conjecture,~(![X1]:![X2]:difference(union(X1,X2),X2)=difference(X1,X2)),inference(assume_negation,[status(cth)],[9])).
% fof(11, plain,![X1]:![X2]:![X3]:(member(X3,difference(X1,X2))<=>(member(X3,X1)&~(member(X3,X2)))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(12, plain,![X3]:![X4]:union(X3,X4)=union(X4,X3),inference(variable_rename,[status(thm)],[1])).
% cnf(13,plain,(union(X1,X2)=union(X2,X1)),inference(split_conjunct,[status(thm)],[12])).
% fof(14, 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)],[11])).
% fof(15, 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)],[14])).
% fof(16, 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)],[15])).
% cnf(17,plain,(member(X1,difference(X2,X3))|member(X1,X3)|~member(X1,X2)),inference(split_conjunct,[status(thm)],[16])).
% cnf(18,plain,(~member(X1,difference(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[16])).
% cnf(19,plain,(member(X1,X2)|~member(X1,difference(X2,X3))),inference(split_conjunct,[status(thm)],[16])).
% fof(20, 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(21, 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)],[20])).
% fof(22, 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)],[21])).
% cnf(23,plain,(member(X1,union(X2,X3))|~member(X1,X3)),inference(split_conjunct,[status(thm)],[22])).
% cnf(24,plain,(member(X1,union(X2,X3))|~member(X1,X2)),inference(split_conjunct,[status(thm)],[22])).
% cnf(25,plain,(member(X1,X2)|member(X1,X3)|~member(X1,union(X3,X2))),inference(split_conjunct,[status(thm)],[22])).
% fof(43, 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(44, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[43])).
% fof(45, 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)],[44])).
% cnf(46,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[45])).
% fof(49, 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(50, 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)],[49])).
% fof(51, 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)],[50])).
% fof(52, 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)],[51])).
% fof(53, 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)],[52])).
% cnf(54,plain,(subset(X1,X2)|~member(esk3_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[53])).
% cnf(55,plain,(subset(X1,X2)|member(esk3_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[53])).
% cnf(56,plain,(member(X3,X2)|~subset(X1,X2)|~member(X3,X1)),inference(split_conjunct,[status(thm)],[53])).
% fof(57, negated_conjecture,?[X1]:?[X2]:~(difference(union(X1,X2),X2)=difference(X1,X2)),inference(fof_nnf,[status(thm)],[10])).
% fof(58, negated_conjecture,?[X3]:?[X4]:~(difference(union(X3,X4),X4)=difference(X3,X4)),inference(variable_rename,[status(thm)],[57])).
% fof(59, negated_conjecture,~(difference(union(esk4_0,esk5_0),esk5_0)=difference(esk4_0,esk5_0)),inference(skolemize,[status(esa)],[58])).
% cnf(60,negated_conjecture,(difference(union(esk4_0,esk5_0),esk5_0)!=difference(esk4_0,esk5_0)),inference(split_conjunct,[status(thm)],[59])).
% cnf(61,negated_conjecture,(difference(union(esk5_0,esk4_0),esk5_0)!=difference(esk4_0,esk5_0)),inference(rw,[status(thm)],[60,13,theory(equality)])).
% cnf(70,plain,(member(esk3_2(difference(X1,X2),X3),X1)|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[19,55,theory(equality)])).
% cnf(71,plain,(subset(difference(X1,X2),X3)|~member(esk3_2(difference(X1,X2),X3),X2)),inference(spm,[status(thm)],[18,55,theory(equality)])).
% cnf(72,plain,(subset(X1,union(X2,X3))|~member(esk3_2(X1,union(X2,X3)),X3)),inference(spm,[status(thm)],[54,23,theory(equality)])).
% cnf(73,plain,(subset(X1,union(X2,X3))|~member(esk3_2(X1,union(X2,X3)),X2)),inference(spm,[status(thm)],[54,24,theory(equality)])).
% cnf(77,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)],[54,17,theory(equality)])).
% cnf(82,plain,(member(esk3_2(union(X1,X2),X3),X2)|member(esk3_2(union(X1,X2),X3),X1)|subset(union(X1,X2),X3)),inference(spm,[status(thm)],[25,55,theory(equality)])).
% cnf(109,plain,(member(esk3_2(difference(difference(X1,X2),X3),X4),X1)|subset(difference(difference(X1,X2),X3),X4)),inference(spm,[status(thm)],[19,70,theory(equality)])).
% cnf(111,plain,(member(esk3_2(difference(union(X1,X2),X3),X4),X2)|member(esk3_2(difference(union(X1,X2),X3),X4),X1)|subset(difference(union(X1,X2),X3),X4)),inference(spm,[status(thm)],[25,70,theory(equality)])).
% cnf(112,plain,(subset(difference(X1,X2),X1)),inference(spm,[status(thm)],[54,70,theory(equality)])).
% cnf(113,plain,(X1=difference(X1,X2)|~subset(X1,difference(X1,X2))),inference(spm,[status(thm)],[46,112,theory(equality)])).
% cnf(115,plain,(subset(difference(X1,difference(X2,X3)),X4)|member(esk3_2(difference(X1,difference(X2,X3)),X4),X3)|~member(esk3_2(difference(X1,difference(X2,X3)),X4),X2)),inference(spm,[status(thm)],[71,17,theory(equality)])).
% cnf(116,plain,(subset(difference(X1,union(X2,X3)),X4)|~member(esk3_2(difference(X1,union(X2,X3)),X4),X3)),inference(spm,[status(thm)],[71,23,theory(equality)])).
% cnf(118,plain,(subset(difference(X1,X1),X2)),inference(spm,[status(thm)],[71,70,theory(equality)])).
% cnf(119,plain,(X1=difference(X2,X2)|~subset(X1,difference(X2,X2))),inference(spm,[status(thm)],[46,118,theory(equality)])).
% cnf(120,plain,(member(X1,X2)|~member(X1,difference(X3,X3))),inference(spm,[status(thm)],[56,118,theory(equality)])).
% cnf(121,plain,(difference(difference(X1,X1),X2)=difference(X1,X1)),inference(spm,[status(thm)],[113,118,theory(equality)])).
% cnf(124,plain,(~member(X1,difference(X2,X2))|~member(X1,X3)),inference(spm,[status(thm)],[18,121,theory(equality)])).
% cnf(180,plain,(subset(difference(X1,X2),union(X3,X1))),inference(spm,[status(thm)],[72,70,theory(equality)])).
% cnf(181,plain,(subset(X1,union(X2,X1))),inference(spm,[status(thm)],[72,55,theory(equality)])).
% cnf(184,plain,(subset(X1,union(X1,X2))),inference(spm,[status(thm)],[181,13,theory(equality)])).
% cnf(187,plain,(member(X1,union(X2,X3))|~member(X1,difference(X3,X4))),inference(spm,[status(thm)],[56,180,theory(equality)])).
% cnf(217,plain,(subset(X1,union(difference(X2,X3),X4))|member(esk3_2(X1,union(difference(X2,X3),X4)),X3)|~member(esk3_2(X1,union(difference(X2,X3),X4)),X2)),inference(spm,[status(thm)],[73,17,theory(equality)])).
% cnf(218,plain,(subset(X1,union(union(X2,X3),X4))|~member(esk3_2(X1,union(union(X2,X3),X4)),X3)),inference(spm,[status(thm)],[73,23,theory(equality)])).
% cnf(236,plain,(subset(X1,difference(X1,X2))|member(esk3_2(X1,difference(X1,X2)),X2)),inference(spm,[status(thm)],[77,55,theory(equality)])).
% cnf(250,plain,(member(esk3_2(X1,difference(X1,difference(X2,X3))),X2)|subset(X1,difference(X1,difference(X2,X3)))),inference(spm,[status(thm)],[19,236,theory(equality)])).
% cnf(302,plain,(~member(X1,difference(X2,X2))),inference(csr,[status(thm)],[124,120])).
% cnf(307,plain,(subset(X1,difference(X1,difference(X2,X2)))),inference(spm,[status(thm)],[302,236,theory(equality)])).
% cnf(316,plain,(difference(X1,difference(X2,X2))=X1|~subset(difference(X1,difference(X2,X2)),X1)),inference(spm,[status(thm)],[46,307,theory(equality)])).
% cnf(327,plain,(difference(X1,difference(X2,X2))=X1|$false),inference(rw,[status(thm)],[316,112,theory(equality)])).
% cnf(328,plain,(difference(X1,difference(X2,X2))=X1),inference(cn,[status(thm)],[327,theory(equality)])).
% cnf(377,plain,(subset(union(X1,difference(X2,X2)),X3)|member(esk3_2(union(X1,difference(X2,X2)),X3),X1)),inference(spm,[status(thm)],[302,82,theory(equality)])).
% cnf(380,plain,(subset(union(X1,X2),union(X3,X2))|member(esk3_2(union(X1,X2),union(X3,X2)),X1)),inference(spm,[status(thm)],[72,82,theory(equality)])).
% cnf(389,plain,(subset(union(X1,X2),union(X3,X1))|member(esk3_2(union(X1,X2),union(X3,X1)),X2)),inference(spm,[status(thm)],[72,82,theory(equality)])).
% cnf(498,plain,(member(esk3_2(difference(X1,X2),X3),union(X4,X1))|subset(difference(X1,X2),X3)),inference(spm,[status(thm)],[187,55,theory(equality)])).
% cnf(564,plain,(subset(difference(X1,X2),difference(union(X3,X1),X4))|member(esk3_2(difference(X1,X2),difference(union(X3,X1),X4)),X4)),inference(spm,[status(thm)],[77,498,theory(equality)])).
% cnf(2242,plain,(subset(difference(union(X1,X2),X3),union(X4,X2))|member(esk3_2(difference(union(X1,X2),X3),union(X4,X2)),X1)),inference(spm,[status(thm)],[72,111,theory(equality)])).
% cnf(2245,plain,(subset(difference(union(X1,X2),X2),X3)|member(esk3_2(difference(union(X1,X2),X2),X3),X1)),inference(spm,[status(thm)],[71,111,theory(equality)])).
% cnf(2339,plain,(subset(difference(X1,difference(union(X2,X1),X3)),X4)|member(esk3_2(difference(X1,difference(union(X2,X1),X3)),X4),X3)),inference(spm,[status(thm)],[115,498,theory(equality)])).
% cnf(2415,plain,(subset(difference(difference(X1,X2),union(X3,X1)),X4)),inference(spm,[status(thm)],[116,109,theory(equality)])).
% cnf(3610,plain,(difference(difference(difference(X1,X2),union(X3,X1)),X4)=difference(difference(X1,X2),union(X3,X1))),inference(spm,[status(thm)],[113,2415,theory(equality)])).
% cnf(6027,plain,(subset(difference(X1,X2),difference(difference(X1,X2),difference(X2,X3)))),inference(spm,[status(thm)],[71,250,theory(equality)])).
% cnf(6133,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)|~subset(difference(difference(X1,X2),difference(X2,X3)),difference(X1,X2))),inference(spm,[status(thm)],[46,6027,theory(equality)])).
% cnf(6236,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)|$false),inference(rw,[status(thm)],[6133,112,theory(equality)])).
% cnf(6237,plain,(difference(difference(X1,X2),difference(X2,X3))=difference(X1,X2)),inference(cn,[status(thm)],[6236,theory(equality)])).
% cnf(6355,plain,(subset(difference(X1,X2),X4)|~member(esk3_2(difference(X1,X2),X4),difference(X2,X3))),inference(spm,[status(thm)],[71,6237,theory(equality)])).
% cnf(11948,plain,(subset(union(X1,difference(X2,X2)),X1)),inference(spm,[status(thm)],[54,377,theory(equality)])).
% cnf(11980,plain,(X1=union(X1,difference(X2,X2))|~subset(X1,union(X1,difference(X2,X2)))),inference(spm,[status(thm)],[46,11948,theory(equality)])).
% cnf(12013,plain,(X1=union(X1,difference(X2,X2))|$false),inference(rw,[status(thm)],[11980,184,theory(equality)])).
% cnf(12014,plain,(X1=union(X1,difference(X2,X2))),inference(cn,[status(thm)],[12013,theory(equality)])).
% cnf(12042,plain,(X1=union(difference(X2,X2),X1)),inference(spm,[status(thm)],[13,12014,theory(equality)])).
% cnf(12349,plain,(union(difference(difference(X1,X2),union(X3,X1)),X4)=X4),inference(spm,[status(thm)],[12042,3610,theory(equality)])).
% cnf(13301,plain,(subset(union(X1,X2),union(difference(X1,X3),X2))|member(esk3_2(union(X1,X2),union(difference(X1,X3),X2)),X3)),inference(spm,[status(thm)],[217,380,theory(equality)])).
% cnf(16503,plain,(subset(union(X1,X2),union(union(X3,X2),X1))),inference(spm,[status(thm)],[218,389,theory(equality)])).
% cnf(50126,plain,(subset(difference(X1,X2),difference(union(X3,X1),X2))),inference(spm,[status(thm)],[71,564,theory(equality)])).
% cnf(50388,plain,(subset(difference(X1,X2),difference(union(X1,X3),X2))),inference(spm,[status(thm)],[50126,13,theory(equality)])).
% cnf(198483,plain,(subset(difference(union(X1,X2),X1),union(X3,X2))),inference(spm,[status(thm)],[71,2242,theory(equality)])).
% cnf(198682,plain,(subset(difference(union(X1,X2),X1),X2)),inference(spm,[status(thm)],[198483,12349,theory(equality)])).
% cnf(210982,plain,(subset(difference(X1,difference(union(X2,X1),X3)),X3)),inference(spm,[status(thm)],[54,2339,theory(equality)])).
% cnf(211209,plain,(subset(difference(X1,difference(X1,X5)),X5)),inference(spm,[status(thm)],[210982,12349,theory(equality)])).
% cnf(701427,plain,(subset(difference(union(difference(X1,X2),X1),X1),X3)),inference(spm,[status(thm)],[6355,2245,theory(equality)])).
% cnf(703485,plain,(subset(difference(union(X1,difference(X1,X2)),X1),X3)),inference(rw,[status(thm)],[701427,13,theory(equality)])).
% cnf(703493,plain,(difference(union(X1,difference(X1,X2)),X1)=difference(X3,X3)),inference(spm,[status(thm)],[119,703485,theory(equality)])).
% cnf(705628,plain,(subset(difference(union(X1,difference(X1,X2)),difference(X3,X3)),X1)),inference(spm,[status(thm)],[211209,703493,theory(equality)])).
% cnf(707235,plain,(subset(union(X1,difference(X1,X2)),X1)),inference(rw,[status(thm)],[705628,328,theory(equality)])).
% cnf(707878,plain,(X1=union(X1,difference(X1,X2))|~subset(X1,union(X1,difference(X1,X2)))),inference(spm,[status(thm)],[46,707235,theory(equality)])).
% cnf(708147,plain,(X1=union(X1,difference(X1,X2))|$false),inference(rw,[status(thm)],[707878,184,theory(equality)])).
% cnf(708148,plain,(X1=union(X1,difference(X1,X2))),inference(cn,[status(thm)],[708147,theory(equality)])).
% cnf(709115,plain,(subset(union(X1,difference(X2,X3)),union(X2,X1))),inference(spm,[status(thm)],[16503,708148,theory(equality)])).
% cnf(1317678,plain,(subset(union(X1,X2),union(difference(X1,X2),X2))),inference(spm,[status(thm)],[72,13301,theory(equality)])).
% cnf(1318104,plain,(subset(union(X1,X2),union(X2,difference(X1,X2)))),inference(rw,[status(thm)],[1317678,13,theory(equality)])).
% cnf(1318619,plain,(union(X1,difference(X2,X1))=union(X2,X1)|~subset(union(X1,difference(X2,X1)),union(X2,X1))),inference(spm,[status(thm)],[46,1318104,theory(equality)])).
% cnf(1318995,plain,(union(X1,difference(X2,X1))=union(X2,X1)|$false),inference(rw,[status(thm)],[1318619,709115,theory(equality)])).
% cnf(1318996,plain,(union(X1,difference(X2,X1))=union(X2,X1)),inference(cn,[status(thm)],[1318995,theory(equality)])).
% cnf(1319916,plain,(subset(difference(union(X2,X1),X1),difference(X2,X1))),inference(spm,[status(thm)],[198682,1318996,theory(equality)])).
% cnf(2146252,plain,(difference(X1,X2)=difference(union(X1,X2),X2)|~subset(difference(X1,X2),difference(union(X1,X2),X2))),inference(spm,[status(thm)],[46,1319916,theory(equality)])).
% cnf(2146642,plain,(difference(X1,X2)=difference(union(X1,X2),X2)|$false),inference(rw,[status(thm)],[2146252,50388,theory(equality)])).
% cnf(2146643,plain,(difference(X1,X2)=difference(union(X1,X2),X2)),inference(cn,[status(thm)],[2146642,theory(equality)])).
% cnf(2148760,plain,(difference(union(X2,X1),X2)=difference(X1,X2)),inference(spm,[status(thm)],[2146643,13,theory(equality)])).
% cnf(2151181,negated_conjecture,($false),inference(rw,[status(thm)],[61,2148760,theory(equality)])).
% cnf(2151182,negated_conjecture,($false),inference(cn,[status(thm)],[2151181,theory(equality)])).
% cnf(2151183,negated_conjecture,($false),2151182,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 29992
% # ...of these trivial : 1281
% # ...subsumed : 26708
% # ...remaining for further processing: 2003
% # Other redundant clauses eliminated : 2
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 22
% # Backward-rewritten : 224
% # Generated clauses : 1171459
% # ...of the previous two non-trivial : 770838
% # Contextual simplify-reflections : 813
% # Paramodulations : 1170075
% # Factorizations : 1382
% # Equation resolutions : 2
% # Current number of processed clauses: 1755
% # Positive orientable unit clauses: 784
% # Positive unorientable unit clauses: 108
% # Negative unit clauses : 8
% # Non-unit-clauses : 855
% # Current number of unprocessed clauses: 624541
% # ...number of literals in the above : 1639842
% # Clause-clause subsumption calls (NU) : 241046
% # Rec. Clause-clause subsumption calls : 120084
% # Unit Clause-clause subsumption calls : 125293
% # Rewrite failures with RHS unbound : 5480
% # Indexed BW rewrite attempts : 38704
% # Indexed BW rewrite successes : 1084
% # Backwards rewriting index: 511 leaves, 6.99+/-14.299 terms/leaf
% # Paramod-from index: 183 leaves, 9.71+/-19.902 terms/leaf
% # Paramod-into index: 451 leaves, 7.03+/-14.688 terms/leaf
% # -------------------------------------------------
% # User time : 27.223 s
% # System time : 1.045 s
% # Total time : 28.268 s
% # Maximum resident set size: 0 pages
% PrfWatch: 50.66 CPU 51.49 WC
% FINAL PrfWatch: 50.66 CPU 51.49 WC
% SZS output end Solution for /tmp/SystemOnTPTP12690/SET610+3.tptp
%
%------------------------------------------------------------------------------