TSTP Solution File: SEU147+2 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU147+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 : art06.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:18:24 EST 2010
% Result : Theorem 48.91s
% Output : Solution 48.91s
% 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/SystemOnTPTP20339/SEU147+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20339/SEU147+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20339/SEU147+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 20437
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.01 WC
% PrfWatch: 1.94 CPU 2.02 WC
% PrfWatch: 3.92 CPU 4.02 WC
% PrfWatch: 5.92 CPU 6.03 WC
% PrfWatch: 7.53 CPU 8.03 WC
% PrfWatch: 9.16 CPU 10.04 WC
% PrfWatch: 11.16 CPU 12.04 WC
% PrfWatch: 13.15 CPU 14.05 WC
% PrfWatch: 15.13 CPU 16.05 WC
% PrfWatch: 17.12 CPU 18.06 WC
% PrfWatch: 19.10 CPU 20.06 WC
% PrfWatch: 21.09 CPU 22.06 WC
% PrfWatch: 23.08 CPU 24.07 WC
% PrfWatch: 25.06 CPU 26.07 WC
% PrfWatch: 27.05 CPU 28.08 WC
% PrfWatch: 29.04 CPU 30.08 WC
% PrfWatch: 31.03 CPU 32.09 WC
% # Preprocessing time : 0.022 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 33.02 CPU 34.09 WC
% PrfWatch: 34.99 CPU 36.10 WC
% PrfWatch: 36.98 CPU 38.10 WC
% PrfWatch: 38.98 CPU 40.11 WC
% PrfWatch: 40.97 CPU 42.11 WC
% PrfWatch: 42.97 CPU 44.12 WC
% PrfWatch: 44.96 CPU 46.12 WC
% PrfWatch: 46.96 CPU 48.13 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(4, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(6, axiom,![X1]:set_union2(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t1_boole)).
% fof(9, axiom,![X1]:set_difference(empty_set,X1)=empty_set,file('/tmp/SRASS.s.p', t4_boole)).
% fof(10, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(11, axiom,![X1]:(empty(X1)=>X1=empty_set),file('/tmp/SRASS.s.p', t6_boole)).
% fof(13, axiom,![X1]:![X2]:(X2=powerset(X1)<=>![X3]:(in(X3,X2)<=>subset(X3,X1))),file('/tmp/SRASS.s.p', d1_zfmisc_1)).
% fof(16, axiom,![X1]:![X2]:set_union2(X1,X2)=set_union2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k2_xboole_0)).
% fof(17, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(21, axiom,?[X1]:empty(X1),file('/tmp/SRASS.s.p', rc1_xboole_0)).
% fof(28, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(30, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_intersection2(X1,X2)=empty_set),file('/tmp/SRASS.s.p', d7_xboole_0)).
% fof(31, axiom,![X1]:![X2]:(subset(X1,X2)=>set_union2(X1,X2)=X2),file('/tmp/SRASS.s.p', t12_xboole_1)).
% fof(32, axiom,![X1]:![X2]:(subset(X1,X2)=>set_intersection2(X1,X2)=X1),file('/tmp/SRASS.s.p', t28_xboole_1)).
% fof(35, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(36, axiom,![X1]:![X2]:(disjoint(X1,X2)=>disjoint(X2,X1)),file('/tmp/SRASS.s.p', symmetry_r1_xboole_0)).
% fof(38, 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(42, axiom,![X1]:![X2]:set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2),file('/tmp/SRASS.s.p', t39_xboole_1)).
% fof(43, axiom,![X1]:![X2]:set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2),file('/tmp/SRASS.s.p', t40_xboole_1)).
% fof(44, axiom,![X1]:![X2]:set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2),file('/tmp/SRASS.s.p', t48_xboole_1)).
% fof(45, axiom,![X1]:![X2]:(disjoint(X1,X2)<=>set_difference(X1,X2)=X1),file('/tmp/SRASS.s.p', t83_xboole_1)).
% fof(46, axiom,![X1]:![X2]:(subset(X1,X2)<=>![X3]:(in(X3,X1)=>in(X3,X2))),file('/tmp/SRASS.s.p', d3_tarski)).
% fof(51, axiom,![X1]:![X2]:subset(set_difference(X1,X2),X1),file('/tmp/SRASS.s.p', t36_xboole_1)).
% fof(52, axiom,![X1]:![X2]:subset(X1,set_union2(X1,X2)),file('/tmp/SRASS.s.p', t7_xboole_1)).
% fof(56, axiom,![X1]:![X2]:~((in(X1,X2)&empty(X2))),file('/tmp/SRASS.s.p', t7_boole)).
% fof(60, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t3_xboole_0)).
% fof(61, axiom,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),file('/tmp/SRASS.s.p', t4_xboole_0)).
% fof(70, conjecture,powerset(empty_set)=singleton(empty_set),file('/tmp/SRASS.s.p', t1_zfmisc_1)).
% fof(71, negated_conjecture,~(powerset(empty_set)=singleton(empty_set)),inference(assume_negation,[status(cth)],[70])).
% fof(80, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~((in(X3,X1)&in(X3,X2)))))&~((?[X3]:(in(X3,X1)&in(X3,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[60,theory(equality)])).
% fof(81, plain,![X1]:![X2]:(~((~(disjoint(X1,X2))&![X3]:~(in(X3,set_intersection2(X1,X2)))))&~((?[X3]:in(X3,set_intersection2(X1,X2))&disjoint(X1,X2)))),inference(fof_simplification,[status(thm)],[61,theory(equality)])).
% fof(82, negated_conjecture,~(powerset(empty_set)=singleton(empty_set)),inference(fof_simplification,[status(thm)],[71,theory(equality)])).
% fof(91, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[3])).
% fof(92, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[91])).
% cnf(93,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[92])).
% fof(94, plain,![X1]:![X2]:((~(X2=singleton(X1))|![X3]:((~(in(X3,X2))|X3=X1)&(~(X3=X1)|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(X3=X1))&(in(X3,X2)|X3=X1))|X2=singleton(X1))),inference(fof_nnf,[status(thm)],[4])).
% fof(95, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(X7=X4))&(in(X7,X5)|X7=X4))|X5=singleton(X4))),inference(variable_rename,[status(thm)],[94])).
% fof(96, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[95])).
% fof(97, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))&(in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[96])).
% fof(98, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk1_2(X4,X5),X5))|~(esk1_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk1_2(X4,X5),X5)|esk1_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[97])).
% cnf(102,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[98])).
% fof(109, plain,![X2]:set_union2(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[6])).
% cnf(110,plain,(set_union2(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[109])).
% fof(115, plain,![X2]:set_difference(empty_set,X2)=empty_set,inference(variable_rename,[status(thm)],[9])).
% cnf(116,plain,(set_difference(empty_set,X1)=empty_set),inference(split_conjunct,[status(thm)],[115])).
% fof(117, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[10])).
% cnf(118,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[117])).
% fof(119, plain,![X1]:(~(empty(X1))|X1=empty_set),inference(fof_nnf,[status(thm)],[11])).
% fof(120, plain,![X2]:(~(empty(X2))|X2=empty_set),inference(variable_rename,[status(thm)],[119])).
% cnf(121,plain,(X1=empty_set|~empty(X1)),inference(split_conjunct,[status(thm)],[120])).
% fof(124, plain,![X1]:![X2]:((~(X2=powerset(X1))|![X3]:((~(in(X3,X2))|subset(X3,X1))&(~(subset(X3,X1))|in(X3,X2))))&(?[X3]:((~(in(X3,X2))|~(subset(X3,X1)))&(in(X3,X2)|subset(X3,X1)))|X2=powerset(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(125, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(?[X7]:((~(in(X7,X5))|~(subset(X7,X4)))&(in(X7,X5)|subset(X7,X4)))|X5=powerset(X4))),inference(variable_rename,[status(thm)],[124])).
% fof(126, plain,![X4]:![X5]:((~(X5=powerset(X4))|![X6]:((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5))))&(((~(in(esk3_2(X4,X5),X5))|~(subset(esk3_2(X4,X5),X4)))&(in(esk3_2(X4,X5),X5)|subset(esk3_2(X4,X5),X4)))|X5=powerset(X4))),inference(skolemize,[status(esa)],[125])).
% fof(127, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))&(~(subset(X6,X4))|in(X6,X5)))|~(X5=powerset(X4)))&(((~(in(esk3_2(X4,X5),X5))|~(subset(esk3_2(X4,X5),X4)))&(in(esk3_2(X4,X5),X5)|subset(esk3_2(X4,X5),X4)))|X5=powerset(X4))),inference(shift_quantors,[status(thm)],[126])).
% fof(128, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|subset(X6,X4))|~(X5=powerset(X4)))&((~(subset(X6,X4))|in(X6,X5))|~(X5=powerset(X4))))&(((~(in(esk3_2(X4,X5),X5))|~(subset(esk3_2(X4,X5),X4)))|X5=powerset(X4))&((in(esk3_2(X4,X5),X5)|subset(esk3_2(X4,X5),X4))|X5=powerset(X4)))),inference(distribute,[status(thm)],[127])).
% cnf(131,plain,(in(X3,X1)|X1!=powerset(X2)|~subset(X3,X2)),inference(split_conjunct,[status(thm)],[128])).
% cnf(132,plain,(subset(X3,X2)|X1!=powerset(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[128])).
% fof(138, plain,![X3]:![X4]:set_union2(X3,X4)=set_union2(X4,X3),inference(variable_rename,[status(thm)],[16])).
% cnf(139,plain,(set_union2(X1,X2)=set_union2(X2,X1)),inference(split_conjunct,[status(thm)],[138])).
% fof(140, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[17])).
% cnf(141,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[140])).
% fof(152, plain,?[X2]:empty(X2),inference(variable_rename,[status(thm)],[21])).
% fof(153, plain,empty(esk4_0),inference(skolemize,[status(esa)],[152])).
% cnf(154,plain,(empty(esk4_0)),inference(split_conjunct,[status(thm)],[153])).
% fof(173, 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)],[28])).
% fof(174, 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)],[173])).
% cnf(175,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[174])).
% fof(181, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_intersection2(X1,X2)=empty_set)&(~(set_intersection2(X1,X2)=empty_set)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[30])).
% fof(182, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_intersection2(X3,X4)=empty_set)&(~(set_intersection2(X3,X4)=empty_set)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[181])).
% cnf(183,plain,(disjoint(X1,X2)|set_intersection2(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[182])).
% fof(185, plain,![X1]:![X2]:(~(subset(X1,X2))|set_union2(X1,X2)=X2),inference(fof_nnf,[status(thm)],[31])).
% fof(186, plain,![X3]:![X4]:(~(subset(X3,X4))|set_union2(X3,X4)=X4),inference(variable_rename,[status(thm)],[185])).
% cnf(187,plain,(set_union2(X1,X2)=X2|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[186])).
% fof(188, plain,![X1]:![X2]:(~(subset(X1,X2))|set_intersection2(X1,X2)=X1),inference(fof_nnf,[status(thm)],[32])).
% fof(189, plain,![X3]:![X4]:(~(subset(X3,X4))|set_intersection2(X3,X4)=X3),inference(variable_rename,[status(thm)],[188])).
% cnf(190,plain,(set_intersection2(X1,X2)=X1|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[189])).
% fof(196, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[35])).
% fof(197, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[196])).
% cnf(198,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[197])).
% fof(200, plain,![X1]:![X2]:(~(disjoint(X1,X2))|disjoint(X2,X1)),inference(fof_nnf,[status(thm)],[36])).
% fof(201, plain,![X3]:![X4]:(~(disjoint(X3,X4))|disjoint(X4,X3)),inference(variable_rename,[status(thm)],[200])).
% cnf(202,plain,(disjoint(X1,X2)|~disjoint(X2,X1)),inference(split_conjunct,[status(thm)],[201])).
% fof(206, 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)],[38])).
% fof(207, 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)],[206])).
% fof(208, 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(esk7_3(X5,X6,X7),X7))|(~(esk7_3(X5,X6,X7)=X5)&~(esk7_3(X5,X6,X7)=X6)))&(in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(skolemize,[status(esa)],[207])).
% fof(209, 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(esk7_3(X5,X6,X7),X7))|(~(esk7_3(X5,X6,X7)=X5)&~(esk7_3(X5,X6,X7)=X6)))&(in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6)))|X7=unordered_pair(X5,X6))),inference(shift_quantors,[status(thm)],[208])).
% fof(210, 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)))))&((((~(esk7_3(X5,X6,X7)=X5)|~(in(esk7_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6))&((~(esk7_3(X5,X6,X7)=X6)|~(in(esk7_3(X5,X6,X7),X7)))|X7=unordered_pair(X5,X6)))&((in(esk7_3(X5,X6,X7),X7)|(esk7_3(X5,X6,X7)=X5|esk7_3(X5,X6,X7)=X6))|X7=unordered_pair(X5,X6)))),inference(distribute,[status(thm)],[209])).
% cnf(214,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X3),inference(split_conjunct,[status(thm)],[210])).
% cnf(215,plain,(in(X4,X1)|X1!=unordered_pair(X2,X3)|X4!=X2),inference(split_conjunct,[status(thm)],[210])).
% fof(250, plain,![X3]:![X4]:set_union2(X3,set_difference(X4,X3))=set_union2(X3,X4),inference(variable_rename,[status(thm)],[42])).
% cnf(251,plain,(set_union2(X1,set_difference(X2,X1))=set_union2(X1,X2)),inference(split_conjunct,[status(thm)],[250])).
% fof(252, plain,![X3]:![X4]:set_difference(set_union2(X3,X4),X4)=set_difference(X3,X4),inference(variable_rename,[status(thm)],[43])).
% cnf(253,plain,(set_difference(set_union2(X1,X2),X2)=set_difference(X1,X2)),inference(split_conjunct,[status(thm)],[252])).
% fof(254, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[44])).
% cnf(255,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[254])).
% fof(256, plain,![X1]:![X2]:((~(disjoint(X1,X2))|set_difference(X1,X2)=X1)&(~(set_difference(X1,X2)=X1)|disjoint(X1,X2))),inference(fof_nnf,[status(thm)],[45])).
% fof(257, plain,![X3]:![X4]:((~(disjoint(X3,X4))|set_difference(X3,X4)=X3)&(~(set_difference(X3,X4)=X3)|disjoint(X3,X4))),inference(variable_rename,[status(thm)],[256])).
% cnf(258,plain,(disjoint(X1,X2)|set_difference(X1,X2)!=X1),inference(split_conjunct,[status(thm)],[257])).
% cnf(259,plain,(set_difference(X1,X2)=X1|~disjoint(X1,X2)),inference(split_conjunct,[status(thm)],[257])).
% fof(260, 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)],[46])).
% fof(261, 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)],[260])).
% fof(262, plain,![X4]:![X5]:((~(subset(X4,X5))|![X6]:(~(in(X6,X4))|in(X6,X5)))&((in(esk11_2(X4,X5),X4)&~(in(esk11_2(X4,X5),X5)))|subset(X4,X5))),inference(skolemize,[status(esa)],[261])).
% fof(263, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk11_2(X4,X5),X4)&~(in(esk11_2(X4,X5),X5)))|subset(X4,X5))),inference(shift_quantors,[status(thm)],[262])).
% fof(264, plain,![X4]:![X5]:![X6]:(((~(in(X6,X4))|in(X6,X5))|~(subset(X4,X5)))&((in(esk11_2(X4,X5),X4)|subset(X4,X5))&(~(in(esk11_2(X4,X5),X5))|subset(X4,X5)))),inference(distribute,[status(thm)],[263])).
% cnf(265,plain,(subset(X1,X2)|~in(esk11_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[264])).
% cnf(266,plain,(subset(X1,X2)|in(esk11_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[264])).
% fof(279, plain,![X3]:![X4]:subset(set_difference(X3,X4),X3),inference(variable_rename,[status(thm)],[51])).
% cnf(280,plain,(subset(set_difference(X1,X2),X1)),inference(split_conjunct,[status(thm)],[279])).
% fof(281, plain,![X3]:![X4]:subset(X3,set_union2(X3,X4)),inference(variable_rename,[status(thm)],[52])).
% cnf(282,plain,(subset(X1,set_union2(X1,X2))),inference(split_conjunct,[status(thm)],[281])).
% fof(295, plain,![X1]:![X2]:(~(in(X1,X2))|~(empty(X2))),inference(fof_nnf,[status(thm)],[56])).
% fof(296, plain,![X3]:![X4]:(~(in(X3,X4))|~(empty(X4))),inference(variable_rename,[status(thm)],[295])).
% cnf(297,plain,(~empty(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[296])).
% fof(307, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:(in(X3,X1)&in(X3,X2)))&(![X3]:(~(in(X3,X1))|~(in(X3,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[80])).
% fof(308, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:(in(X6,X4)&in(X6,X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[307])).
% fof(309, plain,![X4]:![X5]:((disjoint(X4,X5)|(in(esk12_2(X4,X5),X4)&in(esk12_2(X4,X5),X5)))&(![X7]:(~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[308])).
% fof(310, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|(in(esk12_2(X4,X5),X4)&in(esk12_2(X4,X5),X5)))),inference(shift_quantors,[status(thm)],[309])).
% fof(311, plain,![X4]:![X5]:![X7]:(((~(in(X7,X4))|~(in(X7,X5)))|~(disjoint(X4,X5)))&((in(esk12_2(X4,X5),X4)|disjoint(X4,X5))&(in(esk12_2(X4,X5),X5)|disjoint(X4,X5)))),inference(distribute,[status(thm)],[310])).
% cnf(312,plain,(disjoint(X1,X2)|in(esk12_2(X1,X2),X2)),inference(split_conjunct,[status(thm)],[311])).
% cnf(313,plain,(disjoint(X1,X2)|in(esk12_2(X1,X2),X1)),inference(split_conjunct,[status(thm)],[311])).
% fof(315, plain,![X1]:![X2]:((disjoint(X1,X2)|?[X3]:in(X3,set_intersection2(X1,X2)))&(![X3]:~(in(X3,set_intersection2(X1,X2)))|~(disjoint(X1,X2)))),inference(fof_nnf,[status(thm)],[81])).
% fof(316, plain,![X4]:![X5]:((disjoint(X4,X5)|?[X6]:in(X6,set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(variable_rename,[status(thm)],[315])).
% fof(317, plain,![X4]:![X5]:((disjoint(X4,X5)|in(esk13_2(X4,X5),set_intersection2(X4,X5)))&(![X7]:~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))),inference(skolemize,[status(esa)],[316])).
% fof(318, plain,![X4]:![X5]:![X7]:((~(in(X7,set_intersection2(X4,X5)))|~(disjoint(X4,X5)))&(disjoint(X4,X5)|in(esk13_2(X4,X5),set_intersection2(X4,X5)))),inference(shift_quantors,[status(thm)],[317])).
% cnf(320,plain,(~disjoint(X1,X2)|~in(X3,set_intersection2(X1,X2))),inference(split_conjunct,[status(thm)],[318])).
% cnf(331,negated_conjecture,(powerset(empty_set)!=singleton(empty_set)),inference(split_conjunct,[status(thm)],[82])).
% cnf(336,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[198,118,theory(equality)]),['unfolding']).
% cnf(339,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[102,118,theory(equality)]),['unfolding']).
% cnf(343,negated_conjecture,(powerset(empty_set)!=unordered_pair(empty_set,empty_set)),inference(rw,[status(thm)],[331,118,theory(equality)]),['unfolding']).
% cnf(346,plain,(set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[141,255,theory(equality)]),255,theory(equality)]),['unfolding']).
% cnf(351,plain,(set_difference(X1,set_difference(X1,X2))=X1|~subset(X1,X2)),inference(rw,[status(thm)],[190,255,theory(equality)]),['unfolding']).
% cnf(353,plain,(disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=empty_set),inference(rw,[status(thm)],[183,255,theory(equality)]),['unfolding']).
% cnf(360,plain,(~disjoint(X1,X2)|~in(X3,set_difference(X1,set_difference(X1,X2)))),inference(rw,[status(thm)],[320,255,theory(equality)]),['unfolding']).
% cnf(367,plain,(in(X1,X2)|unordered_pair(X3,X1)!=X2),inference(er,[status(thm)],[214,theory(equality)])).
% cnf(368,plain,(in(X1,X2)|unordered_pair(X1,X3)!=X2),inference(er,[status(thm)],[215,theory(equality)])).
% cnf(372,plain,(empty_set=esk4_0),inference(spm,[status(thm)],[121,154,theory(equality)])).
% cnf(407,plain,(subset(X1,set_union2(X2,X1))),inference(spm,[status(thm)],[282,139,theory(equality)])).
% cnf(417,plain,(set_union2(X1,X2)=set_difference(X2,X1)|~subset(X1,set_difference(X2,X1))),inference(spm,[status(thm)],[187,251,theory(equality)])).
% cnf(464,plain,(in(X1,unordered_pair(X2,X1))),inference(er,[status(thm)],[367,theory(equality)])).
% cnf(467,plain,(in(X1,unordered_pair(X1,X2))),inference(er,[status(thm)],[368,theory(equality)])).
% cnf(470,plain,(disjoint(X1,X2)|set_difference(X2,X1)!=X2),inference(spm,[status(thm)],[202,258,theory(equality)])).
% cnf(472,plain,(subset(set_difference(X1,X2),set_union2(X1,X2))),inference(spm,[status(thm)],[280,253,theory(equality)])).
% cnf(475,plain,(set_difference(set_union2(X1,X2),set_difference(X2,X1))=set_difference(X1,set_difference(X2,X1))),inference(spm,[status(thm)],[253,251,theory(equality)])).
% cnf(476,plain,(set_difference(set_union2(X2,X1),X2)=set_difference(X1,X2)),inference(spm,[status(thm)],[253,139,theory(equality)])).
% cnf(477,plain,(set_difference(X2,X2)=set_difference(X1,X2)|~subset(X1,X2)),inference(spm,[status(thm)],[253,187,theory(equality)])).
% cnf(522,plain,(set_union2(set_difference(X1,X2),set_difference(X2,set_difference(X2,X1)))=set_union2(set_difference(X1,X2),X1)),inference(spm,[status(thm)],[251,346,theory(equality)])).
% cnf(530,plain,(set_difference(X1,set_difference(X1,set_union2(X2,X1)))=set_difference(set_union2(X2,X1),set_difference(X2,X1))),inference(spm,[status(thm)],[346,253,theory(equality)])).
% cnf(578,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[339,theory(equality)])).
% cnf(582,plain,(subset(X1,X2)|~empty(X1)),inference(spm,[status(thm)],[297,266,theory(equality)])).
% cnf(603,plain,(subset(esk12_2(X1,X2),X3)|disjoint(X1,X2)|powerset(X3)!=X2),inference(spm,[status(thm)],[132,312,theory(equality)])).
% cnf(607,plain,(in(unordered_pair(X1,X1),X2)|powerset(X3)!=X2|~in(X1,X3)),inference(spm,[status(thm)],[131,336,theory(equality)])).
% cnf(1457,plain,(disjoint(X1,X2)|set_difference(X1,set_difference(X1,X2))!=esk4_0),inference(rw,[status(thm)],[353,372,theory(equality)])).
% cnf(1462,plain,(set_difference(X1,X2)=esk4_0|~subset(X1,X2)),inference(rw,[status(thm)],[175,372,theory(equality)])).
% cnf(1466,plain,(esk4_0=X1|~subset(X1,empty_set)),inference(rw,[status(thm)],[93,372,theory(equality)])).
% cnf(1467,plain,(esk4_0=X1|~subset(X1,esk4_0)),inference(rw,[status(thm)],[1466,372,theory(equality)])).
% cnf(1468,negated_conjecture,(powerset(esk4_0)!=unordered_pair(empty_set,empty_set)),inference(rw,[status(thm)],[343,372,theory(equality)])).
% cnf(1469,negated_conjecture,(powerset(esk4_0)!=unordered_pair(esk4_0,esk4_0)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1468,372,theory(equality)]),372,theory(equality)])).
% cnf(1471,plain,(set_difference(esk4_0,X1)=empty_set),inference(rw,[status(thm)],[116,372,theory(equality)])).
% cnf(1472,plain,(set_difference(esk4_0,X1)=esk4_0),inference(rw,[status(thm)],[1471,372,theory(equality)])).
% cnf(1474,plain,(set_union2(X1,esk4_0)=X1),inference(rw,[status(thm)],[110,372,theory(equality)])).
% cnf(1496,plain,(subset(esk4_0,X1)),inference(spm,[status(thm)],[582,154,theory(equality)])).
% cnf(1501,plain,(in(esk4_0,X1)|powerset(X2)!=X1),inference(spm,[status(thm)],[131,1496,theory(equality)])).
% cnf(1503,plain,(~empty(unordered_pair(X1,X2))),inference(spm,[status(thm)],[297,464,theory(equality)])).
% cnf(1548,plain,(disjoint(esk4_0,X1)),inference(spm,[status(thm)],[1457,1472,theory(equality)])).
% cnf(1598,plain,(disjoint(X1,esk4_0)),inference(spm,[status(thm)],[202,1548,theory(equality)])).
% cnf(1648,plain,(set_difference(X1,esk4_0)=X1),inference(spm,[status(thm)],[259,1598,theory(equality)])).
% cnf(1661,plain,(~disjoint(X1,esk4_0)|~in(X2,set_difference(X1,X1))),inference(spm,[status(thm)],[360,1648,theory(equality)])).
% cnf(1680,plain,($false|~in(X2,set_difference(X1,X1))),inference(rw,[status(thm)],[1661,1598,theory(equality)])).
% cnf(1681,plain,(~in(X2,set_difference(X1,X1))),inference(cn,[status(thm)],[1680,theory(equality)])).
% cnf(1727,plain,(disjoint(X1,set_difference(X2,X2))),inference(spm,[status(thm)],[1681,312,theory(equality)])).
% cnf(1747,plain,(X1=set_union2(esk4_0,X1)),inference(spm,[status(thm)],[139,1474,theory(equality)])).
% cnf(1799,plain,(set_difference(X1,set_difference(X2,X2))=X1),inference(spm,[status(thm)],[259,1727,theory(equality)])).
% cnf(1926,plain,(set_difference(X1,set_union2(X1,X2))=esk4_0),inference(spm,[status(thm)],[1462,282,theory(equality)])).
% cnf(2089,plain,(set_difference(X1,set_difference(X1,set_union2(X2,X1)))=X1),inference(spm,[status(thm)],[351,407,theory(equality)])).
% cnf(2500,plain,(empty(set_difference(X1,set_union2(X1,X2)))),inference(spm,[status(thm)],[154,1926,theory(equality)])).
% cnf(3063,plain,(set_difference(X1,X2)=X1|set_difference(X2,X1)!=X2),inference(spm,[status(thm)],[259,470,theory(equality)])).
% cnf(3088,plain,(set_difference(set_difference(X1,X2),set_union2(X1,X2))=esk4_0),inference(spm,[status(thm)],[1462,472,theory(equality)])).
% cnf(3515,plain,(set_difference(X1,X1)=set_difference(set_difference(X1,X2),X1)),inference(spm,[status(thm)],[477,280,theory(equality)])).
% cnf(3542,plain,(set_difference(set_union2(X1,set_difference(X1,X2)),set_difference(X1,X1))=set_difference(X1,set_difference(X1,X1))),inference(spm,[status(thm)],[475,3515,theory(equality)])).
% cnf(3582,plain,(set_union2(X1,set_difference(X1,X2))=set_difference(X1,set_difference(X1,X1))),inference(rw,[status(thm)],[3542,1799,theory(equality)])).
% cnf(3583,plain,(set_union2(X1,set_difference(X1,X2))=X1),inference(rw,[status(thm)],[3582,1799,theory(equality)])).
% cnf(3895,plain,(set_union2(set_difference(X1,X2),set_difference(X2,set_difference(X2,X1)))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[522,139,theory(equality)]),3583,theory(equality)])).
% cnf(3975,plain,(set_union2(esk4_0,set_difference(set_union2(X1,X2),set_difference(set_union2(X1,X2),X1)))=X1),inference(spm,[status(thm)],[3895,1926,theory(equality)])).
% cnf(4028,plain,(set_difference(X1,set_difference(X2,X1))=X1),inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[3975,476,theory(equality)]),475,theory(equality)]),1747,theory(equality)])).
% cnf(4426,plain,(set_difference(set_union2(X2,X1),set_difference(X2,X1))=X1),inference(rw,[status(thm)],[530,2089,theory(equality)])).
% cnf(4584,plain,(in(esk4_0,powerset(X1))),inference(er,[status(thm)],[1501,theory(equality)])).
% cnf(4801,plain,(X1=esk12_2(unordered_pair(X1,X1),X2)|disjoint(unordered_pair(X1,X1),X2)),inference(spm,[status(thm)],[578,313,theory(equality)])).
% cnf(5453,plain,(empty(set_difference(X1,set_difference(X2,X1)))|~subset(X1,set_difference(X2,X1))),inference(spm,[status(thm)],[2500,417,theory(equality)])).
% cnf(5472,plain,(empty(X1)|~subset(X1,set_difference(X2,X1))),inference(rw,[status(thm)],[5453,4028,theory(equality)])).
% cnf(6391,plain,(disjoint(X1,powerset(X2))|subset(esk12_2(X1,powerset(X2)),X2)),inference(er,[status(thm)],[603,theory(equality)])).
% cnf(6652,plain,(in(unordered_pair(esk4_0,esk4_0),X1)|powerset(powerset(X2))!=X1),inference(spm,[status(thm)],[607,4584,theory(equality)])).
% cnf(12208,plain,(set_difference(set_union2(X1,X2),set_difference(X1,X2))=set_union2(X1,X2)|esk4_0!=set_difference(X1,X2)),inference(spm,[status(thm)],[3063,3088,theory(equality)])).
% cnf(12247,plain,(X2=set_union2(X1,X2)|esk4_0!=set_difference(X1,X2)),inference(rw,[status(thm)],[12208,4426,theory(equality)])).
% cnf(59058,plain,(empty(unordered_pair(X1,X1))|~in(X1,set_difference(X2,unordered_pair(X1,X1)))),inference(spm,[status(thm)],[5472,336,theory(equality)])).
% cnf(59099,plain,(~in(X1,set_difference(X2,unordered_pair(X1,X1)))),inference(sr,[status(thm)],[59058,1503,theory(equality)])).
% cnf(85345,plain,(esk4_0=esk12_2(X1,powerset(esk4_0))|disjoint(X1,powerset(esk4_0))),inference(spm,[status(thm)],[1467,6391,theory(equality)])).
% cnf(85458,plain,(esk4_0=X1|disjoint(unordered_pair(X1,X1),powerset(esk4_0))),inference(spm,[status(thm)],[4801,85345,theory(equality)])).
% cnf(87258,plain,(disjoint(powerset(esk4_0),unordered_pair(X1,X1))|esk4_0=X1),inference(spm,[status(thm)],[202,85458,theory(equality)])).
% cnf(87351,plain,(set_difference(powerset(esk4_0),unordered_pair(X1,X1))=powerset(esk4_0)|esk4_0=X1),inference(spm,[status(thm)],[259,87258,theory(equality)])).
% cnf(87596,plain,(esk4_0=X1|~in(X1,powerset(esk4_0))),inference(spm,[status(thm)],[59099,87351,theory(equality)])).
% cnf(96552,plain,(esk4_0=esk11_2(powerset(esk4_0),X1)|subset(powerset(esk4_0),X1)),inference(spm,[status(thm)],[87596,266,theory(equality)])).
% cnf(103765,plain,(subset(powerset(esk4_0),X1)|~in(esk4_0,X1)),inference(spm,[status(thm)],[265,96552,theory(equality)])).
% cnf(249050,plain,(set_difference(powerset(esk4_0),X1)=esk4_0|~in(esk4_0,X1)),inference(spm,[status(thm)],[1462,103765,theory(equality)])).
% cnf(261742,plain,(set_union2(X1,esk4_0)=set_union2(X1,powerset(esk4_0))|~in(esk4_0,X1)),inference(spm,[status(thm)],[251,249050,theory(equality)])).
% cnf(262393,plain,(X1=set_union2(X1,powerset(esk4_0))|~in(esk4_0,X1)),inference(rw,[status(thm)],[261742,1474,theory(equality)])).
% cnf(1040640,plain,(in(unordered_pair(esk4_0,esk4_0),powerset(powerset(X1)))),inference(er,[status(thm)],[6652,theory(equality)])).
% cnf(1041137,plain,(subset(unordered_pair(esk4_0,esk4_0),X1)|powerset(X1)!=powerset(powerset(X2))),inference(spm,[status(thm)],[132,1040640,theory(equality)])).
% cnf(1046591,plain,(subset(unordered_pair(esk4_0,esk4_0),powerset(X1))),inference(er,[status(thm)],[1041137,theory(equality)])).
% cnf(1047878,plain,(set_difference(unordered_pair(esk4_0,esk4_0),powerset(X1))=esk4_0),inference(spm,[status(thm)],[1462,1046591,theory(equality)])).
% cnf(1048442,plain,(set_union2(unordered_pair(esk4_0,esk4_0),powerset(X1))=powerset(X1)),inference(spm,[status(thm)],[12247,1047878,theory(equality)])).
% cnf(1049963,plain,(powerset(esk4_0)=unordered_pair(esk4_0,esk4_0)|~in(esk4_0,unordered_pair(esk4_0,esk4_0))),inference(spm,[status(thm)],[262393,1048442,theory(equality)])).
% cnf(1050480,plain,(powerset(esk4_0)=unordered_pair(esk4_0,esk4_0)|$false),inference(rw,[status(thm)],[1049963,467,theory(equality)])).
% cnf(1050481,plain,(powerset(esk4_0)=unordered_pair(esk4_0,esk4_0)),inference(cn,[status(thm)],[1050480,theory(equality)])).
% cnf(1050482,plain,($false),inference(sr,[status(thm)],[1050481,1469,theory(equality)])).
% cnf(1050483,plain,($false),1050482,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 16441
% # ...of these trivial : 512
% # ...subsumed : 13835
% # ...remaining for further processing: 2094
% # Other redundant clauses eliminated : 14826
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 40
% # Backward-rewritten : 96
% # Generated clauses : 812172
% # ...of the previous two non-trivial : 701484
% # Contextual simplify-reflections : 164
% # Paramodulations : 796893
% # Factorizations : 240
% # Equation resolutions : 15031
% # Current number of processed clauses: 1850
% # Positive orientable unit clauses: 382
% # Positive unorientable unit clauses: 31
% # Negative unit clauses : 119
% # Non-unit-clauses : 1318
% # Current number of unprocessed clauses: 653705
% # ...number of literals in the above : 3417033
% # Clause-clause subsumption calls (NU) : 72355
% # Rec. Clause-clause subsumption calls : 47528
% # Unit Clause-clause subsumption calls : 3918
% # Rewrite failures with RHS unbound : 417
% # Indexed BW rewrite attempts : 2734
% # Indexed BW rewrite successes : 196
% # Backwards rewriting index: 788 leaves, 2.44+/-3.057 terms/leaf
% # Paramod-from index: 471 leaves, 2.08+/-2.057 terms/leaf
% # Paramod-into index: 687 leaves, 2.42+/-2.940 terms/leaf
% # -------------------------------------------------
% # User time : 30.059 s
% # System time : 1.050 s
% # Total time : 31.109 s
% # Maximum resident set size: 0 pages
% PrfWatch: 47.84 CPU 49.03 WC
% FINAL PrfWatch: 47.84 CPU 49.03 WC
% SZS output end Solution for /tmp/SystemOnTPTP20339/SEU147+2.tptp
%
%------------------------------------------------------------------------------