%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU145+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 : art07.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:17:25 EST 2010
% Result : Theorem 21.10s
% Output : Solution 21.10s
% 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/SystemOnTPTP20457/SEU145+2.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP20457/SEU145+2.tptp
% SZS output start Solution for /tmp/SystemOnTPTP20457/SEU145+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 20553
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% PrfWatch: 1.92 CPU 2.01 WC
% PrfWatch: 3.91 CPU 4.01 WC
% PrfWatch: 5.91 CPU 6.02 WC
% PrfWatch: 7.50 CPU 8.02 WC
% PrfWatch: 9.14 CPU 10.03 WC
% PrfWatch: 11.14 CPU 12.03 WC
% PrfWatch: 13.13 CPU 14.04 WC
% # Preprocessing time : 0.019 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% PrfWatch: 15.11 CPU 16.04 WC
% PrfWatch: 17.11 CPU 18.05 WC
% PrfWatch: 19.10 CPU 20.05 WC
% # SZS output start CNFRefutation.
% fof(3, axiom,![X1]:![X2]:(subset(singleton(X1),X2)<=>in(X1,X2)),file('/tmp/SRASS.s.p', l2_zfmisc_1)).
% fof(5, axiom,![X1]:![X2]:![X3]:((subset(X1,X2)&subset(X2,X3))=>subset(X1,X3)),file('/tmp/SRASS.s.p', t1_xboole_1)).
% fof(6, axiom,![X1]:![X2]:![X3]:(subset(X1,X2)=>subset(set_difference(X1,X3),set_difference(X2,X3))),file('/tmp/SRASS.s.p', t33_xboole_1)).
% fof(7, axiom,![X1]:![X2]:subset(set_difference(X1,X2),X1),file('/tmp/SRASS.s.p', t36_xboole_1)).
% fof(8, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(12, axiom,![X1]:![X2]:(set_difference(X1,X2)=empty_set<=>subset(X1,X2)),file('/tmp/SRASS.s.p', l32_xboole_1)).
% fof(32, axiom,![X1]:![X2]:set_intersection2(X1,X2)=set_intersection2(X2,X1),file('/tmp/SRASS.s.p', commutativity_k3_xboole_0)).
% fof(35, axiom,![X1]:~(singleton(X1)=empty_set),file('/tmp/SRASS.s.p', l1_zfmisc_1)).
% fof(42, axiom,![X1]:set_difference(X1,empty_set)=X1,file('/tmp/SRASS.s.p', t3_boole)).
% 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]:set_difference(empty_set,X1)=empty_set,file('/tmp/SRASS.s.p', t4_boole)).
% fof(46, axiom,![X1]:![X2]:![X3]:(X3=set_intersection2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)&in(X4,X2)))),file('/tmp/SRASS.s.p', d3_xboole_0)).
% fof(48, axiom,![X1]:(subset(X1,empty_set)=>X1=empty_set),file('/tmp/SRASS.s.p', t3_xboole_1)).
% fof(49, axiom,![X1]:unordered_pair(X1,X1)=singleton(X1),file('/tmp/SRASS.s.p', t69_enumset1)).
% fof(66, conjecture,![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3))))),file('/tmp/SRASS.s.p', l3_zfmisc_1)).
% fof(67, negated_conjecture,~(![X1]:![X2]:![X3]:(subset(X1,X2)=>(in(X3,X1)|subset(X1,set_difference(X2,singleton(X3)))))),inference(assume_negation,[status(cth)],[66])).
% fof(89, plain,![X1]:![X2]:((~(subset(singleton(X1),X2))|in(X1,X2))&(~(in(X1,X2))|subset(singleton(X1),X2))),inference(fof_nnf,[status(thm)],[3])).
% fof(90, plain,![X3]:![X4]:((~(subset(singleton(X3),X4))|in(X3,X4))&(~(in(X3,X4))|subset(singleton(X3),X4))),inference(variable_rename,[status(thm)],[89])).
% cnf(91,plain,(subset(singleton(X1),X2)|~in(X1,X2)),inference(split_conjunct,[status(thm)],[90])).
% fof(95, plain,![X1]:![X2]:![X3]:((~(subset(X1,X2))|~(subset(X2,X3)))|subset(X1,X3)),inference(fof_nnf,[status(thm)],[5])).
% fof(96, plain,![X4]:![X5]:![X6]:((~(subset(X4,X5))|~(subset(X5,X6)))|subset(X4,X6)),inference(variable_rename,[status(thm)],[95])).
% cnf(97,plain,(subset(X1,X2)|~subset(X3,X2)|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[96])).
% fof(98, plain,![X1]:![X2]:![X3]:(~(subset(X1,X2))|subset(set_difference(X1,X3),set_difference(X2,X3))),inference(fof_nnf,[status(thm)],[6])).
% fof(99, plain,![X4]:![X5]:![X6]:(~(subset(X4,X5))|subset(set_difference(X4,X6),set_difference(X5,X6))),inference(variable_rename,[status(thm)],[98])).
% cnf(100,plain,(subset(set_difference(X1,X2),set_difference(X3,X2))|~subset(X1,X3)),inference(split_conjunct,[status(thm)],[99])).
% fof(101, plain,![X3]:![X4]:subset(set_difference(X3,X4),X3),inference(variable_rename,[status(thm)],[7])).
% cnf(102,plain,(subset(set_difference(X1,X2),X1)),inference(split_conjunct,[status(thm)],[101])).
% fof(103, 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)],[8])).
% fof(104, 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)],[103])).
% fof(105, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[104])).
% fof(106, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))&(in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[105])).
% fof(107, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk2_2(X4,X5),X5))|~(esk2_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk2_2(X4,X5),X5)|esk2_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[106])).
% cnf(111,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[107])).
% fof(135, 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)],[12])).
% fof(136, 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)],[135])).
% cnf(137,plain,(set_difference(X1,X2)=empty_set|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[136])).
% cnf(138,plain,(subset(X1,X2)|set_difference(X1,X2)!=empty_set),inference(split_conjunct,[status(thm)],[136])).
% fof(196, plain,![X3]:![X4]:set_intersection2(X3,X4)=set_intersection2(X4,X3),inference(variable_rename,[status(thm)],[32])).
% cnf(197,plain,(set_intersection2(X1,X2)=set_intersection2(X2,X1)),inference(split_conjunct,[status(thm)],[196])).
% fof(202, plain,![X2]:~(singleton(X2)=empty_set),inference(variable_rename,[status(thm)],[35])).
% cnf(203,plain,(singleton(X1)!=empty_set),inference(split_conjunct,[status(thm)],[202])).
% fof(234, plain,![X2]:set_difference(X2,empty_set)=X2,inference(variable_rename,[status(thm)],[42])).
% cnf(235,plain,(set_difference(X1,empty_set)=X1),inference(split_conjunct,[status(thm)],[234])).
% fof(238, plain,![X3]:![X4]:set_difference(X3,set_difference(X3,X4))=set_intersection2(X3,X4),inference(variable_rename,[status(thm)],[44])).
% cnf(239,plain,(set_difference(X1,set_difference(X1,X2))=set_intersection2(X1,X2)),inference(split_conjunct,[status(thm)],[238])).
% fof(240, plain,![X2]:set_difference(empty_set,X2)=empty_set,inference(variable_rename,[status(thm)],[45])).
% cnf(241,plain,(set_difference(empty_set,X1)=empty_set),inference(split_conjunct,[status(thm)],[240])).
% fof(242, plain,![X1]:![X2]:![X3]:((~(X3=set_intersection2(X1,X2))|![X4]:((~(in(X4,X3))|(in(X4,X1)&in(X4,X2)))&((~(in(X4,X1))|~(in(X4,X2)))|in(X4,X3))))&(?[X4]:((~(in(X4,X3))|(~(in(X4,X1))|~(in(X4,X2))))&(in(X4,X3)|(in(X4,X1)&in(X4,X2))))|X3=set_intersection2(X1,X2))),inference(fof_nnf,[status(thm)],[46])).
% fof(243, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(?[X9]:((~(in(X9,X7))|(~(in(X9,X5))|~(in(X9,X6))))&(in(X9,X7)|(in(X9,X5)&in(X9,X6))))|X7=set_intersection2(X5,X6))),inference(variable_rename,[status(thm)],[242])).
% fof(244, plain,![X5]:![X6]:![X7]:((~(X7=set_intersection2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk11_3(X5,X6,X7),X7))|(~(in(esk11_3(X5,X6,X7),X5))|~(in(esk11_3(X5,X6,X7),X6))))&(in(esk11_3(X5,X6,X7),X7)|(in(esk11_3(X5,X6,X7),X5)&in(esk11_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(skolemize,[status(esa)],[243])).
% fof(245, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)&in(X8,X6)))&((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&(((~(in(esk11_3(X5,X6,X7),X7))|(~(in(esk11_3(X5,X6,X7),X5))|~(in(esk11_3(X5,X6,X7),X6))))&(in(esk11_3(X5,X6,X7),X7)|(in(esk11_3(X5,X6,X7),X5)&in(esk11_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))),inference(shift_quantors,[status(thm)],[244])).
% fof(246, plain,![X5]:![X6]:![X7]:![X8]:(((((in(X8,X5)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6)))&((in(X8,X6)|~(in(X8,X7)))|~(X7=set_intersection2(X5,X6))))&(((~(in(X8,X5))|~(in(X8,X6)))|in(X8,X7))|~(X7=set_intersection2(X5,X6))))&(((~(in(esk11_3(X5,X6,X7),X7))|(~(in(esk11_3(X5,X6,X7),X5))|~(in(esk11_3(X5,X6,X7),X6))))|X7=set_intersection2(X5,X6))&(((in(esk11_3(X5,X6,X7),X5)|in(esk11_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))&((in(esk11_3(X5,X6,X7),X6)|in(esk11_3(X5,X6,X7),X7))|X7=set_intersection2(X5,X6))))),inference(distribute,[status(thm)],[245])).
% cnf(247,plain,(X1=set_intersection2(X2,X3)|in(esk11_3(X2,X3,X1),X1)|in(esk11_3(X2,X3,X1),X3)),inference(split_conjunct,[status(thm)],[246])).
% cnf(248,plain,(X1=set_intersection2(X2,X3)|in(esk11_3(X2,X3,X1),X1)|in(esk11_3(X2,X3,X1),X2)),inference(split_conjunct,[status(thm)],[246])).
% fof(255, plain,![X1]:(~(subset(X1,empty_set))|X1=empty_set),inference(fof_nnf,[status(thm)],[48])).
% fof(256, plain,![X2]:(~(subset(X2,empty_set))|X2=empty_set),inference(variable_rename,[status(thm)],[255])).
% cnf(257,plain,(X1=empty_set|~subset(X1,empty_set)),inference(split_conjunct,[status(thm)],[256])).
% fof(258, plain,![X2]:unordered_pair(X2,X2)=singleton(X2),inference(variable_rename,[status(thm)],[49])).
% cnf(259,plain,(unordered_pair(X1,X1)=singleton(X1)),inference(split_conjunct,[status(thm)],[258])).
% fof(307, negated_conjecture,?[X1]:?[X2]:?[X3]:(subset(X1,X2)&(~(in(X3,X1))&~(subset(X1,set_difference(X2,singleton(X3)))))),inference(fof_nnf,[status(thm)],[67])).
% fof(308, negated_conjecture,?[X4]:?[X5]:?[X6]:(subset(X4,X5)&(~(in(X6,X4))&~(subset(X4,set_difference(X5,singleton(X6)))))),inference(variable_rename,[status(thm)],[307])).
% fof(309, negated_conjecture,(subset(esk13_0,esk14_0)&(~(in(esk15_0,esk13_0))&~(subset(esk13_0,set_difference(esk14_0,singleton(esk15_0)))))),inference(skolemize,[status(esa)],[308])).
% cnf(310,negated_conjecture,(~subset(esk13_0,set_difference(esk14_0,singleton(esk15_0)))),inference(split_conjunct,[status(thm)],[309])).
% cnf(311,negated_conjecture,(~in(esk15_0,esk13_0)),inference(split_conjunct,[status(thm)],[309])).
% cnf(312,negated_conjecture,(subset(esk13_0,esk14_0)),inference(split_conjunct,[status(thm)],[309])).
% cnf(315,plain,(subset(unordered_pair(X1,X1),X2)|~in(X1,X2)),inference(rw,[status(thm)],[91,259,theory(equality)]),['unfolding']).
% cnf(316,plain,(X2=X3|unordered_pair(X2,X2)!=X1|~in(X3,X1)),inference(rw,[status(thm)],[111,259,theory(equality)]),['unfolding']).
% cnf(319,plain,(unordered_pair(X1,X1)!=empty_set),inference(rw,[status(thm)],[203,259,theory(equality)]),['unfolding']).
% cnf(320,negated_conjecture,(~subset(esk13_0,set_difference(esk14_0,unordered_pair(esk15_0,esk15_0)))),inference(rw,[status(thm)],[310,259,theory(equality)]),['unfolding']).
% cnf(323,plain,(set_difference(X1,set_difference(X1,X2))=set_difference(X2,set_difference(X2,X1))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[197,239,theory(equality)]),239,theory(equality)]),['unfolding']).
% cnf(326,plain,(set_difference(X2,set_difference(X2,X3))=X1|in(esk11_3(X2,X3,X1),X3)|in(esk11_3(X2,X3,X1),X1)),inference(rw,[status(thm)],[247,239,theory(equality)]),['unfolding']).
% cnf(327,plain,(set_difference(X2,set_difference(X2,X3))=X1|in(esk11_3(X2,X3,X1),X2)|in(esk11_3(X2,X3,X1),X1)),inference(rw,[status(thm)],[248,239,theory(equality)]),['unfolding']).
% cnf(392,plain,(empty_set=unordered_pair(X1,X1)|~in(X1,empty_set)),inference(spm,[status(thm)],[257,315,theory(equality)])).
% cnf(397,plain,(~in(X1,empty_set)),inference(sr,[status(thm)],[392,319,theory(equality)])).
% cnf(536,plain,(subset(set_difference(X2,set_difference(X2,X1)),X1)),inference(spm,[status(thm)],[102,323,theory(equality)])).
% cnf(596,plain,(set_difference(set_difference(X1,X2),set_difference(X3,X2))=empty_set|~subset(X1,X3)),inference(spm,[status(thm)],[137,100,theory(equality)])).
% cnf(626,plain,(X1=X2|~in(X2,unordered_pair(X1,X1))),inference(er,[status(thm)],[316,theory(equality)])).
% cnf(1236,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,set_difference(empty_set,X1)),X3)|in(esk11_3(X2,X3,set_difference(empty_set,X1)),set_difference(empty_set,X1))),inference(spm,[status(thm)],[241,326,theory(equality)])).
% cnf(1329,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X3)|in(esk11_3(X2,X3,set_difference(empty_set,X1)),set_difference(empty_set,X1))),inference(rw,[status(thm)],[1236,241,theory(equality)])).
% cnf(1330,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X3)|in(esk11_3(X2,X3,empty_set),empty_set)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1329,241,theory(equality)]),241,theory(equality)])).
% cnf(1403,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,set_difference(empty_set,X1)),X2)|in(esk11_3(X2,X3,set_difference(empty_set,X1)),set_difference(empty_set,X1))),inference(spm,[status(thm)],[241,327,theory(equality)])).
% cnf(1504,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X2)|in(esk11_3(X2,X3,set_difference(empty_set,X1)),set_difference(empty_set,X1))),inference(rw,[status(thm)],[1403,241,theory(equality)])).
% cnf(1505,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X2)|in(esk11_3(X2,X3,empty_set),empty_set)),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1504,241,theory(equality)]),241,theory(equality)])).
% cnf(15445,negated_conjecture,(set_difference(set_difference(esk13_0,X1),set_difference(esk14_0,X1))=empty_set),inference(spm,[status(thm)],[596,312,theory(equality)])).
% cnf(15514,negated_conjecture,(subset(set_difference(set_difference(esk13_0,X1),empty_set),set_difference(esk14_0,X1))),inference(spm,[status(thm)],[536,15445,theory(equality)])).
% cnf(15658,negated_conjecture,(subset(set_difference(esk13_0,X1),set_difference(esk14_0,X1))),inference(rw,[status(thm)],[15514,235,theory(equality)])).
% cnf(15745,negated_conjecture,(subset(X1,set_difference(esk14_0,X2))|~subset(X1,set_difference(esk13_0,X2))),inference(spm,[status(thm)],[97,15658,theory(equality)])).
% cnf(195743,negated_conjecture,(~subset(esk13_0,set_difference(esk13_0,unordered_pair(esk15_0,esk15_0)))),inference(spm,[status(thm)],[320,15745,theory(equality)])).
% cnf(196552,negated_conjecture,(set_difference(esk13_0,set_difference(esk13_0,unordered_pair(esk15_0,esk15_0)))!=empty_set),inference(spm,[status(thm)],[195743,138,theory(equality)])).
% cnf(232931,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X3)),inference(sr,[status(thm)],[1330,397,theory(equality)])).
% cnf(233058,negated_conjecture,(in(esk11_3(esk13_0,unordered_pair(esk15_0,esk15_0),empty_set),unordered_pair(esk15_0,esk15_0))),inference(spm,[status(thm)],[196552,232931,theory(equality)])).
% cnf(234976,negated_conjecture,(esk15_0=esk11_3(esk13_0,unordered_pair(esk15_0,esk15_0),empty_set)),inference(spm,[status(thm)],[626,233058,theory(equality)])).
% cnf(435467,plain,(set_difference(X2,set_difference(X2,X3))=empty_set|in(esk11_3(X2,X3,empty_set),X2)),inference(sr,[status(thm)],[1505,397,theory(equality)])).
% cnf(435605,negated_conjecture,(in(esk11_3(esk13_0,unordered_pair(esk15_0,esk15_0),empty_set),esk13_0)),inference(spm,[status(thm)],[196552,435467,theory(equality)])).
% cnf(436703,negated_conjecture,(in(esk15_0,esk13_0)),inference(rw,[status(thm)],[435605,234976,theory(equality)])).
% cnf(436704,negated_conjecture,($false),inference(sr,[status(thm)],[436703,311,theory(equality)])).
% cnf(436705,negated_conjecture,($false),436704,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 6687
% # ...of these trivial : 294
% # ...subsumed : 4994
% # ...remaining for further processing: 1399
% # Other redundant clauses eliminated : 4697
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 39
% # Backward-rewritten : 27
% # Generated clauses : 342958
% # ...of the previous two non-trivial : 314285
% # Contextual simplify-reflections : 514
% # Paramodulations : 338076
% # Factorizations : 103
% # Equation resolutions : 4779
% # Current number of processed clauses: 1238
% # Positive orientable unit clauses: 267
% # Positive unorientable unit clauses: 3
% # Negative unit clauses : 108
% # Non-unit-clauses : 860
% # Current number of unprocessed clauses: 300659
% # ...number of literals in the above : 1544453
% # Clause-clause subsumption calls (NU) : 26188
% # Rec. Clause-clause subsumption calls : 18692
% # Unit Clause-clause subsumption calls : 388
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 416
% # Indexed BW rewrite successes : 50
% # Backwards rewriting index: 703 leaves, 2.12+/-5.969 terms/leaf
% # Paramod-from index: 340 leaves, 1.90+/-3.808 terms/leaf
% # Paramod-into index: 625 leaves, 1.89+/-3.609 terms/leaf
% # -------------------------------------------------
% # User time : 13.243 s
% # System time : 0.442 s
% # Total time : 13.685 s
% # Maximum resident set size: 0 pages
% PrfWatch: 20.14 CPU 21.10 WC
% FINAL PrfWatch: 20.14 CPU 21.10 WC
% SZS output end Solution for /tmp/SystemOnTPTP20457/SEU145+2.tptp
%
%------------------------------------------------------------------------------