%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU386+1 : 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 : n017.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:56 PM UTC 2026
% Result : Theorem 0.50s 0.65s
% Output : CNFRefutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 333 ( 10 equ)
% Maximal formula atoms : 81 ( 7 avg)
% Number of connectives : 445 ( 158 ~; 172 |; 69 &)
% ( 6 <=>; 40 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 87 ( 0 sgn 60 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t29_waybel_9,conjecture,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
=> is_a_cluster_point_of_netstr(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t29_waybel_9) ).
fof(d18_yellow_6,axiom,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( X3 = lim_points_of_net(X1,X2)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X3)
<=> ! [X5] :
( point_neighbourhood(X5,X1,X4)
=> is_eventually_in(X1,X2,X5) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d18_yellow_6) ).
fof(dt_k11_yellow_6,axiom,
! [X1,X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2)
& top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> element(lim_points_of_net(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k11_yellow_6) ).
fof(d9_waybel_9,axiom,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( is_a_cluster_point_of_netstr(X1,X2,X3)
<=> ! [X4] :
( point_neighbourhood(X4,X1,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_waybel_9) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( element(X2,powerset(X3))
& in(X1,X2) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_subset) ).
fof(t28_yellow_6,axiom,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t28_yellow_6) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l1_pre_topc) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
=> is_a_cluster_point_of_netstr(X1,X2,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t29_waybel_9]) ).
fof(c_0_8,plain,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( X3 = lim_points_of_net(X1,X2)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X3)
<=> ! [X5] :
( point_neighbourhood(X5,X1,X4)
=> is_eventually_in(X1,X2,X5) ) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d18_yellow_6]) ).
fof(c_0_9,plain,
! [X1,X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2)
& top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> element(lim_points_of_net(X1,X2),powerset(the_carrier(X1))) ),
inference(fof_simplification,[status(thm)],[dt_k11_yellow_6]) ).
fof(c_0_10,plain,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( is_a_cluster_point_of_netstr(X1,X2,X3)
<=> ! [X4] :
( point_neighbourhood(X4,X1,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d9_waybel_9]) ).
fof(c_0_11,negated_conjecture,
~ ! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
=> is_a_cluster_point_of_netstr(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_12,plain,
! [X14,X15,X16,X17,X18,X22] :
( ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 = lim_points_of_net(X14,X15)
| is_eventually_in(X14,X15,X22)
| ~ point_neighbourhood(X22,X14,esk2_3(X14,X15,X16))
| in(esk2_3(X14,X15,X16),X16) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 = lim_points_of_net(X14,X15)
| ~ in(esk2_3(X14,X15,X16),X16)
| ~ is_eventually_in(X14,X15,esk3_3(X14,X15,X16)) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 = lim_points_of_net(X14,X15)
| ~ in(esk2_3(X14,X15,X16),X16)
| point_neighbourhood(esk3_3(X14,X15,X16),X14,esk2_3(X14,X15,X16)) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 = lim_points_of_net(X14,X15)
| element(esk2_3(X14,X15,X16),the_carrier(X14)) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 != lim_points_of_net(X14,X15)
| ~ element(X17,the_carrier(X14))
| in(X17,X16)
| ~ is_eventually_in(X14,X15,esk1_4(X14,X15,X16,X17)) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 != lim_points_of_net(X14,X15)
| ~ element(X17,the_carrier(X14))
| in(X17,X16)
| point_neighbourhood(esk1_4(X14,X15,X16,X17),X14,X17) )
& ( ~ top_str(X14)
| ~ topological_space(X14)
| empty_carrier(X14)
| ~ net_str(X15,X14)
| ~ directed_relstr(X15)
| ~ transitive_relstr(X15)
| empty_carrier(X15)
| ~ element(X16,powerset(the_carrier(X14)))
| X16 != lim_points_of_net(X14,X15)
| ~ element(X17,the_carrier(X14))
| is_eventually_in(X14,X15,X18)
| ~ point_neighbourhood(X18,X14,X17)
| ~ in(X17,X16) ) ),
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_8])])])])])]) ).
fof(c_0_13,plain,
! [X72,X73,X74] :
( element(X72,X74)
| ~ element(X73,powerset(X74))
| ~ in(X72,X73) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_14,plain,
! [X28,X29] :
( element(lim_points_of_net(X28,X29),powerset(the_carrier(X28)))
| ~ net_str(X29,X28)
| ~ directed_relstr(X29)
| ~ transitive_relstr(X29)
| empty_carrier(X29)
| ~ top_str(X28)
| ~ topological_space(X28)
| empty_carrier(X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_15,plain,
! [X23,X24,X25,X26] :
( ( ~ top_str(X23)
| ~ topological_space(X23)
| empty_carrier(X23)
| ~ net_str(X24,X23)
| empty_carrier(X24)
| ~ element(X25,the_carrier(X23))
| is_a_cluster_point_of_netstr(X23,X24,X25)
| ~ is_often_in(X23,X24,esk4_3(X23,X24,X25)) )
& ( ~ top_str(X23)
| ~ topological_space(X23)
| empty_carrier(X23)
| ~ net_str(X24,X23)
| empty_carrier(X24)
| ~ element(X25,the_carrier(X23))
| is_a_cluster_point_of_netstr(X23,X24,X25)
| point_neighbourhood(esk4_3(X23,X24,X25),X23,X25) )
& ( ~ top_str(X23)
| ~ topological_space(X23)
| empty_carrier(X23)
| ~ net_str(X24,X23)
| empty_carrier(X24)
| ~ element(X25,the_carrier(X23))
| is_often_in(X23,X24,X26)
| ~ point_neighbourhood(X26,X23,X25)
| ~ is_a_cluster_point_of_netstr(X23,X24,X25) ) ),
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_10])])])])])]) ).
fof(c_0_16,negated_conjecture,
( ~ is_a_cluster_point_of_netstr(esk18_0,esk19_0,esk20_0)
& in(esk20_0,lim_points_of_net(esk18_0,esk19_0))
& element(esk20_0,the_carrier(esk18_0))
& net_str(esk19_0,esk18_0)
& directed_relstr(esk19_0)
& transitive_relstr(esk19_0)
& ~ empty_carrier(esk19_0)
& top_str(esk18_0)
& topological_space(esk18_0)
& ~ empty_carrier(esk18_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
cnf(c_0_17,plain,
( ~ top_str(X4)
| ~ topological_space(X4)
| ~ net_str(X5,X4)
| ~ directed_relstr(X5)
| ~ transitive_relstr(X5)
| ~ element(X2,powerset(the_carrier(X4)))
| X2 != lim_points_of_net(X4,X5)
| ~ element(X1,the_carrier(X4))
| ~ point_neighbourhood(X3,X4,X1)
| ~ in(X1,X2)
| empty_carrier(X4)
| empty_carrier(X5)
| is_eventually_in(X4,X5,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( ~ element(X2,powerset(X3))
| ~ in(X1,X2)
| element(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ top_str(X1)
| ~ topological_space(X1)
| element(lim_points_of_net(X1,X2),powerset(the_carrier(X1)))
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ element(X3,the_carrier(X1))
| empty_carrier(X1)
| empty_carrier(X2)
| is_a_cluster_point_of_netstr(X1,X2,X3)
| point_neighbourhood(esk4_3(X1,X2,X3),X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
element(esk20_0,the_carrier(esk18_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
top_str(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
topological_space(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,negated_conjecture,
~ empty_carrier(esk18_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X1] :
( ( one_sorted_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( ( net_str(X2,X1)
& directed_relstr(X2)
& transitive_relstr(X2)
& ~ empty_carrier(X2) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[t28_yellow_6]) ).
cnf(c_0_26,plain,
( ~ in(X4,lim_points_of_net(X1,X2))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ transitive_relstr(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ point_neighbourhood(X3,X1,X4)
| empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_17,c_0_18])]),c_0_19]) ).
cnf(c_0_27,negated_conjecture,
in(esk20_0,lim_points_of_net(esk18_0,esk19_0)),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_28,negated_conjecture,
net_str(esk19_0,esk18_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_29,negated_conjecture,
directed_relstr(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
transitive_relstr(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_31,negated_conjecture,
~ empty_carrier(esk19_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_32,negated_conjecture,
( ~ net_str(X1,esk18_0)
| empty_carrier(X1)
| point_neighbourhood(esk4_3(esk18_0,X1,esk20_0),esk18_0,esk20_0)
| is_a_cluster_point_of_netstr(esk18_0,X1,esk20_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
~ is_a_cluster_point_of_netstr(esk18_0,esk19_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_34,plain,
( ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ element(X3,the_carrier(X1))
| ~ is_often_in(X1,X2,esk4_3(X1,X2,X3))
| empty_carrier(X1)
| empty_carrier(X2)
| is_a_cluster_point_of_netstr(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_35,plain,
! [X62,X63,X64] :
( is_often_in(X62,X63,X64)
| ~ is_eventually_in(X62,X63,X64)
| ~ net_str(X63,X62)
| ~ directed_relstr(X63)
| ~ transitive_relstr(X63)
| empty_carrier(X63)
| ~ one_sorted_str(X62)
| empty_carrier(X62) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])]) ).
cnf(c_0_36,negated_conjecture,
( ~ point_neighbourhood(X1,esk18_0,esk20_0)
| is_eventually_in(esk18_0,esk19_0,X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_22]),c_0_23])]),c_0_24]),c_0_31]) ).
cnf(c_0_37,negated_conjecture,
point_neighbourhood(esk4_3(esk18_0,esk19_0,esk20_0),esk18_0,esk20_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_28]),c_0_33]),c_0_31]) ).
cnf(c_0_38,negated_conjecture,
( ~ net_str(X1,esk18_0)
| ~ is_often_in(esk18_0,X1,esk4_3(esk18_0,X1,esk20_0))
| empty_carrier(X1)
| is_a_cluster_point_of_netstr(esk18_0,X1,esk20_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_39,plain,
( ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ one_sorted_str(X1)
| is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,negated_conjecture,
is_eventually_in(esk18_0,esk19_0,esk4_3(esk18_0,esk19_0,esk20_0)),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,negated_conjecture,
~ is_often_in(esk18_0,esk19_0,esk4_3(esk18_0,esk19_0,esk20_0)),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_33]),c_0_31]) ).
fof(c_0_42,plain,
! [X31] :
( one_sorted_str(X31)
| ~ top_str(X31) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
cnf(c_0_43,negated_conjecture,
~ one_sorted_str(esk18_0),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_39,c_0_40]),c_0_28]),c_0_29]),c_0_30])]),c_0_41]),c_0_31]),c_0_24]) ).
cnf(c_0_44,plain,
( ~ top_str(X1)
| one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU386+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n017.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Mon Sep 21 06:13:45 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.26/0.55 Running first-order theorem proving
% 0.26/0.55 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
% 0.50/0.65 % Version: 3.5.1
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.50/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.50/0.65 % Starting sh5l with 300s (1) cores
% 0.50/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1608798 completed with status 0
% 0.50/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.65 % No SInE strategy applied
% 0.50/0.65 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.50/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.50/0.65 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.50/0.65 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.50/0.65 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1608804 completed with status 0
% 0.50/0.65 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.50/0.65 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.50/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.50/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.50/0.65 % No SInE strategy applied
% 0.50/0.65 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.50/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.50/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.50/0.65 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.50/0.65 % Preprocessing time : 0.002 s
% 0.50/0.65 % Presaturation interreduction done
% 0.50/0.65
% 0.50/0.65 % Proof found!
% 0.50/0.65 % SZS status Theorem
% 0.50/0.65 % SZS output start CNFRefutation
% See solution above
% 0.50/0.66 % Parsed axioms : 45
% 0.50/0.66 % Removed by relevancy pruning/SinE : 0
% 0.50/0.66 % Initial clauses : 74
% 0.50/0.66 % Removed in clause preprocessing : 5
% 0.50/0.66 % Initial clauses in saturation : 69
% 0.50/0.66 % Processed clauses : 467
% 0.50/0.66 % ...of these trivial : 0
% 0.50/0.66 % ...subsumed : 226
% 0.50/0.66 % ...remaining for further processing : 241
% 0.50/0.66 % Other redundant clauses eliminated : 3
% 0.50/0.66 % Clauses deleted for lack of memory : 0
% 0.50/0.66 % Backward-subsumed : 1
% 0.50/0.66 % Backward-rewritten : 3
% 0.50/0.66 % Generated clauses : 658
% 0.50/0.66 % ...of the previous two non-redundant : 622
% 0.50/0.66 % ...aggressively subsumed : 0
% 0.50/0.66 % Contextual simplify-reflections : 5
% 0.50/0.66 % Paramodulations : 655
% 0.50/0.66 % Factorizations : 0
% 0.50/0.66 % NegExts : 0
% 0.50/0.66 % Equation resolutions : 3
% 0.50/0.66 % Disequality decompositions : 0
% 0.50/0.66 % Total rewrite steps : 99
% 0.50/0.66 % ...of those cached : 79
% 0.50/0.66 % Propositional unsat checks : 0
% 0.50/0.66 % Propositional check models : 0
% 0.50/0.66 % Propositional check unsatisfiable : 0
% 0.50/0.66 % Propositional clauses : 0
% 0.50/0.66 % Propositional clauses after purity: 0
% 0.50/0.66 % Propositional unsat core size : 0
% 0.50/0.66 % Propositional preprocessing time : 0.000
% 0.50/0.66 % Propositional encoding time : 0.000
% 0.50/0.66 % Propositional solver time : 0.000
% 0.50/0.66 % Success case prop preproc time : 0.000
% 0.50/0.66 % Success case prop encoding time : 0.000
% 0.50/0.66 % Success case prop solver time : 0.000
% 0.50/0.66 % Current number of processed clauses : 165
% 0.50/0.66 % Positive orientable unit clauses : 38
% 0.50/0.66 % Positive unorientable unit clauses: 0
% 0.50/0.66 % Negative unit clauses : 14
% 0.50/0.66 % Non-unit-clauses : 113
% 0.50/0.66 % Current number of unprocessed clauses: 291
% 0.50/0.66 % ...number of literals in the above : 1848
% 0.50/0.66 % Current number of archived formulas : 0
% 0.50/0.66 % Current number of archived clauses : 73
% 0.50/0.66 % Clause-clause subsumption calls (NU) : 7493
% 0.50/0.66 % Rec. Clause-clause subsumption calls : 3347
% 0.50/0.66 % Non-unit clause-clause subsumptions : 134
% 0.50/0.66 % Unit Clause-clause subsumption calls : 146
% 0.50/0.66 % Rewrite failures with RHS unbound : 0
% 0.50/0.66 % BW rewrite match attempts : 16
% 0.50/0.66 % BW rewrite match successes : 3
% 0.50/0.66 % Condensation attempts : 0
% 0.50/0.66 % Condensation successes : 0
% 0.50/0.66 % Termbank termtop insertions : 15208
% 0.50/0.66 % Search garbage collected termcells : 1098
% 0.50/0.66
% 0.50/0.66 % -------------------------------------------------
% 0.50/0.66 % User time : 0.035 s
% 0.50/0.66 % System time : 0.005 s
% 0.50/0.66 % Total time : 0.040 s
% 0.50/0.66 % Maximum resident set size: 3880 pages
% 0.50/0.66
% 0.50/0.66 % -------------------------------------------------
% 0.50/0.66 % User time : 0.096 s
% 0.50/0.66 % System time : 0.023 s
% 0.50/0.66 % Total time : 0.119 s
% 0.50/0.66 % Maximum resident set size: 4864 pages
% 0.50/0.66 % E exiting
%------------------------------------------------------------------------------