TSTP Solution File: SEU395+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU395+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% 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 : 300s
% WCLimit : 600s
% DateTime : Tue Jul 19 09:19:39 EDT 2022
% Result : Theorem 0.25s 1.41s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 53 ( 13 unt; 0 def)
% Number of atoms : 376 ( 4 equ)
% Maximal formula atoms : 50 ( 7 avg)
% Number of connectives : 516 ( 193 ~; 229 |; 74 &)
% ( 3 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 6 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 : 66 ( 0 sgn 40 !; 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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t18_yellow19) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_pre_topc) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t15_yellow19) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc4_yellow19) ).
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/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_pre_topc) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc2_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(assume_negation,[status(cth)],[t18_yellow19]) ).
fof(c_0_10,plain,
! [X2] :
( ~ top_str(X2)
| one_sorted_str(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])]) ).
fof(c_0_11,negated_conjecture,
( ~ empty_carrier(esk1_0)
& topological_space(esk1_0)
& top_str(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0)))
& proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))
& element(esk3_0,the_carrier(esk1_0))
& ( ~ in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,esk3_0) )
& ( in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)))
| is_a_convergence_point_of_set(esk1_0,esk2_0,esk3_0) ) ),
inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_9])])])])])]) ).
fof(c_0_12,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ one_sorted_str(X3)
| empty(X4)
| ~ filtered_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))
| ~ upper_relstr_subset(X4,boole_POSet(cast_as_carrier_subset(X3)))
| ~ proper_element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3)))))
| ~ element(X4,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X3)))))
| X4 = filter_of_net_str(X3,net_of_bool_filter(X3,cast_as_carrier_subset(X3),X4)) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t15_yellow19])])])])])]) ).
cnf(c_0_13,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X4,X5,X6] :
( ( ~ in(X6,lim_points_of_net(X4,X5))
| is_a_convergence_point_of_set(X4,filter_of_net_str(X4,X5),X6)
| ~ element(X6,the_carrier(X4))
| empty_carrier(X5)
| ~ transitive_relstr(X5)
| ~ directed_relstr(X5)
| ~ net_str(X5,X4)
| empty_carrier(X4)
| ~ topological_space(X4)
| ~ top_str(X4) )
& ( ~ is_a_convergence_point_of_set(X4,filter_of_net_str(X4,X5),X6)
| in(X6,lim_points_of_net(X4,X5))
| ~ element(X6,the_carrier(X4))
| empty_carrier(X5)
| ~ transitive_relstr(X5)
| ~ directed_relstr(X5)
| ~ net_str(X5,X4)
| empty_carrier(X4)
| ~ topological_space(X4)
| ~ top_str(X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[t13_yellow19])])])])])])]) ).
cnf(c_0_16,plain,
( X1 = filter_of_net_str(X2,net_of_bool_filter(X2,cast_as_carrier_subset(X2),X1))
| empty(X1)
| empty_carrier(X2)
| ~ element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X2)))))
| ~ proper_element(X1,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(X2)))))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ one_sorted_str(X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_23,negated_conjecture,
one_sorted_str(esk1_0),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_24,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3)
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ element(X3,the_carrier(X1))
| ~ in(X3,lim_points_of_net(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)) = esk2_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_16,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]),c_0_22]),c_0_23])]) ).
cnf(c_0_26,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_27,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(X3,lim_points_of_net(X1,X2))
| ~ top_str(X1)
| ~ topological_space(X1)
| ~ net_str(X2,X1)
| ~ directed_relstr(X2)
| ~ transitive_relstr(X2)
| ~ element(X3,the_carrier(X1))
| ~ is_a_convergence_point_of_set(X1,filter_of_net_str(X1,X2),X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_28,negated_conjecture,
( ~ is_a_convergence_point_of_set(esk1_0,esk2_0,esk3_0)
| ~ in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ directed_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)))
| ~ net_str(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_14]),c_0_26])]),c_0_22]) ).
cnf(c_0_30,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_31,plain,
! [X4,X5,X6] :
( ( ~ empty_carrier(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ proper_element(X6,powerset(the_carrier(boole_POSet(X5))))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( reflexive_relstr(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ proper_element(X6,powerset(the_carrier(boole_POSet(X5))))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( transitive_relstr(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ proper_element(X6,powerset(the_carrier(boole_POSet(X5))))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( strict_net_str(net_of_bool_filter(X4,X5,X6),X4)
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ proper_element(X6,powerset(the_carrier(boole_POSet(X5))))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( directed_relstr(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ proper_element(X6,powerset(the_carrier(boole_POSet(X5))))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc5_yellow19])])])]) ).
cnf(c_0_32,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| ~ directed_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ net_str(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_25]),c_0_14]),c_0_26])]),c_0_22]) ).
cnf(c_0_33,negated_conjecture,
( is_a_convergence_point_of_set(esk1_0,esk2_0,esk3_0)
| in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_34,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ directed_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)))
| ~ net_str(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]) ).
cnf(c_0_35,plain,
( empty(X1)
| empty(X2)
| empty_carrier(X3)
| directed_relstr(net_of_bool_filter(X3,X2,X1))
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ proper_element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_36,negated_conjecture,
( empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ directed_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ net_str(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0),esk1_0) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_30])]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
( directed_relstr(net_of_bool_filter(X1,cast_as_carrier_subset(esk1_0),esk2_0))
| empty(cast_as_carrier_subset(esk1_0))
| empty_carrier(X1)
| ~ element(cast_as_carrier_subset(esk1_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_35,c_0_17]),c_0_18]),c_0_19]),c_0_20])]),c_0_21]) ).
fof(c_0_38,plain,
! [X4,X5,X6] :
( ( ~ empty_carrier(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( strict_net_str(net_of_bool_filter(X4,X5,X6),X4)
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( net_str(net_of_bool_filter(X4,X5,X6),X4)
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[dt_k3_yellow19])])])]) ).
cnf(c_0_39,negated_conjecture,
( empty(cast_as_carrier_subset(esk1_0))
| empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(esk1_0)))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ net_str(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23])]),c_0_22]) ).
cnf(c_0_40,plain,
( empty(X1)
| empty(X2)
| empty_carrier(X3)
| net_str(net_of_bool_filter(X3,X2,X1),X3)
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
fof(c_0_41,plain,
! [X4,X5,X6] :
( ( ~ empty_carrier(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( reflexive_relstr(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( transitive_relstr(net_of_bool_filter(X4,X5,X6))
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) )
& ( strict_net_str(net_of_bool_filter(X4,X5,X6),X4)
| empty_carrier(X4)
| ~ one_sorted_str(X4)
| empty(X5)
| ~ element(X5,powerset(the_carrier(X4)))
| empty(X6)
| ~ filtered_subset(X6,boole_POSet(X5))
| ~ upper_relstr_subset(X6,boole_POSet(X5))
| ~ element(X6,powerset(the_carrier(boole_POSet(X5)))) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc4_yellow19])])])]) ).
cnf(c_0_42,negated_conjecture,
( empty(cast_as_carrier_subset(esk1_0))
| empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(esk1_0)))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_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_39,c_0_40]),c_0_18]),c_0_19]),c_0_20]),c_0_23])]),c_0_21]),c_0_22]) ).
cnf(c_0_43,plain,
( empty(X1)
| empty(X2)
| empty_carrier(X3)
| transitive_relstr(net_of_bool_filter(X3,X2,X1))
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_44,plain,
( empty(X1)
| empty(X2)
| empty_carrier(X3)
| ~ element(X1,powerset(the_carrier(boole_POSet(X2))))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ one_sorted_str(X3)
| ~ empty_carrier(net_of_bool_filter(X3,X2,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_45,negated_conjecture,
( empty(cast_as_carrier_subset(esk1_0))
| empty_carrier(net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0))
| ~ element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(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(spm,[status(thm)],[c_0_42,c_0_43]),c_0_18]),c_0_19]),c_0_20]),c_0_23])]),c_0_21]),c_0_22]) ).
fof(c_0_46,plain,
! [X2] :
( ~ one_sorted_str(X2)
| element(cast_as_carrier_subset(X2),powerset(the_carrier(X2))) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_pre_topc])]) ).
fof(c_0_47,plain,
! [X2] :
( empty_carrier(X2)
| ~ one_sorted_str(X2)
| ~ empty(cast_as_carrier_subset(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc2_pre_topc])])]) ).
cnf(c_0_48,negated_conjecture,
( empty(cast_as_carrier_subset(esk1_0))
| ~ element(cast_as_carrier_subset(esk1_0),powerset(the_carrier(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(spm,[status(thm)],[c_0_44,c_0_45]),c_0_18]),c_0_19]),c_0_20]),c_0_23])]),c_0_21]),c_0_22]) ).
cnf(c_0_49,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_50,plain,
( empty_carrier(X1)
| ~ empty(cast_as_carrier_subset(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_47]) ).
cnf(c_0_51,negated_conjecture,
empty(cast_as_carrier_subset(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_23])]) ).
cnf(c_0_52,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_23])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SEU395+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n018.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 20 05:05:50 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.25/1.41 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.41 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.41 # Preprocessing time : 0.025 s
% 0.25/1.41
% 0.25/1.41 # Proof found!
% 0.25/1.41 # SZS status Theorem
% 0.25/1.41 # SZS output start CNFRefutation
% See solution above
% 0.25/1.41 # Proof object total steps : 53
% 0.25/1.41 # Proof object clause steps : 34
% 0.25/1.41 # Proof object formula steps : 19
% 0.25/1.41 # Proof object conjectures : 27
% 0.25/1.41 # Proof object clause conjectures : 24
% 0.25/1.41 # Proof object formula conjectures : 3
% 0.25/1.41 # Proof object initial clauses used : 21
% 0.25/1.41 # Proof object initial formulas used : 9
% 0.25/1.41 # Proof object generating inferences : 13
% 0.25/1.41 # Proof object simplifying inferences : 55
% 0.25/1.41 # Training examples: 0 positive, 0 negative
% 0.25/1.41 # Parsed axioms : 136
% 0.25/1.41 # Removed by relevancy pruning/SinE : 80
% 0.25/1.41 # Initial clauses : 161
% 0.25/1.41 # Removed in clause preprocessing : 4
% 0.25/1.41 # Initial clauses in saturation : 157
% 0.25/1.41 # Processed clauses : 351
% 0.25/1.41 # ...of these trivial : 7
% 0.25/1.41 # ...subsumed : 90
% 0.25/1.41 # ...remaining for further processing : 254
% 0.25/1.41 # Other redundant clauses eliminated : 0
% 0.25/1.41 # Clauses deleted for lack of memory : 0
% 0.25/1.41 # Backward-subsumed : 11
% 0.25/1.41 # Backward-rewritten : 3
% 0.25/1.41 # Generated clauses : 442
% 0.25/1.41 # ...of the previous two non-trivial : 387
% 0.25/1.41 # Contextual simplify-reflections : 42
% 0.25/1.41 # Paramodulations : 438
% 0.25/1.41 # Factorizations : 4
% 0.25/1.41 # Equation resolutions : 0
% 0.25/1.41 # Current number of processed clauses : 240
% 0.25/1.41 # Positive orientable unit clauses : 78
% 0.25/1.41 # Positive unorientable unit clauses: 1
% 0.25/1.41 # Negative unit clauses : 24
% 0.25/1.41 # Non-unit-clauses : 137
% 0.25/1.41 # Current number of unprocessed clauses: 176
% 0.25/1.41 # ...number of literals in the above : 951
% 0.25/1.41 # Current number of archived formulas : 0
% 0.25/1.41 # Current number of archived clauses : 14
% 0.25/1.41 # Clause-clause subsumption calls (NU) : 14012
% 0.25/1.41 # Rec. Clause-clause subsumption calls : 3057
% 0.25/1.41 # Non-unit clause-clause subsumptions : 113
% 0.25/1.41 # Unit Clause-clause subsumption calls : 798
% 0.25/1.41 # Rewrite failures with RHS unbound : 12
% 0.25/1.41 # BW rewrite match attempts : 6
% 0.25/1.41 # BW rewrite match successes : 6
% 0.25/1.41 # Condensation attempts : 0
% 0.25/1.41 # Condensation successes : 0
% 0.25/1.41 # Termbank termtop insertions : 18504
% 0.25/1.41
% 0.25/1.41 # -------------------------------------------------
% 0.25/1.41 # User time : 0.055 s
% 0.25/1.41 # System time : 0.002 s
% 0.25/1.41 # Total time : 0.057 s
% 0.25/1.41 # Maximum resident set size: 4176 pages
% 0.25/23.41 eprover: CPU time limit exceeded, terminating
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.43 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.43 eprover: No such file or directory
% 0.25/23.44 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.44 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.45 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.45 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.46 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.46 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.47 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.47 eprover: No such file or directory
% 0.25/23.48 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.48 eprover: No such file or directory
% 0.25/23.49 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.25/23.49 eprover: No such file or directory
%------------------------------------------------------------------------------