TSTP Solution File: SEU367+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SEU367+1 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n023.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 : 300s
% DateTime : Thu Aug 31 16:25:10 EDT 2023
% Result : Theorem 3.84s 3.92s
% Output : CNFRefutation 3.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 58
% Syntax : Number of formulae : 126 ( 15 unt; 48 typ; 0 def)
% Number of atoms : 408 ( 5 equ)
% Maximal formula atoms : 35 ( 5 avg)
% Number of connectives : 521 ( 191 ~; 249 |; 48 &)
% ( 5 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 73 ( 37 >; 36 *; 0 +; 0 <<)
% Number of predicates : 19 ( 17 usr; 1 prp; 0-3 aty)
% Number of functors : 31 ( 31 usr; 11 con; 0-4 aty)
% Number of variables : 172 ( 5 sgn; 65 !; 7 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
in: ( $i * $i ) > $o ).
tff(decl_23,type,
empty: $i > $o ).
tff(decl_24,type,
finite: $i > $o ).
tff(decl_25,type,
cartesian_product2: ( $i * $i ) > $i ).
tff(decl_26,type,
powerset: $i > $i ).
tff(decl_27,type,
element: ( $i * $i ) > $o ).
tff(decl_28,type,
relation: $i > $o ).
tff(decl_29,type,
empty_carrier: $i > $o ).
tff(decl_30,type,
one_sorted_str: $i > $o ).
tff(decl_31,type,
net_str: ( $i * $i ) > $o ).
tff(decl_32,type,
is_eventually_in: ( $i * $i * $i ) > $o ).
tff(decl_33,type,
the_carrier: $i > $i ).
tff(decl_34,type,
related: ( $i * $i * $i ) > $o ).
tff(decl_35,type,
apply_netmap: ( $i * $i * $i ) > $i ).
tff(decl_36,type,
is_often_in: ( $i * $i * $i ) > $o ).
tff(decl_37,type,
the_mapping: ( $i * $i ) > $i ).
tff(decl_38,type,
apply_on_structs: ( $i * $i * $i * $i ) > $i ).
tff(decl_39,type,
function: $i > $o ).
tff(decl_40,type,
quasi_total: ( $i * $i * $i ) > $o ).
tff(decl_41,type,
relation_of2: ( $i * $i * $i ) > $o ).
tff(decl_42,type,
rel_str: $i > $o ).
tff(decl_43,type,
relation_of2_as_subset: ( $i * $i * $i ) > $o ).
tff(decl_44,type,
empty_set: $i ).
tff(decl_45,type,
apply: ( $i * $i ) > $i ).
tff(decl_46,type,
subset: ( $i * $i ) > $o ).
tff(decl_47,type,
esk1_3: ( $i * $i * $i ) > $i ).
tff(decl_48,type,
esk2_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_49,type,
esk3_4: ( $i * $i * $i * $i ) > $i ).
tff(decl_50,type,
esk4_3: ( $i * $i * $i ) > $i ).
tff(decl_51,type,
esk5_0: $i ).
tff(decl_52,type,
esk6_0: $i ).
tff(decl_53,type,
esk7_1: $i > $i ).
tff(decl_54,type,
esk8_2: ( $i * $i ) > $i ).
tff(decl_55,type,
esk9_1: $i > $i ).
tff(decl_56,type,
esk10_2: ( $i * $i ) > $i ).
tff(decl_57,type,
esk11_0: $i ).
tff(decl_58,type,
esk12_1: $i > $i ).
tff(decl_59,type,
esk13_0: $i ).
tff(decl_60,type,
esk14_1: $i > $i ).
tff(decl_61,type,
esk15_0: $i ).
tff(decl_62,type,
esk16_1: $i > $i ).
tff(decl_63,type,
esk17_0: $i ).
tff(decl_64,type,
esk18_1: $i > $i ).
tff(decl_65,type,
esk19_1: $i > $i ).
tff(decl_66,type,
esk20_0: $i ).
tff(decl_67,type,
esk21_0: $i ).
tff(decl_68,type,
esk22_0: $i ).
tff(decl_69,type,
esk23_0: $i ).
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/benchmark/theBenchmark.p',t8_waybel_0) ).
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/benchmark/theBenchmark.p',d12_waybel_0) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_subset) ).
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/benchmark/theBenchmark.p',d11_waybel_0) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(rc4_finset_1,axiom,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rc4_finset_1) ).
fof(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).
fof(c_0_10,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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t8_waybel_0])]) ).
fof(c_0_11,plain,
! [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) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d12_waybel_0]) ).
fof(c_0_12,plain,
! [X92,X93] :
( ( ~ element(X92,powerset(X93))
| subset(X92,X93) )
& ( ~ subset(X92,X93)
| element(X92,powerset(X93)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_13,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(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_14,plain,
! [X22,X23,X24,X25,X27,X29] :
( ( element(esk3_4(X22,X23,X24,X25),the_carrier(X23))
| ~ element(X25,the_carrier(X23))
| ~ is_often_in(X22,X23,X24)
| empty_carrier(X23)
| ~ net_str(X23,X22)
| empty_carrier(X22)
| ~ one_sorted_str(X22) )
& ( related(X23,X25,esk3_4(X22,X23,X24,X25))
| ~ element(X25,the_carrier(X23))
| ~ is_often_in(X22,X23,X24)
| empty_carrier(X23)
| ~ net_str(X23,X22)
| empty_carrier(X22)
| ~ one_sorted_str(X22) )
& ( in(apply_netmap(X22,X23,esk3_4(X22,X23,X24,X25)),X24)
| ~ element(X25,the_carrier(X23))
| ~ is_often_in(X22,X23,X24)
| empty_carrier(X23)
| ~ net_str(X23,X22)
| empty_carrier(X22)
| ~ one_sorted_str(X22) )
& ( element(esk4_3(X22,X23,X27),the_carrier(X23))
| is_often_in(X22,X23,X27)
| empty_carrier(X23)
| ~ net_str(X23,X22)
| empty_carrier(X22)
| ~ one_sorted_str(X22) )
& ( ~ element(X29,the_carrier(X23))
| ~ related(X23,esk4_3(X22,X23,X27),X29)
| ~ in(apply_netmap(X22,X23,X29),X27)
| is_often_in(X22,X23,X27)
| empty_carrier(X23)
| ~ net_str(X23,X22)
| empty_carrier(X22)
| ~ one_sorted_str(X22) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])])]) ).
fof(c_0_15,plain,
! [X94,X95,X96] :
( ~ in(X94,X95)
| ~ element(X95,powerset(X96))
| element(X94,X96) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
cnf(c_0_16,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,negated_conjecture,
subset(esk22_0,esk23_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
fof(c_0_18,plain,
! [X97,X98,X99] :
( ~ in(X97,X98)
| ~ element(X98,powerset(X99))
| ~ empty(X99) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_19,plain,
! [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) ) ) ) ) ) ),
inference(fof_simplification,[status(thm)],[d11_waybel_0]) ).
cnf(c_0_20,plain,
( is_often_in(X3,X2,X4)
| empty_carrier(X2)
| empty_carrier(X3)
| ~ element(X1,the_carrier(X2))
| ~ related(X2,esk4_3(X3,X2,X4),X1)
| ~ in(apply_netmap(X3,X2,X1),X4)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( related(X1,X2,esk3_4(X3,X1,X4,X2))
| empty_carrier(X1)
| empty_carrier(X3)
| ~ element(X2,the_carrier(X1))
| ~ is_often_in(X3,X1,X4)
| ~ net_str(X1,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
( element(esk4_3(X1,X2,X3),the_carrier(X2))
| is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X90,X91] :
( ~ element(X90,X91)
| empty(X91)
| in(X90,X91) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_24,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
element(esk22_0,powerset(esk23_0)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_26,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_27,plain,
! [X14,X15,X16,X18,X19,X20] :
( ( element(esk1_3(X14,X15,X16),the_carrier(X15))
| ~ is_eventually_in(X14,X15,X16)
| empty_carrier(X15)
| ~ net_str(X15,X14)
| empty_carrier(X14)
| ~ one_sorted_str(X14) )
& ( ~ element(X18,the_carrier(X15))
| ~ related(X15,esk1_3(X14,X15,X16),X18)
| in(apply_netmap(X14,X15,X18),X16)
| ~ is_eventually_in(X14,X15,X16)
| empty_carrier(X15)
| ~ net_str(X15,X14)
| empty_carrier(X14)
| ~ one_sorted_str(X14) )
& ( element(esk2_4(X14,X15,X19,X20),the_carrier(X15))
| ~ element(X20,the_carrier(X15))
| is_eventually_in(X14,X15,X19)
| empty_carrier(X15)
| ~ net_str(X15,X14)
| empty_carrier(X14)
| ~ one_sorted_str(X14) )
& ( related(X15,X20,esk2_4(X14,X15,X19,X20))
| ~ element(X20,the_carrier(X15))
| is_eventually_in(X14,X15,X19)
| empty_carrier(X15)
| ~ net_str(X15,X14)
| empty_carrier(X14)
| ~ one_sorted_str(X14) )
& ( ~ in(apply_netmap(X14,X15,esk2_4(X14,X15,X19,X20)),X19)
| ~ element(X20,the_carrier(X15))
| is_eventually_in(X14,X15,X19)
| empty_carrier(X15)
| ~ net_str(X15,X14)
| empty_carrier(X14)
| ~ one_sorted_str(X14) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])])])])]) ).
cnf(c_0_28,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X4)
| empty_carrier(X1)
| empty_carrier(X2)
| ~ 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_20,c_0_21]),c_0_22]) ).
cnf(c_0_29,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( element(X1,esk23_0)
| ~ in(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
( in(apply_netmap(X1,X2,esk3_4(X1,X2,X3,X4)),X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ element(X4,the_carrier(X2))
| ~ is_often_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,negated_conjecture,
( ~ empty(esk23_0)
| ~ in(X1,esk22_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_33,plain,
( in(apply_netmap(X3,X2,X1),X4)
| empty_carrier(X2)
| empty_carrier(X3)
| ~ element(X1,the_carrier(X2))
| ~ related(X2,esk1_3(X3,X2,X4),X1)
| ~ is_eventually_in(X3,X2,X4)
| ~ net_str(X2,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_34,plain,
( related(X1,X2,esk2_4(X3,X1,X4,X2))
| is_eventually_in(X3,X1,X4)
| empty_carrier(X1)
| empty_carrier(X3)
| ~ element(X2,the_carrier(X1))
| ~ net_str(X1,X3)
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_35,plain,
( element(esk1_3(X1,X2,X3),the_carrier(X2))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ is_eventually_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,plain,
( is_often_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| 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_28,c_0_29]) ).
cnf(c_0_37,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_30,c_0_31]) ).
cnf(c_0_38,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_32,c_0_31]) ).
cnf(c_0_39,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ in(apply_netmap(X1,X2,esk2_4(X1,X2,X3,X4)),X3)
| ~ element(X4,the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_40,plain,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X1)
| empty_carrier(X4)
| empty_carrier(X2)
| 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_33,c_0_34]),c_0_35]) ).
cnf(c_0_41,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)
| ~ 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_36,c_0_37]),c_0_22]),c_0_38]) ).
cnf(c_0_42,plain,
( element(esk3_4(X1,X2,X3,X4),the_carrier(X2))
| empty_carrier(X2)
| empty_carrier(X1)
| ~ element(X4,the_carrier(X2))
| ~ is_often_in(X1,X2,X3)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_43,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_39,c_0_29]) ).
cnf(c_0_44,negated_conjecture,
( is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X4)
| 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_30,c_0_40]) ).
fof(c_0_45,plain,
! [X1] :
( ~ empty(X1)
=> ? [X2] :
( element(X2,powerset(X1))
& ~ empty(X2)
& finite(X2) ) ),
inference(fof_simplification,[status(thm)],[rc4_finset_1]) ).
cnf(c_0_46,negated_conjecture,
( ~ is_often_in(esk20_0,esk21_0,esk23_0)
| ~ is_eventually_in(esk20_0,esk21_0,esk23_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_47,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) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_22]) ).
cnf(c_0_48,negated_conjecture,
net_str(esk21_0,esk20_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_49,negated_conjecture,
one_sorted_str(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_50,negated_conjecture,
~ empty_carrier(esk21_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_51,negated_conjecture,
~ empty_carrier(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_52,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_13]) ).
cnf(c_0_53,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)
| ~ element(esk2_4(X1,X2,esk23_0,esk1_3(X1,X2,esk22_0)),the_carrier(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_35]) ).
cnf(c_0_54,plain,
( element(esk2_4(X1,X2,X3,X4),the_carrier(X2))
| is_eventually_in(X1,X2,X3)
| empty_carrier(X2)
| empty_carrier(X1)
| ~ element(X4,the_carrier(X2))
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
fof(c_0_55,plain,
! [X76] :
( ( element(esk18_1(X76),powerset(X76))
| empty(X76) )
& ( ~ empty(esk18_1(X76))
| empty(X76) )
& ( finite(esk18_1(X76))
| empty(X76) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_45])])])]) ).
cnf(c_0_56,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_46,c_0_47]),c_0_48]),c_0_49])]),c_0_50]),c_0_51]),c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( is_eventually_in(X1,X2,esk23_0)
| empty_carrier(X2)
| empty_carrier(X1)
| empty(esk23_0)
| ~ is_eventually_in(X1,X2,esk22_0)
| ~ net_str(X2,X1)
| ~ one_sorted_str(X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_35]) ).
cnf(c_0_58,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_13]) ).
cnf(c_0_59,negated_conjecture,
( is_often_in(esk20_0,esk21_0,esk22_0)
| is_eventually_in(esk20_0,esk21_0,esk22_0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_60,plain,
( element(esk18_1(X1),powerset(X1))
| empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
cnf(c_0_61,negated_conjecture,
( empty(esk23_0)
| ~ is_eventually_in(esk20_0,esk21_0,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_56,c_0_57]),c_0_48]),c_0_49])]),c_0_50]),c_0_51]) ).
cnf(c_0_62,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_58,c_0_47]),c_0_48]),c_0_49])]),c_0_50]),c_0_51]),c_0_59]) ).
cnf(c_0_63,plain,
( element(X1,X2)
| empty(X2)
| ~ in(X1,esk18_1(X2)) ),
inference(spm,[status(thm)],[c_0_24,c_0_60]) ).
cnf(c_0_64,plain,
( empty(X1)
| ~ empty(esk18_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_55]) ).
fof(c_0_65,plain,
! [X55] : element(esk9_1(X55),X55),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_66,plain,
! [X103,X104] :
( ~ empty(X103)
| X103 = X104
| ~ empty(X104) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
cnf(c_0_67,negated_conjecture,
( empty(esk22_0)
| ~ element(X1,esk22_0)
| ~ empty(esk23_0) ),
inference(spm,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_68,negated_conjecture,
empty(esk23_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]) ).
cnf(c_0_69,plain,
( element(X1,X2)
| empty(X2)
| ~ element(X1,esk18_1(X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_29]),c_0_64]) ).
cnf(c_0_70,plain,
element(esk9_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_71,plain,
( X1 = X2
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( empty(esk22_0)
| ~ element(X1,esk22_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_68])]) ).
cnf(c_0_73,plain,
( element(esk9_1(esk18_1(X1)),X1)
| empty(X1) ),
inference(spm,[status(thm)],[c_0_69,c_0_70]) ).
cnf(c_0_74,negated_conjecture,
( X1 = esk23_0
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_71,c_0_68]) ).
cnf(c_0_75,negated_conjecture,
empty(esk22_0),
inference(spm,[status(thm)],[c_0_72,c_0_73]) ).
cnf(c_0_76,negated_conjecture,
esk23_0 = esk22_0,
inference(spm,[status(thm)],[c_0_74,c_0_75]) ).
cnf(c_0_77,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_76]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU367+1 : TPTP v8.1.2. Released v3.3.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n023.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 : 300
% 0.13/0.34 % DateTime : Thu Aug 24 01:54:27 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.45/0.57 start to proof: theBenchmark
% 3.84/3.92 % Version : CSE_E---1.5
% 3.84/3.92 % Problem : theBenchmark.p
% 3.84/3.92 % Proof found
% 3.84/3.92 % SZS status Theorem for theBenchmark.p
% 3.84/3.92 % SZS output start Proof
% See solution above
% 3.84/3.93 % Total time : 3.330000 s
% 3.84/3.93 % SZS output end Proof
% 3.84/3.93 % Total time : 3.333000 s
%------------------------------------------------------------------------------