TSTP Solution File: SEU383+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : SEU383+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:33 EDT 2022
% Result : Theorem 0.21s 1.40s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 12
% Syntax : Number of formulae : 72 ( 18 unt; 0 def)
% Number of atoms : 282 ( 18 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 340 ( 130 ~; 137 |; 50 &)
% ( 5 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 2 con; 0-2 aty)
% Number of variables : 99 ( 2 sgn 51 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t8_waybel_7,conjecture,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t8_waybel_7) ).
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(t1_subset,axiom,
! [X1,X2] :
( in(X1,X2)
=> element(X1,X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t1_subset) ).
fof(t2_tarski,axiom,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
<=> in(X3,X2) )
=> X1 = X2 ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_tarski) ).
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(rc10_waybel_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& rel_str(X1) )
=> ? [X2] :
( element(X2,powerset(the_carrier(X1)))
& ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',rc10_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(d20_waybel_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( upper_relstr_subset(X2,X1)
<=> ! [X3] :
( element(X3,the_carrier(X1))
=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( ( in(X3,X2)
& related(X1,X3,X4) )
=> in(X4,X2) ) ) ) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d20_waybel_0) ).
fof(t44_yellow_0,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t44_yellow_0) ).
fof(t5_tex_2,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> ( proper_element(X2,powerset(X1))
<=> X2 != X1 ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t5_tex_2) ).
fof(dt_k3_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> element(bottom_of_relstr(X1),the_carrier(X1)) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_k3_yellow_0) ).
fof(c_0_12,negated_conjecture,
~ ! [X1] :
( ( ~ empty_carrier(X1)
& reflexive_relstr(X1)
& transitive_relstr(X1)
& antisymmetric_relstr(X1)
& lower_bounded_relstr(X1)
& rel_str(X1) )
=> ! [X2] :
( ( ~ empty(X2)
& filtered_subset(X2,X1)
& upper_relstr_subset(X2,X1)
& element(X2,powerset(the_carrier(X1))) )
=> ( proper_element(X2,powerset(the_carrier(X1)))
<=> ~ in(bottom_of_relstr(X1),X2) ) ) ),
inference(assume_negation,[status(cth)],[t8_waybel_7]) ).
fof(c_0_13,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_14,negated_conjecture,
( ~ empty_carrier(esk1_0)
& reflexive_relstr(esk1_0)
& transitive_relstr(esk1_0)
& antisymmetric_relstr(esk1_0)
& lower_bounded_relstr(esk1_0)
& rel_str(esk1_0)
& ~ empty(esk2_0)
& filtered_subset(esk2_0,esk1_0)
& upper_relstr_subset(esk2_0,esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ( ~ proper_element(esk2_0,powerset(the_carrier(esk1_0)))
| in(bottom_of_relstr(esk1_0),esk2_0) )
& ( proper_element(esk2_0,powerset(the_carrier(esk1_0)))
| ~ in(bottom_of_relstr(esk1_0),esk2_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_12])])])])])]) ).
fof(c_0_15,plain,
! [X3,X4] :
( ~ in(X3,X4)
| element(X3,X4) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).
fof(c_0_16,plain,
! [X4,X5] :
( ( ~ in(esk3_2(X4,X5),X4)
| ~ in(esk3_2(X4,X5),X5)
| X4 = X5 )
& ( in(esk3_2(X4,X5),X4)
| in(esk3_2(X4,X5),X5)
| X4 = X5 ) ),
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)],[t2_tarski])])])])])]) ).
fof(c_0_17,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_18,plain,
! [X3] :
( ( element(esk7_1(X3),powerset(the_carrier(X3)))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ rel_str(X3) )
& ( ~ empty(esk7_1(X3))
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ rel_str(X3) )
& ( filtered_subset(esk7_1(X3),X3)
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ rel_str(X3) )
& ( upper_relstr_subset(esk7_1(X3),X3)
| empty_carrier(X3)
| ~ reflexive_relstr(X3)
| ~ transitive_relstr(X3)
| ~ rel_str(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)],[rc10_waybel_0])])])])])])]) ).
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])]) ).
fof(c_0_20,plain,
! [X3] : element(esk6_1(X3),X3),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
cnf(c_0_21,plain,
( element(X1,X2)
| ~ element(X3,powerset(X2))
| ~ in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_22,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,plain,
( element(X1,X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
( X1 = X2
| in(esk3_2(X1,X2),X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_26,plain,
( empty_carrier(X1)
| element(esk7_1(X1),powerset(the_carrier(X1)))
| ~ rel_str(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_27,plain,
( in(X1,X2)
| empty(X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_28,plain,
element(esk6_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_29,plain,
! [X5,X6,X7,X8] :
( ( ~ upper_relstr_subset(X6,X5)
| ~ element(X7,the_carrier(X5))
| ~ element(X8,the_carrier(X5))
| ~ in(X7,X6)
| ~ related(X5,X7,X8)
| in(X8,X6)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) )
& ( element(esk11_2(X5,X6),the_carrier(X5))
| upper_relstr_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) )
& ( element(esk12_2(X5,X6),the_carrier(X5))
| upper_relstr_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) )
& ( in(esk11_2(X5,X6),X6)
| upper_relstr_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) )
& ( related(X5,esk11_2(X5,X6),esk12_2(X5,X6))
| upper_relstr_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) )
& ( ~ in(esk12_2(X5,X6),X6)
| upper_relstr_subset(X6,X5)
| ~ element(X6,powerset(the_carrier(X5)))
| ~ rel_str(X5) ) ),
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)],[d20_waybel_0])])])])])])]) ).
fof(c_0_30,plain,
! [X3,X4] :
( empty_carrier(X3)
| ~ antisymmetric_relstr(X3)
| ~ lower_bounded_relstr(X3)
| ~ rel_str(X3)
| ~ element(X4,the_carrier(X3))
| related(X3,bottom_of_relstr(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)],[t44_yellow_0])])])])])]) ).
cnf(c_0_31,negated_conjecture,
( element(X1,the_carrier(esk1_0))
| ~ in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_32,plain,
( X1 = X2
| element(esk3_2(X1,X2),X2)
| in(esk3_2(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_33,plain,
( empty_carrier(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ rel_str(X1)
| ~ empty(the_carrier(X1))
| ~ in(X2,esk7_1(X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_34,plain,
( empty(X1)
| in(esk6_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_35,plain,
( empty_carrier(X1)
| ~ rel_str(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ empty(esk7_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_36,plain,
( in(X3,X2)
| ~ rel_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ related(X1,X4,X3)
| ~ in(X4,X2)
| ~ element(X3,the_carrier(X1))
| ~ element(X4,the_carrier(X1))
| ~ upper_relstr_subset(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_37,plain,
( related(X1,bottom_of_relstr(X1),X2)
| empty_carrier(X1)
| ~ element(X2,the_carrier(X1))
| ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,negated_conjecture,
lower_bounded_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_39,negated_conjecture,
antisymmetric_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_41,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_42,negated_conjecture,
( esk2_0 = X1
| element(esk3_2(esk2_0,X1),the_carrier(esk1_0))
| element(esk3_2(esk2_0,X1),X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_43,plain,
( empty_carrier(X1)
| ~ transitive_relstr(X1)
| ~ reflexive_relstr(X1)
| ~ rel_str(X1)
| ~ empty(the_carrier(X1)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]) ).
cnf(c_0_44,negated_conjecture,
transitive_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_45,negated_conjecture,
reflexive_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_46,plain,
( in(X1,X2)
| ~ related(X3,X4,X1)
| ~ upper_relstr_subset(X2,X3)
| ~ element(X2,powerset(the_carrier(X3)))
| ~ element(X1,the_carrier(X3))
| ~ rel_str(X3)
| ~ in(X4,X2) ),
inference(csr,[status(thm)],[c_0_36,c_0_21]) ).
cnf(c_0_47,negated_conjecture,
( related(esk1_0,bottom_of_relstr(esk1_0),X1)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),c_0_40])]),c_0_41]) ).
fof(c_0_48,plain,
! [X3,X4] :
( ( ~ proper_element(X4,powerset(X3))
| X4 != X3
| ~ element(X4,powerset(X3)) )
& ( X4 = X3
| proper_element(X4,powerset(X3))
| ~ element(X4,powerset(X3)) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_tex_2])])]) ).
cnf(c_0_49,negated_conjecture,
( the_carrier(esk1_0) = esk2_0
| element(esk3_2(esk2_0,the_carrier(esk1_0)),the_carrier(esk1_0)) ),
inference(ef,[status(thm)],[c_0_42]) ).
cnf(c_0_50,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_40])]),c_0_41]) ).
fof(c_0_51,plain,
! [X2] :
( ~ rel_str(X2)
| element(bottom_of_relstr(X2),the_carrier(X2)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_yellow_0])]) ).
cnf(c_0_52,negated_conjecture,
( in(X1,X2)
| ~ upper_relstr_subset(X2,esk1_0)
| ~ element(X2,powerset(the_carrier(esk1_0)))
| ~ element(X1,the_carrier(esk1_0))
| ~ in(bottom_of_relstr(esk1_0),X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_40])]) ).
cnf(c_0_53,negated_conjecture,
( in(bottom_of_relstr(esk1_0),esk2_0)
| ~ proper_element(esk2_0,powerset(the_carrier(esk1_0))) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,plain,
( proper_element(X1,powerset(X2))
| X1 = X2
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_55,plain,
( X1 = X2
| ~ in(esk3_2(X1,X2),X2)
| ~ in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_56,negated_conjecture,
( the_carrier(esk1_0) = esk2_0
| in(esk3_2(esk2_0,the_carrier(esk1_0)),the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_49]),c_0_50]) ).
cnf(c_0_57,plain,
( element(bottom_of_relstr(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_58,negated_conjecture,
( the_carrier(esk1_0) = esk2_0
| in(esk3_2(esk2_0,the_carrier(esk1_0)),X1)
| ~ upper_relstr_subset(X1,esk1_0)
| ~ element(X1,powerset(the_carrier(esk1_0)))
| ~ in(bottom_of_relstr(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_52,c_0_49]) ).
cnf(c_0_59,negated_conjecture,
upper_relstr_subset(esk2_0,esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_60,negated_conjecture,
( the_carrier(esk1_0) = esk2_0
| in(bottom_of_relstr(esk1_0),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_22])]) ).
cnf(c_0_61,negated_conjecture,
( the_carrier(esk1_0) = esk2_0
| ~ in(esk3_2(esk2_0,the_carrier(esk1_0)),esk2_0) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,plain,
( empty(the_carrier(X1))
| in(bottom_of_relstr(X1),the_carrier(X1))
| ~ rel_str(X1) ),
inference(spm,[status(thm)],[c_0_27,c_0_57]) ).
cnf(c_0_63,negated_conjecture,
the_carrier(esk1_0) = esk2_0,
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_22])]),c_0_60]),c_0_61]) ).
cnf(c_0_64,negated_conjecture,
~ empty(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_65,plain,
( ~ element(X1,powerset(X2))
| X1 != X2
| ~ proper_element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_66,negated_conjecture,
( proper_element(esk2_0,powerset(the_carrier(esk1_0)))
| ~ in(bottom_of_relstr(esk1_0),esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_67,negated_conjecture,
in(bottom_of_relstr(esk1_0),esk2_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_40])]),c_0_64]) ).
cnf(c_0_68,plain,
( ~ proper_element(X1,powerset(X1))
| ~ element(X1,powerset(X1)) ),
inference(er,[status(thm)],[c_0_65]) ).
cnf(c_0_69,negated_conjecture,
proper_element(esk2_0,powerset(esk2_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_63]),c_0_67])]) ).
cnf(c_0_70,negated_conjecture,
element(esk2_0,powerset(esk2_0)),
inference(rw,[status(thm)],[c_0_22,c_0_63]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU383+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : run_ET %s %d
% 0.12/0.33 % Computer : n017.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 06:36:14 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.21/1.40 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.21/1.40 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.21/1.40 # Preprocessing time : 0.018 s
% 0.21/1.40
% 0.21/1.40 # Proof found!
% 0.21/1.40 # SZS status Theorem
% 0.21/1.40 # SZS output start CNFRefutation
% See solution above
% 0.21/1.41 # Proof object total steps : 72
% 0.21/1.41 # Proof object clause steps : 47
% 0.21/1.41 # Proof object formula steps : 25
% 0.21/1.41 # Proof object conjectures : 29
% 0.21/1.41 # Proof object clause conjectures : 26
% 0.21/1.41 # Proof object formula conjectures : 3
% 0.21/1.41 # Proof object initial clauses used : 25
% 0.21/1.41 # Proof object initial formulas used : 12
% 0.21/1.41 # Proof object generating inferences : 18
% 0.21/1.41 # Proof object simplifying inferences : 29
% 0.21/1.41 # Training examples: 0 positive, 0 negative
% 0.21/1.41 # Parsed axioms : 45
% 0.21/1.41 # Removed by relevancy pruning/SinE : 21
% 0.21/1.41 # Initial clauses : 48
% 0.21/1.41 # Removed in clause preprocessing : 1
% 0.21/1.41 # Initial clauses in saturation : 47
% 0.21/1.41 # Processed clauses : 659
% 0.21/1.41 # ...of these trivial : 4
% 0.21/1.41 # ...subsumed : 319
% 0.21/1.41 # ...remaining for further processing : 336
% 0.21/1.41 # Other redundant clauses eliminated : 1
% 0.21/1.41 # Clauses deleted for lack of memory : 0
% 0.21/1.41 # Backward-subsumed : 19
% 0.21/1.41 # Backward-rewritten : 131
% 0.21/1.41 # Generated clauses : 1320
% 0.21/1.41 # ...of the previous two non-trivial : 1344
% 0.21/1.41 # Contextual simplify-reflections : 252
% 0.21/1.41 # Paramodulations : 1296
% 0.21/1.41 # Factorizations : 18
% 0.21/1.41 # Equation resolutions : 1
% 0.21/1.41 # Current number of processed clauses : 180
% 0.21/1.41 # Positive orientable unit clauses : 20
% 0.21/1.41 # Positive unorientable unit clauses: 0
% 0.21/1.41 # Negative unit clauses : 8
% 0.21/1.41 # Non-unit-clauses : 152
% 0.21/1.41 # Current number of unprocessed clauses: 559
% 0.21/1.41 # ...number of literals in the above : 2333
% 0.21/1.41 # Current number of archived formulas : 0
% 0.21/1.41 # Current number of archived clauses : 155
% 0.21/1.41 # Clause-clause subsumption calls (NU) : 14873
% 0.21/1.41 # Rec. Clause-clause subsumption calls : 5448
% 0.21/1.41 # Non-unit clause-clause subsumptions : 507
% 0.21/1.41 # Unit Clause-clause subsumption calls : 185
% 0.21/1.41 # Rewrite failures with RHS unbound : 0
% 0.21/1.41 # BW rewrite match attempts : 4
% 0.21/1.41 # BW rewrite match successes : 4
% 0.21/1.41 # Condensation attempts : 0
% 0.21/1.41 # Condensation successes : 0
% 0.21/1.41 # Termbank termtop insertions : 24317
% 0.21/1.41
% 0.21/1.41 # -------------------------------------------------
% 0.21/1.41 # User time : 0.092 s
% 0.21/1.41 # System time : 0.006 s
% 0.21/1.41 # Total time : 0.098 s
% 0.21/1.41 # Maximum resident set size: 4392 pages
%------------------------------------------------------------------------------