%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU375+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 : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:24:54 PM UTC 2026
% Result : Theorem 63.18s 9.70s
% Output : CNFRefutation 63.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 73 ( 25 unt; 0 def)
% Number of atoms : 280 ( 16 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 328 ( 121 ~; 105 |; 46 &)
% ( 7 <=>; 49 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-1 aty)
% Number of variables : 123 ( 1 sgn 83 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t21_yellow_6,conjecture,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t21_yellow_6) ).
fof(d2_subset_1,axiom,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_struct_0) ).
fof(dt_m1_yellow_6,axiom,
! [X1,X2] :
( ( net_str(X2,X1)
& one_sorted_str(X1) )
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> net_str(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_m1_yellow_6) ).
fof(t19_yellow_6,lemma,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> subset(the_carrier(X3),the_carrier(X2)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t19_yellow_6) ).
fof(dt_l1_orders_2,axiom,
! [X1] :
( rel_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_orders_2) ).
fof(dt_l1_waybel_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> rel_str(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_waybel_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t61_yellow_0,lemma,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( ( subrelstr(X2,X1)
& full_subrelstr(X2,X1) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X2))
=> ( ( in(X6,the_carrier(X2))
& in(X5,the_carrier(X2))
& related(X1,X3,X4)
& X6 = X4
& X5 = X3 )
=> related(X2,X5,X6) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t61_yellow_0) ).
fof(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
fof(d9_yellow_6,axiom,
! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( net_str(X2,X1)
=> ! [X3] :
( subnetstr(X3,X1,X2)
=> ( full_subnetstr(X3,X1,X2)
<=> ( subrelstr(X3,X2)
& full_subrelstr(X3,X2) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_yellow_6) ).
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(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t21_yellow_6]) ).
fof(c_0_14,plain,
! [X1,X2] :
( ( empty(X1)
=> ( element(X2,X1)
<=> empty(X2) ) )
& ( ~ empty(X1)
=> ( element(X2,X1)
<=> in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[d2_subset_1]) ).
fof(c_0_15,negated_conjecture,
~ ! [X1] :
( one_sorted_str(X1)
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( ( subnetstr(X3,X1,X2)
& full_subnetstr(X3,X1,X2)
& ~ empty_carrier(X3) )
=> ! [X4] :
( element(X4,the_carrier(X2))
=> ! [X5] :
( element(X5,the_carrier(X2))
=> ! [X6] :
( element(X6,the_carrier(X3))
=> ! [X7] :
( element(X7,the_carrier(X3))
=> ( ( related(X2,X4,X5)
& X5 = X7
& X4 = X6 )
=> related(X3,X6,X7) ) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_16,plain,
! [X144,X145] :
( ( ~ empty(X144)
| element(X145,X144)
| ~ empty(X145) )
& ( ~ empty(X144)
| empty(X145)
| ~ element(X145,X144) )
& ( empty(X144)
| element(X145,X144)
| ~ in(X145,X144) )
& ( empty(X144)
| in(X145,X144)
| ~ element(X145,X144) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_17,negated_conjecture,
( ~ related(esk3_0,esk6_0,esk7_0)
& related(esk2_0,esk4_0,esk5_0)
& esk5_0 = esk7_0
& esk4_0 = esk6_0
& element(esk7_0,the_carrier(esk3_0))
& element(esk6_0,the_carrier(esk3_0))
& element(esk5_0,the_carrier(esk2_0))
& element(esk4_0,the_carrier(esk2_0))
& subnetstr(esk3_0,esk1_0,esk2_0)
& full_subnetstr(esk3_0,esk1_0,esk2_0)
& ~ empty_carrier(esk3_0)
& net_str(esk2_0,esk1_0)
& ~ empty_carrier(esk2_0)
& one_sorted_str(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])]) ).
fof(c_0_18,plain,
! [X62] :
( ( ~ one_sorted_str(X62)
| empty_carrier(X62)
| ~ empty(the_carrier(X62)) )
& ( ~ one_sorted_str(X62)
| empty(the_carrier(X62))
| ~ empty_carrier(X62) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])])]) ).
cnf(c_0_19,plain,
( ~ element(X1,X2)
| empty(X2)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,negated_conjecture,
element(esk7_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_21,plain,
! [X39,X40,X41] :
( net_str(X41,X39)
| ~ subnetstr(X41,X39,X40)
| ~ net_str(X40,X39)
| ~ one_sorted_str(X39) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_m1_yellow_6])])])]) ).
fof(c_0_22,lemma,
! [X45,X46,X47] :
( subset(the_carrier(X47),the_carrier(X46))
| ~ subnetstr(X47,X45,X46)
| ~ net_str(X46,X45)
| ~ one_sorted_str(X45) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_yellow_6])])])]) ).
cnf(c_0_23,plain,
( ~ one_sorted_str(X1)
| ~ empty(the_carrier(X1))
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( in(esk7_0,the_carrier(esk3_0))
| empty(the_carrier(esk3_0)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
~ empty_carrier(esk3_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_26,plain,
! [X63] :
( one_sorted_str(X63)
| ~ rel_str(X63) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])])]) ).
fof(c_0_27,plain,
! [X58,X59] :
( rel_str(X59)
| ~ net_str(X59,X58)
| ~ one_sorted_str(X58) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_waybel_0])])])]) ).
cnf(c_0_28,plain,
( ~ subnetstr(X3,X1,X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| net_str(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_29,negated_conjecture,
subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_30,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
one_sorted_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_32,plain,
! [X120,X121] :
( ( element(X120,powerset(X121))
| ~ subset(X120,X121) )
& ( subset(X120,X121)
| ~ element(X120,powerset(X121)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_33,lemma,
( ~ subnetstr(X3,X1,X2)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| subset(the_carrier(X3),the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,negated_conjecture,
( ~ one_sorted_str(esk3_0)
| in(esk7_0,the_carrier(esk3_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).
cnf(c_0_35,plain,
( ~ rel_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_36,plain,
( ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| rel_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,negated_conjecture,
net_str(esk3_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_31])]) ).
fof(c_0_38,lemma,
! [X136,X137,X138,X139,X140,X141] :
( related(X137,X140,X141)
| ~ in(X141,the_carrier(X137))
| ~ in(X140,the_carrier(X137))
| ~ related(X136,X138,X139)
| X141 != X139
| X140 != X138
| ~ element(X141,the_carrier(X137))
| ~ element(X140,the_carrier(X137))
| ~ element(X139,the_carrier(X136))
| ~ element(X138,the_carrier(X136))
| ~ subrelstr(X137,X136)
| ~ full_subrelstr(X137,X136)
| ~ rel_str(X136) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t61_yellow_0])])])]) ).
fof(c_0_39,plain,
! [X37,X38] :
( element(X37,X38)
| ~ in(X37,X38) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_40,plain,
! [X55,X56,X57] :
( ( ~ one_sorted_str(X55)
| ~ net_str(X56,X55)
| ~ subnetstr(X57,X55,X56)
| full_subnetstr(X57,X55,X56)
| ~ subrelstr(X57,X56)
| ~ full_subrelstr(X57,X56) )
& ( ~ one_sorted_str(X55)
| ~ net_str(X56,X55)
| ~ subnetstr(X57,X55,X56)
| ~ full_subnetstr(X57,X55,X56)
| subrelstr(X57,X56) )
& ( ~ one_sorted_str(X55)
| ~ net_str(X56,X55)
| ~ subnetstr(X57,X55,X56)
| ~ full_subnetstr(X57,X55,X56)
| full_subrelstr(X57,X56) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d9_yellow_6])])])])]) ).
fof(c_0_41,plain,
! [X88,X89,X90] :
( element(X88,X90)
| ~ element(X89,powerset(X90))
| ~ in(X88,X89) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
cnf(c_0_42,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_43,negated_conjecture,
subset(the_carrier(esk3_0),the_carrier(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_29]),c_0_30]),c_0_31])]) ).
fof(c_0_44,plain,
! [X200,X201] :
( ~ empty(X201)
| ~ in(X200,X201) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_45,negated_conjecture,
( ~ rel_str(esk3_0)
| in(esk7_0,the_carrier(esk3_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_46,negated_conjecture,
rel_str(esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]) ).
cnf(c_0_47,lemma,
( ~ in(X6,the_carrier(X2))
| ~ in(X5,the_carrier(X2))
| ~ related(X1,X3,X4)
| X6 != X4
| X5 != X3
| ~ element(X6,the_carrier(X2))
| ~ element(X5,the_carrier(X2))
| ~ element(X4,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ subrelstr(X2,X1)
| ~ full_subrelstr(X2,X1)
| ~ rel_str(X1)
| related(X2,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_48,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_49,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ subnetstr(X1,X3,X2)
| ~ full_subnetstr(X1,X3,X2)
| full_subrelstr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_50,negated_conjecture,
full_subnetstr(esk3_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_51,plain,
( ~ one_sorted_str(X3)
| ~ net_str(X2,X3)
| ~ subnetstr(X1,X3,X2)
| ~ full_subnetstr(X1,X3,X2)
| subrelstr(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_52,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_53,negated_conjecture,
element(the_carrier(esk3_0),powerset(the_carrier(esk2_0))),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_54,negated_conjecture,
element(esk6_0,the_carrier(esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_55,negated_conjecture,
esk4_0 = esk6_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_56,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_57,negated_conjecture,
in(esk7_0,the_carrier(esk3_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46])]) ).
cnf(c_0_58,lemma,
( ~ rel_str(X4)
| ~ in(X2,the_carrier(X1))
| ~ in(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X4))
| ~ element(X3,the_carrier(X4))
| ~ related(X4,X2,X3)
| ~ subrelstr(X1,X4)
| ~ full_subrelstr(X1,X4)
| related(X1,X2,X3) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_47,c_0_48]),c_0_48])])]) ).
cnf(c_0_59,negated_conjecture,
full_subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_60,negated_conjecture,
subrelstr(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_50]),c_0_29]),c_0_30]),c_0_31])]) ).
cnf(c_0_61,negated_conjecture,
rel_str(esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_31])]) ).
cnf(c_0_62,negated_conjecture,
( ~ in(X1,the_carrier(esk3_0))
| element(X1,the_carrier(esk2_0)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_63,negated_conjecture,
related(esk2_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_64,negated_conjecture,
esk5_0 = esk7_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_65,negated_conjecture,
element(esk4_0,the_carrier(esk3_0)),
inference(rw,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_66,negated_conjecture,
~ empty(the_carrier(esk3_0)),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_67,negated_conjecture,
~ related(esk3_0,esk6_0,esk7_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_68,negated_conjecture,
( ~ in(X1,the_carrier(esk3_0))
| ~ in(X2,the_carrier(esk3_0))
| ~ related(esk2_0,X1,X2)
| related(esk3_0,X1,X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]),c_0_62]),c_0_62]) ).
cnf(c_0_69,negated_conjecture,
related(esk2_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_63,c_0_64]) ).
cnf(c_0_70,negated_conjecture,
in(esk4_0,the_carrier(esk3_0)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_65]),c_0_66]) ).
cnf(c_0_71,negated_conjecture,
~ related(esk3_0,esk4_0,esk7_0),
inference(rw,[status(thm)],[c_0_67,c_0_55]) ).
cnf(c_0_72,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_68,c_0_69]),c_0_57]),c_0_70])]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU375+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.12/0.37 % Computer : n008.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 06:17:40 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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
% 63.18/9.70 % Version: 3.5.1
% 63.18/9.70 % Preprocessing class: FSLMSMSSSSSNFFN.
% 63.18/9.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.18/9.70 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 63.18/9.70 % Starting new_bool_3 with 600s (2) cores
% 63.18/9.70 % Starting new_bool_1 with 600s (2) cores
% 63.18/9.70 % Starting sh5l with 300s (1) cores
% 63.18/9.70 % new_bool_1 with pid 320605 completed with status 0
% 63.18/9.70 % Result found by new_bool_1
% 63.18/9.70 % Preprocessing class: FSLMSMSSSSSNFFN.
% 63.18/9.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.18/9.70 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 63.18/9.70 % Starting new_bool_3 with 600s (2) cores
% 63.18/9.70 % Starting new_bool_1 with 600s (2) cores
% 63.18/9.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 63.18/9.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 63.18/9.70 % Search class: FGHSM-FSLM31-SFFFFFNN
% 63.18/9.70 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 63.18/9.70 % Starting SubtermCWHack with 55s (1) cores
% 63.18/9.70 % Starting new_bool_1 with 61s (1) cores
% 63.18/9.70 % new_bool_1 with pid 320616 completed with status 0
% 63.18/9.70 % Result found by new_bool_1
% 63.18/9.70 % Preprocessing class: FSLMSMSSSSSNFFN.
% 63.18/9.70 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 63.18/9.70 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 63.18/9.70 % Starting new_bool_3 with 600s (2) cores
% 63.18/9.70 % Starting new_bool_1 with 600s (2) cores
% 63.18/9.70 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 63.18/9.70 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 63.18/9.70 % Search class: FGHSM-FSLM31-SFFFFFNN
% 63.18/9.70 % Scheduled 7 strats onto 2 cores with 600 seconds (600 total)
% 63.18/9.70 % Starting SubtermCWHack with 55s (1) cores
% 63.18/9.70 % Starting new_bool_1 with 61s (1) cores
% 63.18/9.70 % Preprocessing time : 0.005 s
% 63.18/9.70 % Presaturation interreduction done
% 63.18/9.70
% 63.18/9.70 % Proof found!
% 63.18/9.70 % SZS status Theorem
% 63.18/9.70 % SZS output start CNFRefutation
% See solution above
% 63.18/9.70 % Parsed axioms : 769
% 63.18/9.70 % Removed by relevancy pruning/SinE : 686
% 63.18/9.70 % Initial clauses : 284
% 63.18/9.70 % Removed in clause preprocessing : 2
% 72.68/9.70 % Initial clauses in saturation : 282
% 72.68/9.70 % Processed clauses : 36086
% 72.68/9.70 % ...of these trivial : 113
% 72.68/9.70 % ...subsumed : 27736
% 72.68/9.70 % ...remaining for further processing : 8237
% 72.68/9.70 % Other redundant clauses eliminated : 412
% 72.68/9.70 % Clauses deleted for lack of memory : 0
% 72.68/9.70 % Backward-subsumed : 121
% 72.68/9.70 % Backward-rewritten : 44
% 72.68/9.70 % Generated clauses : 428991
% 72.68/9.70 % ...of the previous two non-redundant : 421854
% 72.68/9.70 % ...aggressively subsumed : 0
% 72.68/9.70 % Contextual simplify-reflections : 217
% 72.68/9.70 % Paramodulations : 428541
% 72.68/9.70 % Factorizations : 32
% 72.68/9.70 % NegExts : 0
% 72.68/9.70 % Equation resolutions : 416
% 72.68/9.70 % Disequality decompositions : 0
% 72.68/9.70 % Total rewrite steps : 11621
% 72.68/9.70 % ...of those cached : 11080
% 72.68/9.70 % Propositional unsat checks : 1
% 72.68/9.70 % Propositional check models : 0
% 72.68/9.70 % Propositional check unsatisfiable : 0
% 72.68/9.70 % Propositional clauses : 0
% 72.68/9.70 % Propositional clauses after purity: 0
% 72.68/9.70 % Propositional unsat core size : 0
% 72.68/9.70 % Propositional preprocessing time : 0.000
% 72.68/9.70 % Propositional encoding time : 0.231
% 72.68/9.70 % Propositional solver time : 0.137
% 72.68/9.70 % Success case prop preproc time : 0.000
% 72.68/9.70 % Success case prop encoding time : 0.000
% 72.68/9.70 % Success case prop solver time : 0.000
% 72.68/9.70 % Current number of processed clauses : 7764
% 72.68/9.70 % Positive orientable unit clauses : 459
% 72.68/9.70 % Positive unorientable unit clauses: 0
% 72.68/9.70 % Negative unit clauses : 1131
% 72.68/9.70 % Non-unit-clauses : 6174
% 72.68/9.70 % Current number of unprocessed clauses: 385708
% 72.68/9.70 % ...number of literals in the above : 2233692
% 72.68/9.70 % Current number of archived formulas : 0
% 72.68/9.70 % Current number of archived clauses : 427
% 72.68/9.70 % Clause-clause subsumption calls (NU) : 6221369
% 72.68/9.70 % Rec. Clause-clause subsumption calls : 1721651
% 72.68/9.70 % Non-unit clause-clause subsumptions : 12884
% 72.68/9.70 % Unit Clause-clause subsumption calls : 671249
% 72.68/9.70 % Rewrite failures with RHS unbound : 0
% 72.68/9.70 % BW rewrite match attempts : 1865
% 72.68/9.70 % BW rewrite match successes : 16
% 72.68/9.70 % Condensation attempts : 0
% 72.68/9.70 % Condensation successes : 0
% 72.68/9.70 % Termbank termtop insertions : 12530653
% 72.68/9.70 % Search garbage collected termcells : 9838
% 72.68/9.70
% 72.68/9.70 % -------------------------------------------------
% 72.68/9.70 % User time : 8.830 s
% 72.68/9.70 % System time : 0.244 s
% 72.68/9.70 % Total time : 9.074 s
% 72.68/9.70 % Maximum resident set size: 5420 pages
% 72.68/9.70
% 72.68/9.70 % -------------------------------------------------
% 72.68/9.70 % User time : 17.664 s
% 72.68/9.70 % System time : 0.530 s
% 72.68/9.70 % Total time : 18.194 s
% 72.68/9.70 % Maximum resident set size: 5632 pages
% 72.68/9.70 % E exiting
%------------------------------------------------------------------------------