TSTP Solution File: SYN415+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : SYN415+1 : TPTP v5.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art03.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 13:20:55 EST 2010
% Result : Theorem 0.44s
% Output : CNFRefutation 0.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 55
% Number of leaves : 5
% Syntax : Number of formulae : 107 ( 10 unt; 0 def)
% Number of atoms : 443 ( 125 equ)
% Maximal formula atoms : 38 ( 4 avg)
% Number of connectives : 578 ( 242 ~; 287 |; 39 &)
% ( 6 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 5 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-1 aty)
% Number of variables : 185 ( 80 sgn 35 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(1,conjecture,
( ( ? [X1] : f(X1)
& ! [X2,X3] :
( ( f(X2)
& f(X3) )
=> X2 = X3 ) )
<=> ? [X4] :
( f(X4)
& ! [X5] :
( f(X5)
=> X4 = X5 ) ) ),
file('/tmp/tmpzpzrk_/sel_SYN415+1.p_1',kalish317) ).
fof(2,negated_conjecture,
~ ( ( ? [X1] : f(X1)
& ! [X2,X3] :
( ( f(X2)
& f(X3) )
=> X2 = X3 ) )
<=> ? [X4] :
( f(X4)
& ! [X5] :
( f(X5)
=> X4 = X5 ) ) ),
inference(assume_negation,[status(cth)],[1]) ).
fof(3,negated_conjecture,
( ( ! [X1] : ~ f(X1)
| ? [X2,X3] :
( f(X2)
& f(X3)
& X2 != X3 )
| ! [X4] :
( ~ f(X4)
| ? [X5] :
( f(X5)
& X4 != X5 ) ) )
& ( ( ? [X1] : f(X1)
& ! [X2,X3] :
( ~ f(X2)
| ~ f(X3)
| X2 = X3 ) )
| ? [X4] :
( f(X4)
& ! [X5] :
( ~ f(X5)
| X4 = X5 ) ) ) ),
inference(fof_nnf,[status(thm)],[2]) ).
fof(4,negated_conjecture,
( ( ! [X6] : ~ f(X6)
| ? [X7,X8] :
( f(X7)
& f(X8)
& X7 != X8 )
| ! [X9] :
( ~ f(X9)
| ? [X10] :
( f(X10)
& X9 != X10 ) ) )
& ( ( ? [X11] : f(X11)
& ! [X12,X13] :
( ~ f(X12)
| ~ f(X13)
| X12 = X13 ) )
| ? [X14] :
( f(X14)
& ! [X15] :
( ~ f(X15)
| X14 = X15 ) ) ) ),
inference(variable_rename,[status(thm)],[3]) ).
fof(5,negated_conjecture,
( ( ! [X6] : ~ f(X6)
| ( f(esk1_0)
& f(esk2_0)
& esk1_0 != esk2_0 )
| ! [X9] :
( ~ f(X9)
| ( f(esk3_1(X9))
& X9 != esk3_1(X9) ) ) )
& ( ( f(esk4_0)
& ! [X12,X13] :
( ~ f(X12)
| ~ f(X13)
| X12 = X13 ) )
| ( f(esk5_0)
& ! [X15] :
( ~ f(X15)
| esk5_0 = X15 ) ) ) ),
inference(skolemize,[status(esa)],[4]) ).
fof(6,negated_conjecture,
! [X6,X9,X12,X13,X15] :
( ( ( ( ~ f(X15)
| esk5_0 = X15 )
& f(esk5_0) )
| ( ( ~ f(X12)
| ~ f(X13)
| X12 = X13 )
& f(esk4_0) ) )
& ( ~ f(X9)
| ( f(esk3_1(X9))
& X9 != esk3_1(X9) )
| ~ f(X6)
| ( f(esk1_0)
& f(esk2_0)
& esk1_0 != esk2_0 ) ) ),
inference(shift_quantors,[status(thm)],[5]) ).
fof(7,negated_conjecture,
! [X6,X9,X12,X13,X15] :
( ( ~ f(X12)
| ~ f(X13)
| X12 = X13
| ~ f(X15)
| esk5_0 = X15 )
& ( f(esk4_0)
| ~ f(X15)
| esk5_0 = X15 )
& ( ~ f(X12)
| ~ f(X13)
| X12 = X13
| f(esk5_0) )
& ( f(esk4_0)
| f(esk5_0) )
& ( f(esk1_0)
| ~ f(X6)
| f(esk3_1(X9))
| ~ f(X9) )
& ( f(esk2_0)
| ~ f(X6)
| f(esk3_1(X9))
| ~ f(X9) )
& ( esk1_0 != esk2_0
| ~ f(X6)
| f(esk3_1(X9))
| ~ f(X9) )
& ( f(esk1_0)
| ~ f(X6)
| X9 != esk3_1(X9)
| ~ f(X9) )
& ( f(esk2_0)
| ~ f(X6)
| X9 != esk3_1(X9)
| ~ f(X9) )
& ( esk1_0 != esk2_0
| ~ f(X6)
| X9 != esk3_1(X9)
| ~ f(X9) ) ),
inference(distribute,[status(thm)],[6]) ).
cnf(8,negated_conjecture,
( ~ f(X1)
| X1 != esk3_1(X1)
| ~ f(X2)
| esk1_0 != esk2_0 ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(9,negated_conjecture,
( f(esk2_0)
| ~ f(X1)
| X1 != esk3_1(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(10,negated_conjecture,
( f(esk1_0)
| ~ f(X1)
| X1 != esk3_1(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(11,negated_conjecture,
( f(esk3_1(X1))
| ~ f(X1)
| ~ f(X2)
| esk1_0 != esk2_0 ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(12,negated_conjecture,
( f(esk3_1(X1))
| f(esk2_0)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(13,negated_conjecture,
( f(esk3_1(X1))
| f(esk1_0)
| ~ f(X1)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(14,negated_conjecture,
( f(esk5_0)
| f(esk4_0) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(15,negated_conjecture,
( f(esk5_0)
| X1 = X2
| ~ f(X2)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(16,negated_conjecture,
( esk5_0 = X1
| f(esk4_0)
| ~ f(X1) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(17,negated_conjecture,
( esk5_0 = X1
| X2 = X3
| ~ f(X1)
| ~ f(X3)
| ~ f(X2) ),
inference(split_conjunct,[status(thm)],[7]) ).
cnf(21,negated_conjecture,
( X1 = esk4_0
| f(esk5_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[15,14,theory(equality)]) ).
cnf(29,negated_conjecture,
( esk5_0 = esk3_1(X1)
| f(esk4_0)
| f(esk1_0)
| ~ f(X2)
| ~ f(X1) ),
inference(spm,[status(thm)],[16,13,theory(equality)]) ).
cnf(45,negated_conjecture,
( f(esk1_0)
| f(esk5_0)
| X3 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X3)
| ~ f(esk3_1(X1)) ),
inference(spm,[status(thm)],[10,15,theory(equality)]) ).
cnf(47,negated_conjecture,
( f(esk1_0)
| f(esk5_0)
| ~ f(X1)
| ~ f(X2)
| ~ f(esk3_1(X2)) ),
inference(er,[status(thm)],[45,theory(equality)]) ).
cnf(49,negated_conjecture,
( f(esk2_0)
| f(esk5_0)
| X3 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X3)
| ~ f(esk3_1(X1)) ),
inference(spm,[status(thm)],[9,15,theory(equality)]) ).
cnf(51,negated_conjecture,
( f(esk2_0)
| f(esk5_0)
| ~ f(X1)
| ~ f(X2)
| ~ f(esk3_1(X2)) ),
inference(er,[status(thm)],[49,theory(equality)]) ).
fof(53,plain,
( ~ epred1_0
<=> ! [X1] :
( ~ f(X1)
| esk3_1(X1) != X1
| esk2_0 != esk1_0 ) ),
introduced(definition),
[split] ).
cnf(54,plain,
( epred1_0
| ~ f(X1)
| esk3_1(X1) != X1
| esk2_0 != esk1_0 ),
inference(split_equiv,[status(thm)],[53]) ).
fof(55,plain,
( ~ epred2_0
<=> ! [X2] : ~ f(X2) ),
introduced(definition),
[split] ).
cnf(56,plain,
( epred2_0
| ~ f(X2) ),
inference(split_equiv,[status(thm)],[55]) ).
cnf(57,negated_conjecture,
( ~ epred2_0
| ~ epred1_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[8,53,theory(equality)]),55,theory(equality)]),
[split] ).
cnf(58,negated_conjecture,
( esk5_0 = X4
| X5 != esk5_0
| ~ f(X5)
| ~ f(X4) ),
inference(ef,[status(thm)],[17,theory(equality)]) ).
cnf(78,negated_conjecture,
( f(esk1_0)
| esk5_0 = X3
| X4 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X4)
| ~ f(esk3_1(X1))
| ~ f(X3) ),
inference(spm,[status(thm)],[10,17,theory(equality)]) ).
cnf(82,negated_conjecture,
( f(esk1_0)
| esk5_0 = X1
| ~ f(X2)
| ~ f(X3)
| ~ f(esk3_1(X3))
| ~ f(X1) ),
inference(er,[status(thm)],[78,theory(equality)]) ).
cnf(86,negated_conjecture,
( epred2_0
| f(esk5_0) ),
inference(spm,[status(thm)],[56,14,theory(equality)]) ).
cnf(91,negated_conjecture,
epred2_0,
inference(csr,[status(thm)],[86,56]) ).
cnf(93,negated_conjecture,
( $false
| ~ epred1_0 ),
inference(rw,[status(thm)],[57,91,theory(equality)]) ).
cnf(94,negated_conjecture,
~ epred1_0,
inference(cn,[status(thm)],[93,theory(equality)]) ).
cnf(107,negated_conjecture,
( ~ f(X1)
| esk3_1(X1) != X1
| esk2_0 != esk1_0 ),
inference(sr,[status(thm)],[54,94,theory(equality)]) ).
cnf(110,negated_conjecture,
( esk5_0 = X1
| ~ f(esk5_0)
| ~ f(X1) ),
inference(er,[status(thm)],[58,theory(equality)]) ).
cnf(113,negated_conjecture,
( f(esk1_0)
| f(esk5_0)
| ~ f(X1)
| ~ f(X2) ),
inference(csr,[status(thm)],[47,13]) ).
cnf(114,negated_conjecture,
( f(esk5_0)
| f(esk1_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[113,14,theory(equality)]) ).
cnf(132,negated_conjecture,
( f(esk1_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[114,14,theory(equality)]) ).
cnf(149,negated_conjecture,
( esk1_0 = esk4_0
| f(esk5_0) ),
inference(spm,[status(thm)],[21,132,theory(equality)]) ).
cnf(157,negated_conjecture,
( esk5_0 = X1
| esk4_0 = esk1_0
| ~ f(X1) ),
inference(spm,[status(thm)],[110,149,theory(equality)]) ).
cnf(161,negated_conjecture,
( esk4_0 = esk1_0
| esk5_0 = esk3_1(X1)
| f(esk1_0)
| ~ f(X2)
| ~ f(X1) ),
inference(spm,[status(thm)],[157,13,theory(equality)]) ).
cnf(237,negated_conjecture,
( f(esk2_0)
| f(esk5_0)
| ~ f(X1)
| ~ f(X2) ),
inference(csr,[status(thm)],[51,12]) ).
cnf(238,negated_conjecture,
( f(esk5_0)
| f(esk2_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[237,14,theory(equality)]) ).
cnf(262,negated_conjecture,
( f(esk2_0)
| f(esk5_0) ),
inference(spm,[status(thm)],[238,14,theory(equality)]) ).
cnf(285,negated_conjecture,
( esk2_0 = esk4_0
| f(esk5_0) ),
inference(spm,[status(thm)],[21,262,theory(equality)]) ).
cnf(299,negated_conjecture,
( esk5_0 = X1
| esk4_0 = esk2_0
| ~ f(X1) ),
inference(spm,[status(thm)],[110,285,theory(equality)]) ).
cnf(360,negated_conjecture,
( f(esk1_0)
| f(esk4_0)
| esk5_0 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(spm,[status(thm)],[10,29,theory(equality)]) ).
cnf(505,negated_conjecture,
( f(esk1_0)
| esk4_0 = esk1_0
| esk5_0 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(spm,[status(thm)],[10,161,theory(equality)]) ).
cnf(628,negated_conjecture,
( f(esk1_0)
| f(esk4_0)
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(csr,[status(thm)],[360,16]) ).
cnf(653,negated_conjecture,
( esk4_0 = esk2_0
| esk5_0 = esk4_0
| f(esk1_0)
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[299,628,theory(equality)]) ).
cnf(1124,negated_conjecture,
( esk4_0 = esk2_0
| esk5_0 = esk1_0
| esk4_0 = esk5_0
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[299,653,theory(equality)]) ).
cnf(1238,negated_conjecture,
( esk5_0 = X1
| f(esk1_0)
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(csr,[status(thm)],[82,13]) ).
cnf(1358,negated_conjecture,
( esk4_0 = esk5_0
| esk1_0 = esk5_0
| esk4_0 = esk2_0
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[1124,285,theory(equality)]) ).
cnf(1405,negated_conjecture,
( esk4_0 = esk2_0
| esk1_0 = esk5_0
| esk4_0 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[1358,285,theory(equality)]) ).
cnf(1433,negated_conjecture,
( esk4_0 = esk5_0
| esk1_0 = esk5_0
| esk4_0 = esk2_0 ),
inference(spm,[status(thm)],[1405,285,theory(equality)]) ).
cnf(2839,negated_conjecture,
( esk4_0 = esk1_0
| f(esk1_0)
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(csr,[status(thm)],[505,1238]) ).
cnf(2861,negated_conjecture,
( esk4_0 = esk1_0
| esk5_0 = esk1_0
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[157,2839,theory(equality)]) ).
cnf(2993,negated_conjecture,
( esk1_0 = esk5_0
| esk4_0 = esk1_0
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[2861,149,theory(equality)]) ).
cnf(3073,negated_conjecture,
( esk4_0 = esk1_0
| esk1_0 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[2993,149,theory(equality)]) ).
cnf(3124,negated_conjecture,
( esk1_0 = esk5_0
| esk4_0 = esk1_0 ),
inference(spm,[status(thm)],[3073,149,theory(equality)]) ).
cnf(3148,negated_conjecture,
( f(esk1_0)
| esk1_0 = esk5_0
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[628,3124,theory(equality)]) ).
cnf(3150,negated_conjecture,
( esk1_0 = esk2_0
| esk1_0 = esk5_0 ),
inference(spm,[status(thm)],[1433,3124,theory(equality)]) ).
cnf(3154,negated_conjecture,
( f(esk3_1(X1))
| esk1_0 = esk5_0
| ~ f(X2)
| ~ f(X1) ),
inference(spm,[status(thm)],[11,3150,theory(equality)]) ).
cnf(3155,negated_conjecture,
( esk1_0 = esk5_0
| esk3_1(X1) != X1
| ~ f(X1) ),
inference(spm,[status(thm)],[107,3150,theory(equality)]) ).
cnf(3167,negated_conjecture,
( esk1_0 = esk5_0
| f(esk5_0)
| X2 != X1
| ~ f(X1)
| ~ f(X2)
| ~ f(esk3_1(X1)) ),
inference(spm,[status(thm)],[3155,15,theory(equality)]) ).
cnf(3189,negated_conjecture,
( esk1_0 = esk5_0
| f(esk5_0)
| ~ f(X1)
| ~ f(esk3_1(X1)) ),
inference(er,[status(thm)],[3167,theory(equality)]) ).
cnf(3421,negated_conjecture,
( esk1_0 = esk5_0
| f(esk5_0)
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[3189,3154,theory(equality)]) ).
cnf(3440,negated_conjecture,
( esk1_0 = esk5_0
| f(esk5_0)
| ~ f(X1) ),
inference(spm,[status(thm)],[3421,14,theory(equality)]) ).
cnf(3515,negated_conjecture,
( esk1_0 = esk5_0
| f(esk5_0) ),
inference(spm,[status(thm)],[3440,14,theory(equality)]) ).
cnf(3563,negated_conjecture,
( esk5_0 = X1
| esk1_0 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[110,3515,theory(equality)]) ).
cnf(3689,negated_conjecture,
( esk1_0 = esk5_0
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[3563,3148,theory(equality)]) ).
cnf(3787,negated_conjecture,
( esk1_0 = esk5_0
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[3689,3515,theory(equality)]) ).
cnf(3840,negated_conjecture,
( esk1_0 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[3787,3515,theory(equality)]) ).
cnf(3867,negated_conjecture,
esk1_0 = esk5_0,
inference(spm,[status(thm)],[3840,3515,theory(equality)]) ).
cnf(3913,negated_conjecture,
( f(esk5_0)
| f(esk5_0) ),
inference(rw,[status(thm)],[132,3867,theory(equality)]) ).
cnf(3914,negated_conjecture,
f(esk5_0),
inference(cn,[status(thm)],[3913,theory(equality)]) ).
cnf(3915,negated_conjecture,
( esk3_1(X1) != X1
| esk2_0 != esk5_0
| ~ f(X1) ),
inference(rw,[status(thm)],[107,3867,theory(equality)]) ).
cnf(3917,negated_conjecture,
( f(esk3_1(X1))
| esk2_0 != esk5_0
| ~ f(X2)
| ~ f(X1) ),
inference(rw,[status(thm)],[11,3867,theory(equality)]) ).
cnf(3926,negated_conjecture,
( esk5_0 = X1
| $false
| ~ f(X1) ),
inference(rw,[status(thm)],[110,3914,theory(equality)]) ).
cnf(3927,negated_conjecture,
( esk5_0 = X1
| ~ f(X1) ),
inference(cn,[status(thm)],[3926,theory(equality)]) ).
cnf(3938,negated_conjecture,
( esk5_0 = esk3_1(X1)
| f(esk2_0)
| ~ f(X2)
| ~ f(X1) ),
inference(spm,[status(thm)],[3927,12,theory(equality)]) ).
cnf(3952,negated_conjecture,
( f(esk2_0)
| esk5_0 != X1
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(spm,[status(thm)],[9,3938,theory(equality)]) ).
cnf(3986,negated_conjecture,
( f(esk2_0)
| ~ f(X2)
| ~ f(X1)
| ~ f(X3) ),
inference(csr,[status(thm)],[3952,3927]) ).
cnf(3990,negated_conjecture,
( esk5_0 = esk2_0
| ~ f(X1)
| ~ f(X2)
| ~ f(X3) ),
inference(spm,[status(thm)],[3927,3986,theory(equality)]) ).
cnf(3997,negated_conjecture,
( esk2_0 = esk5_0
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[3990,3914,theory(equality)]) ).
cnf(4006,negated_conjecture,
( esk2_0 = esk5_0
| ~ f(X1) ),
inference(spm,[status(thm)],[3997,3914,theory(equality)]) ).
cnf(4012,negated_conjecture,
esk2_0 = esk5_0,
inference(spm,[status(thm)],[4006,3914,theory(equality)]) ).
cnf(4019,negated_conjecture,
( f(esk3_1(X1))
| $false
| ~ f(X2)
| ~ f(X1) ),
inference(rw,[status(thm)],[3917,4012,theory(equality)]) ).
cnf(4020,negated_conjecture,
( f(esk3_1(X1))
| ~ f(X2)
| ~ f(X1) ),
inference(cn,[status(thm)],[4019,theory(equality)]) ).
cnf(4021,negated_conjecture,
( esk3_1(X1) != X1
| $false
| ~ f(X1) ),
inference(rw,[status(thm)],[3915,4012,theory(equality)]) ).
cnf(4022,negated_conjecture,
( esk3_1(X1) != X1
| ~ f(X1) ),
inference(cn,[status(thm)],[4021,theory(equality)]) ).
cnf(4026,negated_conjecture,
( esk5_0 = esk3_1(X1)
| ~ f(X2)
| ~ f(X1) ),
inference(spm,[status(thm)],[3927,4020,theory(equality)]) ).
cnf(4032,negated_conjecture,
( esk5_0 != X1
| ~ f(X1)
| ~ f(X2) ),
inference(spm,[status(thm)],[4022,4026,theory(equality)]) ).
fof(4033,plain,
( ~ epred3_0
<=> ! [X1] :
( ~ f(X1)
| esk5_0 != X1 ) ),
introduced(definition),
[split] ).
cnf(4034,plain,
( epred3_0
| ~ f(X1)
| esk5_0 != X1 ),
inference(split_equiv,[status(thm)],[4033]) ).
fof(4035,plain,
( ~ epred4_0
<=> ! [X2] : ~ f(X2) ),
introduced(definition),
[split] ).
cnf(4036,plain,
( epred4_0
| ~ f(X2) ),
inference(split_equiv,[status(thm)],[4035]) ).
cnf(4037,negated_conjecture,
( ~ epred4_0
| ~ epred3_0 ),
inference(apply_def,[status(esa)],[inference(apply_def,[status(esa)],[4032,4033,theory(equality)]),4035,theory(equality)]),
[split] ).
cnf(4040,negated_conjecture,
epred4_0,
inference(spm,[status(thm)],[4036,3914,theory(equality)]) ).
cnf(4043,negated_conjecture,
( $false
| ~ epred3_0 ),
inference(rw,[status(thm)],[4037,4040,theory(equality)]) ).
cnf(4044,negated_conjecture,
~ epred3_0,
inference(cn,[status(thm)],[4043,theory(equality)]) ).
cnf(4045,negated_conjecture,
( ~ f(X1)
| esk5_0 != X1 ),
inference(sr,[status(thm)],[4034,4044,theory(equality)]) ).
cnf(4046,negated_conjecture,
~ f(X1),
inference(csr,[status(thm)],[4045,3927]) ).
cnf(4048,negated_conjecture,
$false,
inference(sr,[status(thm)],[3914,4046,theory(equality)]) ).
cnf(4049,negated_conjecture,
$false,
4048,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % SZS status Started for /home/graph/tptp/TPTP/Problems/SYN/SYN415+1.p
% --creating new selector for []
% -running prover on /tmp/tmpzpzrk_/sel_SYN415+1.p_1 with time limit 29
% -prover status Theorem
% Problem SYN415+1.p solved in phase 0.
% % SZS status Theorem for /home/graph/tptp/TPTP/Problems/SYN/SYN415+1.p
% % SZS status Ended for /home/graph/tptp/TPTP/Problems/SYN/SYN415+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
%
%------------------------------------------------------------------------------