TSTP Solution File: SEU395+2 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU395+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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 1.96s 231.15s
% Output : CNFRefutation 1.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 11
% Syntax : Number of formulae : 82 ( 31 unt; 0 def)
% Number of atoms : 446 ( 13 equ)
% Maximal formula atoms : 50 ( 5 avg)
% Number of connectives : 590 ( 226 ~; 269 |; 74 &)
% ( 3 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 6 ( 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 : 92 ( 0 sgn 44 !; 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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_pre_topc) ).
fof(t15_yellow19,lemma,
! [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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t15_yellow19) ).
fof(t4_waybel_7,lemma,
! [X1] : the_carrier(boole_POSet(X1)) = powerset(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_waybel_7) ).
fof(d3_pre_topc,axiom,
! [X1] :
( one_sorted_str(X1)
=> cast_as_carrier_subset(X1) = the_carrier(X1) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d3_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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k2_pre_topc) ).
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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc5_yellow19) ).
fof(fc2_pre_topc,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ~ empty(cast_as_carrier_subset(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc2_pre_topc) ).
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/sandbox2/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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc4_yellow19) ).
fof(t13_yellow19,lemma,
! [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/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t13_yellow19) ).
fof(c_0_11,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_12,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_13,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_11])])])])])]) ).
fof(c_0_14,lemma,
! [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])])])])])]) ).
fof(c_0_15,lemma,
! [X2] : the_carrier(boole_POSet(X2)) = powerset(X2),
inference(variable_rename,[status(thm)],[t4_waybel_7]) ).
fof(c_0_16,plain,
! [X2] :
( ~ one_sorted_str(X2)
| cast_as_carrier_subset(X2) = the_carrier(X2) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_pre_topc])]) ).
cnf(c_0_17,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,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])]) ).
cnf(c_0_20,lemma,
( 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_14]) ).
cnf(c_0_21,lemma,
the_carrier(boole_POSet(X1)) = powerset(X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_22,negated_conjecture,
proper_element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,negated_conjecture,
element(esk2_0,powerset(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0))))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_24,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_25,plain,
( cast_as_carrier_subset(X1) = the_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_26,negated_conjecture,
one_sorted_str(esk1_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_27,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_28,plain,
( element(cast_as_carrier_subset(X1),powerset(the_carrier(X1)))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_29,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_30,lemma,
( X1 = filter_of_net_str(X2,net_of_bool_filter(X2,cast_as_carrier_subset(X2),X1))
| empty_carrier(X2)
| empty(X1)
| ~ one_sorted_str(X2)
| ~ filtered_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ upper_relstr_subset(X1,boole_POSet(cast_as_carrier_subset(X2)))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(X2))))))
| ~ proper_element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(X2)))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_31,negated_conjecture,
proper_element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_32,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_33,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(cast_as_carrier_subset(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_34,negated_conjecture,
element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(cast_as_carrier_subset(esk1_0)))))),
inference(rw,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_35,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_36,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_37,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_24]) ).
cnf(c_0_38,negated_conjecture,
cast_as_carrier_subset(esk1_0) = the_carrier(esk1_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_39,plain,
( empty_carrier(X1)
| ~ empty(cast_as_carrier_subset(X1))
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( element(cast_as_carrier_subset(X1),the_carrier(boole_POSet(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
inference(rw,[status(thm)],[c_0_28,c_0_21]) ).
cnf(c_0_41,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_29]) ).
fof(c_0_42,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])])])]) ).
fof(c_0_43,lemma,
! [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_44,negated_conjecture,
( filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,cast_as_carrier_subset(esk1_0),esk2_0)) = esk2_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_30,c_0_31]),c_0_32]),c_0_33]),c_0_34])]),c_0_35]),c_0_36]) ).
cnf(c_0_45,plain,
( empty_carrier(X3)
| empty(X2)
| empty(X1)
| directed_relstr(net_of_bool_filter(X3,X2,X1))
| ~ one_sorted_str(X3)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X3))))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2)))))
| ~ proper_element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_37,c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_46,negated_conjecture,
proper_element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(the_carrier(esk1_0)))))),
inference(rw,[status(thm)],[c_0_31,c_0_38]) ).
cnf(c_0_47,negated_conjecture,
upper_relstr_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(rw,[status(thm)],[c_0_32,c_0_38]) ).
cnf(c_0_48,negated_conjecture,
filtered_subset(esk2_0,boole_POSet(the_carrier(esk1_0))),
inference(rw,[status(thm)],[c_0_33,c_0_38]) ).
cnf(c_0_49,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_38]),c_0_26])]),c_0_36]) ).
cnf(c_0_50,negated_conjecture,
element(esk2_0,the_carrier(boole_POSet(the_carrier(boole_POSet(the_carrier(esk1_0)))))),
inference(rw,[status(thm)],[c_0_34,c_0_38]) ).
cnf(c_0_51,negated_conjecture,
element(cast_as_carrier_subset(esk1_0),the_carrier(boole_POSet(the_carrier(esk1_0)))),
inference(spm,[status(thm)],[c_0_40,c_0_26]) ).
cnf(c_0_52,plain,
( empty_carrier(X3)
| empty(X2)
| empty(X1)
| ~ one_sorted_str(X3)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ empty_carrier(net_of_bool_filter(X3,X2,X1))
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X3))))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_21]),c_0_21]) ).
cnf(c_0_53,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_42]) ).
cnf(c_0_54,lemma,
( 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_43]) ).
cnf(c_0_55,negated_conjecture,
filter_of_net_str(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)) = esk2_0,
inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_26])]),c_0_38]) ).
cnf(c_0_56,negated_conjecture,
topological_space(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_57,negated_conjecture,
( directed_relstr(net_of_bool_filter(X1,the_carrier(esk1_0),esk2_0))
| empty_carrier(X1)
| ~ element(the_carrier(esk1_0),the_carrier(boole_POSet(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
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(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),c_0_48])]),c_0_35]),c_0_49]),c_0_50])]) ).
cnf(c_0_58,negated_conjecture,
element(the_carrier(esk1_0),the_carrier(boole_POSet(the_carrier(esk1_0)))),
inference(rw,[status(thm)],[c_0_51,c_0_38]) ).
cnf(c_0_59,negated_conjecture,
( empty_carrier(X1)
| ~ empty_carrier(net_of_bool_filter(X1,the_carrier(esk1_0),esk2_0))
| ~ element(the_carrier(esk1_0),the_carrier(boole_POSet(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_50]),c_0_47]),c_0_48])]),c_0_35]),c_0_49]) ).
cnf(c_0_60,plain,
( empty_carrier(X3)
| empty(X2)
| empty(X1)
| transitive_relstr(net_of_bool_filter(X3,X2,X1))
| ~ one_sorted_str(X3)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X3))))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_21]),c_0_21]) ).
cnf(c_0_61,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_29]) ).
cnf(c_0_62,lemma,
( empty_carrier(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0))
| in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| ~ directed_relstr(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0))
| ~ transitive_relstr(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ net_str(net_of_bool_filter(esk1_0,the_carrier(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_54,c_0_55]),c_0_18]),c_0_56])]),c_0_36]) ).
cnf(c_0_63,negated_conjecture,
directed_relstr(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_26])]),c_0_36]) ).
cnf(c_0_64,negated_conjecture,
~ empty_carrier(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_58]),c_0_26])]),c_0_36]) ).
cnf(c_0_65,negated_conjecture,
( transitive_relstr(net_of_bool_filter(X1,the_carrier(esk1_0),esk2_0))
| empty_carrier(X1)
| ~ element(the_carrier(esk1_0),the_carrier(boole_POSet(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_50]),c_0_47]),c_0_48])]),c_0_35]),c_0_49]) ).
cnf(c_0_66,plain,
( empty_carrier(X3)
| empty(X2)
| empty(X1)
| net_str(net_of_bool_filter(X3,X2,X1),X3)
| ~ one_sorted_str(X3)
| ~ filtered_subset(X1,boole_POSet(X2))
| ~ upper_relstr_subset(X1,boole_POSet(X2))
| ~ element(X2,the_carrier(boole_POSet(the_carrier(X3))))
| ~ element(X1,the_carrier(boole_POSet(the_carrier(boole_POSet(X2))))) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_21]),c_0_21]) ).
cnf(c_0_67,lemma,
( in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| ~ transitive_relstr(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0))
| ~ element(X1,the_carrier(esk1_0))
| ~ net_str(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_62,c_0_63])]),c_0_64]) ).
cnf(c_0_68,negated_conjecture,
transitive_relstr(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_58]),c_0_26])]),c_0_36]) ).
cnf(c_0_69,negated_conjecture,
( empty_carrier(X1)
| net_str(net_of_bool_filter(X1,the_carrier(esk1_0),esk2_0),X1)
| ~ element(the_carrier(esk1_0),the_carrier(boole_POSet(the_carrier(X1))))
| ~ one_sorted_str(X1) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_50]),c_0_47]),c_0_48])]),c_0_35]),c_0_49]) ).
cnf(c_0_70,lemma,
( in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| ~ element(X1,the_carrier(esk1_0))
| ~ net_str(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0),esk1_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_71,negated_conjecture,
net_str(net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0),esk1_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_58]),c_0_26])]),c_0_36]) ).
cnf(c_0_72,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_13]) ).
cnf(c_0_73,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_13]) ).
cnf(c_0_74,lemma,
( in(X1,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0)))
| ~ is_a_convergence_point_of_set(esk1_0,esk2_0,X1)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_70,c_0_71])]) ).
cnf(c_0_75,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,the_carrier(esk1_0),esk2_0))) ),
inference(rw,[status(thm)],[c_0_72,c_0_38]) ).
cnf(c_0_76,negated_conjecture,
element(esk3_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_77,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,the_carrier(esk1_0),esk2_0))) ),
inference(rw,[status(thm)],[c_0_73,c_0_38]) ).
cnf(c_0_78,negated_conjecture,
in(esk3_0,lim_points_of_net(esk1_0,net_of_bool_filter(esk1_0,the_carrier(esk1_0),esk2_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76])]) ).
cnf(c_0_79,lemma,
( 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_43]) ).
cnf(c_0_80,negated_conjecture,
~ is_a_convergence_point_of_set(esk1_0,esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).
cnf(c_0_81,lemma,
$false,
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_78]),c_0_55]),c_0_63]),c_0_18]),c_0_56]),c_0_68]),c_0_76]),c_0_71])]),c_0_36]),c_0_64]),c_0_80]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU395+2 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 07:48:52 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.48/23.49 eprover: CPU time limit exceeded, terminating
% 0.48/23.49 eprover: CPU time limit exceeded, terminating
% 0.48/23.49 eprover: CPU time limit exceeded, terminating
% 0.48/23.51 eprover: CPU time limit exceeded, terminating
% 0.65/46.50 eprover: CPU time limit exceeded, terminating
% 0.65/46.50 eprover: CPU time limit exceeded, terminating
% 0.65/46.51 eprover: CPU time limit exceeded, terminating
% 0.65/46.53 eprover: CPU time limit exceeded, terminating
% 0.82/69.52 eprover: CPU time limit exceeded, terminating
% 0.82/69.52 eprover: CPU time limit exceeded, terminating
% 0.82/69.52 eprover: CPU time limit exceeded, terminating
% 0.82/69.54 eprover: CPU time limit exceeded, terminating
% 1.00/92.53 eprover: CPU time limit exceeded, terminating
% 1.00/92.53 eprover: CPU time limit exceeded, terminating
% 1.00/92.54 eprover: CPU time limit exceeded, terminating
% 1.00/92.56 eprover: CPU time limit exceeded, terminating
% 1.17/115.55 eprover: CPU time limit exceeded, terminating
% 1.17/115.55 eprover: CPU time limit exceeded, terminating
% 1.17/115.55 eprover: CPU time limit exceeded, terminating
% 1.17/115.57 eprover: CPU time limit exceeded, terminating
% 1.34/138.57 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.34/138.57
% 1.34/138.57 eprover: CPU time limit exceeded, terminating
% 1.34/138.59 eprover: CPU time limit exceeded, terminating
% 1.50/161.59 eprover: CPU time limit exceeded, terminating
% 1.50/161.60 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.50/161.60
% 1.50/161.60 eprover: CPU time limit exceeded, terminating
% 1.66/184.61 eprover: CPU time limit exceeded, terminating
% 1.66/184.62 eprover: eprover: CPU time limit exceeded, terminatingCPU time limit exceeded, terminating
% 1.66/184.62
% 1.66/184.62 eprover: CPU time limit exceeded, terminating
% 1.81/207.64 eprover: CPU time limit exceeded, terminating
% 1.81/207.64 eprover: CPU time limit exceeded, terminating
% 1.81/207.64 eprover: CPU time limit exceeded, terminating
% 1.81/207.65 eprover: CPU time limit exceeded, terminating
% 1.96/230.65 eprover: CPU time limit exceeded, terminating
% 1.96/230.66 eprover: CPU time limit exceeded, terminating
% 1.96/230.67 eprover: CPU time limit exceeded, terminating
% 1.96/230.71 eprover: CPU time limit exceeded, terminating
% 1.96/231.15 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 1.96/231.15 # Preprocessing time : 0.051 s
% 1.96/231.15 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # Preprocessing time : 0.184 s
% 1.96/231.15 # Running protocol protocol_eprover_eb48853eb71ccd2a6fdade56c25b63f5692e1a0c for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # Preprocessing time : 0.149 s
% 1.96/231.15 # Running protocol protocol_eprover_761a0d093d9701c0eed884aebb46468e8d439c31 for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,hypos,1.2,,,100,1.0)
% 1.96/231.15 # Preprocessing time : 0.036 s
% 1.96/231.15 # Running protocol protocol_eprover_bb5e3cecdbc7660bd3a6f864cadb7769d8aea26a for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,,500,1.0)
% 1.96/231.15 # Preprocessing time : 0.063 s
% 1.96/231.15 # Running protocol protocol_eprover_e252f7803940d118fa0ef69fc2319cb55aee23b9 for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,,1.4,,03,100,1.0)
% 1.96/231.15 # Preprocessing time : 0.033 s
% 1.96/231.15 # Running protocol protocol_eprover_b1d72019af42f5b571a6c0b233a5b6d1de064075 for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,500,1.0)
% 1.96/231.15 # Preprocessing time : 0.046 s
% 1.96/231.15 # Running protocol protocol_eprover_e96ef4641ae500918cdd95fcfce21e29f2ac5eec for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,,6.0,,03,100,1.0)
% 1.96/231.15 # Preprocessing time : 0.040 s
% 1.96/231.15 # Running protocol protocol_eprover_1f734394cb6ce69b36c9826f6782d3567d6ecd6c for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,hypos,1.1,,02,20000,1.0)
% 1.96/231.15 # Preprocessing time : 0.041 s
% 1.96/231.15 # Running protocol protocol_eprover_e9eb28a402764e1f99b41605245cd0a359f475fb for 23 seconds:
% 1.96/231.15
% 1.96/231.15 # Failure: Resource limit exceeded (time)
% 1.96/231.15 # OLD status Res
% 1.96/231.15 # Preprocessing time : 0.197 s
% 1.96/231.15 # Running protocol protocol_eprover_3dd3316ad6e39f95bf120b2757347c6970e0a532 for 23 seconds:
% 1.96/231.15 # SinE strategy is GSinE(CountFormulas,,1.1,,01,500,1.0)
% 1.96/231.15 # Preprocessing time : 0.059 s
% 1.96/231.15
% 1.96/231.15 # Proof found!
% 1.96/231.15 # SZS status Theorem
% 1.96/231.15 # SZS output start CNFRefutation
% See solution above
% 1.96/231.15 # Proof object total steps : 82
% 1.96/231.15 # Proof object clause steps : 59
% 1.96/231.15 # Proof object formula steps : 23
% 1.96/231.15 # Proof object conjectures : 39
% 1.96/231.15 # Proof object clause conjectures : 36
% 1.96/231.15 # Proof object formula conjectures : 3
% 1.96/231.15 # Proof object initial clauses used : 23
% 1.96/231.15 # Proof object initial formulas used : 11
% 1.96/231.15 # Proof object generating inferences : 16
% 1.96/231.15 # Proof object simplifying inferences : 93
% 1.96/231.15 # Training examples: 0 positive, 0 negative
% 1.96/231.15 # Parsed axioms : 917
% 1.96/231.15 # Removed by relevancy pruning/SinE : 862
% 1.96/231.15 # Initial clauses : 140
% 1.96/231.15 # Removed in clause preprocessing : 1
% 1.96/231.15 # Initial clauses in saturation : 139
% 1.96/231.15 # Processed clauses : 359
% 1.96/231.15 # ...of these trivial : 3
% 1.96/231.15 # ...subsumed : 55
% 1.96/231.15 # ...remaining for further processing : 300
% 1.96/231.15 # Other redundant clauses eliminated : 6
% 1.96/231.15 # Clauses deleted for lack of memory : 0
% 1.96/231.15 # Backward-subsumed : 0
% 1.96/231.15 # Backward-rewritten : 25
% 1.96/231.15 # Generated clauses : 776
% 1.96/231.15 # ...of the previous two non-trivial : 745
% 1.96/231.15 # Contextual simplify-reflections : 11
% 1.96/231.15 # Paramodulations : 764
% 1.96/231.15 # Factorizations : 2
% 1.96/231.15 # Equation resolutions : 6
% 1.96/231.15 # Current number of processed clauses : 267
% 1.96/231.15 # Positive orientable unit clauses : 46
% 1.96/231.15 # Positive unorientable unit clauses: 2
% 1.96/231.15 # Negative unit clauses : 23
% 1.96/231.15 # Non-unit-clauses : 196
% 1.96/231.15 # Current number of unprocessed clauses: 428
% 1.96/231.15 # ...number of literals in the above : 1761
% 1.96/231.15 # Current number of archived formulas : 0
% 1.96/231.15 # Current number of archived clauses : 27
% 1.96/231.15 # Clause-clause subsumption calls (NU) : 9032
% 1.96/231.15 # Rec. Clause-clause subsumption calls : 2410
% 1.96/231.15 # Non-unit clause-clause subsumptions : 24
% 1.96/231.15 # Unit Clause-clause subsumption calls : 743
% 1.96/231.15 # Rewrite failures with RHS unbound : 12
% 1.96/231.15 # BW rewrite match attempts : 12
% 1.96/231.15 # BW rewrite match successes : 12
% 1.96/231.15 # Condensation attempts : 0
% 1.96/231.15 # Condensation successes : 0
% 1.96/231.15 # Termbank termtop insertions : 52642
% 1.96/231.15
% 1.96/231.15 # -------------------------------------------------
% 1.96/231.15 # User time : 0.093 s
% 1.96/231.15 # System time : 0.007 s
% 1.96/231.15 # Total time : 0.100 s
% 1.96/231.15 # Maximum resident set size: 6540 pages
% 2.00/253.68 eprover: CPU time limit exceeded, terminating
% 2.00/253.70 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 2.00/253.70 eprover: No such file or directory
% 2.00/253.72 eprover: CPU time limit exceeded, terminating
% 2.00/253.74 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 2.00/253.74 eprover: No such file or directory
%------------------------------------------------------------------------------