%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU266+2 : 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 : n011.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:28:47 PM UTC 2026
% Result : Theorem 276.68s 36.45s
% Output : CNFRefutation 276.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 13
% Syntax : Number of formulae : 71 ( 17 unt; 0 def)
% Number of atoms : 190 ( 51 equ)
% Maximal formula atoms : 16 ( 2 avg)
% Number of connectives : 203 ( 84 ~; 81 |; 19 &)
% ( 8 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 6 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 1 prp; 0-3 aty)
% Number of functors : 17 ( 17 usr; 4 con; 0-3 aty)
% Number of variables : 143 ( 7 sgn 85 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t23_relset_1,conjecture,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X5,X4),X3)
& in(X4,X2) )
<=> relation_rng_as_subset(X1,X2,X3) = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t23_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(t69_enumset1,lemma,
! [X1] : unordered_pair(X1,X1) = singleton(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t69_enumset1) ).
fof(t12_relset_1,lemma,
! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( subset(relation_rng(X3),X2)
& subset(relation_dom(X3),X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_relset_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_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(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(redefinition_k5_relset_1,axiom,
! [X1,X2,X3] :
( relation_of2(X3,X1,X2)
=> relation_rng_as_subset(X1,X2,X3) = relation_rng(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k5_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(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,lemma,
! [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(c_0_13,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X5,X4),X3)
& in(X4,X2) )
<=> relation_rng_as_subset(X1,X2,X3) = X2 ) ),
inference(assume_negation,[status(cth)],[t23_relset_1]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3] :
( relation_of2_as_subset(X3,X1,X2)
=> ( ! [X4] :
~ ( ! [X5] : ~ in(ordered_pair(X5,X4),X3)
& in(X4,X2) )
<=> relation_rng_as_subset(X1,X2,X3) = X2 ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X323,X324] : ordered_pair(X323,X324) = unordered_pair(unordered_pair(X323,X324),singleton(X323)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_16,lemma,
! [X881] : unordered_pair(X881,X881) = singleton(X881),
inference(variable_rename,[status(thm)],[t69_enumset1]) ).
fof(c_0_17,lemma,
! [X600,X601,X602] :
( ( ~ relation_of2_as_subset(X602,X600,X601)
| subset(relation_rng(X602),X601) )
& ( ~ relation_of2_as_subset(X602,X600,X601)
| subset(relation_dom(X602),X600) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_relset_1])])])]) ).
fof(c_0_18,negated_conjecture,
! [X708,X709] :
( ( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(ordered_pair(esk115_1(X709),X709),esk113_0)
| ~ in(X709,esk112_0) )
& ( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(ordered_pair(X708,esk114_0),esk113_0) )
& ( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| in(esk114_0,esk112_0) )
& relation_of2_as_subset(esk113_0,esk111_0,esk112_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_14])])])])])]) ).
cnf(c_0_19,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,lemma,
unordered_pair(X1,X1) = singleton(X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_21,plain,
! [X36,X37] :
( ( X36 = X37
| ~ subset(X37,X36)
| ~ subset(X36,X37) )
& ( X36 != X37
| subset(X37,X36) )
& ( X36 != X37
| subset(X36,X37) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
cnf(c_0_22,lemma,
( ~ relation_of2_as_subset(X1,X3,X2)
| subset(relation_rng(X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
relation_of2_as_subset(esk113_0,esk111_0,esk112_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X311,X312,X313,X315,X316,X317,X319] :
( ( ~ relation(X311)
| X317 = relation_rng(X311)
| in(ordered_pair(esk63_2(X311,X317),esk62_2(X311,X317)),X311)
| in(esk62_2(X311,X317),X317) )
& ( ~ relation(X311)
| X317 = relation_rng(X311)
| ~ in(ordered_pair(X319,esk62_2(X311,X317)),X311)
| ~ in(esk62_2(X311,X317),X317) )
& ( ~ relation(X311)
| X312 != relation_rng(X311)
| in(X315,X312)
| ~ in(ordered_pair(X316,X315),X311) )
& ( ~ relation(X311)
| X312 != relation_rng(X311)
| in(ordered_pair(esk61_3(X311,X312,X313),X313),X311)
| ~ in(X313,X312) ) ),
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)],[d5_relat_1])])])])])])]) ).
cnf(c_0_25,negated_conjecture,
( ~ in(X1,esk112_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0
| in(ordered_pair(esk115_1(X1),X1),esk113_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),unordered_pair(X1,X1)),
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
fof(c_0_27,plain,
! [X20,X21] : unordered_pair(X20,X21) = unordered_pair(X21,X20),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_28,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
subset(relation_rng(esk113_0),esk112_0),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_30,plain,
! [X236,X237,X238,X239,X240] :
( ( subset(X239,X240)
| ~ in(esk45_2(X239,X240),X240) )
& ( subset(X239,X240)
| in(esk45_2(X239,X240),X239) )
& ( in(X238,X237)
| ~ in(X238,X236)
| ~ subset(X236,X237) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_31,plain,
! [X553,X554,X555] :
( relation_rng_as_subset(X553,X554,X555) = relation_rng(X555)
| ~ relation_of2(X555,X553,X554) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_relset_1])])]) ).
fof(c_0_32,plain,
! [X563,X564,X565] :
( ( relation_of2_as_subset(X565,X563,X564)
| ~ relation_of2(X565,X563,X564) )
& ( relation_of2(X565,X563,X564)
| ~ relation_of2_as_subset(X565,X563,X564) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_m2_relset_1])])]) ).
cnf(c_0_33,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| ~ in(ordered_pair(X1,esk114_0),esk113_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_34,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk61_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
fof(c_0_35,plain,
! [X14,X15,X16] :
( relation(X16)
| ~ element(X16,powerset(cartesian_product2(X14,X15))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_relset_1])])]) ).
fof(c_0_36,plain,
! [X422,X423,X424] :
( element(X424,powerset(cartesian_product2(X422,X423)))
| ~ relation_of2_as_subset(X424,X422,X423) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m2_relset_1])])]) ).
fof(c_0_37,lemma,
! [X673,X674,X675] :
( ( ~ relation(X675)
| ~ in(ordered_pair(X673,X674),X675)
| in(X674,relation_rng(X675)) )
& ( ~ relation(X675)
| ~ in(ordered_pair(X673,X674),X675)
| in(X673,relation_dom(X675)) ) ),
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_38,negated_conjecture,
( ~ in(X1,esk112_0)
| in(unordered_pair(unordered_pair(esk115_1(X1),X1),unordered_pair(esk115_1(X1),esk115_1(X1))),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_39,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,negated_conjecture,
( ~ subset(esk112_0,relation_rng(esk113_0))
| relation_rng(esk113_0) = esk112_0 ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_41,plain,
( subset(X1,X2)
| in(esk45_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,plain,
( ~ relation_of2(X1,X2,X3)
| relation_rng_as_subset(X2,X3,X1) = relation_rng(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_43,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation_of2(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X1,esk114_0),unordered_pair(X1,X1)),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(rw,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_45,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(unordered_pair(unordered_pair(esk61_3(X3,X2,X1),X1),unordered_pair(esk61_3(X3,X2,X1),esk61_3(X3,X2,X1))),X3) ),
inference(rw,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_46,plain,
( ~ element(X1,powerset(cartesian_product2(X2,X3)))
| relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_47,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| element(X1,powerset(cartesian_product2(X2,X3))) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_48,lemma,
( ~ relation(X2)
| ~ in(ordered_pair(X3,X1),X2)
| in(X1,relation_rng(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_49,negated_conjecture,
( ~ in(X1,esk112_0)
| in(unordered_pair(unordered_pair(X1,esk115_1(X1)),unordered_pair(esk115_1(X1),esk115_1(X1))),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(rw,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_50,negated_conjecture,
( in(esk45_2(esk112_0,relation_rng(esk113_0)),esk112_0)
| relation_rng(esk113_0) = esk112_0 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_51,plain,
( ~ relation_of2_as_subset(X3,X1,X2)
| relation_rng_as_subset(X1,X2,X3) = relation_rng(X3) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_52,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(esk114_0,X1),unordered_pair(X1,X1)),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(spm,[status(thm)],[c_0_44,c_0_39]) ).
cnf(c_0_53,plain,
( ~ in(X1,relation_rng(X2))
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X1,esk61_3(X2,relation_rng(X2),X1)),unordered_pair(esk61_3(X2,relation_rng(X2),X1),esk61_3(X2,relation_rng(X2),X1))),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_39])]) ).
cnf(c_0_54,plain,
( ~ relation_of2_as_subset(X1,X2,X3)
| relation(X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_55,lemma,
( ~ in(unordered_pair(unordered_pair(X3,X1),unordered_pair(X3,X3)),X2)
| ~ relation(X2)
| in(X1,relation_rng(X2)) ),
inference(rw,[status(thm)],[c_0_48,c_0_26]) ).
cnf(c_0_56,negated_conjecture,
( in(unordered_pair(unordered_pair(esk45_2(esk112_0,relation_rng(esk113_0)),esk115_1(esk45_2(esk112_0,relation_rng(esk113_0)))),unordered_pair(esk115_1(esk45_2(esk112_0,relation_rng(esk113_0))),esk115_1(esk45_2(esk112_0,relation_rng(esk113_0))))),esk113_0)
| relation_rng(esk113_0) = esk112_0
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_57,negated_conjecture,
relation_rng(esk113_0) = relation_rng_as_subset(esk111_0,esk112_0,esk113_0),
inference(spm,[status(thm)],[c_0_51,c_0_23]) ).
cnf(c_0_58,negated_conjecture,
( ~ in(esk114_0,relation_rng(esk113_0))
| ~ relation(esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
relation(esk113_0),
inference(spm,[status(thm)],[c_0_54,c_0_23]) ).
cnf(c_0_60,lemma,
( ~ in(unordered_pair(unordered_pair(X1,X3),unordered_pair(X3,X3)),X2)
| ~ relation(X2)
| in(X1,relation_rng(X2)) ),
inference(spm,[status(thm)],[c_0_55,c_0_39]) ).
cnf(c_0_61,negated_conjecture,
( in(unordered_pair(unordered_pair(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)),esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)))),unordered_pair(esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))),esk115_1(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))))),esk113_0)
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_57]),c_0_57]),c_0_57]),c_0_57]),c_0_57])]) ).
cnf(c_0_62,negated_conjecture,
( ~ in(esk114_0,relation_rng(esk113_0))
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]) ).
cnf(c_0_63,plain,
( ~ in(esk45_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_64,negated_conjecture,
( in(esk45_2(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0)),relation_rng_as_subset(esk111_0,esk112_0,esk113_0))
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_57]),c_0_59])]) ).
cnf(c_0_65,negated_conjecture,
( ~ subset(esk112_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_57]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
( ~ in(esk114_0,relation_rng_as_subset(esk111_0,esk112_0,esk113_0))
| relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0 ),
inference(rw,[status(thm)],[c_0_62,c_0_57]) ).
cnf(c_0_67,negated_conjecture,
relation_rng_as_subset(esk111_0,esk112_0,esk113_0) = esk112_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_68,negated_conjecture,
( relation_rng_as_subset(esk111_0,esk112_0,esk113_0) != esk112_0
| in(esk114_0,esk112_0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_69,negated_conjecture,
~ in(esk114_0,esk112_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_68,c_0_67])]),c_0_69]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU266+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n011.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 06:04:55 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 276.68/36.45 % Version: 3.5.1
% 276.68/36.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 276.68/36.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 276.68/36.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 276.68/36.45 % Starting new_bool_3 with 300s (1) cores
% 276.68/36.45 % Starting new_bool_1 with 300s (1) cores
% 276.68/36.45 % Starting sh5l with 300s (1) cores
% 276.68/36.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1134522 completed with status 0
% 276.68/36.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 276.68/36.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 276.68/36.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 276.68/36.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 276.68/36.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 276.68/36.45 % No SInE strategy applied
% 276.68/36.45 % Search class: FGHSM-FSLM32-MFFFFFNN
% 276.68/36.45 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 276.68/36.45 % Starting SubtermCWHack with 136s (1) cores
% 276.68/36.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 276.68/36.45 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 276.68/36.45 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 276.68/36.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PI_PS_S5PRR_S032N with 123s (1) cores
% 276.68/36.45 % U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with pid 1134550 completed with status 0
% 276.68/36.45 % Result found by U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN
% 276.68/36.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 276.68/36.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 276.68/36.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 276.68/36.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 276.68/36.45 % No SInE strategy applied
% 276.68/36.45 % Search class: FGHSM-FSLM32-MFFFFFNN
% 276.68/36.45 % Scheduled 12 strats onto 5 cores with 1500 seconds (1500 total)
% 276.68/36.45 % Starting SubtermCWHack with 136s (1) cores
% 276.68/36.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 276.68/36.45 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 123s (1) cores
% 276.68/36.45 % Starting U----_100_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_ND_S04AN with 123s (1) cores
% 276.68/36.45 % Preprocessing time : 0.013 s
% 276.68/36.45 % Presaturation interreduction done
% 276.68/36.45
% 276.68/36.45 % Proof found!
% 276.68/36.45 % SZS status Theorem
% 276.68/36.45 % SZS output start CNFRefutation
% See solution above
% 276.68/36.45 % Parsed axioms : 337
% 276.68/36.45 % Removed by relevancy pruning/SinE : 0
% 276.68/36.45 % Initial clauses : 716
% 276.68/36.45 % Removed in clause preprocessing : 31
% 276.68/36.45 % Initial clauses in saturation : 685
% 276.68/36.45 % Processed clauses : 75013
% 276.68/36.45 % ...of these trivial : 612
% 276.68/36.45 % ...subsumed : 54766
% 276.68/36.45 % ...remaining for further processing : 19634
% 276.68/36.45 % Other redundant clauses eliminated : 2779
% 276.68/36.45 % Clauses deleted for lack of memory : 0
% 276.68/36.45 % Backward-subsumed : 6500
% 276.68/36.45 % Backward-rewritten : 3212
% 276.68/36.45 % Generated clauses : 1111554
% 276.68/36.45 % ...of the previous two non-redundant : 966753
% 276.68/36.45 % ...aggressively subsumed : 0
% 276.68/36.45 % Contextual simplify-reflections : 521
% 276.68/36.45 % Paramodulations : 1108724
% 276.68/36.45 % Factorizations : 31
% 276.68/36.45 % NegExts : 0
% 276.68/36.45 % Equation resolutions : 2810
% 276.68/36.45 % Disequality decompositions : 0
% 276.68/36.45 % Total rewrite steps : 469953
% 276.68/36.45 % ...of those cached : 461606
% 276.68/36.45 % Propositional unsat checks : 3
% 276.68/36.45 % Propositional check models : 0
% 276.68/36.45 % Propositional check unsatisfiable : 0
% 276.68/36.45 % Propositional clauses : 0
% 276.68/36.45 % Propositional clauses after purity: 0
% 276.68/36.45 % Propositional unsat core size : 0
% 276.68/36.45 % Propositional preprocessing time : 0.000
% 276.68/36.45 % Propositional encoding time : 1.589
% 276.68/36.45 % Propositional solver time : 1.798
% 276.68/36.45 % Success case prop preproc time : 0.000
% 276.68/36.45 % Success case prop encoding time : 0.000
% 276.68/36.45 % Success case prop solver time : 0.000
% 276.68/36.45 % Current number of processed clauses : 9201
% 276.68/36.45 % Positive orientable unit clauses : 419
% 276.68/36.45 % Positive unorientable unit clauses: 11
% 276.68/36.45 % Negative unit clauses : 530
% 276.68/36.45 % Non-unit-clauses : 8241
% 276.68/36.45 % Current number of unprocessed clauses: 880708
% 276.68/36.45 % ...number of literals in the above : 3592143
% 276.68/36.45 % Current number of archived formulas : 0
% 276.68/36.45 % Current number of archived clauses : 10342
% 276.68/36.45 % Clause-clause subsumption calls (NU) : 27150075
% 276.68/36.45 % Rec. Clause-clause subsumption calls : 18402123
% 276.68/36.45 % Non-unit clause-clause subsumptions : 46158
% 276.68/36.45 % Unit Clause-clause subsumption calls : 526245
% 276.68/36.45 % Rewrite failures with RHS unbound : 0
% 276.68/36.45 % BW rewrite match attempts : 337
% 276.68/36.45 % BW rewrite match successes : 184
% 276.68/36.45 % Condensation attempts : 0
% 276.68/36.45 % Condensation successes : 0
% 276.68/36.45 % Termbank termtop insertions : 21384352
% 276.68/36.45 % Search garbage collected termcells : 12488
% 276.68/36.45
% 276.68/36.45 % -------------------------------------------------
% 276.68/36.45 % User time : 33.800 s
% 276.68/36.45 % System time : 0.853 s
% 276.68/36.45 % Total time : 34.653 s
% 276.68/36.45 % Maximum resident set size: 6056 pages
% 276.68/36.45
% 276.68/36.45 % -------------------------------------------------
% 276.68/36.45 % User time : 171.342 s
% 276.68/36.45 % System time : 5.408 s
% 276.68/36.45 % Total time : 176.751 s
% 276.68/36.45 % Maximum resident set size: 5120 pages
% 276.68/36.45 % E exiting
%------------------------------------------------------------------------------