TSTP Solution File: SEU430+1 by SRASS---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SRASS---0.1
% Problem : SEU430+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp
% Command : SRASS -q2 -a 0 10 10 10 -i3 -n60 %s
% Computer : art04.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 2.80GHz @ 2793MHz
% Memory : 2018MB
% OS : Linux 2.6.26.8-57.fc8
% CPULimit : 300s
% DateTime : Thu Dec 30 05:55:07 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/SystemOnTPTP31447/SEU430+1.tptp
% Adding relevance values
% Extracting the conjecture
% Sorting axioms by relevance
% Looking for THM ...
% found
% SZS status THM for /tmp/SystemOnTPTP31447/SEU430+1.tptp
% SZS output start Solution for /tmp/SystemOnTPTP31447/SEU430+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 31543
% TreeLimitedRun: ----------------------------------------------------------
% PrfWatch: 0.00 CPU 0.00 WC
% # Preprocessing time : 0.013 s
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% fof(2, axiom,![X1]:(X1=k1_xboole_0<=>![X2]:~(r2_hidden(X2,X1))),file('/tmp/SRASS.s.p', d1_xboole_0)).
% fof(3, axiom,![X1]:![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))=>m1_subset_1(k5_setfam_1(X1,X2),k1_zfmisc_1(X1))),file('/tmp/SRASS.s.p', dt_k5_setfam_1)).
% fof(7, axiom,![X1]:![X2]:![X3]:~(((r2_hidden(X1,X2)&m1_subset_1(X2,k1_zfmisc_1(X3)))&v1_xboole_0(X3))),file('/tmp/SRASS.s.p', t5_subset)).
% fof(8, axiom,![X1]:![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))=>k5_setfam_1(X1,X2)=k3_tarski(X2)),file('/tmp/SRASS.s.p', redefinition_k5_setfam_1)).
% fof(9, axiom,![X1]:(v1_xboole_0(X1)=>X1=k1_xboole_0),file('/tmp/SRASS.s.p', t6_boole)).
% fof(11, axiom,![X1]:?[X2]:(m1_subset_1(X2,k1_zfmisc_1(X1))&v1_xboole_0(X2)),file('/tmp/SRASS.s.p', rc2_subset_1)).
% fof(13, axiom,![X1]:![X2]:(X2=k3_tarski(X1)<=>![X3]:(r2_hidden(X3,X2)<=>?[X4]:(r2_hidden(X3,X4)&r2_hidden(X4,X1)))),file('/tmp/SRASS.s.p', d4_tarski)).
% fof(22, axiom,(v1_xboole_0(k1_xboole_0)&v1_relat_1(k1_xboole_0)),file('/tmp/SRASS.s.p', fc4_relat_1)).
% fof(29, conjecture,![X1]:![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))=>(k5_setfam_1(X1,X2)=k1_xboole_0<=>![X3]:(r2_hidden(X3,X2)=>X3=k1_xboole_0))),file('/tmp/SRASS.s.p', t30_relset_2)).
% fof(30, negated_conjecture,~(![X1]:![X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))=>(k5_setfam_1(X1,X2)=k1_xboole_0<=>![X3]:(r2_hidden(X3,X2)=>X3=k1_xboole_0)))),inference(assume_negation,[status(cth)],[29])).
% fof(32, plain,![X1]:(X1=k1_xboole_0<=>![X2]:~(r2_hidden(X2,X1))),inference(fof_simplification,[status(thm)],[2,theory(equality)])).
% fof(39, plain,![X1]:((~(X1=k1_xboole_0)|![X2]:~(r2_hidden(X2,X1)))&(?[X2]:r2_hidden(X2,X1)|X1=k1_xboole_0)),inference(fof_nnf,[status(thm)],[32])).
% fof(40, plain,![X3]:((~(X3=k1_xboole_0)|![X4]:~(r2_hidden(X4,X3)))&(?[X5]:r2_hidden(X5,X3)|X3=k1_xboole_0)),inference(variable_rename,[status(thm)],[39])).
% fof(41, plain,![X3]:((~(X3=k1_xboole_0)|![X4]:~(r2_hidden(X4,X3)))&(r2_hidden(esk1_1(X3),X3)|X3=k1_xboole_0)),inference(skolemize,[status(esa)],[40])).
% fof(42, plain,![X3]:![X4]:((~(r2_hidden(X4,X3))|~(X3=k1_xboole_0))&(r2_hidden(esk1_1(X3),X3)|X3=k1_xboole_0)),inference(shift_quantors,[status(thm)],[41])).
% cnf(43,plain,(X1=k1_xboole_0|r2_hidden(esk1_1(X1),X1)),inference(split_conjunct,[status(thm)],[42])).
% cnf(44,plain,(X1!=k1_xboole_0|~r2_hidden(X2,X1)),inference(split_conjunct,[status(thm)],[42])).
% fof(45, plain,![X1]:![X2]:(~(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))))|m1_subset_1(k5_setfam_1(X1,X2),k1_zfmisc_1(X1))),inference(fof_nnf,[status(thm)],[3])).
% fof(46, plain,![X3]:![X4]:(~(m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3))))|m1_subset_1(k5_setfam_1(X3,X4),k1_zfmisc_1(X3))),inference(variable_rename,[status(thm)],[45])).
% cnf(47,plain,(m1_subset_1(k5_setfam_1(X1,X2),k1_zfmisc_1(X1))|~m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))),inference(split_conjunct,[status(thm)],[46])).
% fof(57, plain,![X1]:![X2]:![X3]:((~(r2_hidden(X1,X2))|~(m1_subset_1(X2,k1_zfmisc_1(X3))))|~(v1_xboole_0(X3))),inference(fof_nnf,[status(thm)],[7])).
% fof(58, plain,![X4]:![X5]:![X6]:((~(r2_hidden(X4,X5))|~(m1_subset_1(X5,k1_zfmisc_1(X6))))|~(v1_xboole_0(X6))),inference(variable_rename,[status(thm)],[57])).
% cnf(59,plain,(~v1_xboole_0(X1)|~m1_subset_1(X2,k1_zfmisc_1(X1))|~r2_hidden(X3,X2)),inference(split_conjunct,[status(thm)],[58])).
% fof(60, plain,![X1]:![X2]:(~(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1))))|k5_setfam_1(X1,X2)=k3_tarski(X2)),inference(fof_nnf,[status(thm)],[8])).
% fof(61, plain,![X3]:![X4]:(~(m1_subset_1(X4,k1_zfmisc_1(k1_zfmisc_1(X3))))|k5_setfam_1(X3,X4)=k3_tarski(X4)),inference(variable_rename,[status(thm)],[60])).
% cnf(62,plain,(k5_setfam_1(X1,X2)=k3_tarski(X2)|~m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))),inference(split_conjunct,[status(thm)],[61])).
% fof(63, plain,![X1]:(~(v1_xboole_0(X1))|X1=k1_xboole_0),inference(fof_nnf,[status(thm)],[9])).
% fof(64, plain,![X2]:(~(v1_xboole_0(X2))|X2=k1_xboole_0),inference(variable_rename,[status(thm)],[63])).
% cnf(65,plain,(X1=k1_xboole_0|~v1_xboole_0(X1)),inference(split_conjunct,[status(thm)],[64])).
% fof(72, plain,![X3]:?[X4]:(m1_subset_1(X4,k1_zfmisc_1(X3))&v1_xboole_0(X4)),inference(variable_rename,[status(thm)],[11])).
% fof(73, plain,![X3]:(m1_subset_1(esk4_1(X3),k1_zfmisc_1(X3))&v1_xboole_0(esk4_1(X3))),inference(skolemize,[status(esa)],[72])).
% cnf(74,plain,(v1_xboole_0(esk4_1(X1))),inference(split_conjunct,[status(thm)],[73])).
% cnf(75,plain,(m1_subset_1(esk4_1(X1),k1_zfmisc_1(X1))),inference(split_conjunct,[status(thm)],[73])).
% fof(79, plain,![X1]:![X2]:((~(X2=k3_tarski(X1))|![X3]:((~(r2_hidden(X3,X2))|?[X4]:(r2_hidden(X3,X4)&r2_hidden(X4,X1)))&(![X4]:(~(r2_hidden(X3,X4))|~(r2_hidden(X4,X1)))|r2_hidden(X3,X2))))&(?[X3]:((~(r2_hidden(X3,X2))|![X4]:(~(r2_hidden(X3,X4))|~(r2_hidden(X4,X1))))&(r2_hidden(X3,X2)|?[X4]:(r2_hidden(X3,X4)&r2_hidden(X4,X1))))|X2=k3_tarski(X1))),inference(fof_nnf,[status(thm)],[13])).
% fof(80, plain,![X5]:![X6]:((~(X6=k3_tarski(X5))|![X7]:((~(r2_hidden(X7,X6))|?[X8]:(r2_hidden(X7,X8)&r2_hidden(X8,X5)))&(![X9]:(~(r2_hidden(X7,X9))|~(r2_hidden(X9,X5)))|r2_hidden(X7,X6))))&(?[X10]:((~(r2_hidden(X10,X6))|![X11]:(~(r2_hidden(X10,X11))|~(r2_hidden(X11,X5))))&(r2_hidden(X10,X6)|?[X12]:(r2_hidden(X10,X12)&r2_hidden(X12,X5))))|X6=k3_tarski(X5))),inference(variable_rename,[status(thm)],[79])).
% fof(81, plain,![X5]:![X6]:((~(X6=k3_tarski(X5))|![X7]:((~(r2_hidden(X7,X6))|(r2_hidden(X7,esk5_3(X5,X6,X7))&r2_hidden(esk5_3(X5,X6,X7),X5)))&(![X9]:(~(r2_hidden(X7,X9))|~(r2_hidden(X9,X5)))|r2_hidden(X7,X6))))&(((~(r2_hidden(esk6_2(X5,X6),X6))|![X11]:(~(r2_hidden(esk6_2(X5,X6),X11))|~(r2_hidden(X11,X5))))&(r2_hidden(esk6_2(X5,X6),X6)|(r2_hidden(esk6_2(X5,X6),esk7_2(X5,X6))&r2_hidden(esk7_2(X5,X6),X5))))|X6=k3_tarski(X5))),inference(skolemize,[status(esa)],[80])).
% fof(82, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(r2_hidden(esk6_2(X5,X6),X11))|~(r2_hidden(X11,X5)))|~(r2_hidden(esk6_2(X5,X6),X6)))&(r2_hidden(esk6_2(X5,X6),X6)|(r2_hidden(esk6_2(X5,X6),esk7_2(X5,X6))&r2_hidden(esk7_2(X5,X6),X5))))|X6=k3_tarski(X5))&((((~(r2_hidden(X7,X9))|~(r2_hidden(X9,X5)))|r2_hidden(X7,X6))&(~(r2_hidden(X7,X6))|(r2_hidden(X7,esk5_3(X5,X6,X7))&r2_hidden(esk5_3(X5,X6,X7),X5))))|~(X6=k3_tarski(X5)))),inference(shift_quantors,[status(thm)],[81])).
% fof(83, plain,![X5]:![X6]:![X7]:![X9]:![X11]:(((((~(r2_hidden(esk6_2(X5,X6),X11))|~(r2_hidden(X11,X5)))|~(r2_hidden(esk6_2(X5,X6),X6)))|X6=k3_tarski(X5))&(((r2_hidden(esk6_2(X5,X6),esk7_2(X5,X6))|r2_hidden(esk6_2(X5,X6),X6))|X6=k3_tarski(X5))&((r2_hidden(esk7_2(X5,X6),X5)|r2_hidden(esk6_2(X5,X6),X6))|X6=k3_tarski(X5))))&((((~(r2_hidden(X7,X9))|~(r2_hidden(X9,X5)))|r2_hidden(X7,X6))|~(X6=k3_tarski(X5)))&(((r2_hidden(X7,esk5_3(X5,X6,X7))|~(r2_hidden(X7,X6)))|~(X6=k3_tarski(X5)))&((r2_hidden(esk5_3(X5,X6,X7),X5)|~(r2_hidden(X7,X6)))|~(X6=k3_tarski(X5)))))),inference(distribute,[status(thm)],[82])).
% cnf(86,plain,(r2_hidden(X3,X1)|X1!=k3_tarski(X2)|~r2_hidden(X4,X2)|~r2_hidden(X3,X4)),inference(split_conjunct,[status(thm)],[83])).
% cnf(87,plain,(X1=k3_tarski(X2)|r2_hidden(esk6_2(X2,X1),X1)|r2_hidden(esk7_2(X2,X1),X2)),inference(split_conjunct,[status(thm)],[83])).
% cnf(88,plain,(X1=k3_tarski(X2)|r2_hidden(esk6_2(X2,X1),X1)|r2_hidden(esk6_2(X2,X1),esk7_2(X2,X1))),inference(split_conjunct,[status(thm)],[83])).
% cnf(116,plain,(v1_xboole_0(k1_xboole_0)),inference(split_conjunct,[status(thm)],[22])).
% fof(128, negated_conjecture,?[X1]:?[X2]:(m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))&((~(k5_setfam_1(X1,X2)=k1_xboole_0)|?[X3]:(r2_hidden(X3,X2)&~(X3=k1_xboole_0)))&(k5_setfam_1(X1,X2)=k1_xboole_0|![X3]:(~(r2_hidden(X3,X2))|X3=k1_xboole_0)))),inference(fof_nnf,[status(thm)],[30])).
% fof(129, negated_conjecture,?[X4]:?[X5]:(m1_subset_1(X5,k1_zfmisc_1(k1_zfmisc_1(X4)))&((~(k5_setfam_1(X4,X5)=k1_xboole_0)|?[X6]:(r2_hidden(X6,X5)&~(X6=k1_xboole_0)))&(k5_setfam_1(X4,X5)=k1_xboole_0|![X7]:(~(r2_hidden(X7,X5))|X7=k1_xboole_0)))),inference(variable_rename,[status(thm)],[128])).
% fof(130, negated_conjecture,(m1_subset_1(esk12_0,k1_zfmisc_1(k1_zfmisc_1(esk11_0)))&((~(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0)|(r2_hidden(esk13_0,esk12_0)&~(esk13_0=k1_xboole_0)))&(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0|![X7]:(~(r2_hidden(X7,esk12_0))|X7=k1_xboole_0)))),inference(skolemize,[status(esa)],[129])).
% fof(131, negated_conjecture,![X7]:((((~(r2_hidden(X7,esk12_0))|X7=k1_xboole_0)|k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0)&(~(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0)|(r2_hidden(esk13_0,esk12_0)&~(esk13_0=k1_xboole_0))))&m1_subset_1(esk12_0,k1_zfmisc_1(k1_zfmisc_1(esk11_0)))),inference(shift_quantors,[status(thm)],[130])).
% fof(132, negated_conjecture,![X7]:((((~(r2_hidden(X7,esk12_0))|X7=k1_xboole_0)|k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0)&((r2_hidden(esk13_0,esk12_0)|~(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0))&(~(esk13_0=k1_xboole_0)|~(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0))))&m1_subset_1(esk12_0,k1_zfmisc_1(k1_zfmisc_1(esk11_0)))),inference(distribute,[status(thm)],[131])).
% cnf(133,negated_conjecture,(m1_subset_1(esk12_0,k1_zfmisc_1(k1_zfmisc_1(esk11_0)))),inference(split_conjunct,[status(thm)],[132])).
% cnf(134,negated_conjecture,(k5_setfam_1(esk11_0,esk12_0)!=k1_xboole_0|esk13_0!=k1_xboole_0),inference(split_conjunct,[status(thm)],[132])).
% cnf(135,negated_conjecture,(r2_hidden(esk13_0,esk12_0)|k5_setfam_1(esk11_0,esk12_0)!=k1_xboole_0),inference(split_conjunct,[status(thm)],[132])).
% cnf(136,negated_conjecture,(k5_setfam_1(esk11_0,esk12_0)=k1_xboole_0|X1=k1_xboole_0|~r2_hidden(X1,esk12_0)),inference(split_conjunct,[status(thm)],[132])).
% cnf(140,plain,(k1_xboole_0=esk4_1(X1)),inference(spm,[status(thm)],[65,74,theory(equality)])).
% cnf(142,negated_conjecture,(k5_setfam_1(esk11_0,esk12_0)=k3_tarski(esk12_0)),inference(spm,[status(thm)],[62,133,theory(equality)])).
% cnf(200,plain,(k3_tarski(X1)=X2|r2_hidden(esk6_2(X1,X2),X2)|k1_xboole_0!=esk7_2(X1,X2)),inference(spm,[status(thm)],[44,88,theory(equality)])).
% cnf(212,negated_conjecture,(k3_tarski(esk12_0)=k1_xboole_0|k1_xboole_0=X1|~r2_hidden(X1,esk12_0)),inference(rw,[status(thm)],[136,142,theory(equality)])).
% cnf(213,negated_conjecture,(r2_hidden(esk13_0,esk12_0)|k3_tarski(esk12_0)!=k1_xboole_0),inference(rw,[status(thm)],[135,142,theory(equality)])).
% cnf(214,negated_conjecture,(k3_tarski(esk12_0)!=k1_xboole_0|esk13_0!=k1_xboole_0),inference(rw,[status(thm)],[134,142,theory(equality)])).
% cnf(217,plain,(m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1))),inference(rw,[status(thm)],[75,140,theory(equality)])).
% cnf(220,plain,(k5_setfam_1(X1,k1_xboole_0)=k3_tarski(k1_xboole_0)),inference(spm,[status(thm)],[62,217,theory(equality)])).
% cnf(221,plain,(~v1_xboole_0(X1)|~r2_hidden(X2,k1_xboole_0)),inference(spm,[status(thm)],[59,217,theory(equality)])).
% cnf(228,plain,(m1_subset_1(k3_tarski(k1_xboole_0),k1_zfmisc_1(X1))|~m1_subset_1(k1_xboole_0,k1_zfmisc_1(k1_zfmisc_1(X1)))),inference(spm,[status(thm)],[47,220,theory(equality)])).
% cnf(229,plain,(m1_subset_1(k3_tarski(k1_xboole_0),k1_zfmisc_1(X1))|$false),inference(rw,[status(thm)],[228,217,theory(equality)])).
% cnf(230,plain,(m1_subset_1(k3_tarski(k1_xboole_0),k1_zfmisc_1(X1))),inference(cn,[status(thm)],[229,theory(equality)])).
% fof(278, plain,(~(epred1_0)<=>![X1]:~(v1_xboole_0(X1))),introduced(definition),['split']).
% cnf(279,plain,(epred1_0|~v1_xboole_0(X1)),inference(split_equiv,[status(thm)],[278])).
% fof(280, plain,(~(epred2_0)<=>![X2]:~(r2_hidden(X2,k1_xboole_0))),introduced(definition),['split']).
% cnf(281,plain,(epred2_0|~r2_hidden(X2,k1_xboole_0)),inference(split_equiv,[status(thm)],[280])).
% cnf(282,plain,(~epred2_0|~epred1_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[221,278,theory(equality)]),280,theory(equality)]),['split']).
% cnf(283,plain,(epred2_0|k3_tarski(k1_xboole_0)=X1|r2_hidden(esk6_2(k1_xboole_0,X1),X1)),inference(spm,[status(thm)],[281,87,theory(equality)])).
% cnf(289,plain,(epred1_0),inference(spm,[status(thm)],[279,116,theory(equality)])).
% cnf(290,plain,(~epred2_0|$false),inference(rw,[status(thm)],[282,289,theory(equality)])).
% cnf(291,plain,(~epred2_0),inference(cn,[status(thm)],[290,theory(equality)])).
% cnf(302,plain,(~v1_xboole_0(X1)|~r2_hidden(X2,k3_tarski(k1_xboole_0))),inference(spm,[status(thm)],[59,230,theory(equality)])).
% cnf(341,negated_conjecture,(k3_tarski(esk12_0)=k1_xboole_0|k1_xboole_0=esk7_2(esk12_0,X1)|k3_tarski(esk12_0)=X1|r2_hidden(esk6_2(esk12_0,X1),X1)),inference(spm,[status(thm)],[212,87,theory(equality)])).
% fof(567, plain,(~(epred5_0)<=>![X1]:~(v1_xboole_0(X1))),introduced(definition),['split']).
% cnf(568,plain,(epred5_0|~v1_xboole_0(X1)),inference(split_equiv,[status(thm)],[567])).
% fof(569, plain,(~(epred6_0)<=>![X2]:~(r2_hidden(X2,k3_tarski(k1_xboole_0)))),introduced(definition),['split']).
% cnf(570,plain,(epred6_0|~r2_hidden(X2,k3_tarski(k1_xboole_0))),inference(split_equiv,[status(thm)],[569])).
% cnf(571,plain,(~epred6_0|~epred5_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[302,567,theory(equality)]),569,theory(equality)]),['split']).
% cnf(580,plain,(epred5_0),inference(spm,[status(thm)],[568,116,theory(equality)])).
% cnf(583,plain,(~epred6_0|$false),inference(rw,[status(thm)],[571,580,theory(equality)])).
% cnf(584,plain,(~epred6_0),inference(cn,[status(thm)],[583,theory(equality)])).
% cnf(585,plain,(~r2_hidden(X2,k3_tarski(k1_xboole_0))),inference(sr,[status(thm)],[570,584,theory(equality)])).
% cnf(590,plain,(k1_xboole_0=k3_tarski(k1_xboole_0)),inference(spm,[status(thm)],[585,43,theory(equality)])).
% cnf(595,plain,(~r2_hidden(X1,k1_xboole_0)),inference(rw,[status(thm)],[585,590,theory(equality)])).
% cnf(1877,plain,(epred2_0|k1_xboole_0=X1|r2_hidden(esk6_2(k1_xboole_0,X1),X1)),inference(rw,[status(thm)],[283,590,theory(equality)])).
% cnf(1878,plain,(k1_xboole_0=X1|r2_hidden(esk6_2(k1_xboole_0,X1),X1)),inference(sr,[status(thm)],[1877,291,theory(equality)])).
% cnf(2639,negated_conjecture,(k3_tarski(esk12_0)=k1_xboole_0|k3_tarski(esk12_0)=X1|r2_hidden(esk6_2(esk12_0,X1),X1)),inference(csr,[status(thm)],[341,200])).
% cnf(2665,negated_conjecture,(k3_tarski(esk12_0)=k1_xboole_0),inference(spm,[status(thm)],[595,2639,theory(equality)])).
% cnf(2747,negated_conjecture,(r2_hidden(esk13_0,esk12_0)|$false),inference(rw,[status(thm)],[213,2665,theory(equality)])).
% cnf(2748,negated_conjecture,(r2_hidden(esk13_0,esk12_0)),inference(cn,[status(thm)],[2747,theory(equality)])).
% cnf(2749,negated_conjecture,($false|esk13_0!=k1_xboole_0),inference(rw,[status(thm)],[214,2665,theory(equality)])).
% cnf(2750,negated_conjecture,(esk13_0!=k1_xboole_0),inference(cn,[status(thm)],[2749,theory(equality)])).
% cnf(2759,negated_conjecture,(r2_hidden(X1,X2)|k3_tarski(esk12_0)!=X2|~r2_hidden(X1,esk13_0)),inference(spm,[status(thm)],[86,2748,theory(equality)])).
% cnf(2764,negated_conjecture,(r2_hidden(X1,X2)|k1_xboole_0!=X2|~r2_hidden(X1,esk13_0)),inference(rw,[status(thm)],[2759,2665,theory(equality)])).
% cnf(2967,negated_conjecture,(k1_xboole_0!=X2|~r2_hidden(X1,esk13_0)),inference(csr,[status(thm)],[2764,44])).
% fof(2968, plain,(~(epred7_0)<=>![X2]:~(k1_xboole_0=X2)),introduced(definition),['split']).
% cnf(2969,plain,(epred7_0|k1_xboole_0!=X2),inference(split_equiv,[status(thm)],[2968])).
% fof(2970, plain,(~(epred8_0)<=>![X1]:~(r2_hidden(X1,esk13_0))),introduced(definition),['split']).
% cnf(2971,plain,(epred8_0|~r2_hidden(X1,esk13_0)),inference(split_equiv,[status(thm)],[2970])).
% cnf(2972,negated_conjecture,(~epred8_0|~epred7_0),inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[2967,2968,theory(equality)]),2970,theory(equality)]),['split']).
% cnf(2973,negated_conjecture,(epred7_0),inference(er,[status(thm)],[2969,theory(equality)])).
% cnf(2974,negated_conjecture,(~epred8_0|$false),inference(rw,[status(thm)],[2972,2973,theory(equality)])).
% cnf(2975,negated_conjecture,(~epred8_0),inference(cn,[status(thm)],[2974,theory(equality)])).
% cnf(2977,negated_conjecture,(~r2_hidden(X1,esk13_0)),inference(sr,[status(thm)],[2971,2975,theory(equality)])).
% cnf(2984,negated_conjecture,(k1_xboole_0=esk13_0),inference(spm,[status(thm)],[2977,1878,theory(equality)])).
% cnf(2990,negated_conjecture,($false),inference(sr,[status(thm)],[2984,2750,theory(equality)])).
% cnf(2991,negated_conjecture,($false),2990,['proof']).
% # SZS output end CNFRefutation
% # Processed clauses : 966
% # ...of these trivial : 4
% # ...subsumed : 573
% # ...remaining for further processing: 389
% # Other redundant clauses eliminated : 0
% # Clauses deleted for lack of memory : 0
% # Backward-subsumed : 44
% # Backward-rewritten : 65
% # Generated clauses : 1923
% # ...of the previous two non-trivial : 1716
% # Contextual simplify-reflections : 341
% # Paramodulations : 1891
% # Factorizations : 0
% # Equation resolutions : 13
% # Current number of processed clauses: 228
% # Positive orientable unit clauses: 32
% # Positive unorientable unit clauses: 0
% # Negative unit clauses : 28
% # Non-unit-clauses : 168
% # Current number of unprocessed clauses: 517
% # ...number of literals in the above : 1922
% # Clause-clause subsumption calls (NU) : 4104
% # Rec. Clause-clause subsumption calls : 3540
% # Unit Clause-clause subsumption calls : 582
% # Rewrite failures with RHS unbound : 0
% # Indexed BW rewrite attempts : 21
% # Indexed BW rewrite successes : 10
% # Backwards rewriting index: 217 leaves, 1.28+/-0.996 terms/leaf
% # Paramod-from index: 84 leaves, 1.01+/-0.108 terms/leaf
% # Paramod-into index: 200 leaves, 1.19+/-0.557 terms/leaf
% # -------------------------------------------------
% # User time : 0.103 s
% # System time : 0.004 s
% # Total time : 0.107 s
% # Maximum resident set size: 0 pages
% PrfWatch: 0.23 CPU 0.32 WC
% FINAL PrfWatch: 0.23 CPU 0.32 WC
% SZS output end Solution for /tmp/SystemOnTPTP31447/SEU430+1.tptp
%
%------------------------------------------------------------------------------