TSTP Solution File: SEU430+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SEU430+1 : TPTP v5.0.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %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 : Sun Dec 26 09:15:47 EST 2010
% Result : Theorem 0.25s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 27
% Number of leaves : 13
% Syntax : Number of formulae : 96 ( 21 unt; 0 def)
% Number of atoms : 293 ( 93 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 327 ( 130 ~; 129 |; 51 &)
% ( 10 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 5 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 146 ( 18 sgn 82 !; 17 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,axiom,
! [X1,X2] :
( X2 = k3_tarski(X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> ? [X4] :
( r2_hidden(X3,X4)
& r2_hidden(X4,X1) ) ) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',d4_tarski) ).
fof(2,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/tmpaeYODf/sel_SEU430+1.p_1',t30_relset_2) ).
fof(6,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/tmpaeYODf/sel_SEU430+1.p_1',dt_k5_setfam_1) ).
fof(12,axiom,
( v1_xboole_0(k1_xboole_0)
& v1_relat_1(k1_xboole_0) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',fc4_relat_1) ).
fof(13,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',redefinition_k5_setfam_1) ).
fof(16,axiom,
! [X1,X2,X3] :
~ ( r2_hidden(X1,X2)
& m1_subset_1(X2,k1_zfmisc_1(X3))
& v1_xboole_0(X3) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',t5_subset) ).
fof(20,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',d1_xboole_0) ).
fof(25,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',t6_boole) ).
fof(27,axiom,
! [X1] :
? [X2] :
( m1_subset_1(X2,k1_zfmisc_1(X1))
& v1_xboole_0(X2) ),
file('/tmp/tmpaeYODf/sel_SEU430+1.p_1',rc2_subset_1) ).
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)],[2]) ).
fof(34,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[20,theory(equality)]) ).
fof(36,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)],[1]) ).
fof(37,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)],[36]) ).
fof(38,plain,
! [X5,X6] :
( ( X6 != k3_tarski(X5)
| ! [X7] :
( ( ~ r2_hidden(X7,X6)
| ( r2_hidden(X7,esk1_3(X5,X6,X7))
& r2_hidden(esk1_3(X5,X6,X7),X5) ) )
& ( ! [X9] :
( ~ r2_hidden(X7,X9)
| ~ r2_hidden(X9,X5) )
| r2_hidden(X7,X6) ) ) )
& ( ( ( ~ r2_hidden(esk2_2(X5,X6),X6)
| ! [X11] :
( ~ r2_hidden(esk2_2(X5,X6),X11)
| ~ r2_hidden(X11,X5) ) )
& ( r2_hidden(esk2_2(X5,X6),X6)
| ( r2_hidden(esk2_2(X5,X6),esk3_2(X5,X6))
& r2_hidden(esk3_2(X5,X6),X5) ) ) )
| X6 = k3_tarski(X5) ) ),
inference(skolemize,[status(esa)],[37]) ).
fof(39,plain,
! [X5,X6,X7,X9,X11] :
( ( ( ( ~ r2_hidden(esk2_2(X5,X6),X11)
| ~ r2_hidden(X11,X5)
| ~ r2_hidden(esk2_2(X5,X6),X6) )
& ( r2_hidden(esk2_2(X5,X6),X6)
| ( r2_hidden(esk2_2(X5,X6),esk3_2(X5,X6))
& r2_hidden(esk3_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,esk1_3(X5,X6,X7))
& r2_hidden(esk1_3(X5,X6,X7),X5) ) ) )
| X6 != k3_tarski(X5) ) ),
inference(shift_quantors,[status(thm)],[38]) ).
fof(40,plain,
! [X5,X6,X7,X9,X11] :
( ( ~ r2_hidden(esk2_2(X5,X6),X11)
| ~ r2_hidden(X11,X5)
| ~ r2_hidden(esk2_2(X5,X6),X6)
| X6 = k3_tarski(X5) )
& ( r2_hidden(esk2_2(X5,X6),esk3_2(X5,X6))
| r2_hidden(esk2_2(X5,X6),X6)
| X6 = k3_tarski(X5) )
& ( r2_hidden(esk3_2(X5,X6),X5)
| r2_hidden(esk2_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,esk1_3(X5,X6,X7))
| ~ r2_hidden(X7,X6)
| X6 != k3_tarski(X5) )
& ( r2_hidden(esk1_3(X5,X6,X7),X5)
| ~ r2_hidden(X7,X6)
| X6 != k3_tarski(X5) ) ),
inference(distribute,[status(thm)],[39]) ).
cnf(43,plain,
( r2_hidden(X3,X1)
| X1 != k3_tarski(X2)
| ~ r2_hidden(X4,X2)
| ~ r2_hidden(X3,X4) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(44,plain,
( X1 = k3_tarski(X2)
| r2_hidden(esk2_2(X2,X1),X1)
| r2_hidden(esk3_2(X2,X1),X2) ),
inference(split_conjunct,[status(thm)],[40]) ).
cnf(45,plain,
( X1 = k3_tarski(X2)
| r2_hidden(esk2_2(X2,X1),X1)
| r2_hidden(esk2_2(X2,X1),esk3_2(X2,X1)) ),
inference(split_conjunct,[status(thm)],[40]) ).
fof(47,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(48,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)],[47]) ).
fof(49,negated_conjecture,
( m1_subset_1(esk5_0,k1_zfmisc_1(k1_zfmisc_1(esk4_0)))
& ( k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0
| ( r2_hidden(esk6_0,esk5_0)
& esk6_0 != k1_xboole_0 ) )
& ( k5_setfam_1(esk4_0,esk5_0) = k1_xboole_0
| ! [X7] :
( ~ r2_hidden(X7,esk5_0)
| X7 = k1_xboole_0 ) ) ),
inference(skolemize,[status(esa)],[48]) ).
fof(50,negated_conjecture,
! [X7] :
( ( ~ r2_hidden(X7,esk5_0)
| X7 = k1_xboole_0
| k5_setfam_1(esk4_0,esk5_0) = k1_xboole_0 )
& ( k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0
| ( r2_hidden(esk6_0,esk5_0)
& esk6_0 != k1_xboole_0 ) )
& m1_subset_1(esk5_0,k1_zfmisc_1(k1_zfmisc_1(esk4_0))) ),
inference(shift_quantors,[status(thm)],[49]) ).
fof(51,negated_conjecture,
! [X7] :
( ( ~ r2_hidden(X7,esk5_0)
| X7 = k1_xboole_0
| k5_setfam_1(esk4_0,esk5_0) = k1_xboole_0 )
& ( r2_hidden(esk6_0,esk5_0)
| k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0 )
& ( esk6_0 != k1_xboole_0
| k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0 )
& m1_subset_1(esk5_0,k1_zfmisc_1(k1_zfmisc_1(esk4_0))) ),
inference(distribute,[status(thm)],[50]) ).
cnf(52,negated_conjecture,
m1_subset_1(esk5_0,k1_zfmisc_1(k1_zfmisc_1(esk4_0))),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(53,negated_conjecture,
( k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0
| esk6_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(54,negated_conjecture,
( r2_hidden(esk6_0,esk5_0)
| k5_setfam_1(esk4_0,esk5_0) != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[51]) ).
cnf(55,negated_conjecture,
( k5_setfam_1(esk4_0,esk5_0) = k1_xboole_0
| X1 = k1_xboole_0
| ~ r2_hidden(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[51]) ).
fof(69,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)],[6]) ).
fof(70,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)],[69]) ).
cnf(71,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)],[70]) ).
cnf(87,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[12]) ).
fof(88,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)],[13]) ).
fof(89,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)],[88]) ).
cnf(90,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)],[89]) ).
fof(98,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)],[16]) ).
fof(99,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)],[98]) ).
cnf(100,plain,
( ~ v1_xboole_0(X1)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1))
| ~ r2_hidden(X3,X2) ),
inference(split_conjunct,[status(thm)],[99]) ).
fof(106,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)],[34]) ).
fof(107,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)],[106]) ).
fof(108,plain,
! [X3] :
( ( X3 != k1_xboole_0
| ! [X4] : ~ r2_hidden(X4,X3) )
& ( r2_hidden(esk10_1(X3),X3)
| X3 = k1_xboole_0 ) ),
inference(skolemize,[status(esa)],[107]) ).
fof(109,plain,
! [X3,X4] :
( ( ~ r2_hidden(X4,X3)
| X3 != k1_xboole_0 )
& ( r2_hidden(esk10_1(X3),X3)
| X3 = k1_xboole_0 ) ),
inference(shift_quantors,[status(thm)],[108]) ).
cnf(110,plain,
( X1 = k1_xboole_0
| r2_hidden(esk10_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
cnf(111,plain,
( X1 != k1_xboole_0
| ~ r2_hidden(X2,X1) ),
inference(split_conjunct,[status(thm)],[109]) ).
fof(122,plain,
! [X1] :
( ~ v1_xboole_0(X1)
| X1 = k1_xboole_0 ),
inference(fof_nnf,[status(thm)],[25]) ).
fof(123,plain,
! [X2] :
( ~ v1_xboole_0(X2)
| X2 = k1_xboole_0 ),
inference(variable_rename,[status(thm)],[122]) ).
cnf(124,plain,
( X1 = k1_xboole_0
| ~ v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[123]) ).
fof(126,plain,
! [X3] :
? [X4] :
( m1_subset_1(X4,k1_zfmisc_1(X3))
& v1_xboole_0(X4) ),
inference(variable_rename,[status(thm)],[27]) ).
fof(127,plain,
! [X3] :
( m1_subset_1(esk12_1(X3),k1_zfmisc_1(X3))
& v1_xboole_0(esk12_1(X3)) ),
inference(skolemize,[status(esa)],[126]) ).
cnf(128,plain,
v1_xboole_0(esk12_1(X1)),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(129,plain,
m1_subset_1(esk12_1(X1),k1_zfmisc_1(X1)),
inference(split_conjunct,[status(thm)],[127]) ).
cnf(140,plain,
k1_xboole_0 = esk12_1(X1),
inference(spm,[status(thm)],[124,128,theory(equality)]) ).
cnf(172,negated_conjecture,
k5_setfam_1(esk4_0,esk5_0) = k3_tarski(esk5_0),
inference(spm,[status(thm)],[90,52,theory(equality)]) ).
cnf(200,plain,
( k3_tarski(X1) = X2
| r2_hidden(esk2_2(X1,X2),X2)
| k1_xboole_0 != esk3_2(X1,X2) ),
inference(spm,[status(thm)],[111,45,theory(equality)]) ).
cnf(209,plain,
m1_subset_1(k1_xboole_0,k1_zfmisc_1(X1)),
inference(rw,[status(thm)],[129,140,theory(equality)]) ).
cnf(229,plain,
k5_setfam_1(X1,k1_xboole_0) = k3_tarski(k1_xboole_0),
inference(spm,[status(thm)],[90,209,theory(equality)]) ).
cnf(236,negated_conjecture,
( k3_tarski(esk5_0) != k1_xboole_0
| esk6_0 != k1_xboole_0 ),
inference(rw,[status(thm)],[53,172,theory(equality)]) ).
cnf(237,negated_conjecture,
( k3_tarski(esk5_0) = k1_xboole_0
| k1_xboole_0 = X1
| ~ r2_hidden(X1,esk5_0) ),
inference(rw,[status(thm)],[55,172,theory(equality)]) ).
cnf(238,negated_conjecture,
( r2_hidden(esk6_0,esk5_0)
| k3_tarski(esk5_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[54,172,theory(equality)]) ).
cnf(241,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)],[71,229,theory(equality)]) ).
cnf(242,plain,
( m1_subset_1(k3_tarski(k1_xboole_0),k1_zfmisc_1(X1))
| $false ),
inference(rw,[status(thm)],[241,209,theory(equality)]) ).
cnf(243,plain,
m1_subset_1(k3_tarski(k1_xboole_0),k1_zfmisc_1(X1)),
inference(cn,[status(thm)],[242,theory(equality)]) ).
cnf(250,negated_conjecture,
( k3_tarski(esk5_0) = k1_xboole_0
| k1_xboole_0 = esk3_2(esk5_0,X1)
| k3_tarski(esk5_0) = X1
| r2_hidden(esk2_2(esk5_0,X1),X1) ),
inference(spm,[status(thm)],[237,44,theory(equality)]) ).
cnf(289,plain,
( ~ v1_xboole_0(X1)
| ~ r2_hidden(X2,k3_tarski(k1_xboole_0)) ),
inference(spm,[status(thm)],[100,243,theory(equality)]) ).
fof(551,plain,
( ~ epred5_0
<=> ! [X1] : ~ v1_xboole_0(X1) ),
introduced(definition),
[split] ).
cnf(552,plain,
( epred5_0
| ~ v1_xboole_0(X1) ),
inference(split_equiv,[status(thm)],[551]) ).
fof(553,plain,
( ~ epred6_0
<=> ! [X2] : ~ r2_hidden(X2,k3_tarski(k1_xboole_0)) ),
introduced(definition),
[split] ).
cnf(554,plain,
( epred6_0
| ~ r2_hidden(X2,k3_tarski(k1_xboole_0)) ),
inference(split_equiv,[status(thm)],[553]) ).
cnf(555,plain,
( ~ epred6_0
| ~ epred5_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[289,551,theory(equality)]),553,theory(equality)]),
[split] ).
cnf(574,plain,
epred5_0,
inference(spm,[status(thm)],[552,87,theory(equality)]) ).
cnf(578,plain,
( ~ epred6_0
| $false ),
inference(rw,[status(thm)],[555,574,theory(equality)]) ).
cnf(579,plain,
~ epred6_0,
inference(cn,[status(thm)],[578,theory(equality)]) ).
cnf(584,plain,
~ r2_hidden(X2,k3_tarski(k1_xboole_0)),
inference(sr,[status(thm)],[554,579,theory(equality)]) ).
cnf(585,plain,
k1_xboole_0 = k3_tarski(k1_xboole_0),
inference(spm,[status(thm)],[584,110,theory(equality)]) ).
cnf(602,plain,
~ r2_hidden(X1,k1_xboole_0),
inference(rw,[status(thm)],[584,585,theory(equality)]) ).
cnf(1494,negated_conjecture,
( k3_tarski(esk5_0) = k1_xboole_0
| k3_tarski(esk5_0) = X1
| r2_hidden(esk2_2(esk5_0,X1),X1) ),
inference(csr,[status(thm)],[250,200]) ).
cnf(1495,negated_conjecture,
k3_tarski(esk5_0) = k1_xboole_0,
inference(spm,[status(thm)],[602,1494,theory(equality)]) ).
cnf(1568,negated_conjecture,
( r2_hidden(esk6_0,esk5_0)
| $false ),
inference(rw,[status(thm)],[238,1495,theory(equality)]) ).
cnf(1569,negated_conjecture,
r2_hidden(esk6_0,esk5_0),
inference(cn,[status(thm)],[1568,theory(equality)]) ).
cnf(1571,negated_conjecture,
( $false
| esk6_0 != k1_xboole_0 ),
inference(rw,[status(thm)],[236,1495,theory(equality)]) ).
cnf(1572,negated_conjecture,
esk6_0 != k1_xboole_0,
inference(cn,[status(thm)],[1571,theory(equality)]) ).
cnf(1576,negated_conjecture,
( r2_hidden(X1,X2)
| k3_tarski(esk5_0) != X2
| ~ r2_hidden(X1,esk6_0) ),
inference(spm,[status(thm)],[43,1569,theory(equality)]) ).
cnf(1588,negated_conjecture,
( r2_hidden(X1,X2)
| k1_xboole_0 != X2
| ~ r2_hidden(X1,esk6_0) ),
inference(rw,[status(thm)],[1576,1495,theory(equality)]) ).
cnf(1590,negated_conjecture,
( k1_xboole_0 != X2
| ~ r2_hidden(X1,esk6_0) ),
inference(csr,[status(thm)],[1588,111]) ).
fof(1591,plain,
( ~ epred7_0
<=> ! [X2] : k1_xboole_0 != X2 ),
introduced(definition),
[split] ).
cnf(1592,plain,
( epred7_0
| k1_xboole_0 != X2 ),
inference(split_equiv,[status(thm)],[1591]) ).
fof(1593,plain,
( ~ epred8_0
<=> ! [X1] : ~ r2_hidden(X1,esk6_0) ),
introduced(definition),
[split] ).
cnf(1594,plain,
( epred8_0
| ~ r2_hidden(X1,esk6_0) ),
inference(split_equiv,[status(thm)],[1593]) ).
cnf(1595,negated_conjecture,
( ~ epred8_0
| ~ epred7_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[1590,1591,theory(equality)]),1593,theory(equality)]),
[split] ).
cnf(1596,negated_conjecture,
epred7_0,
inference(er,[status(thm)],[1592,theory(equality)]) ).
cnf(1598,negated_conjecture,
( epred8_0
| k1_xboole_0 = esk6_0 ),
inference(spm,[status(thm)],[1594,110,theory(equality)]) ).
cnf(1608,negated_conjecture,
epred8_0,
inference(sr,[status(thm)],[1598,1572,theory(equality)]) ).
cnf(1611,negated_conjecture,
( $false
| ~ epred7_0 ),
inference(rw,[status(thm)],[1595,1608,theory(equality)]) ).
cnf(1612,negated_conjecture,
( $false
| $false ),
inference(rw,[status(thm)],[1611,1596,theory(equality)]) ).
cnf(1613,negated_conjecture,
$false,
inference(cn,[status(thm)],[1612,theory(equality)]) ).
cnf(1614,negated_conjecture,
$false,
1613,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SEU/SEU430+1.p
% --creating new selector for []
% -running prover on /tmp/tmpaeYODf/sel_SEU430+1.p_1 with time limit 29
% -prover status Theorem
% Problem SEU430+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SEU/SEU430+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SEU/SEU430+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------