%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET723+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:15:04 PM UTC 2026
% Result : Theorem 19.76s 3.52s
% Output : CNFRefutation 19.76s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 5
% Syntax : Number of formulae : 47 ( 6 unt; 0 def)
% Number of atoms : 338 ( 24 equ)
% Maximal formula atoms : 55 ( 7 avg)
% Number of connectives : 479 ( 188 ~; 221 |; 56 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 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 : 208 ( 0 sgn 78 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(thII14,conjecture,
! [X6,X10,X9,X1,X2,X11] :
( ( equal_maps(compose_function(X6,X10,X1,X2,X11),compose_function(X6,X9,X1,X2,X11),X1,X11)
& injective(X6,X2,X11)
& maps(X9,X1,X2)
& maps(X10,X1,X2)
& maps(X6,X2,X11) )
=> equal_maps(X10,X9,X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII14) ).
fof(equal_maps,axiom,
! [X6,X10,X1,X2] :
( equal_maps(X6,X10,X1,X2)
<=> ! [X3,X7,X8] :
( ( member(X8,X2)
& member(X7,X2)
& member(X3,X1) )
=> ( ( apply(X10,X3,X8)
& apply(X6,X3,X7) )
=> X7 = X8 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',equal_maps) ).
fof(compose_function,axiom,
! [X10,X6,X1,X2,X11,X3,X12] :
( ( member(X12,X11)
& member(X3,X1) )
=> ( apply(compose_function(X10,X6,X1,X2,X11),X3,X12)
<=> ? [X5] :
( apply(X10,X5,X12)
& apply(X6,X3,X5)
& member(X5,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',compose_function) ).
fof(maps,axiom,
! [X6,X1,X2] :
( maps(X6,X1,X2)
<=> ( ! [X3,X7,X8] :
( ( member(X8,X2)
& member(X7,X2)
& member(X3,X1) )
=> ( ( apply(X6,X3,X8)
& apply(X6,X3,X7) )
=> X7 = X8 ) )
& ! [X3] :
( member(X3,X1)
=> ? [X5] :
( apply(X6,X3,X5)
& member(X5,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',maps) ).
fof(injective,axiom,
! [X6,X1,X2] :
( injective(X6,X1,X2)
<=> ! [X13,X14,X5] :
( ( member(X5,X2)
& member(X14,X1)
& member(X13,X1) )
=> ( ( apply(X6,X14,X5)
& apply(X6,X13,X5) )
=> X13 = X14 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',injective) ).
fof(c_0_5,negated_conjecture,
~ ! [X6,X10,X9,X1,X2,X11] :
( ( equal_maps(compose_function(X6,X10,X1,X2,X11),compose_function(X6,X9,X1,X2,X11),X1,X11)
& injective(X6,X2,X11)
& maps(X9,X1,X2)
& maps(X10,X1,X2)
& maps(X6,X2,X11) )
=> equal_maps(X10,X9,X1,X2) ),
inference(assume_negation,[status(cth)],[thII14]) ).
fof(c_0_6,plain,
! [X23,X24,X25,X26,X27,X28,X29,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)
| apply(X31,esk7_4(X30,X31,X32,X33),esk9_4(X30,X31,X32,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)
| member(esk9_4(X30,X31,X32,X33),X33) )
& ( equal_maps(X30,X31,X32,X33)
| member(esk8_4(X30,X31,X32,X33),X33) )
& ( equal_maps(X30,X31,X32,X33)
| member(esk7_4(X30,X31,X32,X33),X32) )
& ( X28 = X29
| ~ apply(X24,X27,X29)
| ~ apply(X23,X27,X28)
| ~ member(X29,X26)
| ~ member(X28,X26)
| ~ member(X27,X25)
| ~ equal_maps(X23,X24,X25,X26) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_7,negated_conjecture,
( ~ equal_maps(esk2_0,esk3_0,esk4_0,esk5_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)
& injective(esk1_0,esk5_0,esk6_0)
& maps(esk3_0,esk4_0,esk5_0)
& maps(esk2_0,esk4_0,esk5_0)
& maps(esk1_0,esk5_0,esk6_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
fof(c_0_8,plain,
! [X37,X38,X39,X40,X41,X42,X43,X45] :
( ( ~ member(X43,X41)
| ~ member(X42,X39)
| apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| ~ apply(X37,X45,X43)
| ~ apply(X38,X42,X45)
| ~ member(X45,X40) )
& ( ~ member(X43,X41)
| ~ member(X42,X39)
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| apply(X37,esk10_7(X37,X38,X39,X40,X41,X42,X43),X43) )
& ( ~ member(X43,X41)
| ~ member(X42,X39)
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| apply(X38,X42,esk10_7(X37,X38,X39,X40,X41,X42,X43)) )
& ( ~ member(X43,X41)
| ~ member(X42,X39)
| ~ apply(compose_function(X37,X38,X39,X40,X41),X42,X43)
| member(esk10_7(X37,X38,X39,X40,X41,X42,X43),X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[compose_function])])])])])]) ).
fof(c_0_9,plain,
! [X61,X62,X63,X64,X66,X67,X68,X69,X70,X71,X73] :
( ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| esk17_3(X69,X70,X71) != esk18_3(X69,X70,X71) )
& ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| apply(X69,esk16_3(X69,X70,X71),esk18_3(X69,X70,X71)) )
& ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| apply(X69,esk16_3(X69,X70,X71),esk17_3(X69,X70,X71)) )
& ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| member(esk18_3(X69,X70,X71),X71) )
& ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| member(esk17_3(X69,X70,X71),X71) )
& ( maps(X69,X70,X71)
| ~ apply(X69,esk15_3(X69,X70,X71),X73)
| ~ member(X73,X71)
| member(esk16_3(X69,X70,X71),X70) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| esk17_3(X69,X70,X71) != esk18_3(X69,X70,X71) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| apply(X69,esk16_3(X69,X70,X71),esk18_3(X69,X70,X71)) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| apply(X69,esk16_3(X69,X70,X71),esk17_3(X69,X70,X71)) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| member(esk18_3(X69,X70,X71),X71) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| member(esk17_3(X69,X70,X71),X71) )
& ( maps(X69,X70,X71)
| member(esk15_3(X69,X70,X71),X70)
| member(esk16_3(X69,X70,X71),X70) )
& ( ~ maps(X61,X62,X63)
| X67 = X68
| ~ apply(X61,X66,X68)
| ~ apply(X61,X66,X67)
| ~ member(X68,X63)
| ~ member(X67,X63)
| ~ member(X66,X62) )
& ( ~ maps(X61,X62,X63)
| ~ member(X64,X62)
| apply(X61,X64,esk14_4(X61,X62,X63,X64)) )
& ( ~ maps(X61,X62,X63)
| ~ member(X64,X62)
| member(esk14_4(X61,X62,X63,X64),X63) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).
cnf(c_0_10,plain,
( ~ apply(X2,X5,X7)
| ~ apply(X1,X5,X6)
| ~ member(X7,X4)
| ~ member(X6,X4)
| ~ member(X5,X3)
| ~ equal_maps(X1,X2,X3,X4)
| X6 = X7 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,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_12,plain,
( ~ member(X6,X8)
| ~ member(X4,X7)
| ~ apply(X5,X1,X6)
| ~ apply(X3,X4,X1)
| ~ member(X1,X2)
| apply(compose_function(X5,X3,X7,X2,X8),X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ maps(X1,X3,X4)
| ~ member(X2,X3)
| apply(X1,X2,esk14_4(X1,X3,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(X3,esk4_0)
| ~ member(X1,esk6_0)
| ~ member(X2,esk6_0)
| ~ apply(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),X3,X1)
| ~ apply(compose_function(esk1_0,esk3_0,esk4_0,esk5_0,esk6_0),X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( ~ member(X9,X7)
| ~ member(X9,X4)
| ~ member(X6,X3)
| ~ member(esk14_4(X1,X7,X8,X9),X5)
| ~ maps(X1,X7,X8)
| ~ apply(X2,X6,X9)
| apply(compose_function(X1,X2,X3,X4,X5),X6,esk14_4(X1,X7,X8,X9)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X4,X2)
| ~ member(X4,esk5_0)
| ~ member(X5,esk4_0)
| ~ member(X1,esk6_0)
| ~ member(esk14_4(esk1_0,X2,X3,X4),esk6_0)
| ~ maps(esk1_0,X2,X3)
| ~ apply(esk3_0,X5,X4)
| ~ apply(compose_function(esk1_0,esk2_0,esk4_0,esk5_0,esk6_0),X5,X1)
| X1 = esk14_4(esk1_0,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(X3,X1)
| ~ member(X6,X4)
| ~ member(X3,esk5_0)
| ~ member(X6,esk5_0)
| ~ member(X7,esk4_0)
| ~ member(esk14_4(esk1_0,X1,X2,X3),esk6_0)
| ~ member(esk14_4(esk1_0,X4,X5,X6),esk6_0)
| ~ maps(esk1_0,X1,X2)
| ~ maps(esk1_0,X4,X5)
| ~ apply(esk2_0,X7,X3)
| ~ apply(esk3_0,X7,X6)
| esk14_4(esk1_0,X1,X2,X3) = esk14_4(esk1_0,X4,X5,X6) ),
inference(spm,[status(thm)],[c_0_16,c_0_15]) ).
cnf(c_0_18,plain,
( ~ maps(X1,X2,X3)
| ~ member(X4,X2)
| member(esk14_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X3,X1)
| ~ member(X5,X4)
| ~ member(X3,esk5_0)
| ~ member(X5,esk5_0)
| ~ member(X6,esk4_0)
| ~ member(esk14_4(esk1_0,X1,X2,X3),esk6_0)
| ~ maps(esk1_0,X1,X2)
| ~ maps(esk1_0,X4,esk6_0)
| ~ apply(esk2_0,X6,X3)
| ~ apply(esk3_0,X6,X5)
| esk14_4(esk1_0,X1,X2,X3) = esk14_4(esk1_0,X4,esk6_0,X5) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(X2,X1)
| ~ member(X4,X3)
| ~ member(X2,esk5_0)
| ~ member(X4,esk5_0)
| ~ member(X5,esk4_0)
| ~ maps(esk1_0,X1,esk6_0)
| ~ maps(esk1_0,X3,esk6_0)
| ~ apply(esk2_0,X5,X2)
| ~ apply(esk3_0,X5,X4)
| esk14_4(esk1_0,X1,esk6_0,X2) = esk14_4(esk1_0,X3,esk6_0,X4) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_21,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X1,esk7_4(X1,X2,X3,X4),esk8_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_22,plain,
! [X46,X47,X48,X49,X50,X51,X52,X53,X54] :
( ( injective(X52,X53,X54)
| esk11_3(X52,X53,X54) != esk12_3(X52,X53,X54) )
& ( injective(X52,X53,X54)
| apply(X52,esk12_3(X52,X53,X54),esk13_3(X52,X53,X54)) )
& ( injective(X52,X53,X54)
| apply(X52,esk11_3(X52,X53,X54),esk13_3(X52,X53,X54)) )
& ( injective(X52,X53,X54)
| member(esk13_3(X52,X53,X54),X54) )
& ( injective(X52,X53,X54)
| member(esk12_3(X52,X53,X54),X53) )
& ( injective(X52,X53,X54)
| member(esk11_3(X52,X53,X54),X53) )
& ( X49 = X50
| ~ apply(X46,X50,X51)
| ~ apply(X46,X49,X51)
| ~ member(X51,X48)
| ~ member(X50,X47)
| ~ member(X49,X47)
| ~ injective(X46,X47,X48) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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_23,negated_conjecture,
( ~ member(X2,X1)
| ~ member(X2,esk5_0)
| ~ member(esk8_4(esk3_0,X4,X5,X6),X3)
| ~ member(esk8_4(esk3_0,X4,X5,X6),esk5_0)
| ~ member(esk7_4(esk3_0,X4,X5,X6),esk4_0)
| ~ maps(esk1_0,X1,esk6_0)
| ~ maps(esk1_0,X3,esk6_0)
| ~ apply(esk2_0,esk7_4(esk3_0,X4,X5,X6),X2)
| equal_maps(esk3_0,X4,X5,X6)
| esk14_4(esk1_0,X1,esk6_0,X2) = esk14_4(esk1_0,X3,esk6_0,esk8_4(esk3_0,X4,X5,X6)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,plain,
( equal_maps(X2,X1,X3,X4)
| apply(X1,esk7_4(X2,X1,X3,X4),esk9_4(X2,X1,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,plain,
( ~ apply(X1,X5,X6)
| ~ apply(X1,X4,X6)
| ~ member(X6,X3)
| ~ member(X5,X2)
| ~ member(X4,X2)
| ~ injective(X1,X2,X3)
| X4 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
injective(esk1_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk2_0,X2,X3),X1)
| ~ member(esk8_4(esk3_0,esk2_0,X2,X3),X4)
| ~ member(esk9_4(esk3_0,esk2_0,X2,X3),esk5_0)
| ~ member(esk8_4(esk3_0,esk2_0,X2,X3),esk5_0)
| ~ member(esk7_4(esk3_0,esk2_0,X2,X3),esk4_0)
| ~ maps(esk1_0,X1,esk6_0)
| ~ maps(esk1_0,X4,esk6_0)
| equal_maps(esk3_0,esk2_0,X2,X3)
| esk14_4(esk1_0,X1,esk6_0,esk9_4(esk3_0,esk2_0,X2,X3)) = esk14_4(esk1_0,X4,esk6_0,esk8_4(esk3_0,esk2_0,X2,X3)) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,esk5_0)
| ~ member(X3,esk6_0)
| ~ apply(esk1_0,X1,X3)
| ~ apply(esk1_0,X2,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk2_0,X1,X2),X3)
| ~ member(esk8_4(esk3_0,esk2_0,X1,X2),X4)
| ~ member(esk9_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ member(esk8_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ member(esk7_4(esk3_0,esk2_0,X1,X2),esk4_0)
| ~ maps(esk1_0,X3,esk6_0)
| ~ maps(esk1_0,X4,esk6_0)
| apply(esk1_0,esk8_4(esk3_0,esk2_0,X1,X2),esk14_4(esk1_0,X3,esk6_0,esk9_4(esk3_0,esk2_0,X1,X2)))
| equal_maps(esk3_0,esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_30,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk8_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_31,negated_conjecture,
( ~ member(X2,X3)
| ~ member(X1,esk5_0)
| ~ member(X2,esk5_0)
| ~ member(esk14_4(esk1_0,X3,X4,X2),esk6_0)
| ~ maps(esk1_0,X3,X4)
| ~ apply(esk1_0,X1,esk14_4(esk1_0,X3,X4,X2))
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_28,c_0_13]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk2_0,X1,X2),X3)
| ~ member(esk9_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ member(esk8_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ member(esk7_4(esk3_0,esk2_0,X1,X2),esk4_0)
| ~ maps(esk1_0,X3,esk6_0)
| ~ maps(esk1_0,X2,esk6_0)
| apply(esk1_0,esk8_4(esk3_0,esk2_0,X1,X2),esk14_4(esk1_0,X3,esk6_0,esk9_4(esk3_0,esk2_0,X1,X2)))
| equal_maps(esk3_0,esk2_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
( esk8_4(X1,X2,X3,X4) != esk9_4(X1,X2,X3,X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk2_0,X1,X2),X3)
| ~ member(esk7_4(esk3_0,esk2_0,X1,X2),esk4_0)
| ~ member(esk8_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ member(esk9_4(esk3_0,esk2_0,X1,X2),esk5_0)
| ~ maps(esk1_0,X2,esk6_0)
| ~ maps(esk1_0,X3,esk6_0)
| equal_maps(esk3_0,esk2_0,X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_18]),c_0_33]) ).
cnf(c_0_35,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk9_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_36,negated_conjecture,
maps(esk1_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk2_0,X1,esk5_0),X2)
| ~ member(esk7_4(esk3_0,esk2_0,X1,esk5_0),esk4_0)
| ~ maps(esk1_0,X2,esk6_0)
| equal_maps(esk3_0,esk2_0,X1,esk5_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_30]) ).
cnf(c_0_38,negated_conjecture,
( ~ member(esk7_4(esk3_0,esk2_0,X1,esk5_0),esk4_0)
| equal_maps(esk3_0,esk2_0,X1,esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_36])]) ).
cnf(c_0_39,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk7_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_40,negated_conjecture,
equal_maps(esk3_0,esk2_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
( ~ member(X3,esk4_0)
| ~ member(X1,esk5_0)
| ~ member(X2,esk5_0)
| ~ apply(esk3_0,X3,X1)
| ~ apply(esk2_0,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_10,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(esk7_4(esk2_0,X2,X3,X4),esk4_0)
| ~ member(esk8_4(esk2_0,X2,X3,X4),esk5_0)
| ~ apply(esk3_0,esk7_4(esk2_0,X2,X3,X4),X1)
| equal_maps(esk2_0,X2,X3,X4)
| X1 = esk8_4(esk2_0,X2,X3,X4) ),
inference(spm,[status(thm)],[c_0_41,c_0_21]) ).
cnf(c_0_43,negated_conjecture,
( ~ member(esk9_4(esk2_0,esk3_0,X1,X2),esk5_0)
| ~ member(esk7_4(esk2_0,esk3_0,X1,X2),esk4_0)
| ~ member(esk8_4(esk2_0,esk3_0,X1,X2),esk5_0)
| equal_maps(esk2_0,esk3_0,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_24]),c_0_33]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(esk7_4(esk2_0,esk3_0,X1,esk5_0),esk4_0)
| equal_maps(esk2_0,esk3_0,X1,esk5_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_35]),c_0_30]) ).
cnf(c_0_45,negated_conjecture,
~ equal_maps(esk2_0,esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_46,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_39]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET723+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.61 % Computer : n006.cluster.edu
% 0.15/0.61 % Model : x86_64 x86_64
% 0.15/0.61 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.61 % Memory : 8046.5625MB
% 0.15/0.61 % OS : Linux 6.8.0-71-generic
% 0.15/0.61 % CPULimit : 300
% 0.15/0.61 % WCLimit : 300
% 0.15/0.61 % DateTime : Mon Sep 21 05:33:43 UTC 2026
% 0.15/0.62 % CPUTime :
% 0.15/0.62 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.65 Running first-order theorem proving
% 0.18/0.65 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 19.76/3.52 % Version: 3.5.1
% 19.76/3.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.76/3.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.76/3.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.76/3.52 % Starting new_bool_3 with 300s (1) cores
% 19.76/3.52 % Starting new_bool_1 with 300s (1) cores
% 19.76/3.52 % Starting sh5l with 300s (1) cores
% 19.76/3.52 % new_bool_3 with pid 2101255 completed with status 0
% 19.76/3.52 % Result found by new_bool_3
% 19.76/3.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.76/3.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.76/3.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.76/3.52 % Starting new_bool_3 with 300s (1) cores
% 19.76/3.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 19.76/3.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.76/3.52 % Search class: FGUSF-FFMS33-SFFFFFNN
% 19.76/3.52 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 19.76/3.52 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 19.76/3.52 % Starting SubtermCWHack with 31s (1) cores
% 19.76/3.52 % SubtermCWHack with pid 2101260 completed with status 0
% 19.76/3.52 % Result found by SubtermCWHack
% 19.76/3.52 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.76/3.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.76/3.52 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.76/3.52 % Starting new_bool_3 with 300s (1) cores
% 19.76/3.52 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 19.76/3.52 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.76/3.52 % Search class: FGUSF-FFMS33-SFFFFFNN
% 19.76/3.52 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 19.76/3.52 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 19.76/3.52 % Starting SubtermCWHack with 31s (1) cores
% 19.76/3.52 % Preprocessing time : 0.001 s
% 19.76/3.52
% 19.76/3.52 % Proof found!
% 19.76/3.52 % SZS status Theorem
% 19.76/3.52 % SZS output start CNFRefutation
% See solution above
% 19.76/3.52 % Parsed axioms : 29
% 19.76/3.52 % Removed by relevancy pruning/SinE : 22
% 19.76/3.52 % Initial clauses : 46
% 19.76/3.52 % Removed in clause preprocessing : 0
% 19.76/3.52 % Initial clauses in saturation : 46
% 19.76/3.52 % Processed clauses : 3782
% 19.76/3.52 % ...of these trivial : 0
% 19.76/3.52 % ...subsumed : 1868
% 19.76/3.52 % ...remaining for further processing : 1914
% 19.76/3.52 % Other redundant clauses eliminated : 0
% 19.76/3.52 % Clauses deleted for lack of memory : 0
% 19.76/3.52 % Backward-subsumed : 157
% 19.76/3.52 % Backward-rewritten : 0
% 19.76/3.52 % Generated clauses : 67737
% 19.76/3.52 % ...of the previous two non-redundant : 67621
% 19.76/3.52 % ...aggressively subsumed : 0
% 19.76/3.52 % Contextual simplify-reflections : 55
% 19.76/3.52 % Paramodulations : 67737
% 19.76/3.52 % Factorizations : 0
% 19.76/3.52 % NegExts : 0
% 19.76/3.52 % Equation resolutions : 0
% 19.76/3.52 % Disequality decompositions : 0
% 19.76/3.52 % Total rewrite steps : 102
% 19.76/3.52 % ...of those cached : 98
% 19.76/3.52 % Propositional unsat checks : 0
% 19.76/3.52 % Propositional check models : 0
% 19.76/3.52 % Propositional check unsatisfiable : 0
% 19.76/3.52 % Propositional clauses : 0
% 19.76/3.52 % Propositional clauses after purity: 0
% 19.76/3.52 % Propositional unsat core size : 0
% 19.76/3.52 % Propositional preprocessing time : 0.000
% 19.76/3.52 % Propositional encoding time : 0.000
% 19.76/3.52 % Propositional solver time : 0.000
% 19.76/3.52 % Success case prop preproc time : 0.000
% 19.76/3.52 % Success case prop encoding time : 0.000
% 19.76/3.52 % Success case prop solver time : 0.000
% 19.76/3.52 % Current number of processed clauses : 1757
% 19.76/3.52 % Positive orientable unit clauses : 6
% 19.76/3.52 % Positive unorientable unit clauses: 0
% 19.76/3.52 % Negative unit clauses : 1
% 19.76/3.52 % Non-unit-clauses : 1750
% 19.76/3.52 % Current number of unprocessed clauses: 63781
% 19.76/3.52 % ...number of literals in the above : 1005496
% 19.76/3.52 % Current number of archived formulas : 0
% 19.76/3.52 % Current number of archived clauses : 157
% 19.76/3.52 % Clause-clause subsumption calls (NU) : 979059
% 19.76/3.52 % Rec. Clause-clause subsumption calls : 17568
% 19.76/3.52 % Non-unit clause-clause subsumptions : 2080
% 19.76/3.52 % Unit Clause-clause subsumption calls : 64
% 19.76/3.52 % Rewrite failures with RHS unbound : 0
% 19.76/3.52 % BW rewrite match attempts : 3
% 19.76/3.52 % BW rewrite match successes : 0
% 19.76/3.52 % Condensation attempts : 0
% 19.76/3.52 % Condensation successes : 0
% 19.76/3.52 % Termbank termtop insertions : 4665441
% 19.76/3.52 % Search garbage collected termcells : 1242
% 19.76/3.52
% 19.76/3.52 % -------------------------------------------------
% 19.76/3.52 % User time : 2.698 s
% 19.76/3.52 % System time : 0.067 s
% 19.76/3.52 % Total time : 2.765 s
% 19.76/3.52 % Maximum resident set size: 3640 pages
% 19.76/3.52
% 19.76/3.52 % -------------------------------------------------
% 19.76/3.52 % User time : 2.700 s
% 19.76/3.52 % System time : 0.072 s
% 19.76/3.52 % Total time : 2.772 s
% 19.76/3.52 % Maximum resident set size: 4864 pages
% 19.76/3.52 % E exiting
%------------------------------------------------------------------------------