TSTP Solution File: NUM397+1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : NUM397+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 19:07:00 EDT 2023
% Result : Theorem 1394.88s 195.77s
% Output : CNFRefutation 1394.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 14
% Syntax : Number of formulae : 91 ( 7 unt; 0 def)
% Number of atoms : 279 ( 22 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 313 ( 125 ~; 133 |; 33 &)
% ( 6 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 1 con; 0-3 aty)
% Number of variables : 148 ( 2 sgn; 72 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_subset,axiom,
! [X1,X2,X3] :
( ( in(X1,X2)
& element(X2,powerset(X3)) )
=> element(X1,X3) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t4_subset) ).
fof(t3_subset,axiom,
! [X1,X2] :
( element(X1,powerset(X2))
<=> subset(X1,X2) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t3_subset) ).
fof(t5_subset,axiom,
! [X1,X2,X3] :
~ ( in(X1,X2)
& element(X2,powerset(X3))
& empty(X3) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t5_subset) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',antisymmetry_r2_hidden) ).
fof(t2_subset,axiom,
! [X1,X2] :
( element(X1,X2)
=> ( empty(X2)
| in(X1,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t2_subset) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X3,X4)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',d4_tarski) ).
fof(t30_ordinal1,conjecture,
! [X1] :
( ordinal(X1)
=> ordinal(union(X1)) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t30_ordinal1) ).
fof(d2_ordinal1,axiom,
! [X1] :
( epsilon_transitive(X1)
<=> ! [X2] :
( in(X2,X1)
=> subset(X2,X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',d2_ordinal1) ).
fof(t23_ordinal1,axiom,
! [X1,X2] :
( ordinal(X2)
=> ( in(X1,X2)
=> ordinal(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t23_ordinal1) ).
fof(t92_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t92_zfmisc_1) ).
fof(t24_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',t24_ordinal1) ).
fof(d3_ordinal1,axiom,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',d3_ordinal1) ).
fof(cc1_ordinal1,axiom,
! [X1] :
( ordinal(X1)
=> ( epsilon_transitive(X1)
& epsilon_connected(X1) ) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',cc1_ordinal1) ).
fof(cc2_ordinal1,axiom,
! [X1] :
( ( epsilon_transitive(X1)
& epsilon_connected(X1) )
=> ordinal(X1) ),
file('/export/starexec/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p',cc2_ordinal1) ).
fof(c_0_14,plain,
! [X67,X68,X69] :
( ~ in(X67,X68)
| ~ element(X68,powerset(X69))
| element(X67,X69) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t4_subset])]) ).
fof(c_0_15,plain,
! [X65,X66] :
( ( ~ element(X65,powerset(X66))
| subset(X65,X66) )
& ( ~ subset(X65,X66)
| element(X65,powerset(X66)) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t3_subset])]) ).
fof(c_0_16,plain,
! [X70,X71,X72] :
( ~ in(X70,X71)
| ~ element(X71,powerset(X72))
| ~ empty(X72) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t5_subset])]) ).
fof(c_0_17,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(c_0_18,plain,
! [X62,X63] :
( ~ element(X62,X63)
| empty(X63)
| in(X62,X63) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).
cnf(c_0_19,plain,
( element(X1,X3)
| ~ in(X1,X2)
| ~ element(X2,powerset(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
( element(X1,powerset(X2))
| ~ subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ in(X1,X2)
| ~ element(X2,powerset(X3))
| ~ empty(X3) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,plain,
! [X26,X27,X28,X30,X31,X32,X33,X35] :
( ( in(X28,esk4_3(X26,X27,X28))
| ~ in(X28,X27)
| X27 != union(X26) )
& ( in(esk4_3(X26,X27,X28),X26)
| ~ in(X28,X27)
| X27 != union(X26) )
& ( ~ in(X30,X31)
| ~ in(X31,X26)
| in(X30,X27)
| X27 != union(X26) )
& ( ~ in(esk5_2(X32,X33),X33)
| ~ in(esk5_2(X32,X33),X35)
| ~ in(X35,X32)
| X33 = union(X32) )
& ( in(esk5_2(X32,X33),esk6_2(X32,X33))
| in(esk5_2(X32,X33),X33)
| X33 = union(X32) )
& ( in(esk6_2(X32,X33),X32)
| in(esk5_2(X32,X33),X33)
| X33 = union(X32) ) ),
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)],[d4_tarski])])])])])]) ).
fof(c_0_23,negated_conjecture,
~ ! [X1] :
( ordinal(X1)
=> ordinal(union(X1)) ),
inference(assume_negation,[status(cth)],[t30_ordinal1]) ).
fof(c_0_24,plain,
! [X5,X6] :
( ~ in(X5,X6)
| ~ in(X6,X5) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
cnf(c_0_25,plain,
( empty(X2)
| in(X1,X2)
| ~ element(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( element(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ subset(X1,X2)
| ~ empty(X2)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,plain,
( in(X1,esk4_3(X2,X3,X1))
| ~ in(X1,X3)
| X3 != union(X2) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_29,plain,
! [X15,X16,X17] :
( ( ~ epsilon_transitive(X15)
| ~ in(X16,X15)
| subset(X16,X15) )
& ( in(esk1_1(X17),X17)
| epsilon_transitive(X17) )
& ( ~ subset(esk1_1(X17),X17)
| epsilon_transitive(X17) ) ),
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)],[d2_ordinal1])])])])])]) ).
fof(c_0_30,plain,
! [X58,X59] :
( ~ ordinal(X59)
| ~ in(X58,X59)
| ordinal(X58) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t23_ordinal1])]) ).
fof(c_0_31,negated_conjecture,
( ordinal(esk20_0)
& ~ ordinal(union(esk20_0)) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
cnf(c_0_32,plain,
( in(esk4_3(X1,X2,X3),X1)
| ~ in(X3,X2)
| X2 != union(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_34,plain,
( in(X1,X2)
| ~ subset(X3,X2)
| ~ in(X1,X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
fof(c_0_35,plain,
! [X78,X79] :
( ~ in(X78,X79)
| subset(X78,union(X79)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t92_zfmisc_1])]) ).
fof(c_0_36,plain,
! [X1] :
( ordinal(X1)
=> ! [X2] :
( ordinal(X2)
=> ~ ( ~ in(X1,X2)
& X1 != X2
& ~ in(X2,X1) ) ) ),
inference(fof_simplification,[status(thm)],[t24_ordinal1]) ).
cnf(c_0_37,plain,
( in(X1,esk4_3(X2,union(X2),X1))
| ~ in(X1,union(X2)) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( in(esk1_1(X1),X1)
| epsilon_transitive(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
( ordinal(X2)
| ~ ordinal(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,negated_conjecture,
ordinal(esk20_0),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_41,plain,
( in(esk4_3(X1,union(X1),X2),X1)
| ~ in(X2,union(X1)) ),
inference(er,[status(thm)],[c_0_32]) ).
fof(c_0_42,plain,
! [X1] :
( epsilon_connected(X1)
<=> ! [X2,X3] :
~ ( in(X2,X1)
& in(X3,X1)
& ~ in(X2,X3)
& X2 != X3
& ~ in(X3,X2) ) ),
inference(fof_simplification,[status(thm)],[d3_ordinal1]) ).
cnf(c_0_43,plain,
( ~ subset(X1,X2)
| ~ in(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_44,plain,
( subset(X2,X1)
| ~ epsilon_transitive(X1)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
fof(c_0_45,plain,
! [X8] :
( ( epsilon_transitive(X8)
| ~ ordinal(X8) )
& ( epsilon_connected(X8)
| ~ ordinal(X8) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc1_ordinal1])])]) ).
cnf(c_0_46,plain,
( epsilon_transitive(X1)
| ~ subset(esk1_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_47,plain,
( subset(X1,union(X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
fof(c_0_48,plain,
! [X60,X61] :
( ~ ordinal(X60)
| ~ ordinal(X61)
| in(X60,X61)
| X60 = X61
| in(X61,X60) ),
inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])]) ).
cnf(c_0_49,plain,
( epsilon_transitive(union(X1))
| in(esk1_1(union(X1)),esk4_3(X1,union(X1),esk1_1(union(X1)))) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_50,negated_conjecture,
( ordinal(X1)
| ~ in(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_51,plain,
( epsilon_transitive(union(X1))
| in(esk4_3(X1,union(X1),esk1_1(union(X1))),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_38]) ).
fof(c_0_52,plain,
! [X19,X20,X21,X22] :
( ( ~ epsilon_connected(X19)
| ~ in(X20,X19)
| ~ in(X21,X19)
| in(X20,X21)
| X20 = X21
| in(X21,X20) )
& ( in(esk2_1(X22),X22)
| epsilon_connected(X22) )
& ( in(esk3_1(X22),X22)
| epsilon_connected(X22) )
& ( ~ in(esk2_1(X22),esk3_1(X22))
| epsilon_connected(X22) )
& ( esk2_1(X22) != esk3_1(X22)
| epsilon_connected(X22) )
& ( ~ in(esk3_1(X22),esk2_1(X22))
| epsilon_connected(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_42])])])])])]) ).
cnf(c_0_53,plain,
( ~ epsilon_transitive(X1)
| ~ in(X1,X2)
| ~ in(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_54,plain,
( epsilon_transitive(X1)
| ~ ordinal(X1) ),
inference(split_conjunct,[status(thm)],[c_0_45]) ).
cnf(c_0_55,plain,
( epsilon_transitive(union(X1))
| ~ in(esk1_1(union(X1)),X1) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
cnf(c_0_56,plain,
( in(X1,X2)
| X1 = X2
| in(X2,X1)
| ~ ordinal(X1)
| ~ ordinal(X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_57,plain,
( epsilon_transitive(union(X1))
| ordinal(esk1_1(union(X1)))
| ~ ordinal(esk4_3(X1,union(X1),esk1_1(union(X1)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_49]) ).
cnf(c_0_58,negated_conjecture,
( epsilon_transitive(union(esk20_0))
| ordinal(esk4_3(esk20_0,union(esk20_0),esk1_1(union(esk20_0)))) ),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_59,plain,
( in(esk3_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_60,plain,
( ~ ordinal(X1)
| ~ in(X1,X2)
| ~ in(X2,X3)
| ~ in(X3,X1) ),
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_61,plain,
( esk1_1(union(X1)) = X1
| epsilon_transitive(union(X1))
| in(X1,esk1_1(union(X1)))
| ~ ordinal(esk1_1(union(X1)))
| ~ ordinal(X1) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( epsilon_transitive(union(esk20_0))
| ordinal(esk1_1(union(esk20_0))) ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_63,plain,
( epsilon_connected(X1)
| ~ in(esk3_1(X1),esk2_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_64,plain,
( epsilon_connected(X1)
| ~ in(esk2_1(X1),esk3_1(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_65,plain,
( epsilon_connected(X1)
| esk2_1(X1) != esk3_1(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_66,plain,
( epsilon_connected(union(X1))
| in(esk3_1(union(X1)),esk4_3(X1,union(X1),esk3_1(union(X1)))) ),
inference(spm,[status(thm)],[c_0_37,c_0_59]) ).
cnf(c_0_67,plain,
( epsilon_connected(union(X1))
| in(esk4_3(X1,union(X1),esk3_1(union(X1))),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_59]) ).
cnf(c_0_68,negated_conjecture,
( ~ in(esk20_0,X1)
| ~ in(X2,esk20_0)
| ~ in(X1,X2) ),
inference(spm,[status(thm)],[c_0_60,c_0_40]) ).
cnf(c_0_69,negated_conjecture,
( esk1_1(union(esk20_0)) = esk20_0
| epsilon_transitive(union(esk20_0))
| in(esk20_0,esk1_1(union(esk20_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_40])]) ).
cnf(c_0_70,plain,
( epsilon_connected(X1)
| ~ ordinal(esk2_1(X1))
| ~ ordinal(esk3_1(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_56]),c_0_64]),c_0_65]) ).
cnf(c_0_71,plain,
( epsilon_connected(union(X1))
| ordinal(esk3_1(union(X1)))
| ~ ordinal(esk4_3(X1,union(X1),esk3_1(union(X1)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_66]) ).
cnf(c_0_72,negated_conjecture,
( epsilon_connected(union(esk20_0))
| ordinal(esk4_3(esk20_0,union(esk20_0),esk3_1(union(esk20_0)))) ),
inference(spm,[status(thm)],[c_0_50,c_0_67]) ).
cnf(c_0_73,plain,
( in(esk2_1(X1),X1)
| epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_52]) ).
cnf(c_0_74,negated_conjecture,
( esk1_1(union(esk20_0)) = esk20_0
| epsilon_transitive(union(esk20_0))
| ~ in(esk1_1(union(esk20_0)),X1)
| ~ in(X1,esk20_0) ),
inference(spm,[status(thm)],[c_0_68,c_0_69]) ).
cnf(c_0_75,plain,
( epsilon_connected(X1)
| ~ ordinal(esk3_1(X1))
| ~ ordinal(X2)
| ~ in(esk2_1(X1),X2) ),
inference(spm,[status(thm)],[c_0_70,c_0_39]) ).
cnf(c_0_76,negated_conjecture,
( epsilon_connected(union(esk20_0))
| ordinal(esk3_1(union(esk20_0))) ),
inference(spm,[status(thm)],[c_0_71,c_0_72]) ).
cnf(c_0_77,plain,
( epsilon_connected(union(X1))
| in(esk4_3(X1,union(X1),esk2_1(union(X1))),X1) ),
inference(spm,[status(thm)],[c_0_41,c_0_73]) ).
fof(c_0_78,plain,
! [X11] :
( ~ epsilon_transitive(X11)
| ~ epsilon_connected(X11)
| ordinal(X11) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).
cnf(c_0_79,negated_conjecture,
( esk1_1(union(esk20_0)) = esk20_0
| epsilon_transitive(union(esk20_0)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_51]),c_0_49]) ).
cnf(c_0_80,negated_conjecture,
( epsilon_connected(union(esk20_0))
| ~ ordinal(X1)
| ~ in(esk2_1(union(esk20_0)),X1) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_81,plain,
( epsilon_connected(union(X1))
| in(esk2_1(union(X1)),esk4_3(X1,union(X1),esk2_1(union(X1)))) ),
inference(spm,[status(thm)],[c_0_37,c_0_73]) ).
cnf(c_0_82,negated_conjecture,
( epsilon_connected(union(esk20_0))
| ordinal(esk4_3(esk20_0,union(esk20_0),esk2_1(union(esk20_0)))) ),
inference(spm,[status(thm)],[c_0_50,c_0_77]) ).
cnf(c_0_83,plain,
( ordinal(X1)
| ~ epsilon_transitive(X1)
| ~ epsilon_connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_78]) ).
cnf(c_0_84,negated_conjecture,
( epsilon_transitive(union(esk20_0))
| in(esk20_0,union(esk20_0)) ),
inference(spm,[status(thm)],[c_0_38,c_0_79]) ).
cnf(c_0_85,negated_conjecture,
epsilon_connected(union(esk20_0)),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]) ).
cnf(c_0_86,negated_conjecture,
~ ordinal(union(esk20_0)),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_87,negated_conjecture,
in(esk20_0,union(esk20_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_84]),c_0_85])]),c_0_86]) ).
cnf(c_0_88,negated_conjecture,
in(esk4_3(esk20_0,union(esk20_0),esk20_0),esk20_0),
inference(spm,[status(thm)],[c_0_41,c_0_87]) ).
cnf(c_0_89,negated_conjecture,
in(esk20_0,esk4_3(esk20_0,union(esk20_0),esk20_0)),
inference(spm,[status(thm)],[c_0_37,c_0_87]) ).
cnf(c_0_90,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_88]),c_0_89])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : NUM397+1 : TPTP v8.1.2. Released v3.2.0.
% 0.06/0.14 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n011.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 2400
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Oct 2 13:31:53 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.19/0.45 Running first-order model finding
% 0.19/0.45 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.06F3zzMm6l/E---3.1_19364.p
% 1394.88/195.77 # Version: 3.1pre001
% 1394.88/195.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1394.88/195.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1394.88/195.77 # Starting new_bool_3 with 300s (1) cores
% 1394.88/195.77 # Starting new_bool_1 with 300s (1) cores
% 1394.88/195.77 # Starting sh5l with 300s (1) cores
% 1394.88/195.77 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19441 completed with status 0
% 1394.88/195.77 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1394.88/195.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1394.88/195.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1394.88/195.77 # No SInE strategy applied
% 1394.88/195.77 # Search class: FGHSS-FFMM31-SFFFFFNN
% 1394.88/195.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1394.88/195.77 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1394.88/195.77 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 1394.88/195.77 # Starting U----_206d_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1394.88/195.77 # Starting new_bool_3 with 136s (1) cores
% 1394.88/195.77 # new_bool_3 with pid 19451 completed with status 7
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 130s (1) cores
% 1394.88/195.77 # G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with pid 19448 completed with status 7
% 1394.88/195.77 # U----_206d_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 19450 completed with status 7
% 1394.88/195.77 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 19447 completed with status 7
% 1394.88/195.77 # G-E--_208_C18_F1_SE_CS_SP_PS_S2p with pid 20817 completed with status 0
% 1394.88/195.77 # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2p
% 1394.88/195.77 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1394.88/195.77 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1394.88/195.77 # No SInE strategy applied
% 1394.88/195.77 # Search class: FGHSS-FFMM31-SFFFFFNN
% 1394.88/195.77 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1394.88/195.77 # Starting U----_206d_00_C11_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1394.88/195.77 # Starting G-E--_207_C18_F1_AE_CS_SP_PI_PS_S0S with 136s (1) cores
% 1394.88/195.77 # Starting U----_206d_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 1394.88/195.77 # Starting new_bool_3 with 136s (1) cores
% 1394.88/195.77 # new_bool_3 with pid 19451 completed with status 7
% 1394.88/195.77 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 130s (1) cores
% 1394.88/195.77 # Preprocessing time : 0.002 s
% 1394.88/195.77 # Presaturation interreduction done
% 1394.88/195.77
% 1394.88/195.77 # Proof found!
% 1394.88/195.77 # SZS status Theorem
% 1394.88/195.77 # SZS output start CNFRefutation
% See solution above
% 1394.88/195.77 # Parsed axioms : 44
% 1394.88/195.77 # Removed by relevancy pruning/SinE : 0
% 1394.88/195.77 # Initial clauses : 96
% 1394.88/195.77 # Removed in clause preprocessing : 2
% 1394.88/195.77 # Initial clauses in saturation : 94
% 1394.88/195.77 # Processed clauses : 65781
% 1394.88/195.77 # ...of these trivial : 28
% 1394.88/195.77 # ...subsumed : 60710
% 1394.88/195.77 # ...remaining for further processing : 5043
% 1394.88/195.77 # Other redundant clauses eliminated : 1654
% 1394.88/195.77 # Clauses deleted for lack of memory : 225398
% 1394.88/195.77 # Backward-subsumed : 350
% 1394.88/195.77 # Backward-rewritten : 388
% 1394.88/195.77 # Generated clauses : 2770691
% 1394.88/195.77 # ...of the previous two non-redundant : 2618475
% 1394.88/195.77 # ...aggressively subsumed : 0
% 1394.88/195.77 # Contextual simplify-reflections : 272
% 1394.88/195.77 # Paramodulations : 2768797
% 1394.88/195.77 # Factorizations : 218
% 1394.88/195.77 # NegExts : 0
% 1394.88/195.77 # Equation resolutions : 1654
% 1394.88/195.77 # Total rewrite steps : 781957
% 1394.88/195.77 # Propositional unsat checks : 0
% 1394.88/195.77 # Propositional check models : 0
% 1394.88/195.77 # Propositional check unsatisfiable : 0
% 1394.88/195.77 # Propositional clauses : 0
% 1394.88/195.77 # Propositional clauses after purity: 0
% 1394.88/195.77 # Propositional unsat core size : 0
% 1394.88/195.77 # Propositional preprocessing time : 0.000
% 1394.88/195.77 # Propositional encoding time : 0.000
% 1394.88/195.77 # Propositional solver time : 0.000
% 1394.88/195.77 # Success case prop preproc time : 0.000
% 1394.88/195.77 # Success case prop encoding time : 0.000
% 1394.88/195.77 # Success case prop solver time : 0.000
% 1394.88/195.77 # Current number of processed clauses : 4195
% 1394.88/195.77 # Positive orientable unit clauses : 56
% 1394.88/195.77 # Positive unorientable unit clauses: 0
% 1394.88/195.77 # Negative unit clauses : 12
% 1394.88/195.77 # Non-unit-clauses : 4127
% 1394.88/195.77 # Current number of unprocessed clauses: 1556186
% 1394.88/195.77 # ...number of literals in the above : 10359297
% 1394.88/195.77 # Current number of archived formulas : 0
% 1394.88/195.77 # Current number of archived clauses : 845
% 1394.88/195.77 # Clause-clause subsumption calls (NU) : 5384964
% 1394.88/195.77 # Rec. Clause-clause subsumption calls : 1381004
% 1394.88/195.77 # Non-unit clause-clause subsumptions : 47652
% 1394.88/195.77 # Unit Clause-clause subsumption calls : 9560
% 1394.88/195.77 # Rewrite failures with RHS unbound : 0
% 1394.88/195.77 # BW rewrite match attempts : 63
% 1394.88/195.77 # BW rewrite match successes : 19
% 1394.88/195.77 # Condensation attempts : 0
% 1394.88/195.77 # Condensation successes : 0
% 1394.88/195.77 # Termbank termtop insertions : 57702047
% 1394.88/195.77
% 1394.88/195.77 # -------------------------------------------------
% 1394.88/195.77 # User time : 610.692 s
% 1394.88/195.77 # System time : 6.902 s
% 1394.88/195.77 # Total time : 617.594 s
% 1394.88/195.77 # Maximum resident set size: 1892 pages
% 1394.88/195.77
% 1394.88/195.77 # -------------------------------------------------
% 1394.88/195.77 # User time : 803.250 s
% 1394.88/195.77 # System time : 8.852 s
% 1394.88/195.77 # Total time : 812.102 s
% 1394.88/195.77 # Maximum resident set size: 1732 pages
% 1394.88/195.77 % E---3.1 exiting
%------------------------------------------------------------------------------