TSTP Solution File: SEU367+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n017.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:25 EDT 2022
% Result : Theorem 0.23s 1.41s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 104 ( 19 unt; 0 def)
% Number of atoms : 453 ( 7 equ)
% Maximal formula atoms : 35 ( 4 avg)
% Number of connectives : 577 ( 228 ~; 284 |; 40 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 3 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 5 con; 0-4 aty)
% Number of variables : 193 ( 17 sgn 64 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t4_subset) ).
fof(rc4_finset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc4_finset_1) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t3_subset) ).
fof(t8_waybel_0,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3,X4] :
( subset(X3,X4)
=> ( ( is_eventually_in(X1,X2,X3)
=> is_eventually_in(X1,X2,X4) )
& ( is_often_in(X1,X2,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_waybel_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',existence_m1_subset_1) ).
fof(d12_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_often_in(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X2))
=> ? [X5] :
( element(X5,the_carrier(X2))
& related(X2,X4,X5)
& in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d12_waybel_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t7_boole) ).
fof(d11_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3] :
( is_eventually_in(X1,X2,X3)
<=> ? [X4] :
( element(X4,the_carrier(X2))
& ! [X5] :
( element(X5,the_carrier(X2))
=> ( related(X2,X4,X5)
=> in(apply_netmap(X1,X2,X5),X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d11_waybel_0) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc1_xboole_0) ).
fof(c_0_12,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| element(X4,X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_13,plain,
! [X3] :
( ( element(esk18_1(X3),powerset(X3))
| empty(X3) )
& ( ~ empty(esk18_1(X3))
| empty(X3) )
& ( finite(esk18_1(X3))
| empty(X3) ) ),
inference(distribute,[status(thm)],[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)],[rc4_finset_1])])])])])])]) ).
fof(c_0_14,plain,
! [X4,X5,X6] :
( ~ in(X4,X5)
| ~ element(X5,powerset(X6))
| ~ empty(X6) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_15,plain,
! [X3,X4,X3,X4] :
( ( ~ element(X3,powerset(X4))
| subset(X3,X4) )
& ( ~ subset(X3,X4)
| element(X3,powerset(X4)) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])])]) ).
fof(c_0_16,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( ( ~ empty_carrier(X2)
& net_str(X2,X1) )
=> ! [X3,X4] :
( subset(X3,X4)
=> ( ( is_eventually_in(X1,X2,X3)
=> is_eventually_in(X1,X2,X4) )
& ( is_often_in(X1,X2,X3)
=> is_often_in(X1,X2,X4) ) ) ) ) ),
inference(assume_negation,[status(cth)],[t8_waybel_0]) ).
cnf(c_0_17,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
( empty(X1)
| element(esk18_1(X1),powerset(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X3,X4] :
( ~ element(X3,X4)
| empty(X4)
| in(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_20,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,negated_conjecture,
( ~ empty_carrier(esk20_0)
& one_sorted_str(esk20_0)
& ~ empty_carrier(esk21_0)
& net_str(esk21_0,esk20_0)
& subset(esk22_0,esk23_0)
& ( is_often_in(esk20_0,esk21_0,esk22_0)
| is_eventually_in(esk20_0,esk21_0,esk22_0) )
& ( ~ is_often_in(esk20_0,esk21_0,esk23_0)
| is_eventually_in(esk20_0,esk21_0,esk22_0) )
& ( is_often_in(esk20_0,esk21_0,esk22_0)
| ~ is_eventually_in(esk20_0,esk21_0,esk23_0) )
& ( ~ is_often_in(esk20_0,esk21_0,esk23_0)
| ~ is_eventually_in(esk20_0,esk21_0,esk23_0) ) ),
inference(distribute,[status(thm)],[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_16])])])])])])]) ).
fof(c_0_23,plain,
( ~ epred26_0
<=> ! [X2] : ~ in(X2,esk23_0) ),
introduced(definition) ).
cnf(c_0_24,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,esk18_1(X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( empty(X1)
| ~ empty(esk18_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_27,plain,
! [X3] : element(esk9_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_28,plain,
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
subset(esk22_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_30,plain,
! [X6,X7,X8,X9,X8,X12] :
( ( element(esk3_4(X6,X7,X8,X9),the_carrier(X7))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X9,esk3_4(X6,X7,X8,X9))
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( in(apply_netmap(X6,X7,esk3_4(X6,X7,X8,X9)),X8)
| ~ element(X9,the_carrier(X7))
| ~ is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk4_3(X6,X7,X8),the_carrier(X7))
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X12,the_carrier(X7))
| ~ related(X7,esk4_3(X6,X7,X8),X12)
| ~ in(apply_netmap(X6,X7,X12),X8)
| is_often_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[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)],[d12_waybel_0])])])])])])])]) ).
fof(c_0_31,plain,
! [X3,X4] :
( ~ in(X3,X4)
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(c_0_32,plain,
! [X6,X7,X8,X10,X8,X11] :
( ( element(esk1_3(X6,X7,X8),the_carrier(X7))
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ element(X10,the_carrier(X7))
| ~ related(X7,esk1_3(X6,X7,X8),X10)
| in(apply_netmap(X6,X7,X10),X8)
| ~ is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( element(esk2_4(X6,X7,X8,X11),the_carrier(X7))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( related(X7,X11,esk2_4(X6,X7,X8,X11))
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) )
& ( ~ in(apply_netmap(X6,X7,esk2_4(X6,X7,X8,X11)),X8)
| ~ element(X11,the_carrier(X7))
| is_eventually_in(X6,X7,X8)
| empty_carrier(X7)
| ~ net_str(X7,X6)
| empty_carrier(X6)
| ~ one_sorted_str(X6) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[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)],[d11_waybel_0])])])])])])])]) ).
cnf(c_0_33,negated_conjecture,
( epred26_0
| ~ in(X1,esk23_0) ),
inference(split_equiv,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
( element(X1,X2)
| empty(X2)
| ~ element(X1,esk18_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_35,plain,
element(esk9_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
( ~ empty(esk23_0)
| ~ in(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ in(apply_netmap(X1,X2,X4),X3)
| ~ related(X2,esk4_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| related(X2,X4,esk3_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_often_in(X1,X2,X3)
| element(esk4_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( element(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_17,c_0_21]) ).
cnf(c_0_41,plain,
( ~ empty(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_42,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,esk3_4(X1,X2,X3,X4)),X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_43,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| in(apply_netmap(X1,X2,X4),X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ related(X2,esk1_3(X1,X2,X3),X4)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_44,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| related(X2,X4,esk2_4(X1,X2,X3,X4))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_45,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk1_3(X1,X2,X3),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_eventually_in(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
fof(c_0_46,plain,
! [X3,X4] :
( ~ empty(X3)
| X3 = X4
| ~ empty(X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
cnf(c_0_47,negated_conjecture,
( epred26_0
| empty(esk23_0)
| ~ element(X1,esk23_0) ),
inference(spm,[status(thm)],[c_0_33,c_0_25]) ).
cnf(c_0_48,plain,
( element(esk9_1(esk18_1(X1)),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_49,negated_conjecture,
( empty(esk22_0)
| ~ element(X1,esk22_0)
| ~ empty(esk23_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_25]) ).
cnf(c_0_50,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X4)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X4,X2,X5)
| ~ net_str(X2,X1)
| ~ net_str(X2,X4)
| ~ one_sorted_str(X1)
| ~ one_sorted_str(X4)
| ~ element(esk3_4(X4,X2,X5,esk4_3(X1,X2,X3)),the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk3_4(X4,X2,X5,esk4_3(X1,X2,X3))),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_51,negated_conjecture,
( element(X1,esk23_0)
| ~ in(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_40,c_0_29]) ).
cnf(c_0_52,plain,
( ~ empty(X1)
| ~ in(X2,esk9_1(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_53,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| ~ is_often_in(X2,X1,X3)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ element(X4,the_carrier(X1))
| ~ empty(X3) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_54,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2))
| ~ in(apply_netmap(X1,X2,esk2_4(X1,X2,X3,X4)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_55,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| empty_carrier(X4)
| in(apply_netmap(X4,X2,esk2_4(X1,X2,X3,esk1_3(X4,X2,X5))),X5)
| ~ is_eventually_in(X4,X2,X5)
| ~ net_str(X2,X4)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X4)
| ~ one_sorted_str(X1)
| ~ element(esk2_4(X1,X2,X3,esk1_3(X4,X2,X5)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_56,plain,
( X2 = X1
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_46]) ).
cnf(c_0_57,negated_conjecture,
( epred26_0
| empty(esk23_0) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_58,negated_conjecture,
( empty(esk22_0)
| ~ empty(esk23_0) ),
inference(spm,[status(thm)],[c_0_49,c_0_35]) ).
cnf(c_0_59,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X2)
| empty_carrier(X4)
| empty(X3)
| ~ is_often_in(X4,X2,X5)
| ~ net_str(X2,X1)
| ~ net_str(X2,X4)
| ~ one_sorted_str(X1)
| ~ one_sorted_str(X4)
| ~ element(apply_netmap(X1,X2,esk3_4(X4,X2,X5,esk4_3(X1,X2,X3))),X3)
| ~ element(esk3_4(X4,X2,X5,esk4_3(X1,X2,X3)),the_carrier(X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_25]) ).
cnf(c_0_60,negated_conjecture,
( empty_carrier(X1)
| empty_carrier(X2)
| element(apply_netmap(X2,X1,esk3_4(X2,X1,esk22_0,X3)),esk23_0)
| ~ is_often_in(X2,X1,esk22_0)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ element(X3,the_carrier(X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_42]) ).
cnf(c_0_61,negated_conjecture,
( empty_carrier(X1)
| empty_carrier(X2)
| ~ is_often_in(X2,X1,esk22_0)
| ~ net_str(X1,X2)
| ~ one_sorted_str(X2)
| ~ element(X3,the_carrier(X1))
| ~ empty(esk23_0) ),
inference(spm,[status(thm)],[c_0_36,c_0_42]) ).
cnf(c_0_62,plain,
( empty(esk9_1(powerset(X1)))
| ~ element(X2,esk9_1(powerset(X1)))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_25]) ).
cnf(c_0_63,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| ~ is_often_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ empty(X3) ),
inference(spm,[status(thm)],[c_0_53,c_0_35]) ).
cnf(c_0_64,negated_conjecture,
( is_often_in(esk20_0,esk21_0,esk22_0)
| ~ is_eventually_in(esk20_0,esk21_0,esk23_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_65,negated_conjecture,
net_str(esk21_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_66,negated_conjecture,
one_sorted_str(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_67,negated_conjecture,
~ empty_carrier(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_68,negated_conjecture,
~ empty_carrier(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_69,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| empty(X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(apply_netmap(X1,X2,esk2_4(X1,X2,X3,X4)),X3)
| ~ element(X4,the_carrier(X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_25]) ).
cnf(c_0_70,negated_conjecture,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X4)
| empty_carrier(X2)
| empty_carrier(X1)
| element(apply_netmap(X4,X2,esk2_4(X1,X2,X3,esk1_3(X4,X2,esk22_0))),esk23_0)
| ~ is_eventually_in(X4,X2,esk22_0)
| ~ net_str(X2,X4)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X4)
| ~ one_sorted_str(X1)
| ~ element(esk2_4(X1,X2,X3,esk1_3(X4,X2,esk22_0)),the_carrier(X2)) ),
inference(spm,[status(thm)],[c_0_51,c_0_55]) ).
cnf(c_0_71,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| is_eventually_in(X1,X2,X3)
| element(esk2_4(X1,X2,X3,X4),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_72,negated_conjecture,
( is_eventually_in(esk20_0,esk21_0,esk22_0)
| is_often_in(esk20_0,esk21_0,esk22_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_73,negated_conjecture,
( X1 = esk23_0
| epred26_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_56,c_0_57]) ).
cnf(c_0_74,negated_conjecture,
( epred26_0
| empty(esk22_0) ),
inference(spm,[status(thm)],[c_0_58,c_0_57]) ).
cnf(c_0_75,negated_conjecture,
( is_often_in(X1,X2,esk23_0)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_often_in(X1,X2,esk22_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1)
| ~ element(esk3_4(X1,X2,esk22_0,esk4_3(X1,X2,esk23_0)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_39]),c_0_61]) ).
cnf(c_0_76,plain,
( empty_carrier(X1)
| empty_carrier(X2)
| element(esk3_4(X1,X2,X3,X4),the_carrier(X2))
| ~ one_sorted_str(X1)
| ~ net_str(X2,X1)
| ~ is_often_in(X1,X2,X3)
| ~ element(X4,the_carrier(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_77,plain,
( empty(esk9_1(powerset(X1)))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_62,c_0_48]) ).
cnf(c_0_78,negated_conjecture,
( ~ is_eventually_in(esk20_0,esk21_0,esk23_0)
| ~ empty(esk22_0) ),
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_63,c_0_64]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]) ).
cnf(c_0_79,negated_conjecture,
( is_eventually_in(X1,X2,esk23_0)
| empty_carrier(X1)
| empty_carrier(X2)
| empty(esk23_0)
| ~ is_eventually_in(X1,X2,esk22_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_45]) ).
cnf(c_0_80,negated_conjecture,
( is_eventually_in(esk20_0,esk21_0,esk22_0)
| ~ empty(esk22_0) ),
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_63,c_0_72]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]) ).
cnf(c_0_81,negated_conjecture,
( ~ is_eventually_in(esk20_0,esk21_0,esk23_0)
| ~ is_often_in(esk20_0,esk21_0,esk23_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_82,negated_conjecture,
( esk23_0 = esk22_0
| epred26_0 ),
inference(spm,[status(thm)],[c_0_73,c_0_74]) ).
cnf(c_0_83,negated_conjecture,
( is_eventually_in(esk20_0,esk21_0,esk22_0)
| ~ is_often_in(esk20_0,esk21_0,esk23_0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_84,negated_conjecture,
( is_often_in(X1,X2,esk23_0)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ is_often_in(X1,X2,esk22_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_39]) ).
cnf(c_0_85,plain,
( X1 = esk9_1(powerset(X2))
| ~ empty(X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_77]) ).
cnf(c_0_86,negated_conjecture,
( empty(esk23_0)
| ~ empty(esk22_0) ),
inference(csr,[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_78,c_0_79]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_80]) ).
cnf(c_0_87,negated_conjecture,
( epred26_0
| ~ is_often_in(esk20_0,esk21_0,esk22_0)
| ~ is_eventually_in(esk20_0,esk21_0,esk22_0) ),
inference(spm,[status(thm)],[c_0_81,c_0_82]) ).
cnf(c_0_88,negated_conjecture,
( epred26_0
| is_eventually_in(esk20_0,esk21_0,esk22_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_82]),c_0_72]) ).
cnf(c_0_89,negated_conjecture,
~ is_eventually_in(esk20_0,esk21_0,esk23_0),
inference(csr,[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_81,c_0_84]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_64]) ).
cnf(c_0_90,negated_conjecture,
is_eventually_in(esk20_0,esk21_0,esk22_0),
inference(csr,[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_83,c_0_84]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_72]) ).
fof(c_0_91,plain,
( ~ epred25_0
<=> ! [X1] :
( ~ empty(X1)
| ~ empty(esk22_0) ) ),
introduced(definition) ).
cnf(c_0_92,negated_conjecture,
( esk9_1(powerset(X1)) = esk23_0
| ~ empty(esk22_0)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_93,negated_conjecture,
( epred26_0
| ~ is_eventually_in(esk20_0,esk21_0,esk23_0) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_87,c_0_64]),c_0_88]) ).
cnf(c_0_94,negated_conjecture,
empty(esk23_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(spm,[status(thm)],[c_0_89,c_0_79]),c_0_65]),c_0_66])]),c_0_67]),c_0_68]),c_0_90])]) ).
cnf(c_0_95,negated_conjecture,
( ~ epred26_0
| ~ epred25_0 ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_92]),c_0_91]),c_0_23]) ).
cnf(c_0_96,negated_conjecture,
epred26_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_82]),c_0_88]) ).
fof(c_0_97,plain,
empty(esk13_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(c_0_98,negated_conjecture,
( epred25_0
| ~ empty(esk22_0)
| ~ empty(X1) ),
inference(split_equiv,[status(thm)],[c_0_91]) ).
cnf(c_0_99,negated_conjecture,
empty(esk22_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_94])]) ).
cnf(c_0_100,negated_conjecture,
~ epred25_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_95,c_0_96])]) ).
cnf(c_0_101,plain,
empty(esk13_0),
inference(split_conjunct,[status(thm)],[c_0_97]) ).
cnf(c_0_102,negated_conjecture,
~ empty(X1),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_99])]),c_0_100]) ).
cnf(c_0_103,plain,
$false,
inference(sr,[status(thm)],[c_0_101,c_0_102]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU367+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 12:57:14 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.23/1.41 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.23/1.41 # Preprocessing time : 0.018 s
% 0.23/1.41
% 0.23/1.41 # Proof found!
% 0.23/1.41 # SZS status Theorem
% 0.23/1.41 # SZS output start CNFRefutation
% See solution above
% 0.23/1.41 # Proof object total steps : 104
% 0.23/1.41 # Proof object clause steps : 77
% 0.23/1.41 # Proof object formula steps : 27
% 0.23/1.41 # Proof object conjectures : 44
% 0.23/1.41 # Proof object clause conjectures : 41
% 0.23/1.41 # Proof object formula conjectures : 3
% 0.23/1.41 # Proof object initial clauses used : 31
% 0.23/1.41 # Proof object initial formulas used : 12
% 0.23/1.41 # Proof object generating inferences : 42
% 0.23/1.41 # Proof object simplifying inferences : 56
% 0.23/1.41 # Training examples: 0 positive, 0 negative
% 0.23/1.41 # Parsed axioms : 53
% 0.23/1.41 # Removed by relevancy pruning/SinE : 0
% 0.23/1.41 # Initial clauses : 82
% 0.23/1.41 # Removed in clause preprocessing : 8
% 0.23/1.41 # Initial clauses in saturation : 74
% 0.23/1.41 # Processed clauses : 1649
% 0.23/1.41 # ...of these trivial : 25
% 0.23/1.41 # ...subsumed : 635
% 0.23/1.41 # ...remaining for further processing : 989
% 0.23/1.41 # Other redundant clauses eliminated : 0
% 0.23/1.41 # Clauses deleted for lack of memory : 0
% 0.23/1.41 # Backward-subsumed : 25
% 0.23/1.41 # Backward-rewritten : 145
% 0.23/1.41 # Generated clauses : 6667
% 0.23/1.41 # ...of the previous two non-trivial : 6404
% 0.23/1.41 # Contextual simplify-reflections : 707
% 0.23/1.41 # Paramodulations : 6387
% 0.23/1.41 # Factorizations : 0
% 0.23/1.41 # Equation resolutions : 0
% 0.23/1.41 # Current number of processed clauses : 613
% 0.23/1.41 # Positive orientable unit clauses : 104
% 0.23/1.41 # Positive unorientable unit clauses: 0
% 0.23/1.41 # Negative unit clauses : 32
% 0.23/1.41 # Non-unit-clauses : 477
% 0.23/1.41 # Current number of unprocessed clauses: 2253
% 0.23/1.41 # ...number of literals in the above : 22684
% 0.23/1.41 # Current number of archived formulas : 0
% 0.23/1.41 # Current number of archived clauses : 328
% 0.23/1.41 # Clause-clause subsumption calls (NU) : 513024
% 0.23/1.41 # Rec. Clause-clause subsumption calls : 98271
% 0.23/1.41 # Non-unit clause-clause subsumptions : 1381
% 0.23/1.41 # Unit Clause-clause subsumption calls : 19443
% 0.23/1.41 # Rewrite failures with RHS unbound : 0
% 0.23/1.41 # BW rewrite match attempts : 390
% 0.23/1.41 # BW rewrite match successes : 38
% 0.23/1.41 # Condensation attempts : 0
% 0.23/1.41 # Condensation successes : 0
% 0.23/1.41 # Termbank termtop insertions : 158990
% 0.23/1.41
% 0.23/1.41 # -------------------------------------------------
% 0.23/1.41 # User time : 0.291 s
% 0.23/1.41 # System time : 0.006 s
% 0.23/1.41 # Total time : 0.297 s
% 0.23/1.41 # Maximum resident set size: 10456 pages
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.41 eprover: CPU time limit exceeded, terminating
% 0.23/23.42 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.42 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.43 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.43 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.44 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.44 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.45 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.45 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.46 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.46 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.47 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.47 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.23/23.48 eprover: No such file or directory
% 0.23/23.48 eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.23/23.48 eprover: No such file or directory
%------------------------------------------------------------------------------