%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET714+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 : n018.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:18:01 PM UTC 2026
% Result : Theorem 3.33s 1.12s
% Output : CNFRefutation 3.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 6
% Syntax : Number of formulae : 51 ( 4 unt; 0 def)
% Number of atoms : 290 ( 4 equ)
% Maximal formula atoms : 55 ( 5 avg)
% Number of connectives : 410 ( 171 ~; 188 |; 37 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 30 ( 7 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 3 con; 0-7 aty)
% Number of variables : 249 ( 6 sgn 69 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
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(inverse_function,axiom,
! [X6,X1,X2,X3,X5] :
( ( member(X5,X2)
& member(X3,X1) )
=> ( apply(X6,X3,X5)
<=> apply(inverse_function(X6,X1,X2),X5,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',inverse_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(surjective,axiom,
! [X6,X1,X2] :
( surjective(X6,X1,X2)
<=> ! [X5] :
( member(X5,X2)
=> ? [X4] :
( apply(X6,X4,X5)
& member(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',surjective) ).
fof(thII05,conjecture,
! [X6,X1,X2] :
( ( one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> identity(compose_function(inverse_function(X6,X1,X2),X6,X1,X2,X1),X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thII05) ).
fof(identity,axiom,
! [X6,X1] :
( identity(X6,X1)
<=> ! [X3] :
( member(X3,X1)
=> apply(X6,X3,X3) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+1.ax',identity) ).
fof(c_0_6,plain,
! [X26,X27,X28,X29,X30,X31,X32,X34] :
( ( ~ member(X32,X30)
| ~ member(X31,X28)
| apply(compose_function(X26,X27,X28,X29,X30),X31,X32)
| ~ apply(X26,X34,X32)
| ~ apply(X27,X31,X34)
| ~ member(X34,X29) )
& ( ~ member(X32,X30)
| ~ member(X31,X28)
| ~ apply(compose_function(X26,X27,X28,X29,X30),X31,X32)
| apply(X26,esk5_7(X26,X27,X28,X29,X30,X31,X32),X32) )
& ( ~ member(X32,X30)
| ~ member(X31,X28)
| ~ apply(compose_function(X26,X27,X28,X29,X30),X31,X32)
| apply(X27,X31,esk5_7(X26,X27,X28,X29,X30,X31,X32)) )
& ( ~ member(X32,X30)
| ~ member(X31,X28)
| ~ apply(compose_function(X26,X27,X28,X29,X30),X31,X32)
| member(esk5_7(X26,X27,X28,X29,X30,X31,X32),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(fof_nnf,[status(thm)],[compose_function])])])])])]) ).
fof(c_0_7,plain,
! [X35,X36,X37,X38,X39] :
( ( ~ member(X39,X37)
| ~ member(X38,X36)
| apply(X35,X38,X39)
| ~ apply(inverse_function(X35,X36,X37),X39,X38) )
& ( ~ member(X39,X37)
| ~ member(X38,X36)
| apply(inverse_function(X35,X36,X37),X39,X38)
| ~ apply(X35,X38,X39) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inverse_function])])])]) ).
cnf(c_0_8,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_6]) ).
cnf(c_0_9,plain,
( ~ member(X3,X5)
| ~ member(X2,X4)
| ~ apply(X1,X2,X3)
| apply(inverse_function(X1,X4,X5),X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,plain,
! [X43,X44,X45,X46,X48,X49,X50,X51,X52,X53,X55] :
( ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| esk9_3(X51,X52,X53) != esk10_3(X51,X52,X53) )
& ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| apply(X51,esk8_3(X51,X52,X53),esk10_3(X51,X52,X53)) )
& ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| apply(X51,esk8_3(X51,X52,X53),esk9_3(X51,X52,X53)) )
& ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| member(esk10_3(X51,X52,X53),X53) )
& ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| member(esk9_3(X51,X52,X53),X53) )
& ( maps(X51,X52,X53)
| ~ apply(X51,esk7_3(X51,X52,X53),X55)
| ~ member(X55,X53)
| member(esk8_3(X51,X52,X53),X52) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| esk9_3(X51,X52,X53) != esk10_3(X51,X52,X53) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| apply(X51,esk8_3(X51,X52,X53),esk10_3(X51,X52,X53)) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| apply(X51,esk8_3(X51,X52,X53),esk9_3(X51,X52,X53)) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| member(esk10_3(X51,X52,X53),X53) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| member(esk9_3(X51,X52,X53),X53) )
& ( maps(X51,X52,X53)
| member(esk7_3(X51,X52,X53),X52)
| member(esk8_3(X51,X52,X53),X52) )
& ( ~ maps(X43,X44,X45)
| X49 = X50
| ~ apply(X43,X48,X50)
| ~ apply(X43,X48,X49)
| ~ member(X50,X45)
| ~ member(X49,X45)
| ~ member(X48,X44) )
& ( ~ maps(X43,X44,X45)
| ~ member(X46,X44)
| apply(X43,X46,esk6_4(X43,X44,X45,X46)) )
& ( ~ maps(X43,X44,X45)
| ~ member(X46,X44)
| member(esk6_4(X43,X44,X45,X46),X45) ) ),
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_11,plain,
( ~ member(X9,X2)
| ~ member(X10,X3)
| ~ member(X10,X6)
| ~ member(X8,X5)
| ~ member(X9,X7)
| ~ apply(X1,X9,X10)
| ~ apply(X4,X8,X10)
| apply(compose_function(inverse_function(X1,X2,X3),X4,X5,X6,X7),X8,X9) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
( ~ maps(X1,X3,X4)
| ~ member(X2,X3)
| apply(X1,X2,esk6_4(X1,X3,X4,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( ~ member(X8,X10)
| ~ member(X9,X2)
| ~ member(X8,X5)
| ~ member(X9,X7)
| ~ member(esk6_4(X4,X10,X11,X8),X3)
| ~ member(esk6_4(X4,X10,X11,X8),X6)
| ~ maps(X4,X10,X11)
| ~ apply(X1,X9,esk6_4(X4,X10,X11,X8))
| apply(compose_function(inverse_function(X1,X2,X3),X4,X5,X6,X7),X8,X9) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X59,X60,X61,X62,X64,X65,X66,X68] :
( ( surjective(X64,X65,X66)
| ~ apply(X64,X68,esk12_3(X64,X65,X66))
| ~ member(X68,X65) )
& ( surjective(X64,X65,X66)
| member(esk12_3(X64,X65,X66),X66) )
& ( ~ surjective(X59,X60,X61)
| ~ member(X62,X61)
| apply(X59,esk11_4(X59,X60,X61,X62),X62) )
& ( ~ surjective(X59,X60,X61)
| ~ member(X62,X61)
| member(esk11_4(X59,X60,X61,X62),X60) ) ),
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)],[surjective])])])])])])]) ).
cnf(c_0_15,plain,
( ~ member(X7,X8)
| ~ member(X7,X2)
| ~ member(X7,X4)
| ~ member(X7,X6)
| ~ member(esk6_4(X1,X8,X9,X7),X3)
| ~ member(esk6_4(X1,X8,X9,X7),X5)
| ~ maps(X1,X8,X9)
| apply(compose_function(inverse_function(X1,X2,X3),X1,X4,X5,X6),X7,X7) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_16,plain,
( ~ maps(X1,X2,X3)
| ~ member(X4,X2)
| member(esk6_4(X1,X2,X3,X4),X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_17,negated_conjecture,
~ ! [X6,X1,X2] :
( ( one_to_one(X6,X1,X2)
& maps(X6,X1,X2) )
=> identity(compose_function(inverse_function(X6,X1,X2),X6,X1,X2,X1),X1) ),
inference(assume_negation,[status(cth)],[thII05]) ).
cnf(c_0_18,plain,
( ~ apply(X3,X1,esk12_3(X3,X2,X4))
| ~ member(X1,X2)
| surjective(X3,X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,plain,
( ~ member(X7,X5)
| ~ member(X6,X3)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| apply(X1,esk5_7(X1,X2,X3,X4,X5,X6,X7),X7) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_20,plain,
( ~ member(X7,X8)
| ~ member(X7,X2)
| ~ member(X7,X4)
| ~ member(X7,X6)
| ~ member(esk6_4(X1,X8,X5,X7),X3)
| ~ maps(X1,X8,X5)
| apply(compose_function(inverse_function(X1,X2,X3),X1,X4,X5,X6),X7,X7) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
fof(c_0_21,negated_conjecture,
( ~ identity(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,esk2_0,esk3_0,esk2_0),esk2_0)
& one_to_one(esk1_0,esk2_0,esk3_0)
& maps(esk1_0,esk2_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])])]) ).
cnf(c_0_22,plain,
( ~ member(X8,X5)
| ~ member(esk12_3(X1,X2,X3),X7)
| ~ member(esk5_7(X1,X4,X5,X6,X7,X8,esk12_3(X1,X2,X3)),X2)
| ~ apply(compose_function(X1,X4,X5,X6,X7),X8,esk12_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ member(X7,X5)
| ~ member(X6,X3)
| ~ apply(compose_function(X1,X2,X3,X4,X5),X6,X7)
| member(esk5_7(X1,X2,X3,X4,X5,X6,X7),X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,plain,
( ~ member(X6,X7)
| ~ member(X6,X2)
| ~ member(X6,X4)
| ~ member(X6,X5)
| ~ maps(X1,X7,X3)
| apply(compose_function(inverse_function(X1,X2,X3),X1,X4,X3,X5),X6,X6) ),
inference(spm,[status(thm)],[c_0_20,c_0_16]) ).
cnf(c_0_25,negated_conjecture,
maps(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,plain,
( ~ member(X7,X5)
| ~ member(esk12_3(X1,X2,X3),X6)
| ~ apply(compose_function(X1,X4,X5,X2,X6),X7,esk12_3(X1,X2,X3))
| surjective(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( ~ member(X4,X1)
| ~ member(X4,X2)
| ~ member(X4,X3)
| ~ member(X4,esk2_0)
| apply(compose_function(inverse_function(esk1_0,X1,esk3_0),esk1_0,X2,esk3_0,X3),X4,X4) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_28,plain,
( ~ member(X4,X3)
| ~ member(X5,X2)
| ~ apply(inverse_function(X1,X2,X3),X4,X5)
| apply(X1,X5,X4) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_29,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| apply(X1,esk11_4(X1,X2,X3,X4),X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_30,negated_conjecture,
( ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,X2),X1)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,X2),X4)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,X2),X3)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,X2),esk2_0)
| surjective(inverse_function(esk1_0,X1,esk3_0),esk3_0,X2) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,plain,
( surjective(X1,X2,X3)
| member(esk12_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
( ~ member(X2,X6)
| ~ member(X2,X3)
| ~ member(esk11_4(inverse_function(X1,X3,X4),X5,X6,X2),X4)
| ~ surjective(inverse_function(X1,X3,X4),X5,X6)
| apply(X1,X2,esk11_4(inverse_function(X1,X3,X4),X5,X6,X2)) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ surjective(X1,X2,X3)
| ~ member(X4,X3)
| member(esk11_4(X1,X2,X3,X4),X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_34,negated_conjecture,
( ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X1)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X3)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X2)
| surjective(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_35,plain,
( ~ member(X7,X9)
| ~ member(X6,X3)
| ~ member(X7,X5)
| ~ member(esk11_4(X1,X8,X9,X7),X4)
| ~ apply(X2,X6,esk11_4(X1,X8,X9,X7))
| ~ surjective(X1,X8,X9)
| apply(compose_function(X1,X2,X3,X4,X5),X6,X7) ),
inference(spm,[status(thm)],[c_0_8,c_0_29]) ).
cnf(c_0_36,plain,
( ~ member(X2,X5)
| ~ member(X2,X3)
| ~ surjective(inverse_function(X1,X3,X4),X4,X5)
| apply(X1,X2,esk11_4(inverse_function(X1,X3,X4),X4,X5,X2)) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,negated_conjecture,
( ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X1)
| ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X2)
| surjective(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_38,plain,
( ~ member(X7,X2)
| ~ member(X7,X8)
| ~ member(X7,X4)
| ~ member(X7,X6)
| ~ member(esk11_4(inverse_function(X1,X2,X3),X3,X8,X7),X5)
| ~ surjective(inverse_function(X1,X2,X3),X3,X8)
| apply(compose_function(inverse_function(X1,X2,X3),X1,X4,X5,X6),X7,X7) ),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(esk12_3(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0),X1)
| surjective(inverse_function(esk1_0,X1,esk3_0),esk3_0,esk2_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_31]) ).
fof(c_0_40,plain,
! [X20,X21,X22,X23,X24] :
( ( identity(X23,X24)
| ~ apply(X23,esk4_2(X23,X24),esk4_2(X23,X24)) )
& ( identity(X23,X24)
| member(esk4_2(X23,X24),X24) )
& ( apply(X20,X22,X22)
| ~ member(X22,X21)
| ~ identity(X20,X21) ) ),
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)],[identity])])])])])])]) ).
cnf(c_0_41,plain,
( ~ member(X6,X2)
| ~ member(X6,X7)
| ~ member(X6,X4)
| ~ member(X6,X5)
| ~ surjective(inverse_function(X1,X2,X3),X3,X7)
| apply(compose_function(inverse_function(X1,X2,X3),X1,X4,X3,X5),X6,X6) ),
inference(spm,[status(thm)],[c_0_38,c_0_33]) ).
cnf(c_0_42,negated_conjecture,
surjective(inverse_function(esk1_0,esk2_0,esk3_0),esk3_0,esk2_0),
inference(spm,[status(thm)],[c_0_39,c_0_31]) ).
cnf(c_0_43,plain,
( ~ apply(X1,esk4_2(X1,X2),esk4_2(X1,X2))
| identity(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_44,negated_conjecture,
( ~ member(X3,X1)
| ~ member(X3,X2)
| ~ member(X3,esk2_0)
| apply(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),X3,X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_45,negated_conjecture,
( ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),X3),X1)
| ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),X3),X2)
| ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),X3),esk2_0)
| identity(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),X3) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( identity(X1,X2)
| member(esk4_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_47,negated_conjecture,
( ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),esk2_0),X1)
| ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),esk2_0),X2)
| identity(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,X2),esk2_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_48,negated_conjecture,
( ~ member(esk4_2(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,esk2_0),esk2_0),X1)
| identity(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,X1,esk3_0,esk2_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_46]) ).
cnf(c_0_49,negated_conjecture,
~ identity(compose_function(inverse_function(esk1_0,esk2_0,esk3_0),esk1_0,esk2_0,esk3_0,esk2_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_46]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET714+4 : TPTP v9.3.1. Bugfixed v2.2.1.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n018.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 05:35:44 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.17/0.52 Running first-order theorem proving
% 0.17/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
% 3.33/1.12 % Version: 3.5.1
% 3.33/1.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/1.12 % Starting new_bool_3 with 300s (1) cores
% 3.33/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.33/1.12 % Starting sh5l with 300s (1) cores
% 3.33/1.12 % new_bool_1 with pid 1069368 completed with status 0
% 3.33/1.12 % Result found by new_bool_1
% 3.33/1.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/1.12 % Starting new_bool_3 with 300s (1) cores
% 3.33/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.33/1.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.33/1.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.33/1.12 % Search class: FGUSF-FFMF33-SFFFFFNN
% 3.33/1.12 % partial match(1): FGUSM-FFMF33-SFFFFFNN
% 3.33/1.12 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.33/1.12 % Starting SubtermCWHack with 28s (1) cores
% 3.33/1.12 % SubtermCWHack with pid 1069371 completed with status 0
% 3.33/1.12 % Result found by SubtermCWHack
% 3.33/1.12 % Preprocessing class: FSLSSMSSSSSNFFN.
% 3.33/1.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.33/1.12 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 3.33/1.12 % Starting new_bool_3 with 300s (1) cores
% 3.33/1.12 % Starting new_bool_1 with 300s (1) cores
% 3.33/1.12 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.33/1.12 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.33/1.12 % Search class: FGUSF-FFMF33-SFFFFFNN
% 3.33/1.12 % partial match(1): FGUSM-FFMF33-SFFFFFNN
% 3.33/1.12 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 3.33/1.12 % Starting SubtermCWHack with 28s (1) cores
% 3.33/1.12 % Preprocessing time : 0.001 s
% 3.33/1.12
% 3.33/1.12 % Proof found!
% 3.33/1.12 % SZS status Theorem
% 3.33/1.12 % SZS output start CNFRefutation
% See solution above
% 3.33/1.12 % Parsed axioms : 29
% 3.33/1.12 % Removed by relevancy pruning/SinE : 21
% 3.33/1.12 % Initial clauses : 41
% 3.33/1.12 % Removed in clause preprocessing : 0
% 3.33/1.12 % Initial clauses in saturation : 41
% 3.33/1.12 % Processed clauses : 856
% 3.33/1.12 % ...of these trivial : 0
% 3.33/1.12 % ...subsumed : 379
% 3.33/1.12 % ...remaining for further processing : 477
% 3.33/1.12 % Other redundant clauses eliminated : 0
% 3.33/1.12 % Clauses deleted for lack of memory : 0
% 3.33/1.12 % Backward-subsumed : 48
% 3.33/1.12 % Backward-rewritten : 0
% 3.33/1.12 % Generated clauses : 4818
% 3.33/1.12 % ...of the previous two non-redundant : 4747
% 3.33/1.12 % ...aggressively subsumed : 0
% 3.33/1.12 % Contextual simplify-reflections : 11
% 3.33/1.12 % Paramodulations : 4818
% 3.33/1.12 % Factorizations : 0
% 3.33/1.12 % NegExts : 0
% 3.33/1.12 % Equation resolutions : 0
% 3.33/1.12 % Disequality decompositions : 0
% 3.33/1.12 % Total rewrite steps : 51
% 3.33/1.12 % ...of those cached : 47
% 3.33/1.12 % Propositional unsat checks : 0
% 3.33/1.12 % Propositional check models : 0
% 3.33/1.12 % Propositional check unsatisfiable : 0
% 3.33/1.12 % Propositional clauses : 0
% 3.33/1.12 % Propositional clauses after purity: 0
% 3.33/1.12 % Propositional unsat core size : 0
% 3.33/1.12 % Propositional preprocessing time : 0.000
% 3.33/1.12 % Propositional encoding time : 0.000
% 3.33/1.12 % Propositional solver time : 0.000
% 3.33/1.12 % Success case prop preproc time : 0.000
% 3.33/1.12 % Success case prop encoding time : 0.000
% 3.33/1.12 % Success case prop solver time : 0.000
% 3.33/1.12 % Current number of processed clauses : 429
% 3.33/1.12 % Positive orientable unit clauses : 5
% 3.33/1.12 % Positive unorientable unit clauses: 0
% 3.33/1.12 % Negative unit clauses : 1
% 3.33/1.12 % Non-unit-clauses : 423
% 3.33/1.12 % Current number of unprocessed clauses: 3915
% 3.33/1.12 % ...number of literals in the above : 44697
% 3.33/1.12 % Current number of archived formulas : 0
% 3.33/1.12 % Current number of archived clauses : 48
% 3.33/1.12 % Clause-clause subsumption calls (NU) : 60550
% 3.33/1.12 % Rec. Clause-clause subsumption calls : 2216
% 3.33/1.12 % Non-unit clause-clause subsumptions : 438
% 3.33/1.12 % Unit Clause-clause subsumption calls : 8
% 3.33/1.12 % Rewrite failures with RHS unbound : 0
% 3.33/1.12 % BW rewrite match attempts : 0
% 3.33/1.12 % BW rewrite match successes : 0
% 3.33/1.12 % Condensation attempts : 0
% 3.33/1.12 % Condensation successes : 0
% 3.33/1.12 % Termbank termtop insertions : 240818
% 3.33/1.12 % Search garbage collected termcells : 1126
% 3.33/1.12
% 3.33/1.12 % -------------------------------------------------
% 3.33/1.12 % User time : 0.386 s
% 3.33/1.12 % System time : 0.019 s
% 3.33/1.12 % Total time : 0.405 s
% 3.33/1.12 % Maximum resident set size: 3692 pages
% 3.33/1.12
% 3.33/1.12 % -------------------------------------------------
% 3.33/1.12 % User time : 0.390 s
% 3.33/1.12 % System time : 0.025 s
% 3.33/1.12 % Total time : 0.415 s
% 3.33/1.12 % Maximum resident set size: 4608 pages
% 3.33/1.12 % E exiting
%------------------------------------------------------------------------------