%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET708+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 : n008.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:02 PM UTC 2026
% Result : Theorem 0.27s 0.81s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 49 ( 6 unt; 0 def)
% Number of atoms : 367 ( 21 equ)
% Maximal formula atoms : 55 ( 7 avg)
% Number of connectives : 542 ( 224 ~; 256 |; 50 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 8 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-6 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-8 aty)
% Number of variables : 264 ( 0 sgn 74 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
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(compose_predicate,axiom,
! [X9,X10,X6,X1,X2,X11] :
( compose_predicate(X9,X10,X6,X1,X2,X11)
<=> ! [X3,X12] :
( ( member(X12,X11)
& member(X3,X1) )
=> ( apply(X9,X3,X12)
<=> ? [X5] :
( apply(X10,X5,X12)
& apply(X6,X3,X5)
& member(X5,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',compose_predicate) ).
fof(thII01a,conjecture,
! [X6,X10,X17,X18,X1,X2,X11] :
( ( compose_predicate(X18,X10,X6,X1,X2,X11)
& compose_predicate(X17,X10,X6,X1,X2,X11)
& maps(X10,X2,X11)
& maps(X6,X1,X2) )
=> equal_maps(X17,X18,X1,X11) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII01a) ).
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(c_0_4,plain,
! [X60,X61,X62,X63,X65,X66,X67,X68,X69,X70,X72] :
( ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| esk18_3(X68,X69,X70) != esk19_3(X68,X69,X70) )
& ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| apply(X68,esk17_3(X68,X69,X70),esk19_3(X68,X69,X70)) )
& ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| apply(X68,esk17_3(X68,X69,X70),esk18_3(X68,X69,X70)) )
& ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| member(esk19_3(X68,X69,X70),X70) )
& ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| member(esk18_3(X68,X69,X70),X70) )
& ( maps(X68,X69,X70)
| ~ apply(X68,esk16_3(X68,X69,X70),X72)
| ~ member(X72,X70)
| member(esk17_3(X68,X69,X70),X69) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| esk18_3(X68,X69,X70) != esk19_3(X68,X69,X70) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| apply(X68,esk17_3(X68,X69,X70),esk19_3(X68,X69,X70)) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| apply(X68,esk17_3(X68,X69,X70),esk18_3(X68,X69,X70)) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| member(esk19_3(X68,X69,X70),X70) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| member(esk18_3(X68,X69,X70),X70) )
& ( maps(X68,X69,X70)
| member(esk16_3(X68,X69,X70),X69)
| member(esk17_3(X68,X69,X70),X69) )
& ( ~ maps(X60,X61,X62)
| X66 = X67
| ~ apply(X60,X65,X67)
| ~ apply(X60,X65,X66)
| ~ member(X67,X62)
| ~ member(X66,X62)
| ~ member(X65,X61) )
& ( ~ maps(X60,X61,X62)
| ~ member(X63,X61)
| apply(X60,X63,esk15_4(X60,X61,X62,X63)) )
& ( ~ maps(X60,X61,X62)
| ~ member(X63,X61)
| member(esk15_4(X60,X61,X62,X63),X62) ) ),
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])])])])])])]) ).
fof(c_0_5,plain,
! [X40,X41,X42,X43,X44,X45,X46,X47,X49,X50,X51,X52,X53,X54,X55,X58] :
( ( compose_predicate(X50,X51,X52,X53,X54,X55)
| apply(X50,esk12_6(X50,X51,X52,X53,X54,X55),esk13_6(X50,X51,X52,X53,X54,X55))
| apply(X51,esk14_6(X50,X51,X52,X53,X54,X55),esk13_6(X50,X51,X52,X53,X54,X55)) )
& ( compose_predicate(X50,X51,X52,X53,X54,X55)
| apply(X50,esk12_6(X50,X51,X52,X53,X54,X55),esk13_6(X50,X51,X52,X53,X54,X55))
| apply(X52,esk12_6(X50,X51,X52,X53,X54,X55),esk14_6(X50,X51,X52,X53,X54,X55)) )
& ( compose_predicate(X50,X51,X52,X53,X54,X55)
| apply(X50,esk12_6(X50,X51,X52,X53,X54,X55),esk13_6(X50,X51,X52,X53,X54,X55))
| member(esk14_6(X50,X51,X52,X53,X54,X55),X54) )
& ( compose_predicate(X50,X51,X52,X53,X54,X55)
| ~ apply(X51,X58,esk13_6(X50,X51,X52,X53,X54,X55))
| ~ apply(X52,esk12_6(X50,X51,X52,X53,X54,X55),X58)
| ~ member(X58,X54)
| ~ apply(X50,esk12_6(X50,X51,X52,X53,X54,X55),esk13_6(X50,X51,X52,X53,X54,X55)) )
& ( compose_predicate(X50,X51,X52,X53,X54,X55)
| member(esk13_6(X50,X51,X52,X53,X54,X55),X55) )
& ( compose_predicate(X50,X51,X52,X53,X54,X55)
| member(esk12_6(X50,X51,X52,X53,X54,X55),X53) )
& ( ~ compose_predicate(X40,X41,X42,X43,X44,X45)
| ~ member(X47,X45)
| ~ member(X46,X43)
| apply(X40,X46,X47)
| ~ apply(X41,X49,X47)
| ~ apply(X42,X46,X49)
| ~ member(X49,X44) )
& ( ~ compose_predicate(X40,X41,X42,X43,X44,X45)
| ~ member(X47,X45)
| ~ member(X46,X43)
| ~ apply(X40,X46,X47)
| apply(X41,esk11_8(X40,X41,X42,X43,X44,X45,X46,X47),X47) )
& ( ~ compose_predicate(X40,X41,X42,X43,X44,X45)
| ~ member(X47,X45)
| ~ member(X46,X43)
| ~ apply(X40,X46,X47)
| apply(X42,X46,esk11_8(X40,X41,X42,X43,X44,X45,X46,X47)) )
& ( ~ compose_predicate(X40,X41,X42,X43,X44,X45)
| ~ member(X47,X45)
| ~ member(X46,X43)
| ~ apply(X40,X46,X47)
| member(esk11_8(X40,X41,X42,X43,X44,X45,X46,X47),X44) ) ),
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)],[compose_predicate])])])])])])]) ).
cnf(c_0_6,plain,
( ~ maps(X6,X2,X4)
| ~ apply(X6,X1,X5)
| ~ apply(X6,X1,X3)
| ~ member(X5,X4)
| ~ member(X3,X4)
| ~ member(X1,X2)
| X3 = X5 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ compose_predicate(X3,X4,X1,X5,X6,X7)
| ~ member(X8,X7)
| ~ member(X2,X5)
| ~ apply(X3,X2,X8)
| apply(X1,X2,esk11_8(X3,X4,X1,X5,X6,X7,X2,X8)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ member(X8,X5)
| ~ member(X9,X7)
| ~ member(X8,X10)
| ~ member(X1,X11)
| ~ member(esk11_8(X2,X3,X4,X5,X6,X7,X8,X9),X11)
| ~ maps(X4,X10,X11)
| ~ apply(X2,X8,X9)
| ~ apply(X4,X8,X1)
| ~ compose_predicate(X2,X3,X4,X5,X6,X7)
| X1 = esk11_8(X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,plain,
( ~ compose_predicate(X1,X2,X3,X4,X5,X6)
| ~ member(X8,X6)
| ~ member(X7,X4)
| ~ apply(X1,X7,X8)
| member(esk11_8(X1,X2,X3,X4,X5,X6,X7,X8),X5) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,plain,
( ~ member(X8,X5)
| ~ member(X9,X7)
| ~ member(X8,X10)
| ~ member(X1,X6)
| ~ maps(X4,X10,X6)
| ~ apply(X2,X8,X9)
| ~ apply(X4,X8,X1)
| ~ compose_predicate(X2,X3,X4,X5,X6,X7)
| X1 = esk11_8(X2,X3,X4,X5,X6,X7,X8,X9) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,plain,
( ~ maps(X1,X3,X4)
| ~ member(X2,X3)
| apply(X1,X2,esk15_4(X1,X3,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_12,negated_conjecture,
~ ! [X6,X10,X17,X18,X1,X2,X11] :
( ( compose_predicate(X18,X10,X6,X1,X2,X11)
& compose_predicate(X17,X10,X6,X1,X2,X11)
& maps(X10,X2,X11)
& maps(X6,X1,X2) )
=> equal_maps(X17,X18,X1,X11) ),
inference(assume_negation,[status(cth)],[thII01a]) ).
cnf(c_0_13,plain,
( ~ member(X4,X2)
| ~ member(X4,X7)
| ~ member(X10,X9)
| ~ member(X4,X11)
| ~ member(esk15_4(X1,X2,X3,X4),X8)
| ~ maps(X1,X2,X3)
| ~ maps(X1,X11,X8)
| ~ apply(X5,X4,X10)
| ~ compose_predicate(X5,X6,X1,X7,X8,X9)
| esk15_4(X1,X2,X3,X4) = esk11_8(X5,X6,X1,X7,X8,X9,X4,X10) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ maps(X1,X2,X3)
| ~ member(X4,X2)
| member(esk15_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_15,negated_conjecture,
( ~ equal_maps(esk3_0,esk4_0,esk5_0,esk7_0)
& compose_predicate(esk4_0,esk2_0,esk1_0,esk5_0,esk6_0,esk7_0)
& compose_predicate(esk3_0,esk2_0,esk1_0,esk5_0,esk6_0,esk7_0)
& maps(esk2_0,esk6_0,esk7_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_12])])])]) ).
cnf(c_0_16,plain,
( ~ member(X4,X2)
| ~ member(X4,X7)
| ~ member(X9,X8)
| ~ member(X4,X10)
| ~ maps(X1,X2,X3)
| ~ maps(X1,X10,X3)
| ~ apply(X5,X4,X9)
| ~ compose_predicate(X5,X6,X1,X7,X3,X8)
| esk15_4(X1,X2,X3,X4) = esk11_8(X5,X6,X1,X7,X3,X8,X4,X9) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
maps(esk1_0,esk5_0,esk6_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_18,plain,
( ~ compose_predicate(X2,X1,X3,X4,X5,X6)
| ~ member(X8,X6)
| ~ member(X7,X4)
| ~ apply(X2,X7,X8)
| apply(X1,esk11_8(X2,X1,X3,X4,X5,X6,X7,X8),X8) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X2,X1)
| ~ member(X2,X5)
| ~ member(X7,X6)
| ~ member(X2,esk5_0)
| ~ maps(esk1_0,X1,esk6_0)
| ~ apply(X3,X2,X7)
| ~ compose_predicate(X3,X4,esk1_0,X5,esk6_0,X6)
| esk15_4(esk1_0,X1,esk6_0,X2) = esk11_8(X3,X4,esk1_0,X5,esk6_0,X6,X2,X7) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(X3,X2)
| ~ member(X3,X6)
| ~ member(X4,X7)
| ~ member(X3,esk5_0)
| ~ maps(esk1_0,X2,esk6_0)
| ~ apply(X5,X3,X4)
| ~ compose_predicate(X5,X1,esk1_0,X6,esk6_0,X7)
| apply(X1,esk15_4(esk1_0,X2,esk6_0,X3),X4) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_21,negated_conjecture,
compose_predicate(esk4_0,esk2_0,esk1_0,esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( ~ member(X2,X1)
| ~ member(X3,esk7_0)
| ~ member(X2,esk5_0)
| ~ maps(esk1_0,X1,esk6_0)
| ~ apply(esk4_0,X2,X3)
| apply(esk2_0,esk15_4(esk1_0,X1,esk6_0,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_23,plain,
( ~ compose_predicate(X7,X5,X3,X8,X2,X9)
| ~ member(X6,X9)
| ~ member(X4,X8)
| ~ apply(X5,X1,X6)
| ~ apply(X3,X4,X1)
| ~ member(X1,X2)
| apply(X7,X4,X6) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_24,negated_conjecture,
( ~ member(X4,X3)
| ~ member(X1,X6)
| ~ member(X2,X6)
| ~ member(X2,esk7_0)
| ~ member(X4,esk5_0)
| ~ member(esk15_4(esk1_0,X3,esk6_0,X4),X5)
| ~ maps(esk2_0,X5,X6)
| ~ maps(esk1_0,X3,esk6_0)
| ~ apply(esk4_0,X4,X2)
| ~ apply(esk2_0,esk15_4(esk1_0,X3,esk6_0,X4),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_6,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( ~ member(X3,esk6_0)
| ~ member(X1,esk5_0)
| ~ member(X2,esk7_0)
| ~ apply(esk1_0,X1,X3)
| ~ apply(esk2_0,X3,X2)
| apply(esk4_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(X3,X4)
| ~ member(X1,X6)
| ~ member(X2,X6)
| ~ member(X1,esk7_0)
| ~ member(X2,esk7_0)
| ~ member(X3,esk5_0)
| ~ member(esk15_4(esk1_0,X4,esk6_0,X3),X5)
| ~ maps(esk2_0,X5,X6)
| ~ maps(esk1_0,X4,esk6_0)
| ~ apply(esk4_0,X3,X1)
| ~ apply(esk4_0,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_24,c_0_22]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X8,X5)
| ~ member(X2,X7)
| ~ member(X1,esk5_0)
| ~ member(X2,esk7_0)
| ~ member(esk11_8(X3,esk2_0,X4,X5,X6,X7,X8,X2),esk6_0)
| ~ apply(X3,X8,X2)
| ~ apply(esk1_0,X1,esk11_8(X3,esk2_0,X4,X5,X6,X7,X8,X2))
| ~ compose_predicate(X3,esk2_0,X4,X5,X6,X7)
| apply(esk4_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( ~ member(X3,X4)
| ~ member(X1,X5)
| ~ member(X2,X5)
| ~ member(X1,esk7_0)
| ~ member(X2,esk7_0)
| ~ member(X3,esk5_0)
| ~ maps(esk2_0,esk6_0,X5)
| ~ maps(esk1_0,X4,esk6_0)
| ~ apply(esk4_0,X3,X1)
| ~ apply(esk4_0,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(X1,X4)
| ~ member(X2,X6)
| ~ member(X1,esk5_0)
| ~ member(X2,esk7_0)
| ~ member(esk11_8(X3,esk2_0,esk1_0,X4,X5,X6,X1,X2),esk6_0)
| ~ apply(X3,X1,X2)
| ~ compose_predicate(X3,esk2_0,esk1_0,X4,X5,X6)
| apply(esk4_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_7]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(X1,X4)
| ~ member(X2,X4)
| ~ member(X1,esk7_0)
| ~ member(X2,esk7_0)
| ~ member(X3,esk5_0)
| ~ maps(esk2_0,esk6_0,X4)
| ~ apply(esk4_0,X3,X1)
| ~ apply(esk4_0,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_31,negated_conjecture,
maps(esk2_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,negated_conjecture,
( ~ member(X1,X4)
| ~ member(X2,X5)
| ~ member(X1,esk5_0)
| ~ member(X2,esk7_0)
| ~ apply(X3,X1,X2)
| ~ compose_predicate(X3,esk2_0,esk1_0,X4,esk6_0,X5)
| apply(esk4_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_29,c_0_9]) ).
cnf(c_0_33,negated_conjecture,
compose_predicate(esk3_0,esk2_0,esk1_0,esk5_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(X1,esk7_0)
| ~ member(X2,esk7_0)
| ~ member(X3,esk5_0)
| ~ apply(esk4_0,X3,X1)
| ~ apply(esk4_0,X3,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X2,esk7_0)
| ~ apply(esk3_0,X1,X2)
| apply(esk4_0,X1,X2) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
fof(c_0_36,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33,X34,X35,X36] :
( ( equal_maps(X33,X34,X35,X36)
| esk9_4(X33,X34,X35,X36) != esk10_4(X33,X34,X35,X36) )
& ( equal_maps(X33,X34,X35,X36)
| apply(X34,esk8_4(X33,X34,X35,X36),esk10_4(X33,X34,X35,X36)) )
& ( equal_maps(X33,X34,X35,X36)
| apply(X33,esk8_4(X33,X34,X35,X36),esk9_4(X33,X34,X35,X36)) )
& ( equal_maps(X33,X34,X35,X36)
| member(esk10_4(X33,X34,X35,X36),X36) )
& ( equal_maps(X33,X34,X35,X36)
| member(esk9_4(X33,X34,X35,X36),X36) )
& ( equal_maps(X33,X34,X35,X36)
| member(esk8_4(X33,X34,X35,X36),X35) )
& ( X31 = X32
| ~ apply(X27,X30,X32)
| ~ apply(X26,X30,X31)
| ~ member(X32,X29)
| ~ member(X31,X29)
| ~ member(X30,X28)
| ~ equal_maps(X26,X27,X28,X29) ) ),
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])])])])])])]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(X1,esk7_0)
| ~ member(X2,esk7_0)
| ~ member(X3,esk5_0)
| ~ apply(esk3_0,X3,X2)
| ~ apply(esk4_0,X3,X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_38,plain,
( equal_maps(X2,X1,X3,X4)
| apply(X1,esk8_4(X2,X1,X3,X4),esk10_4(X2,X1,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(X4,esk7_0)
| ~ member(esk10_4(X1,esk4_0,X2,X3),esk7_0)
| ~ member(esk8_4(X1,esk4_0,X2,X3),esk5_0)
| ~ apply(esk3_0,esk8_4(X1,esk4_0,X2,X3),X4)
| equal_maps(X1,esk4_0,X2,X3)
| esk10_4(X1,esk4_0,X2,X3) = X4 ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
( equal_maps(X1,X2,X3,X4)
| apply(X1,esk8_4(X1,X2,X3,X4),esk9_4(X1,X2,X3,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_41,plain,
( esk9_4(X1,X2,X3,X4) != esk10_4(X1,X2,X3,X4)
| equal_maps(X1,X2,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ~ member(esk9_4(esk3_0,esk4_0,X1,X2),esk7_0)
| ~ member(esk10_4(esk3_0,esk4_0,X1,X2),esk7_0)
| ~ member(esk8_4(esk3_0,esk4_0,X1,X2),esk5_0)
| equal_maps(esk3_0,esk4_0,X1,X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_43,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk10_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_44,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk9_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(esk8_4(esk3_0,esk4_0,X1,esk7_0),esk5_0)
| equal_maps(esk3_0,esk4_0,X1,esk7_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_46,plain,
( equal_maps(X1,X2,X3,X4)
| member(esk8_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_47,negated_conjecture,
~ equal_maps(esk3_0,esk4_0,esk5_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SET708+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n008.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 05:33:54 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.52 Running first-order theorem proving
% 0.18/0.52 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
% 0.27/0.81 % Version: 3.5.1
% 0.27/0.81 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.81 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.81 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.81 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.81 % Starting sh5l with 300s (1) cores
% 0.27/0.81 % new_bool_3 with pid 242996 completed with status 0
% 0.27/0.81 % Result found by new_bool_3
% 0.27/0.81 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.81 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.81 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.81 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.27/0.81 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.27/0.81 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.81 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.81 % SubtermCWHack with pid 242999 completed with status 0
% 0.27/0.81 % Result found by SubtermCWHack
% 0.27/0.81 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.27/0.81 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.81 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.27/0.81 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.81 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.81 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.81 % Search class: FGUSF-FFMS33-SFFFFFNN
% 0.27/0.81 % partial match(1): FGUSS-FFMS33-SFFFFFNN
% 0.27/0.81 % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.81 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.81 % Preprocessing time : 0.003 s
% 0.27/0.81
% 0.27/0.81 % Proof found!
% 0.27/0.81 % SZS status Theorem
% 0.27/0.81 % SZS output start CNFRefutation
% See solution above
% 0.27/0.81 % Parsed axioms : 29
% 0.27/0.81 % Removed by relevancy pruning/SinE : 25
% 0.27/0.81 % Initial clauses : 37
% 0.27/0.81 % Removed in clause preprocessing : 0
% 0.27/0.81 % Initial clauses in saturation : 37
% 0.27/0.81 % Processed clauses : 542
% 0.27/0.81 % ...of these trivial : 0
% 0.27/0.81 % ...subsumed : 194
% 0.27/0.81 % ...remaining for further processing : 348
% 0.27/0.81 % Other redundant clauses eliminated : 0
% 0.27/0.81 % Clauses deleted for lack of memory : 0
% 0.27/0.81 % Backward-subsumed : 18
% 0.27/0.81 % Backward-rewritten : 0
% 0.27/0.81 % Generated clauses : 1713
% 0.27/0.81 % ...of the previous two non-redundant : 1680
% 0.27/0.81 % ...aggressively subsumed : 0
% 0.27/0.81 % Contextual simplify-reflections : 14
% 0.27/0.81 % Paramodulations : 1713
% 0.27/0.81 % Factorizations : 0
% 0.27/0.81 % NegExts : 0
% 0.27/0.81 % Equation resolutions : 0
% 0.27/0.81 % Disequality decompositions : 0
% 0.27/0.81 % Total rewrite steps : 0
% 0.27/0.81 % ...of those cached : 0
% 0.27/0.81 % Propositional unsat checks : 0
% 0.27/0.81 % Propositional check models : 0
% 0.27/0.81 % Propositional check unsatisfiable : 0
% 0.27/0.81 % Propositional clauses : 0
% 0.27/0.81 % Propositional clauses after purity: 0
% 0.27/0.81 % Propositional unsat core size : 0
% 0.27/0.81 % Propositional preprocessing time : 0.000
% 0.27/0.81 % Propositional encoding time : 0.000
% 0.27/0.81 % Propositional solver time : 0.000
% 0.27/0.81 % Success case prop preproc time : 0.000
% 0.27/0.81 % Success case prop encoding time : 0.000
% 0.27/0.81 % Success case prop solver time : 0.000
% 0.27/0.81 % Current number of processed clauses : 330
% 0.27/0.81 % Positive orientable unit clauses : 6
% 0.27/0.81 % Positive unorientable unit clauses: 0
% 0.27/0.81 % Negative unit clauses : 1
% 0.27/0.81 % Non-unit-clauses : 323
% 0.27/0.81 % Current number of unprocessed clauses: 1175
% 0.27/0.81 % ...number of literals in the above : 12187
% 0.27/0.81 % Current number of archived formulas : 0
% 0.27/0.81 % Current number of archived clauses : 18
% 0.27/0.81 % Clause-clause subsumption calls (NU) : 29730
% 0.27/0.81 % Rec. Clause-clause subsumption calls : 1747
% 0.27/0.81 % Non-unit clause-clause subsumptions : 226
% 0.27/0.81 % Unit Clause-clause subsumption calls : 98
% 0.27/0.81 % Rewrite failures with RHS unbound : 0
% 0.27/0.81 % BW rewrite match attempts : 4
% 0.27/0.81 % BW rewrite match successes : 0
% 0.27/0.81 % Condensation attempts : 0
% 0.27/0.81 % Condensation successes : 0
% 0.27/0.81 % Termbank termtop insertions : 68853
% 0.27/0.81 % Search garbage collected termcells : 1137
% 0.27/0.81
% 0.27/0.81 % -------------------------------------------------
% 0.27/0.81 % User time : 0.204 s
% 0.27/0.81 % System time : 0.011 s
% 0.27/0.81 % Total time : 0.215 s
% 0.27/0.81 % Maximum resident set size: 3692 pages
% 0.27/0.81
% 0.27/0.81 % -------------------------------------------------
% 0.27/0.81 % User time : 0.210 s
% 0.27/0.81 % System time : 0.015 s
% 0.27/0.81 % Total time : 0.225 s
% 0.27/0.81 % Maximum resident set size: 4864 pages
% 0.27/0.81 % E exiting
%------------------------------------------------------------------------------