%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU383+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 : n009.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:29:11 PM UTC 2026
% Result : Theorem 0.16s 0.50s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of formulae : 73 ( 17 unt; 0 def)
% Number of atoms : 266 ( 19 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 305 ( 112 ~; 107 |; 53 &)
% ( 8 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 17 ( 15 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 103 ( 1 sgn 59 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_waybel_7,conjecture,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_waybel_7) ).
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(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t1_subset) ).
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(fc1_struct_0,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_struct_0) ).
fof(d20_waybel_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( upper_relstr_subset(X2,X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( ( related(X1,X3,X4)
& in(X3,X2) )
=> in(X4,X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d20_waybel_0) ).
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(t44_yellow_0,axiom,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_yellow_0) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_tex_2) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( in(X1,X2)
| empty(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(dt_k3_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> element(bottom_of_relstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_yellow_0) ).
fof(c_0_13,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t8_waybel_7]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& transitive_relstr(X1)
& reflexive_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( element(X2,powerset(the_carrier(X1)))
& upper_relstr_subset(X2,X1)
& filtered_subset(X2,X1)
& ~ empty(X2) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_15,plain,
! [X58,X59,X60] :
( element(X58,X60)
| ~ element(X59,powerset(X60))
| ~ in(X58,X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_16,negated_conjecture,
( ( ~ in(bottom_of_relstr(esk17_0),esk18_0)
| proper_element(esk18_0,powerset(the_carrier(esk17_0))) )
& ( in(bottom_of_relstr(esk17_0),esk18_0)
| ~ proper_element(esk18_0,powerset(the_carrier(esk17_0))) )
& element(esk18_0,powerset(the_carrier(esk17_0)))
& upper_relstr_subset(esk18_0,esk17_0)
& filtered_subset(esk18_0,esk17_0)
& ~ empty(esk18_0)
& rel_str(esk17_0)
& lower_bounded_relstr(esk17_0)
& antisymmetric_relstr(esk17_0)
& transitive_relstr(esk17_0)
& reflexive_relstr(esk17_0)
& ~ empty_carrier(esk17_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).
fof(c_0_17,plain,
! [X47,X48] :
( element(X47,X48)
| ~ in(X47,X48) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])])]) ).
fof(c_0_18,plain,
! [X51,X52] :
( ( X51 = X52
| in(esk16_2(X51,X52),X52)
| in(esk16_2(X51,X52),X51) )
& ( X51 = X52
| ~ in(esk16_2(X51,X52),X52)
| ~ in(esk16_2(X51,X52),X51) ) ),
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])])])])]) ).
fof(c_0_19,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ~ empty(the_carrier(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_struct_0]) ).
fof(c_0_20,plain,
! [X14,X15,X16,X17] :
( ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| upper_relstr_subset(X15,X14)
| ~ in(esk2_2(X14,X15),X15) )
& ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| upper_relstr_subset(X15,X14)
| related(X14,esk1_2(X14,X15),esk2_2(X14,X15)) )
& ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| upper_relstr_subset(X15,X14)
| in(esk1_2(X14,X15),X15) )
& ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| upper_relstr_subset(X15,X14)
| element(esk2_2(X14,X15),the_carrier(X14)) )
& ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| upper_relstr_subset(X15,X14)
| element(esk1_2(X14,X15),the_carrier(X14)) )
& ( ~ rel_str(X14)
| ~ element(X15,powerset(the_carrier(X14)))
| in(X17,X15)
| ~ related(X14,X16,X17)
| ~ in(X16,X15)
| ~ element(X17,the_carrier(X14))
| ~ element(X16,the_carrier(X14))
| ~ upper_relstr_subset(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(fof_nnf,[status(thm)],[d20_waybel_0])])])])])]) ).
cnf(c_0_21,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
element(esk18_0,powerset(the_carrier(esk17_0))),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( ~ in(X1,X2)
| element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,plain,
( X1 = X2
| in(esk16_2(X1,X2),X2)
| in(esk16_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_25,plain,
! [X28] :
( ~ empty(the_carrier(X28))
| ~ one_sorted_str(X28)
| empty_carrier(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
fof(c_0_26,plain,
! [X23] :
( one_sorted_str(X23)
| ~ rel_str(X23) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])])]) ).
cnf(c_0_27,plain,
( ~ rel_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ related(X2,X3,X4)
| ~ in(X3,X1)
| ~ element(X4,the_carrier(X2))
| ~ element(X3,the_carrier(X2))
| ~ upper_relstr_subset(X1,X2)
| in(X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_28,plain,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[t44_yellow_0]) ).
fof(c_0_29,plain,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
inference(fof_simplification,[status(thm)],[t5_tex_2]) ).
fof(c_0_30,plain,
! [X49,X50] :
( in(X49,X50)
| empty(X50)
| ~ element(X49,X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(X1,esk18_0)
| element(X1,the_carrier(esk17_0)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
( in(esk16_2(X1,X2),X1)
| element(esk16_2(X1,X2),X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( ~ empty(the_carrier(X1))
| ~ one_sorted_str(X1)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_34,plain,
( ~ rel_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( ~ in(X4,X2)
| ~ rel_str(X3)
| ~ element(X1,the_carrier(X3))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ upper_relstr_subset(X2,X3)
| ~ related(X3,X4,X1)
| in(X1,X2) ),
inference(csr,[status(thm)],[c_0_27,c_0_21]) ).
cnf(c_0_36,negated_conjecture,
upper_relstr_subset(esk18_0,esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_37,negated_conjecture,
rel_str(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_38,plain,
! [X56,X57] :
( related(X56,bottom_of_relstr(X56),X57)
| ~ element(X57,the_carrier(X56))
| ~ rel_str(X56)
| ~ lower_bounded_relstr(X56)
| ~ antisymmetric_relstr(X56)
| empty_carrier(X56) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])]) ).
fof(c_0_39,plain,
! [X64,X65] :
( ( ~ element(X65,powerset(X64))
| proper_element(X65,powerset(X64))
| X65 = X64 )
& ( ~ element(X65,powerset(X64))
| X65 != X64
| ~ proper_element(X65,powerset(X64)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])]) ).
cnf(c_0_40,plain,
( ~ in(esk16_2(X1,X2),X2)
| ~ in(esk16_2(X1,X2),X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_41,plain,
( ~ element(X1,X2)
| in(X1,X2)
| empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_42,negated_conjecture,
( element(esk16_2(esk18_0,X1),X1)
| element(esk16_2(esk18_0,X1),the_carrier(esk17_0))
| esk18_0 = X1 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_43,negated_conjecture,
~ empty_carrier(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_44,plain,
( ~ empty(the_carrier(X1))
| ~ rel_str(X1)
| empty_carrier(X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_45,negated_conjecture,
( ~ in(X2,esk18_0)
| ~ element(X1,the_carrier(esk17_0))
| ~ related(esk17_0,X2,X1)
| in(X1,esk18_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_22]),c_0_36]),c_0_37])]) ).
cnf(c_0_46,plain,
( ~ element(X2,the_carrier(X1))
| ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| related(X1,bottom_of_relstr(X1),X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_47,negated_conjecture,
lower_bounded_relstr(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_48,negated_conjecture,
antisymmetric_relstr(esk17_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_49,negated_conjecture,
( ~ proper_element(esk18_0,powerset(the_carrier(esk17_0)))
| in(bottom_of_relstr(esk17_0),esk18_0) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_50,plain,
( ~ element(X1,powerset(X2))
| proper_element(X1,powerset(X2))
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
fof(c_0_51,plain,
! [X54,X55] :
( ( element(X54,powerset(X55))
| ~ subset(X54,X55) )
& ( subset(X54,X55)
| ~ element(X54,powerset(X55)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
fof(c_0_52,plain,
! [X46] : subset(X46,X46),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
cnf(c_0_53,plain,
( ~ in(esk16_2(X1,X2),X1)
| ~ element(esk16_2(X1,X2),X2)
| empty(X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_54,negated_conjecture,
( element(esk16_2(esk18_0,the_carrier(esk17_0)),the_carrier(esk17_0))
| the_carrier(esk17_0) = esk18_0 ),
inference(ef,[status(thm)],[c_0_42]) ).
cnf(c_0_55,negated_conjecture,
~ empty(the_carrier(esk17_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_37])]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(bottom_of_relstr(esk17_0),esk18_0)
| ~ element(X1,the_carrier(esk17_0))
| in(X1,esk18_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48]),c_0_37])]),c_0_43]) ).
cnf(c_0_57,negated_conjecture,
( in(bottom_of_relstr(esk17_0),esk18_0)
| the_carrier(esk17_0) = esk18_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_22])]) ).
cnf(c_0_58,plain,
( ~ subset(X1,X2)
| element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_59,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,negated_conjecture,
( ~ in(esk16_2(esk18_0,the_carrier(esk17_0)),esk18_0)
| the_carrier(esk17_0) = esk18_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( ~ element(X1,the_carrier(esk17_0))
| in(X1,esk18_0)
| the_carrier(esk17_0) = esk18_0 ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_62,plain,
( ~ element(X1,powerset(X2))
| X1 != X2
| ~ proper_element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_63,plain,
element(X1,powerset(X1)),
inference(spm,[status(thm)],[c_0_58,c_0_59]) ).
fof(c_0_64,plain,
! [X22] :
( element(bottom_of_relstr(X22),the_carrier(X22))
| ~ rel_str(X22) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])])]) ).
cnf(c_0_65,negated_conjecture,
( ~ in(bottom_of_relstr(esk17_0),esk18_0)
| proper_element(esk18_0,powerset(the_carrier(esk17_0))) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_66,negated_conjecture,
the_carrier(esk17_0) = esk18_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_54]) ).
cnf(c_0_67,plain,
~ proper_element(X1,powerset(X1)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_62]),c_0_63])]) ).
cnf(c_0_68,plain,
( ~ rel_str(X1)
| element(bottom_of_relstr(X1),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
cnf(c_0_69,negated_conjecture,
~ in(bottom_of_relstr(esk17_0),esk18_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_67]) ).
cnf(c_0_70,negated_conjecture,
element(bottom_of_relstr(esk17_0),esk18_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_66]),c_0_37])]) ).
cnf(c_0_71,negated_conjecture,
~ empty(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_72,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_41]),c_0_70])]),c_0_71]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU383+1 : 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.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 06:18:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 0.16/0.50 % Version: 3.5.1
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.50 % Starting sh5l with 300s (1) cores
% 0.16/0.50 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1027958 completed with status 0
% 0.16/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.50 % No SInE strategy applied
% 0.16/0.50 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.50 % Starting G-E--_208_C09_12_F1_SE_CS_SP_PS_S5PRR_S04AN with 136s (1) cores
% 0.16/0.50 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 1027968 completed with status 0
% 0.16/0.50 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.16/0.50 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.16/0.50 % No SInE strategy applied
% 0.16/0.50 % Search class: FGHSM-FFMM21-SFFFFFNN
% 0.16/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.16/0.50 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.16/0.50 % Preprocessing time : 0.003 s
% 0.16/0.50
% 0.16/0.50 % Proof found!
% 0.16/0.50 % SZS status Theorem
% 0.16/0.50 % SZS output start CNFRefutation
% See solution above
% 0.16/0.50 % Parsed axioms : 45
% 0.16/0.50 % Removed by relevancy pruning/SinE : 0
% 0.16/0.50 % Initial clauses : 77
% 0.16/0.50 % Removed in clause preprocessing : 6
% 0.16/0.50 % Initial clauses in saturation : 71
% 0.16/0.50 % Processed clauses : 211
% 0.16/0.50 % ...of these trivial : 0
% 0.16/0.50 % ...subsumed : 30
% 0.16/0.50 % ...remaining for further processing : 181
% 0.16/0.50 % Other redundant clauses eliminated : 1
% 0.16/0.50 % Clauses deleted for lack of memory : 0
% 0.16/0.50 % Backward-subsumed : 14
% 0.16/0.50 % Backward-rewritten : 38
% 0.16/0.50 % Generated clauses : 511
% 0.16/0.50 % ...of the previous two non-redundant : 490
% 0.16/0.50 % ...aggressively subsumed : 0
% 0.16/0.50 % Contextual simplify-reflections : 12
% 0.16/0.50 % Paramodulations : 506
% 0.16/0.50 % Factorizations : 4
% 0.16/0.50 % NegExts : 0
% 0.16/0.50 % Equation resolutions : 1
% 0.16/0.50 % Disequality decompositions : 0
% 0.16/0.50 % Total rewrite steps : 133
% 0.16/0.50 % ...of those cached : 114
% 0.16/0.50 % Propositional unsat checks : 0
% 0.16/0.50 % Propositional check models : 0
% 0.16/0.50 % Propositional check unsatisfiable : 0
% 0.16/0.50 % Propositional clauses : 0
% 0.16/0.50 % Propositional clauses after purity: 0
% 0.16/0.50 % Propositional unsat core size : 0
% 0.16/0.50 % Propositional preprocessing time : 0.000
% 0.16/0.50 % Propositional encoding time : 0.000
% 0.16/0.50 % Propositional solver time : 0.000
% 0.16/0.50 % Success case prop preproc time : 0.000
% 0.16/0.50 % Success case prop encoding time : 0.000
% 0.16/0.50 % Success case prop solver time : 0.000
% 0.16/0.50 % Current number of processed clauses : 128
% 0.16/0.50 % Positive orientable unit clauses : 22
% 0.16/0.50 % Positive unorientable unit clauses: 0
% 0.16/0.50 % Negative unit clauses : 12
% 0.16/0.50 % Non-unit-clauses : 94
% 0.16/0.50 % Current number of unprocessed clauses: 315
% 0.16/0.50 % ...number of literals in the above : 1333
% 0.16/0.50 % Current number of archived formulas : 0
% 0.16/0.50 % Current number of archived clauses : 52
% 0.16/0.50 % Clause-clause subsumption calls (NU) : 2070
% 0.16/0.50 % Rec. Clause-clause subsumption calls : 913
% 0.16/0.50 % Non-unit clause-clause subsumptions : 37
% 0.16/0.50 % Unit Clause-clause subsumption calls : 229
% 0.16/0.50 % Rewrite failures with RHS unbound : 0
% 0.16/0.50 % BW rewrite match attempts : 16
% 0.16/0.50 % BW rewrite match successes : 4
% 0.16/0.50 % Condensation attempts : 0
% 0.16/0.50 % Condensation successes : 0
% 0.16/0.50 % Termbank termtop insertions : 12319
% 0.16/0.50 % Search garbage collected termcells : 926
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.031 s
% 0.16/0.50 % System time : 0.004 s
% 0.16/0.50 % Total time : 0.035 s
% 0.16/0.50 % Maximum resident set size: 3672 pages
% 0.16/0.50
% 0.16/0.50 % -------------------------------------------------
% 0.16/0.50 % User time : 0.213 s
% 0.16/0.50 % System time : 0.035 s
% 0.16/0.50 % Total time : 0.248 s
% 0.16/0.50 % Maximum resident set size: 4864 pages
% 0.16/0.50 % E exiting
%------------------------------------------------------------------------------