%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU265+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:24:30 PM UTC 2026
% Result : Theorem 0.21s 0.61s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 17
% Syntax : Number of formulae : 86 ( 16 unt; 0 def)
% Number of atoms : 227 ( 54 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 247 ( 106 ~; 103 |; 17 &)
% ( 7 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 18 usr; 5 con; 0-3 aty)
% Number of variables : 172 ( 14 sgn 98 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t22_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X4,X5),X3)
& in(X4,X2) )
<=> relation_dom_as_subset(X2,X1,X3) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t22_relset_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(cc1_relset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(cartesian_product2(X1,X2)))
=> relation(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc1_relset_1) ).
fof(dt_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> element(X3,powerset(cartesian_product2(X1,X2))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m2_relset_1) ).
fof(t20_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X2,relation_rng(X3))
& in(X1,relation_dom(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(dt_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> element(relation_dom_as_subset(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k4_relset_1) ).
fof(redefinition_k4_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_dom_as_subset(X1,X2,X3) = relation_dom(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k4_relset_1) ).
fof(redefinition_m2_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
<=> relation_of2(X3,X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_m2_relset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( empty(X3)
& element(X2,powerset(X3))
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_tarski) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X4,X5),X3)
& in(X4,X2) )
<=> relation_dom_as_subset(X2,X1,X3) = X2 ) ),
inference(assume_negation,[status(cth)],[t22_relset_1]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X2,X1)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X4,X5),X3)
& in(X4,X2) )
<=> relation_dom_as_subset(X2,X1,X3) = X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
fof(c_0_19,negated_conjecture,
! [X59,X60] :
( ( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| in(ordered_pair(X60,esk13_1(X60)),esk11_0)
| ~ in(X60,esk10_0) )
& ( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| ~ in(ordered_pair(esk12_0,X59),esk11_0) )
& ( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| in(esk12_0,esk10_0) )
& relation_of2_as_subset(esk11_0,esk10_0,esk9_0) ),
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)],[c_0_18])])])])])]) ).
fof(c_0_20,plain,
! [X23,X24] : ordered_pair(X23,X24) = unordered_pair(unordered_pair(X23,X24),singleton(X23)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_21,plain,
! [X13,X14,X15,X17,X18,X19,X21] :
( ( ~ relation(X13)
| X19 = relation_dom(X13)
| in(ordered_pair(esk2_2(X13,X19),esk3_2(X13,X19)),X13)
| in(esk2_2(X13,X19),X19) )
& ( ~ relation(X13)
| X19 = relation_dom(X13)
| ~ in(ordered_pair(esk2_2(X13,X19),X21),X13)
| ~ in(esk2_2(X13,X19),X19) )
& ( ~ relation(X13)
| X14 != relation_dom(X13)
| in(X17,X14)
| ~ in(ordered_pair(X17,X18),X13) )
& ( ~ relation(X13)
| X14 != relation_dom(X13)
| in(ordered_pair(X15,esk1_3(X13,X14,X15)),X13)
| ~ in(X15,X14) ) ),
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)],[d4_relat_1])])])])])])]) ).
fof(c_0_22,plain,
! [X8,X9,X10] :
( relation(X10)
| ~ element(X10,powerset(cartesian_product2(X8,X9))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
fof(c_0_23,plain,
! [X28,X29,X30] :
( element(X30,powerset(cartesian_product2(X28,X29)))
| ~ relation_of2_as_subset(X30,X28,X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
fof(c_0_24,plain,
! [X52,X53,X54] :
( ( ~ relation(X54)
| ~ in(ordered_pair(X52,X53),X54)
| in(X53,relation_rng(X54)) )
& ( ~ relation(X54)
| ~ in(ordered_pair(X52,X53),X54)
| in(X52,relation_dom(X54)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t20_relat_1])])])]) ).
cnf(c_0_25,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| ~ in(ordered_pair(esk12_0,X1),esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_27,plain,
! [X11,X12] : unordered_pair(X11,X12) = unordered_pair(X12,X11),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_28,plain,
( ~ relation(X3)
| X2 != relation_dom(X3)
| ~ in(X1,X2)
| in(ordered_pair(X1,esk1_3(X3,X2,X1)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_30,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X25,X26,X27] :
( element(relation_dom_as_subset(X25,X26,X27),powerset(X25))
| ~ relation_of2(X27,X25,X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k4_relset_1])])]) ).
fof(c_0_32,plain,
! [X43,X44,X45] :
( relation_dom_as_subset(X43,X44,X45) = relation_dom(X45)
| ~ relation_of2(X45,X43,X44) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k4_relset_1])])]) ).
fof(c_0_33,plain,
! [X46,X47,X48] :
( ( relation_of2_as_subset(X48,X46,X47)
| ~ relation_of2(X48,X46,X47) )
& ( relation_of2(X48,X46,X47)
| ~ relation_of2_as_subset(X48,X46,X47) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_34,plain,
( ~ relation(X2)
| ~ in(ordered_pair(X1,X3),X2)
| in(X1,relation_dom(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_35,negated_conjecture,
( ~ in(X1,esk10_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0
| in(ordered_pair(X1,esk13_1(X1)),esk11_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_36,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk12_0,X1),singleton(esk12_0)),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_37,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_38,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(unordered_pair(unordered_pair(X1,esk1_3(X3,X2,X1)),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_28,c_0_26]) ).
cnf(c_0_39,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation(X1) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_40,negated_conjecture,
relation_of2_as_subset(esk11_0,esk10_0,esk9_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_41,plain,
( ~ relation_of2(X1,X2,X3)
| element(relation_dom_as_subset(X2,X3,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( ~ relation_of2(X1,X2,X3)
| relation_dom_as_subset(X2,X3,X1) = relation_dom(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_44,plain,
( ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2)
| ~ relation(X2)
| in(X1,relation_dom(X2)) ),
inference(rw,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(X1,esk10_0)
| in(unordered_pair(unordered_pair(X1,esk13_1(X1)),singleton(X1)),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(rw,[status(thm)],[c_0_35,c_0_26]) ).
cnf(c_0_46,negated_conjecture,
( ~ in(unordered_pair(singleton(esk12_0),unordered_pair(esk12_0,X1)),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 ),
inference(rw,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_47,plain,
( ~ in(X1,X3)
| ~ relation(X2)
| X3 != relation_dom(X2)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk1_3(X2,X3,X1))),X2) ),
inference(rw,[status(thm)],[c_0_38,c_0_37]) ).
cnf(c_0_48,negated_conjecture,
relation(esk11_0),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
fof(c_0_49,plain,
! [X72,X73,X74] :
( ~ empty(X74)
| ~ element(X73,powerset(X74))
| ~ in(X72,X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
cnf(c_0_50,plain,
( ~ relation_of2(X1,X2,X3)
| element(relation_dom(X1),powerset(X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_51,negated_conjecture,
relation_of2(esk11_0,esk10_0,esk9_0),
inference(spm,[status(thm)],[c_0_43,c_0_40]) ).
fof(c_0_52,plain,
! [X76,X77] :
( ~ empty(X77)
| ~ in(X76,X77) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_53,plain,
! [X64,X65] :
( ( X64 = X65
| in(esk14_2(X64,X65),X65)
| in(esk14_2(X64,X65),X64) )
& ( X64 = X65
| ~ in(esk14_2(X64,X65),X65)
| ~ in(esk14_2(X64,X65),X64) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_tarski])])])])]) ).
cnf(c_0_54,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2)
| ~ relation(X2)
| in(X1,relation_dom(X2)) ),
inference(rw,[status(thm)],[c_0_44,c_0_37]) ).
cnf(c_0_55,negated_conjecture,
( ~ in(X1,esk10_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk13_1(X1))),esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(rw,[status(thm)],[c_0_45,c_0_37]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(esk12_0,X1)
| X1 != relation_dom(esk11_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_48])]) ).
cnf(c_0_57,negated_conjecture,
( relation_dom_as_subset(esk10_0,esk9_0,esk11_0) != esk10_0
| in(esk12_0,esk10_0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_58,plain,
( ~ empty(X3)
| ~ element(X2,powerset(X3))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_59,negated_conjecture,
element(relation_dom(esk11_0),powerset(esk10_0)),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_60,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_61,plain,
( X1 = X2
| in(esk14_2(X1,X2),X2)
| in(esk14_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_62,negated_conjecture,
( ~ in(X1,esk10_0)
| in(X1,relation_dom(esk11_0))
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_48])]) ).
cnf(c_0_63,negated_conjecture,
( ~ in(esk12_0,X1)
| X1 != relation_dom(esk11_0)
| relation_dom(esk11_0) != esk10_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_42]),c_0_51])]) ).
cnf(c_0_64,negated_conjecture,
( relation_dom(esk11_0) != esk10_0
| in(esk12_0,esk10_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_42]),c_0_51])]) ).
cnf(c_0_65,negated_conjecture,
( ~ in(X1,relation_dom(esk11_0))
| ~ empty(esk10_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
cnf(c_0_66,plain,
( ~ empty(X2)
| in(esk14_2(X1,X2),X1)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
fof(c_0_67,plain,
! [X69,X70,X71] :
( element(X69,X71)
| ~ element(X70,powerset(X71))
| ~ in(X69,X70) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_68,negated_conjecture,
( in(esk14_2(esk10_0,X1),X1)
| in(esk14_2(esk10_0,X1),relation_dom(esk11_0))
| esk10_0 = X1
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(spm,[status(thm)],[c_0_62,c_0_61]) ).
cnf(c_0_69,negated_conjecture,
relation_dom(esk11_0) != esk10_0,
inference(spm,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
( ~ empty(X1)
| ~ empty(esk10_0)
| relation_dom(esk11_0) = X1 ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_71,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
fof(c_0_72,plain,
! [X75] :
( X75 = empty_set
| ~ empty(X75) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_73,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_74,plain,
( ~ in(esk14_2(X1,X2),X2)
| ~ in(esk14_2(X1,X2),X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_75,negated_conjecture,
( in(esk14_2(esk10_0,relation_dom(esk11_0)),relation_dom(esk11_0))
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_68]),c_0_69]) ).
fof(c_0_76,plain,
! [X62,X63] :
( in(X62,X63)
| empty(X63)
| ~ element(X62,X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_77,negated_conjecture,
( ~ empty(esk10_0)
| relation_dom(esk11_0) = empty_set ),
inference(spm,[status(thm)],[c_0_70,c_0_71]) ).
cnf(c_0_78,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_72]) ).
cnf(c_0_79,negated_conjecture,
( ~ in(X1,relation_dom(esk11_0))
| element(X1,esk10_0) ),
inference(spm,[status(thm)],[c_0_73,c_0_59]) ).
cnf(c_0_80,negated_conjecture,
( ~ in(esk14_2(esk10_0,relation_dom(esk11_0)),esk10_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_69]) ).
cnf(c_0_81,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_76]) ).
cnf(c_0_82,negated_conjecture,
~ empty(esk10_0),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_77]),c_0_78]) ).
cnf(c_0_83,negated_conjecture,
( element(esk14_2(esk10_0,relation_dom(esk11_0)),esk10_0)
| relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0 ),
inference(spm,[status(thm)],[c_0_79,c_0_75]) ).
cnf(c_0_84,negated_conjecture,
relation_dom_as_subset(esk10_0,esk9_0,esk11_0) = esk10_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_83]) ).
cnf(c_0_85,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_84]),c_0_51])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU265+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n026.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 06:07:51 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 Running first-order theorem proving
% 0.21/0.51 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.21/0.61 % Version: 3.5.1
% 0.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.21/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.21/0.61 % Starting sh5l with 300s (1) cores
% 0.21/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1529790 completed with status 0
% 0.21/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.61 % No SInE strategy applied
% 0.21/0.61 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.21/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.61 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 0.21/0.61 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AA with 136s (1) cores
% 0.21/0.61 % G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with pid 1529797 completed with status 0
% 0.21/0.61 % Result found by G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y
% 0.21/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.21/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.21/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.61 % No SInE strategy applied
% 0.21/0.61 % Search class: FGHSM-FFMS31-MFFFFFNN
% 0.21/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.21/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.21/0.61 % Starting G-E--_107_C37_SOS_F1_PI_AE_Q4_CS_SP_PS_S0Y with 380s (1) cores
% 0.21/0.61 % Preprocessing time : 0.003 s
% 0.21/0.61 % Presaturation interreduction done
% 0.21/0.61
% 0.21/0.61 % Proof found!
% 0.21/0.61 % SZS status Theorem
% 0.21/0.61 % SZS output start CNFRefutation
% See solution above
% 0.21/0.61 % Parsed axioms : 38
% 0.21/0.61 % Removed by relevancy pruning/SinE : 0
% 0.21/0.61 % Initial clauses : 48
% 0.21/0.61 % Removed in clause preprocessing : 11
% 0.21/0.61 % Initial clauses in saturation : 37
% 0.21/0.61 % Processed clauses : 508
% 0.21/0.61 % ...of these trivial : 4
% 0.21/0.61 % ...subsumed : 181
% 0.21/0.61 % ...remaining for further processing : 323
% 0.21/0.61 % Other redundant clauses eliminated : 0
% 0.21/0.61 % Clauses deleted for lack of memory : 0
% 0.21/0.61 % Backward-subsumed : 65
% 0.21/0.61 % Backward-rewritten : 42
% 0.21/0.61 % Generated clauses : 1267
% 0.21/0.61 % ...of the previous two non-redundant : 1219
% 0.21/0.61 % ...aggressively subsumed : 0
% 0.21/0.61 % Contextual simplify-reflections : 3
% 0.21/0.61 % Paramodulations : 1252
% 0.21/0.61 % Factorizations : 6
% 0.21/0.61 % NegExts : 0
% 0.21/0.61 % Equation resolutions : 6
% 0.21/0.61 % Disequality decompositions : 0
% 0.21/0.61 % Total rewrite steps : 227
% 0.21/0.61 % ...of those cached : 192
% 0.21/0.61 % Propositional unsat checks : 0
% 0.21/0.61 % Propositional check models : 0
% 0.21/0.61 % Propositional check unsatisfiable : 0
% 0.21/0.61 % Propositional clauses : 0
% 0.21/0.61 % Propositional clauses after purity: 0
% 0.21/0.61 % Propositional unsat core size : 0
% 0.21/0.61 % Propositional preprocessing time : 0.000
% 0.21/0.61 % Propositional encoding time : 0.000
% 0.21/0.61 % Propositional solver time : 0.000
% 0.21/0.61 % Success case prop preproc time : 0.000
% 0.21/0.61 % Success case prop encoding time : 0.000
% 0.21/0.61 % Success case prop solver time : 0.000
% 0.21/0.61 % Current number of processed clauses : 178
% 0.21/0.61 % Positive orientable unit clauses : 26
% 0.21/0.61 % Positive unorientable unit clauses: 1
% 0.21/0.61 % Negative unit clauses : 10
% 0.21/0.61 % Non-unit-clauses : 141
% 0.21/0.61 % Current number of unprocessed clauses: 665
% 0.21/0.61 % ...number of literals in the above : 2779
% 0.21/0.61 % Current number of archived formulas : 0
% 0.21/0.61 % Current number of archived clauses : 145
% 0.21/0.61 % Clause-clause subsumption calls (NU) : 5943
% 0.21/0.61 % Rec. Clause-clause subsumption calls : 4079
% 0.21/0.61 % Non-unit clause-clause subsumptions : 171
% 0.21/0.61 % Unit Clause-clause subsumption calls : 607
% 0.21/0.61 % Rewrite failures with RHS unbound : 0
% 0.21/0.61 % BW rewrite match attempts : 3
% 0.21/0.61 % BW rewrite match successes : 3
% 0.21/0.61 % Condensation attempts : 0
% 0.21/0.61 % Condensation successes : 0
% 0.21/0.61 % Termbank termtop insertions : 18584
% 0.21/0.61 % Search garbage collected termcells : 578
% 0.21/0.61
% 0.21/0.61 % -------------------------------------------------
% 0.21/0.61 % User time : 0.073 s
% 0.21/0.61 % System time : 0.010 s
% 0.21/0.61 % Total time : 0.082 s
% 0.21/0.61 % Maximum resident set size: 3660 pages
% 0.21/0.61
% 0.21/0.61 % -------------------------------------------------
% 0.21/0.61 % User time : 0.335 s
% 0.21/0.61 % System time : 0.035 s
% 0.21/0.61 % Total time : 0.369 s
% 0.21/0.61 % Maximum resident set size: 4608 pages
% 0.21/0.61 % E exiting
%------------------------------------------------------------------------------