TSTP Solution File: SET723+4 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SET723+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:23:28 EDT 2023
% Result : Theorem 0.15s 0.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of formulae : 52 ( 15 unt; 0 def)
% Number of atoms : 275 ( 26 equ)
% Maximal formula atoms : 55 ( 5 avg)
% Number of connectives : 349 ( 126 ~; 153 |; 56 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-7 aty)
% Number of variables : 168 ( 0 sgn; 78 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII14,conjecture,
! [X6,X10,X9,X1,X2,X11] :
( ( maps(X6,X2,X11)
& maps(X10,X1,X2)
& maps(X9,X1,X2)
& injective(X6,X2,X11)
& equal_maps(compose_function(X6,X10,X1,X2,X11),compose_function(X6,X9,X1,X2,X11),X1,X11) )
=> equal_maps(X10,X9,X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p',thII14) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3] :
( member(X3,X1)
=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5) ) )
& ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X6,X3,X8) )
=> X7 = X8 ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p',maps) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X3,X1)
& member(X7,X2)
& member(X8,X2) )
=> ( ( apply(X6,X3,X7)
& apply(X10,X3,X8) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p',equal_maps) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X3,X1)
& member(X12,X11) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( member(X5,X2)
& apply(X6,X3,X5)
& apply(X10,X5,X12) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p',compose_function) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X13,X1)
& member(X14,X1)
& member(X5,X2) )
=> ( ( apply(X6,X13,X5)
& apply(X6,X14,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p',injective) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X9,X1,X2,X11] :
( ( maps(X6,X2,X11)
& maps(X10,X1,X2)
& maps(X9,X1,X2)
& injective(X6,X2,X11)
& equal_maps(compose_function(X6,X10,X1,X2,X11),compose_function(X6,X9,X1,X2,X11),X1,X11) )
=> equal_maps(X10,X9,X1,X2) ),
inference(assume_negation,[status(cth)],[thII14]) ).
fof(c_0_6,plain,
! [X61,X62,X63,X64,X66,X67,X68,X69,X70,X71,X73] :
( ( member(esk14_4(X61,X62,X63,X64),X63)
| ~ member(X64,X62)
| ~ maps(X61,X62,X63) )
& ( apply(X61,X64,esk14_4(X61,X62,X63,X64))
| ~ member(X64,X62)
| ~ maps(X61,X62,X63) )
& ( ~ member(X66,X62)
| ~ member(X67,X63)
| ~ member(X68,X63)
| ~ apply(X61,X66,X67)
| ~ apply(X61,X66,X68)
| X67 = X68
| ~ maps(X61,X62,X63) )
& ( member(esk16_3(X69,X70,X71),X70)
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( member(esk17_3(X69,X70,X71),X71)
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( member(esk18_3(X69,X70,X71),X71)
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( apply(X69,esk16_3(X69,X70,X71),esk17_3(X69,X70,X71))
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( apply(X69,esk16_3(X69,X70,X71),esk18_3(X69,X70,X71))
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( esk17_3(X69,X70,X71) != esk18_3(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| maps(X69,X70,X71) )
& ( member(esk16_3(X69,X70,X71),X70)
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) )
& ( member(esk17_3(X69,X70,X71),X71)
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) )
& ( member(esk18_3(X69,X70,X71),X71)
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) )
& ( apply(X69,esk16_3(X69,X70,X71),esk17_3(X69,X70,X71))
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) )
& ( apply(X69,esk16_3(X69,X70,X71),esk18_3(X69,X70,X71))
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) )
& ( esk17_3(X69,X70,X71) != esk18_3(X69,X70,X71)
| ~ member(X73,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| maps(X69,X70,X71) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[maps])])])])])]) ).
fof(c_0_7,negated_conjecture,
( maps(esk1_0,esk5_0,esk6_0)
& maps(esk2_0,esk4_0,esk5_0)
& maps(esk3_0,esk4_0,esk5_0)
& injective(esk1_0,esk5_0,esk6_0)
& equal_maps(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),compose_function(esk1_0,esk3_0,esk4_0,esk5_0,esk6_0),esk4_0,esk6_0)
& ~ equal_maps(esk2_0,esk3_0,esk4_0,esk5_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_8,plain,
! [X23,X24,X25,X26,X27,X28,X29,X30,X31,X32,X33] :
( ( ~ equal_maps(X23,X24,X25,X26)
| ~ member(X27,X25)
| ~ member(X28,X26)
| ~ member(X29,X26)
| ~ apply(X23,X27,X28)
| ~ apply(X24,X27,X29)
| X28 = X29 )
& ( member(esk7_4(X30,X31,X32,X33),X32)
| equal_maps(X30,X31,X32,X33) )
& ( member(esk8_4(X30,X31,X32,X33),X33)
| equal_maps(X30,X31,X32,X33) )
& ( member(esk9_4(X30,X31,X32,X33),X33)
| equal_maps(X30,X31,X32,X33) )
& ( apply(X30,esk7_4(X30,X31,X32,X33),esk8_4(X30,X31,X32,X33))
| equal_maps(X30,X31,X32,X33) )
& ( apply(X31,esk7_4(X30,X31,X32,X33),esk9_4(X30,X31,X32,X33))
| equal_maps(X30,X31,X32,X33) )
& ( esk8_4(X30,X31,X32,X33) != esk9_4(X30,X31,X32,X33)
| equal_maps(X30,X31,X32,X33) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_maps])])])])])]) ).
fof(c_0_9,plain,
! [X37,X38,X39,X40,X41,X42,X43,X45] :
( ( member(esk10_7(X37,X38,X39,X40,X41,X42,X43),X40)
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| ~ member(X42,X39)
| ~ member(X43,X41) )
& ( apply(X38,X42,esk10_7(X37,X38,X39,X40,X41,X42,X43))
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| ~ member(X42,X39)
| ~ member(X43,X41) )
& ( apply(X37,esk10_7(X37,X38,X39,X40,X41,X42,X43),X43)
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| ~ member(X42,X39)
| ~ member(X43,X41) )
& ( ~ member(X45,X40)
| ~ apply(X38,X42,X45)
| ~ apply(X37,X45,X43)
| apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| ~ member(X42,X39)
| ~ member(X43,X41) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])]) ).
cnf(c_0_10,plain,
( apply(X1,X2,esk14_4(X1,X3,X4,X2))
| ~ member(X2,X3)
| ~ maps(X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,negated_conjecture,
maps(esk1_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( X6 = X7
| ~ equal_maps(X1,X2,X3,X4)
| ~ member(X5,X3)
| ~ member(X6,X4)
| ~ member(X7,X4)
| ~ apply(X1,X5,X6)
| ~ apply(X2,X5,X7) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
equal_maps(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),compose_function(esk1_0,esk3_0,esk4_0,esk5_0,esk6_0),esk4_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( apply(compose_function(X5,X3,X7,X2,X8),X4,X6)
| ~ member(X1,X2)
| ~ apply(X3,X4,X1)
| ~ apply(X5,X1,X6)
| ~ member(X4,X7)
| ~ member(X6,X8) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
( apply(esk1_0,X1,esk14_4(esk1_0,esk5_0,esk6_0,X1))
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( member(esk14_4(X1,X2,X3,X4),X3)
| ~ member(X4,X2)
| ~ maps(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,plain,
( X3 = X5
| ~ member(X1,X2)
| ~ member(X3,X4)
| ~ member(X5,X4)
| ~ apply(X6,X1,X3)
| ~ apply(X6,X1,X5)
| ~ maps(X6,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
maps(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_19,negated_conjecture,
~ equal_maps(esk2_0,esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_20,plain,
( apply(X1,esk7_4(X1,X2,X3,X4),esk8_4(X1,X2,X3,X4))
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_21,plain,
( member(esk8_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_22,plain,
( member(esk7_4(X1,X2,X3,X4),X3)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( X1 = X2
| ~ apply(compose_function(esk1_0,esk3_0,esk4_0,esk5_0,esk6_0),X3,X2)
| ~ apply(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),X3,X1)
| ~ member(X2,esk6_0)
| ~ member(X1,esk6_0)
| ~ member(X3,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_24,negated_conjecture,
( apply(compose_function(esk1_0,X1,X2,X3,X4),X5,esk14_4(esk1_0,esk5_0,esk6_0,X6))
| ~ apply(X1,X5,X6)
| ~ member(esk14_4(esk1_0,esk5_0,esk6_0,X6),X4)
| ~ member(X6,esk5_0)
| ~ member(X5,X2)
| ~ member(X6,X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
( member(esk14_4(esk1_0,esk5_0,esk6_0,X1),esk6_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_26,negated_conjecture,
( X1 = X2
| ~ apply(esk2_0,X3,X2)
| ~ apply(esk2_0,X3,X1)
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0)
| ~ member(X3,esk4_0) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
apply(esk2_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0),esk8_4(esk2_0,esk3_0,esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,negated_conjecture,
member(esk8_4(esk2_0,esk3_0,esk4_0,esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_19,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
member(esk7_4(esk2_0,esk3_0,esk4_0,esk5_0),esk4_0),
inference(spm,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_30,negated_conjecture,
( X1 = esk14_4(esk1_0,esk5_0,esk6_0,X2)
| ~ apply(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),X3,X1)
| ~ apply(esk3_0,X3,X2)
| ~ member(X1,esk6_0)
| ~ member(X3,esk4_0)
| ~ member(X2,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_31,plain,
( apply(X1,esk7_4(X2,X1,X3,X4),esk9_4(X2,X1,X3,X4))
| equal_maps(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_32,plain,
( member(esk9_4(X1,X2,X3,X4),X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,negated_conjecture,
( X1 = esk8_4(esk2_0,esk3_0,esk4_0,esk5_0)
| ~ apply(esk2_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0),X1)
| ~ member(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29])]) ).
cnf(c_0_34,negated_conjecture,
( apply(esk2_0,X1,esk14_4(esk2_0,esk4_0,esk5_0,X1))
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_18]) ).
fof(c_0_35,plain,
! [X46,X47,X48,X49,X50,X51,X52,X53,X54] :
( ( ~ injective(X46,X47,X48)
| ~ member(X49,X47)
| ~ member(X50,X47)
| ~ member(X51,X48)
| ~ apply(X46,X49,X51)
| ~ apply(X46,X50,X51)
| X49 = X50 )
& ( member(esk11_3(X52,X53,X54),X53)
| injective(X52,X53,X54) )
& ( member(esk12_3(X52,X53,X54),X53)
| injective(X52,X53,X54) )
& ( member(esk13_3(X52,X53,X54),X54)
| injective(X52,X53,X54) )
& ( apply(X52,esk11_3(X52,X53,X54),esk13_3(X52,X53,X54))
| injective(X52,X53,X54) )
& ( apply(X52,esk12_3(X52,X53,X54),esk13_3(X52,X53,X54))
| injective(X52,X53,X54) )
& ( esk11_3(X52,X53,X54) != esk12_3(X52,X53,X54)
| injective(X52,X53,X54) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[injective])])])])])]) ).
cnf(c_0_36,negated_conjecture,
( esk14_4(esk1_0,esk5_0,esk6_0,X1) = esk14_4(esk1_0,esk5_0,esk6_0,X2)
| ~ apply(esk3_0,X3,X2)
| ~ apply(esk2_0,X3,X1)
| ~ member(X3,esk4_0)
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_25]) ).
cnf(c_0_37,negated_conjecture,
apply(esk3_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0),esk9_4(esk2_0,esk3_0,esk4_0,esk5_0)),
inference(spm,[status(thm)],[c_0_19,c_0_31]) ).
cnf(c_0_38,negated_conjecture,
member(esk9_4(esk2_0,esk3_0,esk4_0,esk5_0),esk5_0),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_39,negated_conjecture,
( esk14_4(esk2_0,esk4_0,esk5_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0)) = esk8_4(esk2_0,esk3_0,esk4_0,esk5_0)
| ~ member(esk14_4(esk2_0,esk4_0,esk5_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0)),esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_29])]) ).
cnf(c_0_40,negated_conjecture,
( member(esk14_4(esk2_0,esk4_0,esk5_0,X1),esk5_0)
| ~ member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_41,plain,
( X4 = X5
| ~ injective(X1,X2,X3)
| ~ member(X4,X2)
| ~ member(X5,X2)
| ~ member(X6,X3)
| ~ apply(X1,X4,X6)
| ~ apply(X1,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_42,negated_conjecture,
injective(esk1_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_43,negated_conjecture,
( esk14_4(esk1_0,esk5_0,esk6_0,X1) = esk14_4(esk1_0,esk5_0,esk6_0,esk9_4(esk2_0,esk3_0,esk4_0,esk5_0))
| ~ apply(esk2_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0),X1)
| ~ member(X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_29]),c_0_38])]) ).
cnf(c_0_44,negated_conjecture,
esk14_4(esk2_0,esk4_0,esk5_0,esk7_4(esk2_0,esk3_0,esk4_0,esk5_0)) = esk8_4(esk2_0,esk3_0,esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_29])]) ).
cnf(c_0_45,negated_conjecture,
( X1 = X2
| ~ apply(esk1_0,X2,X3)
| ~ apply(esk1_0,X1,X3)
| ~ member(X3,esk6_0)
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_46,negated_conjecture,
esk14_4(esk1_0,esk5_0,esk6_0,esk9_4(esk2_0,esk3_0,esk4_0,esk5_0)) = esk14_4(esk1_0,esk5_0,esk6_0,esk8_4(esk2_0,esk3_0,esk4_0,esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_44]),c_0_44]),c_0_28]),c_0_29])]) ).
cnf(c_0_47,plain,
( equal_maps(X1,X2,X3,X4)
| esk8_4(X1,X2,X3,X4) != esk9_4(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_48,negated_conjecture,
( X1 = X2
| ~ apply(esk1_0,X1,esk14_4(esk1_0,esk5_0,esk6_0,X2))
| ~ member(X2,esk5_0)
| ~ member(X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_15]),c_0_25]) ).
cnf(c_0_49,negated_conjecture,
apply(esk1_0,esk9_4(esk2_0,esk3_0,esk4_0,esk5_0),esk14_4(esk1_0,esk5_0,esk6_0,esk8_4(esk2_0,esk3_0,esk4_0,esk5_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_46]),c_0_38])]) ).
cnf(c_0_50,negated_conjecture,
esk9_4(esk2_0,esk3_0,esk4_0,esk5_0) != esk8_4(esk2_0,esk3_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_19,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_28]),c_0_38])]),c_0_50]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : SET723+4 : TPTP v8.1.2. Bugfixed v2.2.1.
% 0.05/0.11 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n019.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 17:24:21 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.42 Running first-order model finding
% 0.15/0.42 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.owjqLzlum1/E---3.1_14073.p
% 0.15/0.52 # Version: 3.1pre001
% 0.15/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.15/0.52 # Starting sh5l with 300s (1) cores
% 0.15/0.52 # new_bool_3 with pid 14151 completed with status 0
% 0.15/0.52 # Result found by new_bool_3
% 0.15/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.52 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.15/0.52 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.15/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.15/0.52 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with pid 14154 completed with status 0
% 0.15/0.52 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 0.15/0.52 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.15/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.52 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.15/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.15/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.52 # Search class: FGUSF-FFMS33-SFFFFFNN
% 0.15/0.52 # partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.15/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.52 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI with 150s (1) cores
% 0.15/0.52 # Preprocessing time : 0.003 s
% 0.15/0.52 # Presaturation interreduction done
% 0.15/0.52
% 0.15/0.52 # Proof found!
% 0.15/0.52 # SZS status Theorem
% 0.15/0.52 # SZS output start CNFRefutation
% See solution above
% 0.15/0.52 # Parsed axioms : 29
% 0.15/0.52 # Removed by relevancy pruning/SinE : 22
% 0.15/0.52 # Initial clauses : 46
% 0.15/0.52 # Removed in clause preprocessing : 0
% 0.15/0.52 # Initial clauses in saturation : 46
% 0.15/0.52 # Processed clauses : 488
% 0.15/0.52 # ...of these trivial : 0
% 0.15/0.52 # ...subsumed : 134
% 0.15/0.52 # ...remaining for further processing : 354
% 0.15/0.52 # Other redundant clauses eliminated : 0
% 0.15/0.52 # Clauses deleted for lack of memory : 0
% 0.15/0.52 # Backward-subsumed : 0
% 0.15/0.52 # Backward-rewritten : 4
% 0.15/0.52 # Generated clauses : 2184
% 0.15/0.52 # ...of the previous two non-redundant : 2122
% 0.15/0.52 # ...aggressively subsumed : 0
% 0.15/0.52 # Contextual simplify-reflections : 6
% 0.15/0.52 # Paramodulations : 2184
% 0.15/0.52 # Factorizations : 0
% 0.15/0.52 # NegExts : 0
% 0.15/0.52 # Equation resolutions : 0
% 0.15/0.52 # Total rewrite steps : 315
% 0.15/0.52 # Propositional unsat checks : 0
% 0.15/0.52 # Propositional check models : 0
% 0.15/0.52 # Propositional check unsatisfiable : 0
% 0.15/0.52 # Propositional clauses : 0
% 0.15/0.52 # Propositional clauses after purity: 0
% 0.15/0.52 # Propositional unsat core size : 0
% 0.15/0.52 # Propositional preprocessing time : 0.000
% 0.15/0.52 # Propositional encoding time : 0.000
% 0.15/0.52 # Propositional solver time : 0.000
% 0.15/0.52 # Success case prop preproc time : 0.000
% 0.15/0.52 # Success case prop encoding time : 0.000
% 0.15/0.52 # Success case prop solver time : 0.000
% 0.15/0.52 # Current number of processed clauses : 304
% 0.15/0.52 # Positive orientable unit clauses : 15
% 0.15/0.52 # Positive unorientable unit clauses: 0
% 0.15/0.52 # Negative unit clauses : 3
% 0.15/0.52 # Non-unit-clauses : 286
% 0.15/0.52 # Current number of unprocessed clauses: 1703
% 0.15/0.52 # ...number of literals in the above : 14871
% 0.15/0.52 # Current number of archived formulas : 0
% 0.15/0.52 # Current number of archived clauses : 50
% 0.15/0.52 # Clause-clause subsumption calls (NU) : 26312
% 0.15/0.52 # Rec. Clause-clause subsumption calls : 3918
% 0.15/0.52 # Non-unit clause-clause subsumptions : 138
% 0.15/0.52 # Unit Clause-clause subsumption calls : 63
% 0.15/0.52 # Rewrite failures with RHS unbound : 0
% 0.15/0.52 # BW rewrite match attempts : 41
% 0.15/0.52 # BW rewrite match successes : 3
% 0.15/0.52 # Condensation attempts : 0
% 0.15/0.52 # Condensation successes : 0
% 0.15/0.52 # Termbank termtop insertions : 87977
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.084 s
% 0.15/0.52 # System time : 0.006 s
% 0.15/0.52 # Total time : 0.091 s
% 0.15/0.52 # Maximum resident set size: 1904 pages
% 0.15/0.52
% 0.15/0.52 # -------------------------------------------------
% 0.15/0.52 # User time : 0.086 s
% 0.15/0.52 # System time : 0.009 s
% 0.15/0.52 # Total time : 0.094 s
% 0.15/0.52 # Maximum resident set size: 1740 pages
% 0.15/0.52 % E---3.1 exiting
%------------------------------------------------------------------------------