TSTP Solution File: NUM401+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : NUM401+1 : TPTP v5.0.0. Released v3.2.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 : Wed Dec 29 18:50:25 EST 2010
% Result : Theorem 1.04s
% Output : Solution 1.04s
% 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/SystemOnTPTP17303/NUM401+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP17303/NUM401+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP17303/NUM401+1.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 17399
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.02 WC
% # Preprocessing time : 0.017 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(5, axiom,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),file('/tmp/SRASS.s.p', t24_ordinal1)).
% fof(6, axiom,![X1]:![X2]:((ordinal(X1)&ordinal(X2))=>(ordinal_subset(X1,X2)<=>subset(X1,X2))),file('/tmp/SRASS.s.p', redefinition_r1_ordinal1)).
% fof(15, axiom,![X1]:![X2]:subset(X1,X1),file('/tmp/SRASS.s.p', reflexivity_r1_tarski)).
% fof(20, axiom,![X1]:![X2]:![X3]:(X3=set_union2(X1,X2)<=>![X4]:(in(X4,X3)<=>(in(X4,X1)|in(X4,X2)))),file('/tmp/SRASS.s.p', d2_xboole_0)).
% fof(24, axiom,![X1]:(ordinal(X1)=>(epsilon_transitive(X1)&epsilon_connected(X1))),file('/tmp/SRASS.s.p', cc1_ordinal1)).
% fof(28, axiom,![X1]:![X2]:(X2=singleton(X1)<=>![X3]:(in(X3,X2)<=>X3=X1)),file('/tmp/SRASS.s.p', d1_tarski)).
% fof(29, axiom,![X1]:(epsilon_transitive(X1)<=>![X2]:(in(X2,X1)=>subset(X2,X1))),file('/tmp/SRASS.s.p', d2_ordinal1)).
% fof(32, axiom,![X1]:![X2]:(X1=X2<=>(subset(X1,X2)&subset(X2,X1))),file('/tmp/SRASS.s.p', d10_xboole_0)).
% fof(35, axiom,![X1]:succ(X1)=set_union2(X1,singleton(X1)),file('/tmp/SRASS.s.p', d1_ordinal1)).
% fof(54, conjecture,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(in(X1,succ(X2))<=>ordinal_subset(X1,X2)))),file('/tmp/SRASS.s.p', t34_ordinal1)).
% fof(55, negated_conjecture,~(![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>(in(X1,succ(X2))<=>ordinal_subset(X1,X2))))),inference(assume_negation,[status(cth)],[54])).
% fof(57, plain,![X1]:(ordinal(X1)=>![X2]:(ordinal(X2)=>~(((~(in(X1,X2))&~(X1=X2))&~(in(X2,X1)))))),inference(fof_simplification,[status(thm)],[5,theory(equality)])).
% fof(76, plain,![X1]:(~(ordinal(X1))|![X2]:(~(ordinal(X2))|((in(X1,X2)|X1=X2)|in(X2,X1)))),inference(fof_nnf,[status(thm)],[57])).
% fof(77, plain,![X3]:(~(ordinal(X3))|![X4]:(~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))),inference(variable_rename,[status(thm)],[76])).
% fof(78, plain,![X3]:![X4]:((~(ordinal(X4))|((in(X3,X4)|X3=X4)|in(X4,X3)))|~(ordinal(X3))),inference(shift_quantors,[status(thm)],[77])).
% cnf(79,plain,(in(X2,X1)|X1=X2|in(X1,X2)|~ordinal(X1)|~ordinal(X2)),inference(split_conjunct,[status(thm)],[78])).
% fof(80, plain,![X1]:![X2]:((~(ordinal(X1))|~(ordinal(X2)))|((~(ordinal_subset(X1,X2))|subset(X1,X2))&(~(subset(X1,X2))|ordinal_subset(X1,X2)))),inference(fof_nnf,[status(thm)],[6])).
% fof(81, plain,![X3]:![X4]:((~(ordinal(X3))|~(ordinal(X4)))|((~(ordinal_subset(X3,X4))|subset(X3,X4))&(~(subset(X3,X4))|ordinal_subset(X3,X4)))),inference(variable_rename,[status(thm)],[80])).
% fof(82, plain,![X3]:![X4]:(((~(ordinal_subset(X3,X4))|subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))&((~(subset(X3,X4))|ordinal_subset(X3,X4))|(~(ordinal(X3))|~(ordinal(X4))))),inference(distribute,[status(thm)],[81])).
% cnf(83,plain,(ordinal_subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~subset(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% cnf(84,plain,(subset(X2,X1)|~ordinal(X1)|~ordinal(X2)|~ordinal_subset(X2,X1)),inference(split_conjunct,[status(thm)],[82])).
% fof(113, plain,![X3]:![X4]:subset(X3,X3),inference(variable_rename,[status(thm)],[15])).
% cnf(114,plain,(subset(X1,X1)),inference(split_conjunct,[status(thm)],[113])).
% fof(133, plain,![X1]:![X2]:![X3]:((~(X3=set_union2(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_union2(X1,X2))),inference(fof_nnf,[status(thm)],[20])).
% fof(134, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(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_union2(X5,X6))),inference(variable_rename,[status(thm)],[133])).
% fof(135, plain,![X5]:![X6]:![X7]:((~(X7=set_union2(X5,X6))|![X8]:((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))&((~(in(X8,X5))&~(in(X8,X6)))|in(X8,X7))))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))&~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)|in(esk5_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(skolemize,[status(esa)],[134])).
% fof(136, 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_union2(X5,X6)))&(((~(in(esk5_3(X5,X6,X7),X7))|(~(in(esk5_3(X5,X6,X7),X5))&~(in(esk5_3(X5,X6,X7),X6))))&(in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)|in(esk5_3(X5,X6,X7),X6))))|X7=set_union2(X5,X6))),inference(shift_quantors,[status(thm)],[135])).
% fof(137, plain,![X5]:![X6]:![X7]:![X8]:((((~(in(X8,X7))|(in(X8,X5)|in(X8,X6)))|~(X7=set_union2(X5,X6)))&(((~(in(X8,X5))|in(X8,X7))|~(X7=set_union2(X5,X6)))&((~(in(X8,X6))|in(X8,X7))|~(X7=set_union2(X5,X6)))))&((((~(in(esk5_3(X5,X6,X7),X5))|~(in(esk5_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6))&((~(in(esk5_3(X5,X6,X7),X6))|~(in(esk5_3(X5,X6,X7),X7)))|X7=set_union2(X5,X6)))&((in(esk5_3(X5,X6,X7),X7)|(in(esk5_3(X5,X6,X7),X5)|in(esk5_3(X5,X6,X7),X6)))|X7=set_union2(X5,X6)))),inference(distribute,[status(thm)],[136])).
% cnf(141,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X3)),inference(split_conjunct,[status(thm)],[137])).
% cnf(142,plain,(in(X4,X1)|X1!=set_union2(X2,X3)|~in(X4,X2)),inference(split_conjunct,[status(thm)],[137])).
% cnf(143,plain,(in(X4,X3)|in(X4,X2)|X1!=set_union2(X2,X3)|~in(X4,X1)),inference(split_conjunct,[status(thm)],[137])).
% fof(154, plain,![X1]:(~(ordinal(X1))|(epsilon_transitive(X1)&epsilon_connected(X1))),inference(fof_nnf,[status(thm)],[24])).
% fof(155, plain,![X2]:(~(ordinal(X2))|(epsilon_transitive(X2)&epsilon_connected(X2))),inference(variable_rename,[status(thm)],[154])).
% fof(156, plain,![X2]:((epsilon_transitive(X2)|~(ordinal(X2)))&(epsilon_connected(X2)|~(ordinal(X2)))),inference(distribute,[status(thm)],[155])).
% cnf(158,plain,(epsilon_transitive(X1)|~ordinal(X1)),inference(split_conjunct,[status(thm)],[156])).
% fof(170, 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)],[28])).
% fof(171, 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)],[170])).
% fof(172, plain,![X4]:![X5]:((~(X5=singleton(X4))|![X6]:((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5))))&(((~(in(esk8_2(X4,X5),X5))|~(esk8_2(X4,X5)=X4))&(in(esk8_2(X4,X5),X5)|esk8_2(X4,X5)=X4))|X5=singleton(X4))),inference(skolemize,[status(esa)],[171])).
% fof(173, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)&(~(X6=X4)|in(X6,X5)))|~(X5=singleton(X4)))&(((~(in(esk8_2(X4,X5),X5))|~(esk8_2(X4,X5)=X4))&(in(esk8_2(X4,X5),X5)|esk8_2(X4,X5)=X4))|X5=singleton(X4))),inference(shift_quantors,[status(thm)],[172])).
% fof(174, plain,![X4]:![X5]:![X6]:((((~(in(X6,X5))|X6=X4)|~(X5=singleton(X4)))&((~(X6=X4)|in(X6,X5))|~(X5=singleton(X4))))&(((~(in(esk8_2(X4,X5),X5))|~(esk8_2(X4,X5)=X4))|X5=singleton(X4))&((in(esk8_2(X4,X5),X5)|esk8_2(X4,X5)=X4)|X5=singleton(X4)))),inference(distribute,[status(thm)],[173])).
% cnf(177,plain,(in(X3,X1)|X1!=singleton(X2)|X3!=X2),inference(split_conjunct,[status(thm)],[174])).
% cnf(178,plain,(X3=X2|X1!=singleton(X2)|~in(X3,X1)),inference(split_conjunct,[status(thm)],[174])).
% fof(179, plain,![X1]:((~(epsilon_transitive(X1))|![X2]:(~(in(X2,X1))|subset(X2,X1)))&(?[X2]:(in(X2,X1)&~(subset(X2,X1)))|epsilon_transitive(X1))),inference(fof_nnf,[status(thm)],[29])).
% fof(180, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&(?[X5]:(in(X5,X3)&~(subset(X5,X3)))|epsilon_transitive(X3))),inference(variable_rename,[status(thm)],[179])).
% fof(181, plain,![X3]:((~(epsilon_transitive(X3))|![X4]:(~(in(X4,X3))|subset(X4,X3)))&((in(esk9_1(X3),X3)&~(subset(esk9_1(X3),X3)))|epsilon_transitive(X3))),inference(skolemize,[status(esa)],[180])).
% fof(182, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk9_1(X3),X3)&~(subset(esk9_1(X3),X3)))|epsilon_transitive(X3))),inference(shift_quantors,[status(thm)],[181])).
% fof(183, plain,![X3]:![X4]:(((~(in(X4,X3))|subset(X4,X3))|~(epsilon_transitive(X3)))&((in(esk9_1(X3),X3)|epsilon_transitive(X3))&(~(subset(esk9_1(X3),X3))|epsilon_transitive(X3)))),inference(distribute,[status(thm)],[182])).
% cnf(186,plain,(subset(X2,X1)|~epsilon_transitive(X1)|~in(X2,X1)),inference(split_conjunct,[status(thm)],[183])).
% fof(193, plain,![X1]:![X2]:((~(X1=X2)|(subset(X1,X2)&subset(X2,X1)))&((~(subset(X1,X2))|~(subset(X2,X1)))|X1=X2)),inference(fof_nnf,[status(thm)],[32])).
% fof(194, plain,![X3]:![X4]:((~(X3=X4)|(subset(X3,X4)&subset(X4,X3)))&((~(subset(X3,X4))|~(subset(X4,X3)))|X3=X4)),inference(variable_rename,[status(thm)],[193])).
% fof(195, 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)],[194])).
% cnf(196,plain,(X1=X2|~subset(X2,X1)|~subset(X1,X2)),inference(split_conjunct,[status(thm)],[195])).
% fof(211, plain,![X2]:succ(X2)=set_union2(X2,singleton(X2)),inference(variable_rename,[status(thm)],[35])).
% cnf(212,plain,(succ(X1)=set_union2(X1,singleton(X1))),inference(split_conjunct,[status(thm)],[211])).
% fof(279, negated_conjecture,?[X1]:(ordinal(X1)&?[X2]:(ordinal(X2)&((~(in(X1,succ(X2)))|~(ordinal_subset(X1,X2)))&(in(X1,succ(X2))|ordinal_subset(X1,X2))))),inference(fof_nnf,[status(thm)],[55])).
% fof(280, negated_conjecture,?[X3]:(ordinal(X3)&?[X4]:(ordinal(X4)&((~(in(X3,succ(X4)))|~(ordinal_subset(X3,X4)))&(in(X3,succ(X4))|ordinal_subset(X3,X4))))),inference(variable_rename,[status(thm)],[279])).
% fof(281, negated_conjecture,(ordinal(esk18_0)&(ordinal(esk19_0)&((~(in(esk18_0,succ(esk19_0)))|~(ordinal_subset(esk18_0,esk19_0)))&(in(esk18_0,succ(esk19_0))|ordinal_subset(esk18_0,esk19_0))))),inference(skolemize,[status(esa)],[280])).
% cnf(282,negated_conjecture,(ordinal_subset(esk18_0,esk19_0)|in(esk18_0,succ(esk19_0))),inference(split_conjunct,[status(thm)],[281])).
% cnf(283,negated_conjecture,(~ordinal_subset(esk18_0,esk19_0)|~in(esk18_0,succ(esk19_0))),inference(split_conjunct,[status(thm)],[281])).
% cnf(284,negated_conjecture,(ordinal(esk19_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(285,negated_conjecture,(ordinal(esk18_0)),inference(split_conjunct,[status(thm)],[281])).
% cnf(287,negated_conjecture,(ordinal_subset(esk18_0,esk19_0)|in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))),inference(rw,[status(thm)],[282,212,theory(equality)]),['unfolding']).
% cnf(294,negated_conjecture,(~ordinal_subset(esk18_0,esk19_0)|~in(esk18_0,set_union2(esk19_0,singleton(esk19_0)))),inference(rw,[status(thm)],[283,212,theory(equality)]),['unfolding']).
% cnf(305,plain,(in(X1,X2)|singleton(X1)!=X2),inference(er,[status(thm)],[177,theory(equality)])).
% cnf(348,plain,(in(X1,singleton(X1))),inference(er,[status(thm)],[305,theory(equality)])).
% cnf(384,plain,(in(X1,set_union2(X2,X3))|~in(X1,X3)),inference(er,[status(thm)],[141,theory(equality)])).
% cnf(399,plain,(X1=X2|~subset(X1,X2)|~epsilon_transitive(X1)|~in(X2,X1)),inference(spm,[status(thm)],[196,186,theory(equality)])).
% cnf(403,plain,(in(X1,set_union2(X2,X3))|~in(X1,X2)),inference(er,[status(thm)],[142,theory(equality)])).
% cnf(413,negated_conjecture,(X1=esk19_0|in(esk19_0,X1)|in(X1,esk19_0)|~ordinal(X1)),inference(spm,[status(thm)],[79,284,theory(equality)])).
% cnf(421,plain,(in(X1,X2)|in(X1,X3)|~in(X1,set_union2(X3,X2))),inference(er,[status(thm)],[143,theory(equality)])).
% cnf(614,negated_conjecture,(esk18_0=esk19_0|in(esk18_0,esk19_0)|in(esk19_0,esk18_0)),inference(spm,[status(thm)],[413,285,theory(equality)])).
% cnf(719,negated_conjecture,(~ordinal_subset(esk18_0,esk19_0)|~in(esk18_0,singleton(esk19_0))),inference(spm,[status(thm)],[294,384,theory(equality)])).
% cnf(733,negated_conjecture,(~in(esk18_0,singleton(esk19_0))|~subset(esk18_0,esk19_0)|~ordinal(esk18_0)|~ordinal(esk19_0)),inference(spm,[status(thm)],[719,83,theory(equality)])).
% cnf(735,negated_conjecture,(~in(esk18_0,singleton(esk19_0))|~subset(esk18_0,esk19_0)|$false|~ordinal(esk19_0)),inference(rw,[status(thm)],[733,285,theory(equality)])).
% cnf(736,negated_conjecture,(~in(esk18_0,singleton(esk19_0))|~subset(esk18_0,esk19_0)|$false|$false),inference(rw,[status(thm)],[735,284,theory(equality)])).
% cnf(737,negated_conjecture,(~in(esk18_0,singleton(esk19_0))|~subset(esk18_0,esk19_0)),inference(cn,[status(thm)],[736,theory(equality)])).
% cnf(1061,negated_conjecture,(~ordinal_subset(esk18_0,esk19_0)|~in(esk18_0,esk19_0)),inference(spm,[status(thm)],[294,403,theory(equality)])).
% cnf(1083,negated_conjecture,(~in(esk18_0,esk19_0)|~subset(esk18_0,esk19_0)|~ordinal(esk18_0)|~ordinal(esk19_0)),inference(spm,[status(thm)],[1061,83,theory(equality)])).
% cnf(1085,negated_conjecture,(~in(esk18_0,esk19_0)|~subset(esk18_0,esk19_0)|$false|~ordinal(esk19_0)),inference(rw,[status(thm)],[1083,285,theory(equality)])).
% cnf(1086,negated_conjecture,(~in(esk18_0,esk19_0)|~subset(esk18_0,esk19_0)|$false|$false),inference(rw,[status(thm)],[1085,284,theory(equality)])).
% cnf(1087,negated_conjecture,(~in(esk18_0,esk19_0)|~subset(esk18_0,esk19_0)),inference(cn,[status(thm)],[1086,theory(equality)])).
% cnf(1092,negated_conjecture,(~in(esk18_0,esk19_0)|~epsilon_transitive(esk19_0)),inference(spm,[status(thm)],[1087,186,theory(equality)])).
% cnf(1094,negated_conjecture,(~in(esk18_0,esk19_0)|~ordinal(esk19_0)),inference(spm,[status(thm)],[1092,158,theory(equality)])).
% cnf(1096,negated_conjecture,(~in(esk18_0,esk19_0)|$false),inference(rw,[status(thm)],[1094,284,theory(equality)])).
% cnf(1097,negated_conjecture,(~in(esk18_0,esk19_0)),inference(cn,[status(thm)],[1096,theory(equality)])).
% cnf(1098,negated_conjecture,(esk18_0=esk19_0|in(esk19_0,esk18_0)),inference(sr,[status(thm)],[614,1097,theory(equality)])).
% cnf(1421,negated_conjecture,(in(esk18_0,esk19_0)|in(esk18_0,singleton(esk19_0))|ordinal_subset(esk18_0,esk19_0)),inference(spm,[status(thm)],[421,287,theory(equality)])).
% cnf(1431,negated_conjecture,(in(esk18_0,singleton(esk19_0))|ordinal_subset(esk18_0,esk19_0)),inference(sr,[status(thm)],[1421,1097,theory(equality)])).
% cnf(1433,negated_conjecture,(subset(esk18_0,esk19_0)|in(esk18_0,singleton(esk19_0))|~ordinal(esk18_0)|~ordinal(esk19_0)),inference(spm,[status(thm)],[84,1431,theory(equality)])).
% cnf(1436,negated_conjecture,(subset(esk18_0,esk19_0)|in(esk18_0,singleton(esk19_0))|$false|~ordinal(esk19_0)),inference(rw,[status(thm)],[1433,285,theory(equality)])).
% cnf(1437,negated_conjecture,(subset(esk18_0,esk19_0)|in(esk18_0,singleton(esk19_0))|$false|$false),inference(rw,[status(thm)],[1436,284,theory(equality)])).
% cnf(1438,negated_conjecture,(subset(esk18_0,esk19_0)|in(esk18_0,singleton(esk19_0))),inference(cn,[status(thm)],[1437,theory(equality)])).
% cnf(1442,negated_conjecture,(esk18_0=esk19_0|in(esk18_0,singleton(esk19_0))|~epsilon_transitive(esk18_0)|~in(esk19_0,esk18_0)),inference(spm,[status(thm)],[399,1438,theory(equality)])).
% cnf(1452,negated_conjecture,(esk18_0=esk19_0|in(esk18_0,singleton(esk19_0))|~epsilon_transitive(esk18_0)),inference(csr,[status(thm)],[1442,1098])).
% cnf(1455,negated_conjecture,(X1=esk18_0|esk18_0=esk19_0|singleton(X1)!=singleton(esk19_0)|~epsilon_transitive(esk18_0)),inference(spm,[status(thm)],[178,1452,theory(equality)])).
% cnf(1501,negated_conjecture,(esk18_0=esk19_0|X1=esk18_0|singleton(X1)!=singleton(esk19_0)|~ordinal(esk18_0)),inference(spm,[status(thm)],[1455,158,theory(equality)])).
% cnf(1503,negated_conjecture,(esk18_0=esk19_0|X1=esk18_0|singleton(X1)!=singleton(esk19_0)|$false),inference(rw,[status(thm)],[1501,285,theory(equality)])).
% cnf(1504,negated_conjecture,(esk18_0=esk19_0|X1=esk18_0|singleton(X1)!=singleton(esk19_0)),inference(cn,[status(thm)],[1503,theory(equality)])).
% cnf(1505,negated_conjecture,(esk18_0=esk19_0),inference(er,[status(thm)],[1504,theory(equality)])).
% cnf(1653,negated_conjecture,($false|~in(esk18_0,singleton(esk19_0))),inference(rw,[status(thm)],[inference(rw,[status(thm)],[737,1505,theory(equality)]),114,theory(equality)])).
% cnf(1654,negated_conjecture,($false|$false),inference(rw,[status(thm)],[inference(rw,[status(thm)],[1653,1505,theory(equality)]),348,theory(equality)])).
% cnf(1655,negated_conjecture,($false),inference(cn,[status(thm)],[1654,theory(equality)])).
% cnf(1656,negated_conjecture,($false),1655,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 630
% # ...of these trivial : 7
% # ...subsumed : 196
% # ...remaining for further processing: 427
% # Other redundant clauses eliminated : 12
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 16
% # Backward-rewritten : 108
% # Generated clauses : 864
% # ...of the previous two non-trivial : 786
% # Contextual simplify-reflections : 96
% # Paramodulations : 832
% # Factorizations : 6
% # Equation resolutions : 22
% # Current number of processed clauses: 198
% # Positive orientable unit clauses: 50
% # Positive unorientable unit clauses: 1
% # Negative unit clauses : 18
% # Non-unit-clauses : 129
% # Current number of unprocessed clauses: 219
% # ...number of literals in the above : 674
% # Clause-clause subsumption calls (NU) : 1871
% # Rec. Clause-clause subsumption calls : 1462
% # Unit Clause-clause subsumption calls : 286
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 34
% # Indexed BW rewrite successes : 26
% # Backwards rewriting index: 178 leaves, 1.22+/-0.797 terms/leaf
% # Paramod-from index: 100 leaves, 1.06+/-0.310 terms/leaf
% # Paramod-into index: 148 leaves, 1.20+/-0.716 terms/leaf
% # -------------------------------------------------
% # User time : 0.069 s
% # System time : 0.003 s
% # Total time : 0.072 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.16 CPU 0.26 WC
% FINAL PrfWatch: 0.16 CPU 0.26 WC
% SZS output end Solution for /tmp/SystemOnTPTP17303/NUM401+1.tptp
%
%------------------------------------------------------------------------------