TSTP Solution File: SEU386+2 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : SEU386+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:26:15 EDT 2023
% Result : Theorem 25.17s 3.84s
% Output : CNFRefutation 25.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 7
% Syntax : Number of formulae : 44 ( 12 unt; 0 def)
% Number of atoms : 344 ( 13 equ)
% Maximal formula atoms : 81 ( 7 avg)
% Number of connectives : 473 ( 173 ~; 194 |; 64 &)
% ( 6 <=>; 36 =>; 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 : 92 ( 0 sgn; 57 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d18_yellow_6,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [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/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',d18_yellow_6) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',t4_subset) ).
fof(dt_k11_yellow_6,axiom,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1)
& ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> element(lim_points_of_net(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',dt_k11_yellow_6) ).
fof(t29_waybel_9,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [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/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',t29_waybel_9) ).
fof(t28_yellow_6,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',t28_yellow_6) ).
fof(d9_waybel_9,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [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/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',d9_waybel_9) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/tmp/tmp.avS4QUJn84/E---3.1_14851.p',dt_l1_pre_topc) ).
fof(c_0_7,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [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_8,plain,
! [X52,X53,X54,X55,X56,X60] :
( ( ~ in(X55,X54)
| ~ point_neighbourhood(X56,X52,X55)
| is_eventually_in(X52,X53,X56)
| ~ element(X55,the_carrier(X52))
| X54 != lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( point_neighbourhood(esk8_4(X52,X53,X54,X55),X52,X55)
| in(X55,X54)
| ~ element(X55,the_carrier(X52))
| X54 != lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( ~ is_eventually_in(X52,X53,esk8_4(X52,X53,X54,X55))
| in(X55,X54)
| ~ element(X55,the_carrier(X52))
| X54 != lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( element(esk9_3(X52,X53,X54),the_carrier(X52))
| X54 = lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( point_neighbourhood(esk10_3(X52,X53,X54),X52,esk9_3(X52,X53,X54))
| ~ in(esk9_3(X52,X53,X54),X54)
| X54 = lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( ~ is_eventually_in(X52,X53,esk10_3(X52,X53,X54))
| ~ in(esk9_3(X52,X53,X54),X54)
| X54 = lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) )
& ( in(esk9_3(X52,X53,X54),X54)
| ~ point_neighbourhood(X60,X52,esk9_3(X52,X53,X54))
| is_eventually_in(X52,X53,X60)
| X54 = lim_points_of_net(X52,X53)
| ~ element(X54,powerset(the_carrier(X52)))
| empty_carrier(X53)
| ~ transitive_relstr(X53)
| ~ directed_relstr(X53)
| ~ net_str(X53,X52)
| empty_carrier(X52)
| ~ topological_space(X52)
| ~ top_str(X52) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])]) ).
fof(c_0_9,plain,
! [X45,X46,X47] :
( ~ in(X45,X46)
| ~ element(X46,powerset(X47))
| element(X45,X47) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_10,plain,
! [X1,X2] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1)
& ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> element(lim_points_of_net(X1,X2),powerset(the_carrier(X1))) ),
inference(fof_simplification,[status(thm)],[dt_k11_yellow_6]) ).
cnf(c_0_11,plain,
( is_eventually_in(X4,X5,X3)
| empty_carrier(X5)
| empty_carrier(X4)
| ~ in(X1,X2)
| ~ point_neighbourhood(X3,X4,X1)
| ~ element(X1,the_carrier(X4))
| X2 != lim_points_of_net(X4,X5)
| ~ element(X2,powerset(the_carrier(X4)))
| ~ transitive_relstr(X5)
| ~ directed_relstr(X5)
| ~ net_str(X5,X4)
| ~ topological_space(X4)
| ~ top_str(X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X61,X62] :
( empty_carrier(X61)
| ~ topological_space(X61)
| ~ top_str(X61)
| empty_carrier(X62)
| ~ transitive_relstr(X62)
| ~ directed_relstr(X62)
| ~ net_str(X62,X61)
| element(lim_points_of_net(X61,X62),powerset(the_carrier(X61))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [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)],[inference(assume_negation,[status(cth)],[t29_waybel_9])]) ).
cnf(c_0_15,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| X4 != lim_points_of_net(X1,X2)
| ~ point_neighbourhood(X3,X1,X5)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ element(X4,powerset(the_carrier(X1)))
| ~ in(X5,X4)
| ~ net_str(X2,X1) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(lim_points_of_net(X1,X2),powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ transitive_relstr(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_17,negated_conjecture,
( ~ empty_carrier(esk1_0)
& topological_space(esk1_0)
& top_str(esk1_0)
& ~ empty_carrier(esk2_0)
& transitive_relstr(esk2_0)
& directed_relstr(esk2_0)
& net_str(esk2_0,esk1_0)
& element(esk3_0,the_carrier(esk1_0))
& in(esk3_0,lim_points_of_net(esk1_0,esk2_0))
& ~ is_a_cluster_point_of_netstr(esk1_0,esk2_0,esk3_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
fof(c_0_18,lemma,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& transitive_relstr(X2)
& directed_relstr(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
=> is_often_in(X1,X2,X3) ) ) ),
inference(fof_simplification,[status(thm)],[t28_yellow_6]) ).
cnf(c_0_19,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X4)
| empty_carrier(X2)
| empty_carrier(X1)
| lim_points_of_net(X1,X4) != lim_points_of_net(X1,X2)
| ~ point_neighbourhood(X3,X1,X5)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ directed_relstr(X2)
| ~ directed_relstr(X4)
| ~ transitive_relstr(X2)
| ~ transitive_relstr(X4)
| ~ in(X5,lim_points_of_net(X1,X4))
| ~ net_str(X2,X1)
| ~ net_str(X4,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,negated_conjecture,
in(esk3_0,lim_points_of_net(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_21,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_22,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_23,negated_conjecture,
directed_relstr(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_24,negated_conjecture,
transitive_relstr(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,negated_conjecture,
net_str(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,negated_conjecture,
~ empty_carrier(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_28,lemma,
! [X89,X90,X91] :
( empty_carrier(X89)
| ~ one_sorted_str(X89)
| empty_carrier(X90)
| ~ transitive_relstr(X90)
| ~ directed_relstr(X90)
| ~ net_str(X90,X89)
| ~ is_eventually_in(X89,X90,X91)
| is_often_in(X89,X90,X91) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])]) ).
cnf(c_0_29,negated_conjecture,
( is_eventually_in(esk1_0,X1,X2)
| empty_carrier(X1)
| lim_points_of_net(esk1_0,esk2_0) != lim_points_of_net(esk1_0,X1)
| ~ point_neighbourhood(X2,esk1_0,esk3_0)
| ~ directed_relstr(X1)
| ~ transitive_relstr(X1)
| ~ net_str(X1,esk1_0) ),
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_19,c_0_20]),c_0_21]),c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]),c_0_27]) ).
fof(c_0_30,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [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]) ).
cnf(c_0_31,lemma,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ transitive_relstr(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( is_eventually_in(esk1_0,esk2_0,X1)
| ~ point_neighbourhood(X1,esk1_0,esk3_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_29]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]) ).
fof(c_0_33,plain,
! [X24,X25,X26,X27] :
( ( ~ is_a_cluster_point_of_netstr(X24,X25,X26)
| ~ point_neighbourhood(X27,X24,X26)
| is_often_in(X24,X25,X27)
| ~ element(X26,the_carrier(X24))
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ topological_space(X24)
| ~ top_str(X24) )
& ( point_neighbourhood(esk4_3(X24,X25,X26),X24,X26)
| is_a_cluster_point_of_netstr(X24,X25,X26)
| ~ element(X26,the_carrier(X24))
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ topological_space(X24)
| ~ top_str(X24) )
& ( ~ is_often_in(X24,X25,esk4_3(X24,X25,X26))
| is_a_cluster_point_of_netstr(X24,X25,X26)
| ~ element(X26,the_carrier(X24))
| empty_carrier(X25)
| ~ net_str(X25,X24)
| empty_carrier(X24)
| ~ topological_space(X24)
| ~ top_str(X24) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])]) ).
cnf(c_0_34,lemma,
( is_often_in(esk1_0,esk2_0,X1)
| ~ point_neighbourhood(X1,esk1_0,esk3_0)
| ~ one_sorted_str(esk1_0) ),
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_31,c_0_32]),c_0_23]),c_0_24]),c_0_25])]),c_0_27]),c_0_26]) ).
cnf(c_0_35,plain,
( point_neighbourhood(esk4_3(X1,X2,X3),X1,X3)
| is_a_cluster_point_of_netstr(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ element(X3,the_carrier(X1))
| ~ net_str(X2,X1)
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_37,plain,
( is_a_cluster_point_of_netstr(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,esk4_3(X1,X2,X3))
| ~ element(X3,the_carrier(X1))
| ~ net_str(X2,X1)
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_38,lemma,
( is_a_cluster_point_of_netstr(esk1_0,X1,esk3_0)
| is_often_in(esk1_0,esk2_0,esk4_3(esk1_0,X1,esk3_0))
| empty_carrier(X1)
| ~ net_str(X1,esk1_0)
| ~ one_sorted_str(esk1_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_34,c_0_35]),c_0_21]),c_0_22]),c_0_36])]),c_0_27]) ).
cnf(c_0_39,negated_conjecture,
~ is_a_cluster_point_of_netstr(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_40,plain,
! [X79] :
( ~ top_str(X79)
| one_sorted_str(X79) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
cnf(c_0_41,lemma,
~ one_sorted_str(esk1_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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_21]),c_0_22]),c_0_36]),c_0_25])]),c_0_39]),c_0_27]),c_0_26]) ).
cnf(c_0_42,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_40]) ).
cnf(c_0_43,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.18 % Problem : SEU386+2 : TPTP v8.1.2. Released v3.3.0.
% 0.18/0.19 % Command : run_E %s %d THM
% 0.18/0.39 % Computer : n016.cluster.edu
% 0.18/0.39 % Model : x86_64 x86_64
% 0.18/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.39 % Memory : 8042.1875MB
% 0.18/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.39 % CPULimit : 2400
% 0.18/0.39 % WCLimit : 300
% 0.18/0.39 % DateTime : Mon Oct 2 09:55:51 EDT 2023
% 0.18/0.39 % CPUTime :
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 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/tmp/tmp.avS4QUJn84/E---3.1_14851.p
% 25.17/3.84 # Version: 3.1pre001
% 25.17/3.84 # Preprocessing class: FSLMSMSSSSSNFFN.
% 25.17/3.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.17/3.84 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 25.17/3.84 # Starting new_bool_3 with 600s (2) cores
% 25.17/3.84 # Starting new_bool_1 with 600s (2) cores
% 25.17/3.84 # Starting sh5l with 300s (1) cores
% 25.17/3.84 # new_bool_3 with pid 14931 completed with status 0
% 25.17/3.84 # Result found by new_bool_3
% 25.17/3.84 # Preprocessing class: FSLMSMSSSSSNFFN.
% 25.17/3.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.17/3.84 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 25.17/3.84 # Starting new_bool_3 with 600s (2) cores
% 25.17/3.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.17/3.84 # Search class: FGHSM-FSLM32-MFFFFFNN
% 25.17/3.84 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 25.17/3.84 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 25.17/3.84 # Starting new_bool_3 with 61s (1) cores
% 25.17/3.84 # G-E--_303_C18_F1_URBAN_S0Y with pid 14934 completed with status 0
% 25.17/3.84 # Result found by G-E--_303_C18_F1_URBAN_S0Y
% 25.17/3.84 # Preprocessing class: FSLMSMSSSSSNFFN.
% 25.17/3.84 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.17/3.84 # Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 25.17/3.84 # Starting new_bool_3 with 600s (2) cores
% 25.17/3.84 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 25.17/3.84 # Search class: FGHSM-FSLM32-MFFFFFNN
% 25.17/3.84 # Scheduled 12 strats onto 2 cores with 600 seconds (600 total)
% 25.17/3.84 # Starting G-E--_303_C18_F1_URBAN_S0Y with 50s (1) cores
% 25.17/3.84 # Preprocessing time : 0.009 s
% 25.17/3.84
% 25.17/3.84 # Proof found!
% 25.17/3.84 # SZS status Theorem
% 25.17/3.84 # SZS output start CNFRefutation
% See solution above
% 25.17/3.84 # Parsed axioms : 856
% 25.17/3.84 # Removed by relevancy pruning/SinE : 757
% 25.17/3.84 # Initial clauses : 324
% 25.17/3.84 # Removed in clause preprocessing : 0
% 25.17/3.84 # Initial clauses in saturation : 324
% 25.17/3.84 # Processed clauses : 3589
% 25.17/3.84 # ...of these trivial : 1
% 25.17/3.84 # ...subsumed : 1576
% 25.17/3.84 # ...remaining for further processing : 2012
% 25.17/3.84 # Other redundant clauses eliminated : 39
% 25.17/3.84 # Clauses deleted for lack of memory : 0
% 25.17/3.84 # Backward-subsumed : 229
% 25.17/3.84 # Backward-rewritten : 17
% 25.17/3.84 # Generated clauses : 59062
% 25.17/3.84 # ...of the previous two non-redundant : 58589
% 25.17/3.84 # ...aggressively subsumed : 0
% 25.17/3.84 # Contextual simplify-reflections : 147
% 25.17/3.84 # Paramodulations : 58970
% 25.17/3.84 # Factorizations : 2
% 25.17/3.84 # NegExts : 0
% 25.17/3.84 # Equation resolutions : 90
% 25.17/3.84 # Total rewrite steps : 1579
% 25.17/3.84 # Propositional unsat checks : 0
% 25.17/3.84 # Propositional check models : 0
% 25.17/3.84 # Propositional check unsatisfiable : 0
% 25.17/3.84 # Propositional clauses : 0
% 25.17/3.84 # Propositional clauses after purity: 0
% 25.17/3.84 # Propositional unsat core size : 0
% 25.17/3.84 # Propositional preprocessing time : 0.000
% 25.17/3.84 # Propositional encoding time : 0.000
% 25.17/3.84 # Propositional solver time : 0.000
% 25.17/3.84 # Success case prop preproc time : 0.000
% 25.17/3.84 # Success case prop encoding time : 0.000
% 25.17/3.84 # Success case prop solver time : 0.000
% 25.17/3.84 # Current number of processed clauses : 1727
% 25.17/3.84 # Positive orientable unit clauses : 32
% 25.17/3.84 # Positive unorientable unit clauses: 0
% 25.17/3.84 # Negative unit clauses : 32
% 25.17/3.84 # Non-unit-clauses : 1663
% 25.17/3.84 # Current number of unprocessed clauses: 55111
% 25.17/3.84 # ...number of literals in the above : 574168
% 25.17/3.84 # Current number of archived formulas : 0
% 25.17/3.84 # Current number of archived clauses : 246
% 25.17/3.84 # Clause-clause subsumption calls (NU) : 1202337
% 25.17/3.84 # Rec. Clause-clause subsumption calls : 106962
% 25.17/3.84 # Non-unit clause-clause subsumptions : 1392
% 25.17/3.84 # Unit Clause-clause subsumption calls : 7154
% 25.17/3.84 # Rewrite failures with RHS unbound : 0
% 25.17/3.84 # BW rewrite match attempts : 34
% 25.17/3.84 # BW rewrite match successes : 7
% 25.17/3.84 # Condensation attempts : 0
% 25.17/3.84 # Condensation successes : 0
% 25.17/3.84 # Termbank termtop insertions : 2096381
% 25.17/3.84
% 25.17/3.84 # -------------------------------------------------
% 25.17/3.84 # User time : 3.129 s
% 25.17/3.84 # System time : 0.073 s
% 25.17/3.84 # Total time : 3.202 s
% 25.17/3.84 # Maximum resident set size: 3816 pages
% 25.17/3.84
% 25.17/3.84 # -------------------------------------------------
% 25.17/3.84 # User time : 6.340 s
% 25.17/3.84 # System time : 0.078 s
% 25.17/3.84 # Total time : 6.418 s
% 25.17/3.84 # Maximum resident set size: 2900 pages
% 25.17/3.84 % E---3.1 exiting
% 25.17/3.84 % E---3.1 exiting
%------------------------------------------------------------------------------