TSTP Solution File: SEU322+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : SEU322+1 : TPTP v8.2.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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 : Tue May 21 03:32:34 EDT 2024
% Result : Timeout 299.21s 38.18s
% Output : None
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 20
% Syntax : Number of formulae : 101 ( 14 unt; 0 def)
% Number of atoms : 281 ( 17 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 316 ( 136 ~; 129 |; 21 &)
% ( 5 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 178 ( 11 sgn 83 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
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(existence_m1_subset_1,axiom,
! [X1] :
? [X2] : element(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',existence_m1_subset_1) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t2_subset) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_boole) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(t44_tops_1,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(interior(X1,X2),X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t44_tops_1) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
fof(fc6_membered,axiom,
( empty(empty_set)
& v1_membered(empty_set)
& v2_membered(empty_set)
& v3_membered(empty_set)
& v4_membered(empty_set)
& v5_membered(empty_set) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc6_membered) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(d1_tops_1,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tops_1) ).
fof(t54_subset_1,axiom,
! [X1,X2,X3] :
( element(X3,powerset(X1))
=> ~ ( in(X2,subset_complement(X1,X3))
& in(X2,X3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t54_subset_1) ).
fof(dt_k6_pre_topc,axiom,
! [X1,X2] :
( ( top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> element(topstr_closure(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_pre_topc) ).
fof(dt_l1_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> one_sorted_str(X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_l1_pre_topc) ).
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(dt_k1_tops_1,axiom,
! [X1,X2] :
( ( top_str(X1)
& element(X2,powerset(the_carrier(X1))) )
=> element(interior(X1,X2),powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_tops_1) ).
fof(t48_pre_topc,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(X2,topstr_closure(X1,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t48_pre_topc) ).
fof(l40_tops_1,axiom,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l40_tops_1) ).
fof(d1_struct_0,axiom,
! [X1] :
( one_sorted_str(X1)
=> ( empty_carrier(X1)
<=> empty(the_carrier(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_struct_0) ).
fof(c_0_20,plain,
! [X40,X41,X42] :
( ~ in(X40,X41)
| ~ element(X41,powerset(X42))
| ~ empty(X42) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])])]) ).
fof(c_0_21,plain,
! [X31] : element(esk4_1(X31),X31),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[existence_m1_subset_1])]) ).
fof(c_0_22,plain,
! [X35,X36] :
( ~ element(X35,X36)
| empty(X36)
| in(X35,X36) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])])]) ).
cnf(c_0_23,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_24,plain,
element(esk4_1(X1),X1),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_25,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_26,plain,
! [X43,X44] :
( ~ element(X44,powerset(X43))
| element(subset_complement(X43,X44),powerset(X43)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])])]) ).
fof(c_0_27,plain,
! [X85] :
( ~ empty(X85)
| X85 = empty_set ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
cnf(c_0_28,plain,
( ~ empty(X1)
| ~ in(X2,esk4_1(powerset(X1))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_29,plain,
( empty(X1)
| in(esk4_1(X1),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_24]) ).
cnf(c_0_30,plain,
( element(subset_complement(X2,X1),powerset(X2))
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_32,plain,
( empty(esk4_1(powerset(X1)))
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_33,plain,
( ~ empty(X1)
| ~ element(X2,powerset(X1))
| ~ in(X3,subset_complement(X1,X2)) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_34,plain,
( esk4_1(powerset(X1)) = empty_set
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
fof(c_0_35,plain,
! [X6,X7,X8,X9,X10] :
( ( ~ subset(X6,X7)
| ~ in(X8,X6)
| in(X8,X7) )
& ( in(esk3_2(X9,X10),X9)
| subset(X9,X10) )
& ( ~ in(esk3_2(X9,X10),X10)
| subset(X9,X10) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[d3_tarski])])])])])])]) ).
fof(c_0_36,plain,
! [X45,X46] :
( ~ element(X46,powerset(X45))
| subset_complement(X45,subset_complement(X45,X46)) = X46 ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).
cnf(c_0_37,plain,
( empty(subset_complement(X1,X2))
| ~ empty(X1)
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_33,c_0_29]) ).
fof(c_0_38,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> subset(interior(X1,X2),X2) ) ),
inference(assume_negation,[status(cth)],[t44_tops_1]) ).
cnf(c_0_39,plain,
( ~ empty(X1)
| ~ in(X2,empty_set) ),
inference(spm,[status(thm)],[c_0_28,c_0_34]) ).
cnf(c_0_40,plain,
( in(esk3_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_41,plain,
( subset_complement(X2,subset_complement(X2,X1)) = X1
| ~ element(X1,powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_42,plain,
( subset_complement(X1,X2) = empty_set
| ~ empty(X1)
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_31,c_0_37]) ).
fof(c_0_43,negated_conjecture,
( top_str(esk1_0)
& element(esk2_0,powerset(the_carrier(esk1_0)))
& ~ subset(interior(esk1_0,esk2_0),esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).
fof(c_0_44,plain,
! [X13,X14] :
( ( ~ element(X13,powerset(X14))
| subset(X13,X14) )
& ( ~ subset(X13,X14)
| element(X13,powerset(X14)) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])])]) ).
cnf(c_0_45,plain,
( subset(empty_set,X1)
| ~ empty(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_46,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc6_membered]) ).
cnf(c_0_47,plain,
( subset_complement(X1,empty_set) = X2
| ~ empty(X1)
| ~ element(X2,powerset(X1)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
element(esk2_0,powerset(the_carrier(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_49,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_44]) ).
cnf(c_0_50,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
fof(c_0_51,plain,
! [X63,X64] :
( ~ in(X63,X64)
| ~ empty(X64) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_52,plain,
! [X17,X18] :
( ~ top_str(X17)
| ~ element(X18,powerset(the_carrier(X17)))
| interior(X17,X18) = subset_complement(the_carrier(X17),topstr_closure(X17,subset_complement(the_carrier(X17),X18))) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tops_1])])])]) ).
cnf(c_0_53,negated_conjecture,
( subset_complement(the_carrier(esk1_0),empty_set) = esk2_0
| ~ empty(the_carrier(esk1_0)) ),
inference(spm,[status(thm)],[c_0_47,c_0_48]) ).
cnf(c_0_54,plain,
element(empty_set,powerset(X1)),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_55,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[c_0_51]) ).
cnf(c_0_56,plain,
( interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_57,negated_conjecture,
( subset_complement(the_carrier(esk1_0),esk2_0) = empty_set
| ~ empty(the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_53]),c_0_54])]) ).
cnf(c_0_58,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_59,negated_conjecture,
~ subset(interior(esk1_0,esk2_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_43]) ).
cnf(c_0_60,plain,
( subset(X1,X2)
| ~ empty(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_40]) ).
fof(c_0_61,plain,
! [X52,X53,X54] :
( ~ element(X54,powerset(X52))
| ~ in(X53,subset_complement(X52,X54))
| ~ in(X53,X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t54_subset_1])])]) ).
cnf(c_0_62,negated_conjecture,
( subset_complement(the_carrier(esk1_0),topstr_closure(esk1_0,empty_set)) = interior(esk1_0,esk2_0)
| ~ empty(the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_48])]) ).
cnf(c_0_63,negated_conjecture,
~ empty(interior(esk1_0,esk2_0)),
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
fof(c_0_64,plain,
! [X56,X57] :
( ~ top_str(X56)
| ~ element(X57,powerset(the_carrier(X56)))
| element(topstr_closure(X56,X57),powerset(the_carrier(X56))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k6_pre_topc])])]) ).
fof(c_0_65,plain,
! [X59] :
( ~ top_str(X59)
| one_sorted_str(X59) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_pre_topc])])]) ).
fof(c_0_66,plain,
! [X37,X38,X39] :
( ~ in(X37,X38)
| ~ element(X38,powerset(X39))
| element(X37,X39) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])])]) ).
fof(c_0_67,plain,
! [X19,X20] :
( ~ top_str(X19)
| ~ element(X20,powerset(the_carrier(X19)))
| element(interior(X19,X20),powerset(the_carrier(X19))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_tops_1])])]) ).
cnf(c_0_68,plain,
( ~ element(X1,powerset(X2))
| ~ in(X3,subset_complement(X2,X1))
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_61]) ).
fof(c_0_69,plain,
! [X15,X16] :
( ~ top_str(X15)
| ~ element(X16,powerset(the_carrier(X15)))
| subset(X16,topstr_closure(X15,X16)) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t48_pre_topc])])])]) ).
fof(c_0_70,plain,
! [X1] :
( ( ~ empty_carrier(X1)
& one_sorted_str(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( in(X3,subset_complement(the_carrier(X1),X2))
<=> ~ in(X3,X2) ) ) ) ),
inference(fof_simplification,[status(thm)],[l40_tops_1]) ).
cnf(c_0_71,negated_conjecture,
( ~ empty(the_carrier(esk1_0))
| ~ element(topstr_closure(esk1_0,empty_set),powerset(the_carrier(esk1_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_62]),c_0_63]) ).
cnf(c_0_72,plain,
( element(topstr_closure(X1,X2),powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_64]) ).
fof(c_0_73,plain,
! [X55] :
( ( ~ empty_carrier(X55)
| empty(the_carrier(X55))
| ~ one_sorted_str(X55) )
& ( ~ empty(the_carrier(X55))
| empty_carrier(X55)
| ~ one_sorted_str(X55) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_struct_0])])])]) ).
cnf(c_0_74,plain,
( one_sorted_str(X1)
| ~ top_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_65]) ).
cnf(c_0_75,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_66]) ).
cnf(c_0_76,plain,
( element(interior(X1,X2),powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_67]) ).
cnf(c_0_77,plain,
( subset(subset_complement(X1,X2),X3)
| ~ element(X2,powerset(X1))
| ~ in(esk3_2(subset_complement(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_68,c_0_40]) ).
cnf(c_0_78,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_79,plain,
( subset(X2,topstr_closure(X1,X2))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(split_conjunct,[status(thm)],[c_0_69]) ).
cnf(c_0_80,plain,
( topstr_closure(X1,subset_complement(the_carrier(X1),X2)) = subset_complement(the_carrier(X1),interior(X1,X2))
| ~ top_str(X1)
| ~ element(topstr_closure(X1,subset_complement(the_carrier(X1),X2)),powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_41,c_0_56]) ).
fof(c_0_81,plain,
! [X47,X48,X49] :
( ( ~ in(X49,subset_complement(the_carrier(X47),X48))
| ~ in(X49,X48)
| ~ element(X49,the_carrier(X47))
| ~ element(X48,powerset(the_carrier(X47)))
| empty_carrier(X47)
| ~ one_sorted_str(X47) )
& ( in(X49,X48)
| in(X49,subset_complement(the_carrier(X47),X48))
| ~ element(X49,the_carrier(X47))
| ~ element(X48,powerset(the_carrier(X47)))
| empty_carrier(X47)
| ~ one_sorted_str(X47) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_70])])])])]) ).
cnf(c_0_82,negated_conjecture,
~ empty(the_carrier(esk1_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_58]),c_0_54])]) ).
cnf(c_0_83,plain,
( empty(the_carrier(X1))
| ~ empty_carrier(X1)
| ~ one_sorted_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_73]) ).
cnf(c_0_84,negated_conjecture,
one_sorted_str(esk1_0),
inference(spm,[status(thm)],[c_0_74,c_0_58]) ).
cnf(c_0_85,plain,
( element(X1,the_carrier(X2))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,interior(X2,X3)) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_86,plain,
( subset(interior(X1,X2),X3)
| ~ top_str(X1)
| ~ element(topstr_closure(X1,subset_complement(the_carrier(X1),X2)),powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(esk3_2(interior(X1,X2),X3),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ),
inference(spm,[status(thm)],[c_0_77,c_0_56]) ).
cnf(c_0_87,plain,
( in(X1,topstr_closure(X2,X3))
| ~ top_str(X2)
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_78,c_0_79]) ).
cnf(c_0_88,plain,
( topstr_closure(X1,subset_complement(the_carrier(X1),X2)) = subset_complement(the_carrier(X1),interior(X1,X2))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_72]),c_0_30]) ).
cnf(c_0_89,plain,
( in(X1,X2)
| in(X1,subset_complement(the_carrier(X3),X2))
| empty_carrier(X3)
| ~ element(X1,the_carrier(X3))
| ~ element(X2,powerset(the_carrier(X3)))
| ~ one_sorted_str(X3) ),
inference(split_conjunct,[status(thm)],[c_0_81]) ).
cnf(c_0_90,negated_conjecture,
~ empty_carrier(esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_84])]) ).
cnf(c_0_91,plain,
( subset(interior(X1,X2),X3)
| element(esk3_2(interior(X1,X2),X3),the_carrier(X1))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(spm,[status(thm)],[c_0_85,c_0_40]) ).
cnf(c_0_92,plain,
( subset(interior(X1,X2),X3)
| ~ top_str(X1)
| ~ element(topstr_closure(X1,subset_complement(the_carrier(X1),X2)),powerset(the_carrier(X1)))
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(esk3_2(interior(X1,X2),X3),subset_complement(the_carrier(X1),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_87]),c_0_30]) ).
cnf(c_0_93,plain,
( element(subset_complement(the_carrier(X1),interior(X1,X2)),powerset(the_carrier(X1)))
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_88]),c_0_30]) ).
cnf(c_0_94,negated_conjecture,
( in(X1,subset_complement(the_carrier(esk1_0),esk2_0))
| in(X1,esk2_0)
| ~ element(X1,the_carrier(esk1_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_48]),c_0_84])]),c_0_90]) ).
cnf(c_0_95,negated_conjecture,
( subset(interior(esk1_0,esk2_0),X1)
| element(esk3_2(interior(esk1_0,esk2_0),X1),the_carrier(esk1_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_48]),c_0_58])]) ).
cnf(c_0_96,plain,
( subset(interior(X1,X2),X3)
| ~ top_str(X1)
| ~ element(X2,powerset(the_carrier(X1)))
| ~ in(esk3_2(interior(X1,X2),X3),subset_complement(the_carrier(X1),X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_88]),c_0_93]) ).
cnf(c_0_97,negated_conjecture,
( subset(interior(esk1_0,esk2_0),X1)
| in(esk3_2(interior(esk1_0,esk2_0),X1),subset_complement(the_carrier(esk1_0),esk2_0))
| in(esk3_2(interior(esk1_0,esk2_0),X1),esk2_0) ),
inference(spm,[status(thm)],[c_0_94,c_0_95]) ).
cnf(c_0_98,plain,
( subset(X1,X2)
| ~ in(esk3_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_99,negated_conjecture,
( subset(interior(esk1_0,esk2_0),X1)
| in(esk3_2(interior(esk1_0,esk2_0),X1),esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_58]),c_0_48])]) ).
cnf(c_0_100,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_59]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU322+1 : TPTP v8.2.0. Released v3.3.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 17:34:53 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order model finding
% 0.20/0.48 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 299.21/38.18 # Version: 3.1.0
% 299.21/38.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 299.21/38.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 299.21/38.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 299.21/38.18 # Starting new_bool_3 with 300s (1) cores
% 299.21/38.18 # Starting new_bool_1 with 300s (1) cores
% 299.21/38.18 # Starting sh5l with 300s (1) cores
% 299.21/38.18 # sh5l with pid 20388 completed with status 0
% 299.21/38.18 # Result found by sh5l
% 299.21/38.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 299.21/38.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 299.21/38.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 299.21/38.18 # Starting new_bool_3 with 300s (1) cores
% 299.21/38.18 # Starting new_bool_1 with 300s (1) cores
% 299.21/38.18 # Starting sh5l with 300s (1) cores
% 299.21/38.18 # SinE strategy is gf500_gu_R04_F100_L20000
% 299.21/38.18 # Search class: FGHSS-FFMM21-MFFFFFNN
% 299.21/38.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 299.21/38.18 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 299.21/38.18 # G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with pid 20395 completed with status 0
% 299.21/38.18 # Result found by G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN
% 299.21/38.18 # Preprocessing class: FSLSSMSSSSSNFFN.
% 299.21/38.18 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 299.21/38.18 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 299.21/38.18 # Starting new_bool_3 with 300s (1) cores
% 299.21/38.18 # Starting new_bool_1 with 300s (1) cores
% 299.21/38.18 # Starting sh5l with 300s (1) cores
% 299.21/38.18 # SinE strategy is gf500_gu_R04_F100_L20000
% 299.21/38.18 # Search class: FGHSS-FFMM21-MFFFFFNN
% 299.21/38.18 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 299.21/38.18 # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 181s (1) cores
% 299.21/38.18 # Preprocessing time : 0.002 s
% 299.21/38.18 # Presaturation interreduction done
% 299.21/38.18
% 299.21/38.18 # Proof found!
% 299.21/38.18 # SZS status Theorem
% 299.21/38.18 # SZS output start CNFRefutation
% See solution above
% 299.21/38.18 # Parsed axioms : 50
% 299.21/38.18 # Removed by relevancy pruning/SinE : 5
% 299.21/38.18 # Initial clauses : 88
% 299.21/38.18 # Removed in clause preprocessing : 0
% 299.21/38.18 # Initial clauses in saturation : 88
% 299.21/38.18 # Processed clauses : 176122
% 299.21/38.18 # ...of these trivial : 135
% 299.21/38.18 # ...subsumed : 154632
% 299.21/38.18 # ...remaining for further processing : 21355
% 299.21/38.18 # Other redundant clauses eliminated : 0
% 299.21/38.18 # Clauses deleted for lack of memory : 0
% 299.21/38.18 # Backward-subsumed : 1803
% 299.21/38.18 # Backward-rewritten : 1569
% 299.21/38.18 # Generated clauses : 1650304
% 299.21/38.18 # ...of the previous two non-redundant : 1614280
% 299.21/38.18 # ...aggressively subsumed : 0
% 299.21/38.18 # Contextual simplify-reflections : 603
% 299.21/38.18 # Paramodulations : 1650261
% 299.21/38.18 # Factorizations : 0
% 299.21/38.18 # NegExts : 0
% 299.21/38.18 # Equation resolutions : 0
% 299.21/38.18 # Disequality decompositions : 0
% 299.21/38.18 # Total rewrite steps : 765586
% 299.21/38.18 # ...of those cached : 764858
% 299.21/38.18 # Propositional unsat checks : 4
% 299.21/38.18 # Propositional check models : 0
% 299.21/38.18 # Propositional check unsatisfiable : 0
% 299.21/38.18 # Propositional clauses : 0
% 299.21/38.18 # Propositional clauses after purity: 0
% 299.21/38.18 # Propositional unsat core size : 0
% 299.21/38.18 # Propositional preprocessing time : 0.000
% 299.21/38.18 # Propositional encoding time : 3.126
% 299.21/38.18 # Propositional solver time : 2.264
% 299.21/38.18 # Success case prop preproc time : 0.000
% 299.21/38.18 # Success case prop encoding time : 0.000
% 299.21/38.18 # Success case prop solver time : 0.000
% 299.21/38.18 # Current number of processed clauses : 17854
% 299.21/38.18 # Positive orientable unit clauses : 117
% 299.21/38.18 # Positive unorientable unit clauses: 0
% 299.21/38.18 # Negative unit clauses : 34
% 299.21/38.18 # Non-unit-clauses : 17703
% 299.21/38.18 # Current number of unprocessed clauses: 1425232
% 299.21/38.18 # ...number of literals in the above : 7290825
% 299.21/38.18 # Current number of archived formulas : 0
% 299.21/38.18 # Current number of archived clauses : 3501
% 299.21/38.18 # Clause-clause subsumption calls (NU) : 36576311
% 299.21/38.18 # Rec. Clause-clause subsumption calls : 22200262
% 299.21/38.18 # Non-unit clause-clause subsumptions : 77820
% 299.21/38.18 # Unit Clause-clause subsumption calls : 143553
% 299.21/38.18 # Rewrite failures with RHS unbound : 0
% 299.21/38.18 # BW rewrite match attempts : 1826
% 299.21/38.18 # BW rewrite match successes : 119
% 299.21/38.18 # Condensation attempts : 0
% 299.21/38.18 # Condensation successes : 0
% 299.21/38.18 # Termbank termtop insertions : 73635041
% 299.21/38.18 # Search garbage collected termcells : 918
% 299.21/38.18
% 299.21/38.18 # -------------------------------------------------
% 299.21/38.18 # User time : 36.243 s
% 299.21/38.18 # System time : 0.961 s
% 299.21/38.18 # Total time : 37.204 s
% 299.21/38.18 # Maximum resident set size: 2028 pages
% 299.21/38.18
% 299.21/38.18 # -------------------------------------------------
% 299.21/38.18 # User time : 36.246 s
% 299.21/38.18 # System time : 0.963 s
% 299.21/38.18 # Total time : 37.209 s
% 299.21/38.18 # Maximum resident set size: 1740 pages
% 299.21/38.18 % E---3.1 exiting
%------------------------------------------------------------------------------