%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU430+1 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 02:25:08 PM UTC 2026
% Result : Theorem 0.14s 0.65s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 9 unt; 0 def)
% Number of atoms : 112 ( 54 equ)
% Maximal formula atoms : 20 ( 2 avg)
% Number of connectives : 114 ( 42 ~; 48 |; 12 &)
% ( 6 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 56 ( 4 sgn 31 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t30_relset_2,conjecture,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t30_relset_2) ).
fof(redefinition_k5_setfam_1,axiom,
! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> k5_setfam_1(X1,X2) = k3_tarski(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',redefinition_k5_setfam_1) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = k3_tarski(X1)
<=> ! [X3] :
( r2_hidden(X3,X2)
<=> ? [X4] :
( r2_hidden(X4,X1)
& r2_hidden(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(t6_boole,axiom,
! [X1] :
( v1_xboole_0(X1)
=> X1 = k1_xboole_0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc1_relat_1,axiom,
? [X1] :
( v1_relat_1(X1)
& v1_xboole_0(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_relat_1) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( m1_subset_1(X2,k1_zfmisc_1(k1_zfmisc_1(X1)))
=> ( k5_setfam_1(X1,X2) = k1_xboole_0
<=> ! [X3] :
( r2_hidden(X3,X2)
=> X3 = k1_xboole_0 ) ) ),
inference(assume_negation,[status(cth)],[t30_relset_2]) ).
fof(c_0_7,plain,
! [X39,X40] :
( k5_setfam_1(X39,X40) = k3_tarski(X40)
| ~ m1_subset_1(X40,k1_zfmisc_1(k1_zfmisc_1(X39))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
fof(c_0_8,negated_conjecture,
! [X8] :
( ( X8 = k1_xboole_0
| ~ r2_hidden(X8,esk2_0)
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 )
& ( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) )
& m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( X1 = k1_xboole_0
<=> ! [X2] : ~ r2_hidden(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
cnf(c_0_10,plain,
( ~ m1_subset_1(X1,k1_zfmisc_1(k1_zfmisc_1(X2)))
| k5_setfam_1(X2,X1) = k3_tarski(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X12,X13,X14] :
( ( X14 = k1_xboole_0
| r2_hidden(esk4_1(X14),X14) )
& ( ~ r2_hidden(X13,X12)
| X12 != k1_xboole_0 ) ),
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)],[c_0_9])])])])])]) ).
fof(c_0_13,plain,
! [X16,X17,X18,X20,X21,X22,X23,X25] :
( ( X23 = k3_tarski(X22)
| r2_hidden(esk6_2(X22,X23),X23)
| r2_hidden(esk7_2(X22,X23),X22) )
& ( X23 = k3_tarski(X22)
| r2_hidden(esk6_2(X22,X23),X23)
| r2_hidden(esk6_2(X22,X23),esk7_2(X22,X23)) )
& ( X23 = k3_tarski(X22)
| ~ r2_hidden(X25,X22)
| ~ r2_hidden(esk6_2(X22,X23),X25)
| ~ r2_hidden(esk6_2(X22,X23),X23) )
& ( X17 != k3_tarski(X16)
| r2_hidden(X20,X17)
| ~ r2_hidden(X21,X16)
| ~ r2_hidden(X20,X21) )
& ( X17 != k3_tarski(X16)
| ~ r2_hidden(X18,X17)
| r2_hidden(esk5_3(X16,X17,X18),X16) )
& ( X17 != k3_tarski(X16)
| ~ r2_hidden(X18,X17)
| r2_hidden(X18,esk5_3(X16,X17,X18)) ) ),
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)],[d4_tarski])])])])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_16,plain,
( ~ r2_hidden(X2,X1)
| X1 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_17,plain,
( X2 = k3_tarski(X1)
| r2_hidden(esk6_2(X1,X2),X2)
| r2_hidden(esk6_2(X1,X2),esk7_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,plain,
( X2 = k3_tarski(X1)
| r2_hidden(esk6_2(X1,X2),X2)
| r2_hidden(esk7_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( esk7_2(X2,X1) != k1_xboole_0
| r2_hidden(esk6_2(X2,X1),X1)
| X1 = k3_tarski(X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( r2_hidden(esk6_2(esk2_0,X1),X1)
| X1 = k3_tarski(esk2_0)
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_22,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_23,negated_conjecture,
( X1 != k1_xboole_0
| X1 = k3_tarski(esk2_0)
| k3_tarski(esk2_0) = k1_xboole_0 ),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_22,c_0_15]) ).
cnf(c_0_25,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(er,[status(thm)],[c_0_23]) ).
cnf(c_0_26,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_27,plain,
! [X54] :
( X54 = k1_xboole_0
| ~ v1_xboole_0(X54) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])])]) ).
fof(c_0_28,plain,
( v1_relat_1(esk9_0)
& v1_xboole_0(esk9_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_relat_1])]) ).
cnf(c_0_29,plain,
( X4 != k3_tarski(X3)
| ~ r2_hidden(X2,X3)
| ~ r2_hidden(X1,X2)
| r2_hidden(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_30,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_31,negated_conjecture,
( esk3_0 != k1_xboole_0
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_26,c_0_15]) ).
cnf(c_0_32,plain,
( ~ v1_xboole_0(X1)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_33,plain,
v1_xboole_0(esk9_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_34,negated_conjecture,
( ~ r2_hidden(X2,esk3_0)
| X1 != k1_xboole_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_25]),c_0_16]) ).
cnf(c_0_35,plain,
( X1 = k1_xboole_0
| r2_hidden(esk4_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_36,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_25])]) ).
cnf(c_0_37,plain,
esk9_0 = k1_xboole_0,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_38,negated_conjecture,
X1 != k1_xboole_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_39,plain,
$false,
inference(sr,[status(thm)],[c_0_37,c_0_38]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU430+1 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.56 % Computer : n015.cluster.edu
% 0.09/0.56 % Model : x86_64 x86_64
% 0.09/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56 % Memory : 8046.5625MB
% 0.09/0.56 % OS : Linux 6.8.0-71-generic
% 0.09/0.56 % CPULimit : 300
% 0.09/0.56 % WCLimit : 300
% 0.09/0.56 % DateTime : Mon Sep 21 06:31:37 UTC 2026
% 0.09/0.56 % CPUTime :
% 0.09/0.56 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.61 Running first-order theorem proving
% 0.09/0.61 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.65 % Version: 3.5.1
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.65 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.65 % Starting sh5l with 300s (1) cores
% 0.14/0.65 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 796410 completed with status 0
% 0.14/0.65 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.65 % No SInE strategy applied
% 0.14/0.65 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.14/0.65 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.65 % Starting G-E--_208_B07----D_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.14/0.65 % G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with pid 796419 completed with status 0
% 0.14/0.65 % Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y
% 0.14/0.65 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.65 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.65 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.65 % No SInE strategy applied
% 0.14/0.65 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.14/0.65 % Scheduled 11 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.65 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.65 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4b with 136s (1) cores
% 0.14/0.65 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.14/0.65 % Preprocessing time : 0.001 s
% 0.14/0.65
% 0.14/0.65 % Proof found!
% 0.14/0.65 % SZS status Theorem
% 0.14/0.65 % SZS output start CNFRefutation
% See solution above
% 0.14/0.65 % Parsed axioms : 29
% 0.14/0.65 % Removed by relevancy pruning/SinE : 0
% 0.14/0.65 % Initial clauses : 47
% 0.14/0.65 % Removed in clause preprocessing : 4
% 0.14/0.65 % Initial clauses in saturation : 43
% 0.14/0.65 % Processed clauses : 265
% 0.14/0.65 % ...of these trivial : 4
% 0.14/0.65 % ...subsumed : 59
% 0.14/0.65 % ...remaining for further processing : 202
% 0.14/0.65 % Other redundant clauses eliminated : 0
% 0.14/0.65 % Clauses deleted for lack of memory : 0
% 0.14/0.65 % Backward-subsumed : 52
% 0.14/0.65 % Backward-rewritten : 25
% 0.14/0.65 % Generated clauses : 916
% 0.14/0.65 % ...of the previous two non-redundant : 874
% 0.14/0.65 % ...aggressively subsumed : 0
% 0.14/0.65 % Contextual simplify-reflections : 9
% 0.14/0.65 % Paramodulations : 899
% 0.14/0.65 % Factorizations : 0
% 0.14/0.65 % NegExts : 0
% 0.14/0.65 % Equation resolutions : 11
% 0.14/0.65 % Disequality decompositions : 0
% 0.14/0.65 % Total rewrite steps : 94
% 0.14/0.65 % ...of those cached : 68
% 0.14/0.65 % Propositional unsat checks : 0
% 0.14/0.65 % Propositional check models : 0
% 0.14/0.65 % Propositional check unsatisfiable : 0
% 0.14/0.65 % Propositional clauses : 0
% 0.14/0.65 % Propositional clauses after purity: 0
% 0.14/0.65 % Propositional unsat core size : 0
% 0.14/0.65 % Propositional preprocessing time : 0.000
% 0.14/0.65 % Propositional encoding time : 0.000
% 0.14/0.65 % Propositional solver time : 0.000
% 0.14/0.65 % Success case prop preproc time : 0.000
% 0.14/0.65 % Success case prop encoding time : 0.000
% 0.14/0.65 % Success case prop solver time : 0.000
% 0.14/0.65 % Current number of processed clauses : 119
% 0.14/0.65 % Positive orientable unit clauses : 22
% 0.14/0.65 % Positive unorientable unit clauses: 0
% 0.14/0.65 % Negative unit clauses : 11
% 0.14/0.65 % Non-unit-clauses : 86
% 0.14/0.65 % Current number of unprocessed clauses: 609
% 0.14/0.65 % ...number of literals in the above : 2302
% 0.14/0.65 % Current number of archived formulas : 0
% 0.14/0.65 % Current number of archived clauses : 83
% 0.14/0.65 % Clause-clause subsumption calls (NU) : 1452
% 0.14/0.65 % Rec. Clause-clause subsumption calls : 1011
% 0.14/0.65 % Non-unit clause-clause subsumptions : 63
% 0.14/0.65 % Unit Clause-clause subsumption calls : 347
% 0.14/0.65 % Rewrite failures with RHS unbound : 0
% 0.14/0.65 % BW rewrite match attempts : 18
% 0.14/0.65 % BW rewrite match successes : 6
% 0.14/0.65 % Condensation attempts : 0
% 0.14/0.65 % Condensation successes : 0
% 0.14/0.65 % Termbank termtop insertions : 13448
% 0.14/0.65 % Search garbage collected termcells : 530
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.021 s
% 0.14/0.65 % System time : 0.005 s
% 0.14/0.65 % Total time : 0.026 s
% 0.14/0.65 % Maximum resident set size: 3652 pages
% 0.14/0.65
% 0.14/0.65 % -------------------------------------------------
% 0.14/0.65 % User time : 0.093 s
% 0.14/0.65 % System time : 0.027 s
% 0.14/0.65 % Total time : 0.120 s
% 0.14/0.65 % Maximum resident set size: 4864 pages
% 0.14/0.65 % E exiting
%------------------------------------------------------------------------------