TSTP Solution File: SEU395+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : SEU395+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:31:57 EDT 2023
% Result : Theorem 0.16s 0.66s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 59 ( 13 unt; 0 def)
% Number of atoms : 434 ( 5 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 586 ( 211 ~; 229 |; 116 &)
% ( 4 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 7 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 81 ( 0 sgn; 55 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_yellow19,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))
<=> is_a_convergence_point_of_set(X1,X2,X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',t18_yellow19) ).
fof(t15_yellow19,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',t15_yellow19) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',dt_l1_pre_topc) ).
fof(t13_yellow19,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,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
<=> is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3) ) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',t13_yellow19) ).
fof(fc5_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& reflexive_relstr(net_of_bool_filter(X1,X2,X3))
& transitive_relstr(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
& directed_relstr(net_of_bool_filter(X1,X2,X3)) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',fc5_yellow19) ).
fof(dt_k3_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
& net_str(net_of_bool_filter(X1,X2,X3),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',dt_k3_yellow19) ).
fof(fc4_yellow19,axiom,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& reflexive_relstr(net_of_bool_filter(X1,X2,X3))
& transitive_relstr(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',fc4_yellow19) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',fc2_pre_topc) ).
fof(dt_k2_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> element(cast_as_carrier_subset(X1),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p',dt_k2_pre_topc) ).
fof(c_0_9,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& topological_space(X1)
& top_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)))
<=> is_a_convergence_point_of_set(X1,X2,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t18_yellow19])]) ).
fof(c_0_10,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
& proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
& element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) )
=> X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2)) ) ),
inference(fof_simplification,[status(thm)],[t15_yellow19]) ).
fof(c_0_11,plain,
! [X65] :
( ~ top_str(X65)
| one_sorted_str(X65) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
fof(c_0_12,negated_conjecture,
( ~ empty_carrier(esk46_0)
& topological_space(esk46_0)
& top_str(esk46_0)
& ~ empty(esk47_0)
& filtered_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0)))
& upper_relstr_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0)))
& proper_element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0)))))
& element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0)))))
& element(esk48_0,the_carrier(esk46_0))
& ( ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| ~ is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0) )
& ( in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0) ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).
fof(c_0_13,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,the_carrier(X1))
=> ( in(X3,lim_points_of_net(X1,X2))
<=> is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[t13_yellow19]) ).
fof(c_0_14,plain,
! [X209,X210] :
( empty_carrier(X209)
| ~ one_sorted_str(X209)
| empty(X210)
| ~ filtered_subset(X210,boole_POSet(cast_as_carrier_subset(X209)))
| ~ upper_relstr_subset(X210,boole_POSet(cast_as_carrier_subset(X209)))
| ~ proper_element(X210,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X209)))))
| ~ element(X210,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X209)))))
| X210 = filter_of_net_str(X209,net_of_bool_filter(X209,cast_as_carrier_subset(X209),X210)) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,negated_conjecture,
top_str(esk46_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X206,X207,X208] :
( ( ~ in(X208,lim_points_of_net(X206,X207))
| is_a_convergence_point_of_set(X206,filter_of_net_str(X206,X207),X208)
| ~ element(X208,the_carrier(X206))
| empty_carrier(X207)
| ~ transitive_relstr(X207)
| ~ directed_relstr(X207)
| ~ net_str(X207,X206)
| empty_carrier(X206)
| ~ topological_space(X206)
| ~ top_str(X206) )
& ( ~ is_a_convergence_point_of_set(X206,filter_of_net_str(X206,X207),X208)
| in(X208,lim_points_of_net(X206,X207))
| ~ element(X208,the_carrier(X206))
| empty_carrier(X207)
| ~ transitive_relstr(X207)
| ~ directed_relstr(X207)
| ~ net_str(X207,X206)
| empty_carrier(X206)
| ~ topological_space(X206)
| ~ top_str(X206) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
cnf(c_0_18,plain,
( empty_carrier(X1)
| empty(X2)
| X2 = filter_of_net_str(X1,net_of_bool_filter(X1,cast_as_carrier_subset(X1),X2))
| ~ one_sorted_str(X1)
| ~ filtered_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ upper_relstr_subset(X2,boole_POSet(cast_as_carrier_subset(X1)))
| ~ proper_element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1)))))
| ~ element(X2,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X1))))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
proper_element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0))))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,negated_conjecture,
upper_relstr_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_21,negated_conjecture,
filtered_subset(esk47_0,boole_POSet(cast_as_carrier_subset(esk46_0))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,negated_conjecture,
element(esk47_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk46_0))))),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
~ empty(esk47_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_24,negated_conjecture,
~ empty_carrier(esk46_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_25,negated_conjecture,
one_sorted_str(esk46_0),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_26,plain,
( is_a_convergence_point_of_set(X2,filter_of_net_str(X2,X3),X1)
| empty_carrier(X3)
| empty_carrier(X2)
| ~ in(X1,lim_points_of_net(X2,X3))
| ~ element(X1,the_carrier(X2))
| ~ transitive_relstr(X3)
| ~ directed_relstr(X3)
| ~ net_str(X3,X2)
| ~ topological_space(X2)
| ~ top_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_27,negated_conjecture,
filter_of_net_str(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)) = esk47_0,
inference(cn,[status(thm)],[inference(rw,[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_18,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]),c_0_24]),c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
topological_space(esk46_0),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_29,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& reflexive_relstr(net_of_bool_filter(X1,X2,X3))
& transitive_relstr(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
& directed_relstr(net_of_bool_filter(X1,X2,X3)) ) ),
inference(fof_simplification,[status(thm)],[fc5_yellow19]) ).
cnf(c_0_30,plain,
( in(X3,lim_points_of_net(X1,X2))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3)
| ~ element(X3,the_carrier(X1))
| ~ transitive_relstr(X2)
| ~ directed_relstr(X2)
| ~ net_str(X2,X1)
| ~ topological_space(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_31,negated_conjecture,
( ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| ~ is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_32,negated_conjecture,
( is_a_convergence_point_of_set(esk46_0,esk47_0,X1)
| empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ element(X1,the_carrier(esk46_0))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ in(X1,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_28])]),c_0_24]) ).
cnf(c_0_33,negated_conjecture,
element(esk48_0,the_carrier(esk46_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_34,plain,
! [X112,X113,X114] :
( ( ~ empty_carrier(net_of_bool_filter(X112,X113,X114))
| empty_carrier(X112)
| ~ one_sorted_str(X112)
| empty(X113)
| ~ element(X113,powerset(the_carrier(X112)))
| empty(X114)
| ~ filtered_subset(X114,boole_POSet(X113))
| ~ upper_relstr_subset(X114,boole_POSet(X113))
| ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
| ~ element(X114,powerset(the_carrier(boole_POSet(X113)))) )
& ( reflexive_relstr(net_of_bool_filter(X112,X113,X114))
| empty_carrier(X112)
| ~ one_sorted_str(X112)
| empty(X113)
| ~ element(X113,powerset(the_carrier(X112)))
| empty(X114)
| ~ filtered_subset(X114,boole_POSet(X113))
| ~ upper_relstr_subset(X114,boole_POSet(X113))
| ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
| ~ element(X114,powerset(the_carrier(boole_POSet(X113)))) )
& ( transitive_relstr(net_of_bool_filter(X112,X113,X114))
| empty_carrier(X112)
| ~ one_sorted_str(X112)
| empty(X113)
| ~ element(X113,powerset(the_carrier(X112)))
| empty(X114)
| ~ filtered_subset(X114,boole_POSet(X113))
| ~ upper_relstr_subset(X114,boole_POSet(X113))
| ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
| ~ element(X114,powerset(the_carrier(boole_POSet(X113)))) )
& ( strict_net_str(net_of_bool_filter(X112,X113,X114),X112)
| empty_carrier(X112)
| ~ one_sorted_str(X112)
| empty(X113)
| ~ element(X113,powerset(the_carrier(X112)))
| empty(X114)
| ~ filtered_subset(X114,boole_POSet(X113))
| ~ upper_relstr_subset(X114,boole_POSet(X113))
| ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
| ~ element(X114,powerset(the_carrier(boole_POSet(X113)))) )
& ( directed_relstr(net_of_bool_filter(X112,X113,X114))
| empty_carrier(X112)
| ~ one_sorted_str(X112)
| empty(X113)
| ~ element(X113,powerset(the_carrier(X112)))
| empty(X114)
| ~ filtered_subset(X114,boole_POSet(X113))
| ~ upper_relstr_subset(X114,boole_POSet(X113))
| ~ proper_element(X114,powerset(the_carrier(boole_POSet(X113))))
| ~ element(X114,powerset(the_carrier(boole_POSet(X113)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])]) ).
cnf(c_0_35,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| in(X1,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| ~ is_a_convergence_point_of_set(esk46_0,esk47_0,X1)
| ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ element(X1,the_carrier(esk46_0))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_16]),c_0_28])]),c_0_24]) ).
cnf(c_0_36,negated_conjecture,
( in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| is_a_convergence_point_of_set(esk46_0,esk47_0,esk48_0) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_37,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ in(esk48_0,lim_points_of_net(esk46_0,net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0)))
| ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33])]) ).
cnf(c_0_38,plain,
( directed_relstr(net_of_bool_filter(X1,X2,X3))
| empty_carrier(X1)
| empty(X2)
| empty(X3)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X3,boole_POSet(X2))
| ~ upper_relstr_subset(X3,boole_POSet(X2))
| ~ proper_element(X3,powerset(the_carrier(boole_POSet(X2))))
| ~ element(X3,powerset(the_carrier(boole_POSet(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
fof(c_0_39,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1)
& net_str(net_of_bool_filter(X1,X2,X3),X1) ) ),
inference(fof_simplification,[status(thm)],[dt_k3_yellow19]) ).
cnf(c_0_40,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ directed_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33])]),c_0_37]) ).
cnf(c_0_41,negated_conjecture,
( directed_relstr(net_of_bool_filter(X1,cast_as_carrier_subset(esk46_0),esk47_0))
| empty(cast_as_carrier_subset(esk46_0))
| empty_carrier(X1)
| ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
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_38,c_0_19]),c_0_20]),c_0_21]),c_0_22])]),c_0_23]) ).
fof(c_0_42,plain,
! [X60,X61,X62] :
( ( ~ empty_carrier(net_of_bool_filter(X60,X61,X62))
| empty_carrier(X60)
| ~ one_sorted_str(X60)
| empty(X61)
| ~ element(X61,powerset(the_carrier(X60)))
| empty(X62)
| ~ filtered_subset(X62,boole_POSet(X61))
| ~ upper_relstr_subset(X62,boole_POSet(X61))
| ~ element(X62,powerset(the_carrier(boole_POSet(X61)))) )
& ( strict_net_str(net_of_bool_filter(X60,X61,X62),X60)
| empty_carrier(X60)
| ~ one_sorted_str(X60)
| empty(X61)
| ~ element(X61,powerset(the_carrier(X60)))
| empty(X62)
| ~ filtered_subset(X62,boole_POSet(X61))
| ~ upper_relstr_subset(X62,boole_POSet(X61))
| ~ element(X62,powerset(the_carrier(boole_POSet(X61)))) )
& ( net_str(net_of_bool_filter(X60,X61,X62),X60)
| empty_carrier(X60)
| ~ one_sorted_str(X60)
| empty(X61)
| ~ element(X61,powerset(the_carrier(X60)))
| empty(X62)
| ~ filtered_subset(X62,boole_POSet(X61))
| ~ upper_relstr_subset(X62,boole_POSet(X61))
| ~ element(X62,powerset(the_carrier(boole_POSet(X61)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])]) ).
fof(c_0_43,plain,
! [X1,X2,X3] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1)
& ~ empty(X2)
& element(X2,powerset(the_carrier(X1)))
& ~ empty(X3)
& filtered_subset(X3,boole_POSet(X2))
& upper_relstr_subset(X3,boole_POSet(X2))
& element(X3,powerset(the_carrier(boole_POSet(X2)))) )
=> ( ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
& reflexive_relstr(net_of_bool_filter(X1,X2,X3))
& transitive_relstr(net_of_bool_filter(X1,X2,X3))
& strict_net_str(net_of_bool_filter(X1,X2,X3),X1) ) ),
inference(fof_simplification,[status(thm)],[fc4_yellow19]) ).
cnf(c_0_44,negated_conjecture,
( empty(cast_as_carrier_subset(esk46_0))
| empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ net_str(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0),esk46_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25])]),c_0_24]) ).
cnf(c_0_45,plain,
( net_str(net_of_bool_filter(X1,X2,X3),X1)
| empty_carrier(X1)
| empty(X2)
| empty(X3)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X3,boole_POSet(X2))
| ~ upper_relstr_subset(X3,boole_POSet(X2))
| ~ element(X3,powerset(the_carrier(boole_POSet(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
fof(c_0_46,plain,
! [X107,X108,X109] :
( ( ~ empty_carrier(net_of_bool_filter(X107,X108,X109))
| empty_carrier(X107)
| ~ one_sorted_str(X107)
| empty(X108)
| ~ element(X108,powerset(the_carrier(X107)))
| empty(X109)
| ~ filtered_subset(X109,boole_POSet(X108))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ element(X109,powerset(the_carrier(boole_POSet(X108)))) )
& ( reflexive_relstr(net_of_bool_filter(X107,X108,X109))
| empty_carrier(X107)
| ~ one_sorted_str(X107)
| empty(X108)
| ~ element(X108,powerset(the_carrier(X107)))
| empty(X109)
| ~ filtered_subset(X109,boole_POSet(X108))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ element(X109,powerset(the_carrier(boole_POSet(X108)))) )
& ( transitive_relstr(net_of_bool_filter(X107,X108,X109))
| empty_carrier(X107)
| ~ one_sorted_str(X107)
| empty(X108)
| ~ element(X108,powerset(the_carrier(X107)))
| empty(X109)
| ~ filtered_subset(X109,boole_POSet(X108))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ element(X109,powerset(the_carrier(boole_POSet(X108)))) )
& ( strict_net_str(net_of_bool_filter(X107,X108,X109),X107)
| empty_carrier(X107)
| ~ one_sorted_str(X107)
| empty(X108)
| ~ element(X108,powerset(the_carrier(X107)))
| empty(X109)
| ~ filtered_subset(X109,boole_POSet(X108))
| ~ upper_relstr_subset(X109,boole_POSet(X108))
| ~ element(X109,powerset(the_carrier(boole_POSet(X108)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_43])])]) ).
cnf(c_0_47,negated_conjecture,
( empty(cast_as_carrier_subset(esk46_0))
| empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_0)))
| ~ transitive_relstr(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_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(spm,[status(thm)],[c_0_44,c_0_45]),c_0_20]),c_0_21]),c_0_22]),c_0_25])]),c_0_23]),c_0_24]) ).
cnf(c_0_48,plain,
( transitive_relstr(net_of_bool_filter(X1,X2,X3))
| empty_carrier(X1)
| empty(X2)
| empty(X3)
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X3,boole_POSet(X2))
| ~ upper_relstr_subset(X3,boole_POSet(X2))
| ~ element(X3,powerset(the_carrier(boole_POSet(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
fof(c_0_49,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
inference(fof_simplification,[status(thm)],[fc2_pre_topc]) ).
cnf(c_0_50,plain,
( empty_carrier(X1)
| empty(X2)
| empty(X3)
| ~ empty_carrier(net_of_bool_filter(X1,X2,X3))
| ~ one_sorted_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ filtered_subset(X3,boole_POSet(X2))
| ~ upper_relstr_subset(X3,boole_POSet(X2))
| ~ element(X3,powerset(the_carrier(boole_POSet(X2)))) ),
inference(split_conjunct,[status(thm)],[c_0_42]) ).
cnf(c_0_51,negated_conjecture,
( empty(cast_as_carrier_subset(esk46_0))
| empty_carrier(net_of_bool_filter(esk46_0,cast_as_carrier_subset(esk46_0),esk47_0))
| ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_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(spm,[status(thm)],[c_0_47,c_0_48]),c_0_20]),c_0_21]),c_0_22]),c_0_25])]),c_0_23]),c_0_24]) ).
fof(c_0_52,plain,
! [X57] :
( ~ one_sorted_str(X57)
| element(cast_as_carrier_subset(X57),powerset(the_carrier(X57))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])]) ).
fof(c_0_53,plain,
! [X95] :
( empty_carrier(X95)
| ~ one_sorted_str(X95)
| ~ empty(cast_as_carrier_subset(X95)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_49])]) ).
cnf(c_0_54,negated_conjecture,
( empty(cast_as_carrier_subset(esk46_0))
| ~ element(cast_as_carrier_subset(esk46_0),powerset(the_carrier(esk46_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(spm,[status(thm)],[c_0_50,c_0_51]),c_0_20]),c_0_21]),c_0_22]),c_0_25])]),c_0_23]),c_0_24]) ).
cnf(c_0_55,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_56,plain,
( empty_carrier(X1)
| ~ one_sorted_str(X1)
| ~ empty(cast_as_carrier_subset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_53]) ).
cnf(c_0_57,negated_conjecture,
empty(cast_as_carrier_subset(esk46_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_25])]) ).
cnf(c_0_58,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_25])]),c_0_24]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEU395+1 : TPTP v8.1.2. Released v3.3.0.
% 0.06/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 09:24:53 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.45 Running first-order model finding
% 0.16/0.45 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.QKUPFmKLPP/E---3.1_14720.p
% 0.16/0.66 # Version: 3.1pre001
% 0.16/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.66 # Starting new_bool_3 with 300s (1) cores
% 0.16/0.66 # Starting new_bool_1 with 300s (1) cores
% 0.16/0.66 # Starting sh5l with 300s (1) cores
% 0.16/0.66 # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 14807 completed with status 0
% 0.16/0.66 # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.16/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.66 # No SInE strategy applied
% 0.16/0.66 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.16/0.66 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.16/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.66 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.16/0.66 # Starting U----_116Y_C05_02_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.16/0.66 # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 136s (1) cores
% 0.16/0.66 # G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with pid 14815 completed with status 0
% 0.16/0.66 # Result found by G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y
% 0.16/0.66 # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.16/0.66 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.16/0.66 # No SInE strategy applied
% 0.16/0.66 # Search class: FGHSM-FSLM31-MFFFFFNN
% 0.16/0.66 # Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.66 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 675s (1) cores
% 0.16/0.66 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.16/0.66 # Starting G-E--_207_B07_F1_AE_CS_SP_PI_PS_S0Y with 136s (1) cores
% 0.16/0.66 # Preprocessing time : 0.004 s
% 0.16/0.66 # Presaturation interreduction done
% 0.16/0.66
% 0.16/0.66 # Proof found!
% 0.16/0.66 # SZS status Theorem
% 0.16/0.66 # SZS output start CNFRefutation
% See solution above
% 0.16/0.66 # Parsed axioms : 136
% 0.16/0.66 # Removed by relevancy pruning/SinE : 0
% 0.16/0.66 # Initial clauses : 443
% 0.16/0.66 # Removed in clause preprocessing : 35
% 0.16/0.66 # Initial clauses in saturation : 408
% 0.16/0.66 # Processed clauses : 2131
% 0.16/0.66 # ...of these trivial : 53
% 0.16/0.66 # ...subsumed : 892
% 0.16/0.66 # ...remaining for further processing : 1186
% 0.16/0.66 # Other redundant clauses eliminated : 3
% 0.16/0.66 # Clauses deleted for lack of memory : 0
% 0.16/0.66 # Backward-subsumed : 58
% 0.16/0.66 # Backward-rewritten : 12
% 0.16/0.66 # Generated clauses : 3936
% 0.16/0.66 # ...of the previous two non-redundant : 3670
% 0.16/0.66 # ...aggressively subsumed : 0
% 0.16/0.66 # Contextual simplify-reflections : 47
% 0.16/0.66 # Paramodulations : 3923
% 0.16/0.66 # Factorizations : 2
% 0.16/0.66 # NegExts : 0
% 0.16/0.66 # Equation resolutions : 11
% 0.16/0.66 # Total rewrite steps : 584
% 0.16/0.66 # Propositional unsat checks : 0
% 0.16/0.66 # Propositional check models : 0
% 0.16/0.66 # Propositional check unsatisfiable : 0
% 0.16/0.66 # Propositional clauses : 0
% 0.16/0.66 # Propositional clauses after purity: 0
% 0.16/0.66 # Propositional unsat core size : 0
% 0.16/0.66 # Propositional preprocessing time : 0.000
% 0.16/0.66 # Propositional encoding time : 0.000
% 0.16/0.66 # Propositional solver time : 0.000
% 0.16/0.66 # Success case prop preproc time : 0.000
% 0.16/0.66 # Success case prop encoding time : 0.000
% 0.16/0.66 # Success case prop solver time : 0.000
% 0.16/0.66 # Current number of processed clauses : 776
% 0.16/0.66 # Positive orientable unit clauses : 147
% 0.16/0.66 # Positive unorientable unit clauses: 0
% 0.16/0.66 # Negative unit clauses : 39
% 0.16/0.66 # Non-unit-clauses : 590
% 0.16/0.66 # Current number of unprocessed clauses: 2187
% 0.16/0.66 # ...number of literals in the above : 11768
% 0.16/0.66 # Current number of archived formulas : 0
% 0.16/0.66 # Current number of archived clauses : 409
% 0.16/0.66 # Clause-clause subsumption calls (NU) : 220457
% 0.16/0.66 # Rec. Clause-clause subsumption calls : 52261
% 0.16/0.66 # Non-unit clause-clause subsumptions : 895
% 0.16/0.66 # Unit Clause-clause subsumption calls : 5281
% 0.16/0.66 # Rewrite failures with RHS unbound : 0
% 0.16/0.66 # BW rewrite match attempts : 46
% 0.16/0.66 # BW rewrite match successes : 9
% 0.16/0.66 # Condensation attempts : 0
% 0.16/0.66 # Condensation successes : 0
% 0.16/0.66 # Termbank termtop insertions : 84360
% 0.16/0.66
% 0.16/0.66 # -------------------------------------------------
% 0.16/0.66 # User time : 0.179 s
% 0.16/0.66 # System time : 0.011 s
% 0.16/0.66 # Total time : 0.191 s
% 0.16/0.66 # Maximum resident set size: 2856 pages
% 0.16/0.66
% 0.16/0.66 # -------------------------------------------------
% 0.16/0.66 # User time : 0.879 s
% 0.16/0.66 # System time : 0.038 s
% 0.16/0.66 # Total time : 0.917 s
% 0.16/0.66 # Maximum resident set size: 1864 pages
% 0.16/0.66 % E---3.1 exiting
%------------------------------------------------------------------------------