%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU176+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n014.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:08 PM UTC 2026
% Result : Theorem 226.09s 33.42s
% Output : CNFRefutation 226.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 14
% Syntax : Number of formulae : 74 ( 18 unt; 0 def)
% Number of atoms : 156 ( 77 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 137 ( 55 ~; 54 |; 8 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 95 ( 4 sgn 58 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t47_setfam_1,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t47_setfam_1) ).
fof(d4_subset_1,axiom,
! [X1] : cast_to_subset(X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_subset_1) ).
fof(t48_setfam_1,conjecture,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t48_setfam_1) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(dt_k2_subset_1,axiom,
! [X1] : element(cast_to_subset(X1),powerset(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_subset_1) ).
fof(redefinition_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> subset_difference(X1,X2,X3) = set_difference(X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k6_subset_1) ).
fof(dt_k5_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(union_of_subsets(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k5_setfam_1) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(d5_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,X2) = set_difference(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_subset_1) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(dt_k6_subset_1,axiom,
! [X1,X2,X3] :
( ( element(X3,powerset(X1))
& element(X2,powerset(X1)) )
=> element(subset_difference(X1,X2,X3),powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k6_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc2_subset_1,axiom,
! [X1] :
? [X2] :
( empty(X2)
& element(X2,powerset(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_subset_1) ).
fof(t46_setfam_1,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( complements_of_subsets(X1,X2) = empty_set
& X2 != empty_set ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t46_setfam_1) ).
fof(c_0_14,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> subset_difference(X1,cast_to_subset(X1),union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[t47_setfam_1]) ).
fof(c_0_15,lemma,
! [X15,X16] :
( subset_difference(X15,cast_to_subset(X15),union_of_subsets(X15,X16)) = meet_of_subsets(X15,complements_of_subsets(X15,X16))
| X16 = empty_set
| ~ element(X16,powerset(powerset(X15))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_16,plain,
! [X21] : cast_to_subset(X21) = X21,
inference(variable_rename,[status(thm)],[d4_subset_1]) ).
fof(c_0_17,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
inference(assume_negation,[status(cth)],[t48_setfam_1]) ).
cnf(c_0_18,lemma,
( ~ element(X1,powerset(powerset(X2)))
| subset_difference(X2,cast_to_subset(X2),union_of_subsets(X2,X1)) = meet_of_subsets(X2,complements_of_subsets(X2,X1))
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
cast_to_subset(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_20,plain,
! [X32,X33] :
( element(complements_of_subsets(X32,X33),powerset(powerset(X32)))
| ~ element(X33,powerset(powerset(X32))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])])]) ).
fof(c_0_21,negated_conjecture,
~ ! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ( X2 != empty_set
=> union_of_subsets(X1,complements_of_subsets(X1,X2)) = subset_difference(X1,cast_to_subset(X1),meet_of_subsets(X1,X2)) ) ),
inference(fof_simplification,[status(thm)],[c_0_17]) ).
cnf(c_0_22,lemma,
( ~ element(X2,powerset(powerset(X1)))
| X2 = empty_set
| subset_difference(X1,X1,union_of_subsets(X1,X2)) = meet_of_subsets(X1,complements_of_subsets(X1,X2)) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
( ~ element(X1,powerset(powerset(X2)))
| element(complements_of_subsets(X2,X1),powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_24,negated_conjecture,
( union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_difference(esk1_0,cast_to_subset(esk1_0),meet_of_subsets(esk1_0,esk2_0))
& esk2_0 != empty_set
& element(esk2_0,powerset(powerset(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])])]) ).
fof(c_0_25,plain,
! [X22] : element(cast_to_subset(X22),powerset(X22)),
inference(variable_rename,[status(thm)],[dt_k2_subset_1]) ).
fof(c_0_26,plain,
! [X12,X13,X14] :
( subset_difference(X12,X13,X14) = set_difference(X13,X14)
| ~ element(X14,powerset(X12))
| ~ element(X13,powerset(X12)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k6_subset_1])])]) ).
cnf(c_0_27,lemma,
( ~ element(X2,powerset(powerset(X1)))
| complements_of_subsets(X1,X2) = empty_set
| subset_difference(X1,X1,union_of_subsets(X1,complements_of_subsets(X1,X2))) = meet_of_subsets(X1,complements_of_subsets(X1,complements_of_subsets(X1,X2))) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,negated_conjecture,
element(esk2_0,powerset(powerset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_29,plain,
element(cast_to_subset(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| subset_difference(X2,X1,X3) = set_difference(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| subset_difference(esk1_0,esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) = meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,plain,
element(X1,powerset(X1)),
inference(rw,[status(thm)],[c_0_29,c_0_19]) ).
fof(c_0_33,plain,
! [X23,X24] :
( element(union_of_subsets(X23,X24),powerset(X23))
| ~ element(X24,powerset(powerset(X23))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k5_setfam_1])])]) ).
cnf(c_0_34,negated_conjecture,
( ~ element(union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set
| meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) = set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
cnf(c_0_35,plain,
( ~ element(X1,powerset(powerset(X2)))
| element(union_of_subsets(X2,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
fof(c_0_36,plain,
! [X71,X72] :
( subset_complement(X71,subset_complement(X71,X72)) = X72
| ~ element(X72,powerset(X71)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).
fof(c_0_37,plain,
! [X65,X66] :
( subset_complement(X65,X66) = set_difference(X65,X66)
| ~ element(X66,powerset(X65)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d5_subset_1])])]) ).
cnf(c_0_38,negated_conjecture,
( ~ element(complements_of_subsets(esk1_0,esk2_0),powerset(powerset(esk1_0)))
| complements_of_subsets(esk1_0,esk2_0) = empty_set
| meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) = set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
fof(c_0_39,plain,
! [X34,X35] :
( complements_of_subsets(X34,complements_of_subsets(X34,X35)) = X35
| ~ element(X35,powerset(powerset(X34))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])])]) ).
fof(c_0_40,plain,
! [X9,X10,X11] :
( element(subset_difference(X9,X10,X11),powerset(X9))
| ~ element(X11,powerset(X9))
| ~ element(X10,powerset(X9)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_subset_1])])]) ).
cnf(c_0_41,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,subset_complement(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,X1) = set_difference(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_43,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) = set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_23]),c_0_28])]) ).
cnf(c_0_44,plain,
( ~ element(X1,powerset(powerset(X2)))
| complements_of_subsets(X2,complements_of_subsets(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
( ~ element(X3,powerset(X2))
| ~ element(X1,powerset(X2))
| element(subset_difference(X2,X1,X3),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_46,plain,
( ~ element(X2,powerset(X1))
| subset_complement(X1,set_difference(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| set_difference(esk1_0,union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))) = meet_of_subsets(esk1_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28])]) ).
cnf(c_0_48,negated_conjecture,
( ~ element(union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),powerset(esk1_0))
| element(meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_32])]) ).
fof(c_0_49,plain,
! [X62] :
( X62 = empty_set
| ~ empty(X62) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_50,plain,
! [X81] :
( empty(esk8_1(X81))
& element(esk8_1(X81),powerset(X81)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc2_subset_1])]) ).
cnf(c_0_51,negated_conjecture,
union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != subset_difference(esk1_0,cast_to_subset(esk1_0),meet_of_subsets(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_52,negated_conjecture,
( ~ element(union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set
| union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) = subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_53,negated_conjecture,
( ~ element(complements_of_subsets(esk1_0,esk2_0),powerset(powerset(esk1_0)))
| element(meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set ),
inference(spm,[status(thm)],[c_0_48,c_0_35]) ).
fof(c_0_54,lemma,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> ~ ( complements_of_subsets(X1,X2) = empty_set
& X2 != empty_set ) ),
inference(fof_simplification,[status(thm)],[t46_setfam_1]) ).
cnf(c_0_55,plain,
( ~ empty(X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_49]) ).
cnf(c_0_56,plain,
empty(esk8_1(X1)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_57,negated_conjecture,
subset_difference(esk1_0,esk1_0,meet_of_subsets(esk1_0,esk2_0)) != union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)),
inference(rw,[status(thm)],[c_0_51,c_0_19]) ).
cnf(c_0_58,negated_conjecture,
( ~ element(complements_of_subsets(esk1_0,esk2_0),powerset(powerset(esk1_0)))
| complements_of_subsets(esk1_0,esk2_0) = empty_set
| union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) = subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_35]) ).
cnf(c_0_59,negated_conjecture,
( element(meet_of_subsets(esk1_0,complements_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0))),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_23]),c_0_28])]) ).
fof(c_0_60,lemma,
! [X36,X37] :
( complements_of_subsets(X36,X37) != empty_set
| X37 = empty_set
| ~ element(X37,powerset(powerset(X36))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_54])])]) ).
cnf(c_0_61,plain,
element(esk8_1(X1),powerset(X1)),
inference(split_conjunct,[status(thm)],[c_0_50]) ).
cnf(c_0_62,plain,
esk8_1(X1) = empty_set,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_63,negated_conjecture,
( ~ element(meet_of_subsets(esk1_0,esk2_0),powerset(esk1_0))
| union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) != set_difference(esk1_0,meet_of_subsets(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_30]),c_0_32])]) ).
cnf(c_0_64,negated_conjecture,
( complements_of_subsets(esk1_0,esk2_0) = empty_set
| union_of_subsets(esk1_0,complements_of_subsets(esk1_0,esk2_0)) = subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_23]),c_0_28])]) ).
cnf(c_0_65,negated_conjecture,
( element(meet_of_subsets(esk1_0,esk2_0),powerset(esk1_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_44]),c_0_28])]) ).
cnf(c_0_66,lemma,
( complements_of_subsets(X2,X1) != empty_set
| ~ element(X1,powerset(powerset(X2)))
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[c_0_60]) ).
cnf(c_0_67,plain,
element(empty_set,powerset(X1)),
inference(rw,[status(thm)],[c_0_61,c_0_62]) ).
cnf(c_0_68,negated_conjecture,
( subset_complement(esk1_0,meet_of_subsets(esk1_0,esk2_0)) != set_difference(esk1_0,meet_of_subsets(esk1_0,esk2_0))
| complements_of_subsets(esk1_0,esk2_0) = empty_set ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_64]),c_0_65]) ).
cnf(c_0_69,lemma,
( ~ element(complements_of_subsets(X1,empty_set),powerset(powerset(X1)))
| complements_of_subsets(X1,empty_set) = empty_set ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_44])]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
complements_of_subsets(esk1_0,esk2_0) = empty_set,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_42]),c_0_65]) ).
cnf(c_0_71,lemma,
complements_of_subsets(X1,empty_set) = empty_set,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_23]),c_0_67])]) ).
cnf(c_0_72,negated_conjecture,
esk2_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_73,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_70]),c_0_71]),c_0_28])]),c_0_72]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU176+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n014.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:54:34 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.41 Running first-order theorem proving
% 0.12/0.41 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
% 226.09/33.42 % Version: 3.5.1
% 226.09/33.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 226.09/33.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 226.09/33.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 226.09/33.42 % Starting new_bool_3 with 300s (1) cores
% 226.09/33.42 % Starting new_bool_1 with 300s (1) cores
% 226.09/33.42 % Starting sh5l with 300s (1) cores
% 226.09/33.42 % sh5l with pid 3283522 completed with status 0
% 226.09/33.42 % Result found by sh5l
% 226.09/33.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 226.09/33.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 226.09/33.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 226.09/33.42 % Starting new_bool_3 with 300s (1) cores
% 226.09/33.42 % Starting new_bool_1 with 300s (1) cores
% 226.09/33.42 % Starting sh5l with 300s (1) cores
% 226.09/33.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 226.09/33.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 226.09/33.42 % Search class: FGHSM-FSLS32-SFFFFFNN
% 226.09/33.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 226.09/33.42 % Starting SubtermCWHack with 31s (1) cores
% 226.09/33.42 % SubtermCWHack with pid 3283529 completed with status 8
% 226.09/33.42 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 226.09/33.42 % G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 3284533 completed with status 0
% 226.09/33.42 % Result found by G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 226.09/33.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 226.09/33.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 226.09/33.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 226.09/33.42 % Starting new_bool_3 with 300s (1) cores
% 226.09/33.42 % Starting new_bool_1 with 300s (1) cores
% 226.09/33.42 % Starting sh5l with 300s (1) cores
% 226.09/33.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 226.09/33.42 % SinE strategy is gf500_gu_R04_F100_L20000
% 226.09/33.42 % Search class: FGHSM-FSLS32-SFFFFFNN
% 226.09/33.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 226.09/33.42 % Starting SubtermCWHack with 31s (1) cores
% 226.09/33.42 % SubtermCWHack with pid 3283529 completed with status 8
% 226.09/33.42 % Starting G-E--_208_C18C--_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 226.09/33.42 % Preprocessing time : 0.004 s
% 226.09/33.42 % Presaturation interreduction done
% 226.09/33.42
% 226.09/33.42 % Proof found!
% 226.09/33.42 % SZS status Theorem
% 226.09/33.42 % SZS output start CNFRefutation
% See solution above
% 226.09/33.42 % Parsed axioms : 134
% 226.09/33.42 % Removed by relevancy pruning/SinE : 18
% 226.09/33.42 % Initial clauses : 203
% 226.09/33.42 % Removed in clause preprocessing : 0
% 226.09/33.42 % Initial clauses in saturation : 203
% 226.09/33.42 % Processed clauses : 8486
% 226.09/33.42 % ...of these trivial : 51
% 226.09/33.42 % ...subsumed : 6150
% 226.09/33.42 % ...remaining for further processing : 2285
% 226.09/33.42 % Other redundant clauses eliminated : 222
% 226.09/33.42 % Clauses deleted for lack of memory : 0
% 226.09/33.42 % Backward-subsumed : 530
% 226.09/33.42 % Backward-rewritten : 150
% 226.09/33.42 % Generated clauses : 40261
% 226.09/33.42 % ...of the previous two non-redundant : 34498
% 226.09/33.42 % ...aggressively subsumed : 0
% 226.09/33.42 % Contextual simplify-reflections : 52
% 226.09/33.42 % Paramodulations : 39986
% 226.09/33.42 % Factorizations : 53
% 226.09/33.42 % NegExts : 0
% 226.09/33.42 % Equation resolutions : 227
% 226.09/33.42 % Disequality decompositions : 0
% 226.09/33.42 % Total rewrite steps : 10839
% 226.09/33.42 % ...of those cached : 10312
% 226.09/33.42 % Propositional unsat checks : 0
% 226.09/33.42 % Propositional check models : 0
% 226.09/33.42 % Propositional check unsatisfiable : 0
% 226.09/33.42 % Propositional clauses : 0
% 226.09/33.42 % Propositional clauses after purity: 0
% 226.09/33.42 % Propositional unsat core size : 0
% 226.09/33.42 % Propositional preprocessing time : 0.000
% 226.09/33.42 % Propositional encoding time : 0.000
% 226.09/33.42 % Propositional solver time : 0.000
% 226.09/33.42 % Success case prop preproc time : 0.000
% 226.09/33.42 % Success case prop encoding time : 0.000
% 226.09/33.42 % Success case prop solver time : 0.000
% 226.09/33.42 % Current number of processed clauses : 1385
% 226.09/33.42 % Positive orientable unit clauses : 108
% 226.09/33.42 % Positive unorientable unit clauses: 3
% 226.09/33.42 % Negative unit clauses : 256
% 226.09/33.42 % Non-unit-clauses : 1018
% 226.09/33.42 % Current number of unprocessed clauses: 25468
% 226.09/33.42 % ...number of literals in the above : 80248
% 226.09/33.42 % Current number of archived formulas : 0
% 226.09/33.42 % Current number of archived clauses : 863
% 226.09/33.42 % Clause-clause subsumption calls (NU) : 467365
% 226.09/33.42 % Rec. Clause-clause subsumption calls : 283082
% 226.09/33.42 % Non-unit clause-clause subsumptions : 3581
% 226.09/33.42 % Unit Clause-clause subsumption calls : 62835
% 226.09/33.42 % Rewrite failures with RHS unbound : 0
% 226.09/33.42 % BW rewrite match attempts : 173
% 226.09/33.42 % BW rewrite match successes : 65
% 226.09/33.42 % Condensation attempts : 0
% 226.09/33.42 % Condensation successes : 0
% 226.09/33.42 % Termbank termtop insertions : 447281
% 226.09/33.42 % Search garbage collected termcells : 3221
% 226.09/33.42
% 226.09/33.42 % -------------------------------------------------
% 226.09/33.42 % User time : 31.023 s
% 226.09/33.42 % System time : 1.148 s
% 226.09/33.42 % Total time : 32.171 s
% 226.09/33.42 % Maximum resident set size: 4012 pages
% 226.09/33.42
% 226.09/33.42 % -------------------------------------------------
% 226.09/33.42 % User time : 31.026 s
% 226.09/33.42 % System time : 1.156 s
% 226.09/33.42 % Total time : 32.183 s
% 226.09/33.42 % Maximum resident set size: 4864 pages
% 226.09/33.42 % E exiting
%------------------------------------------------------------------------------