%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU430+3 : 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 : n003.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 19.21s 5.72s
% Output : CNFRefutation 19.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 31 ( 8 unt; 0 def)
% Number of atoms : 83 ( 45 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 95 ( 43 ~; 26 |; 19 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 36 ( 0 sgn 24 !; 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(t8_boole,axiom,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& X1 != X2
& v1_xboole_0(X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+3.ax',t8_boole) ).
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/Axioms/SET007/SET007+8.ax',redefinition_k5_setfam_1) ).
fof(t91_orders_1,axiom,
! [X1] :
( ~ ( ! [X2] :
~ ( r2_hidden(X2,X1)
& X2 != k1_xboole_0 )
& k3_tarski(X1) != k1_xboole_0 )
& ~ ( k3_tarski(X1) = k1_xboole_0
& ? [X2] :
( r2_hidden(X2,X1)
& X2 != k1_xboole_0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+59.ax',t91_orders_1) ).
fof(fc1_xboole_0,axiom,
v1_xboole_0(k1_xboole_0),
file('/export/starexec/sandbox/benchmark/Axioms/SET007/SET007+2.ax',fc1_xboole_0) ).
fof(c_0_5,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_6,plain,
! [X1,X2] :
~ ( v1_xboole_0(X2)
& X1 != X2
& v1_xboole_0(X1) ),
inference(fof_simplification,[status(thm)],[t8_boole]) ).
fof(c_0_7,plain,
! [X135,X136] :
( k5_setfam_1(X135,X136) = k3_tarski(X136)
| ~ m1_subset_1(X136,k1_zfmisc_1(k1_zfmisc_1(X135))) ),
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,
! [X18] :
( ( X18 = k1_xboole_0
| ~ r2_hidden(X18,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_5])])])])])]) ).
fof(c_0_9,plain,
! [X1] :
( ~ ( ! [X2] :
~ ( r2_hidden(X2,X1)
& X2 != k1_xboole_0 )
& k3_tarski(X1) != k1_xboole_0 )
& ~ ( k3_tarski(X1) = k1_xboole_0
& ? [X2] :
( r2_hidden(X2,X1)
& X2 != k1_xboole_0 ) ) ),
inference(fof_simplification,[status(thm)],[t91_orders_1]) ).
fof(c_0_10,plain,
! [X197,X198] :
( ~ v1_xboole_0(X198)
| X197 = X198
| ~ v1_xboole_0(X197) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])]) ).
cnf(c_0_11,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_12,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_13,plain,
! [X394,X395,X396] :
( ( k3_tarski(X396) = k1_xboole_0
| r2_hidden(esk60_1(X396),X396) )
& ( k3_tarski(X396) = k1_xboole_0
| esk60_1(X396) != k1_xboole_0 )
& ( k3_tarski(X394) != k1_xboole_0
| ~ r2_hidden(X395,X394)
| X395 = k1_xboole_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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])])])]) ).
cnf(c_0_14,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_15,plain,
( ~ v1_xboole_0(X2)
| ~ v1_xboole_0(X1)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
v1_xboole_0(k1_xboole_0),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_17,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_18,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
( k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( ~ v1_xboole_0(k5_setfam_1(esk1_0,esk2_0))
| r2_hidden(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15])]),c_0_16])]) ).
cnf(c_0_21,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).
cnf(c_0_22,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk60_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_23,plain,
( esk60_1(X1) != k1_xboole_0
| k3_tarski(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_24,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]) ).
cnf(c_0_25,negated_conjecture,
( ~ v1_xboole_0(k3_tarski(esk2_0))
| r2_hidden(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_26,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]) ).
cnf(c_0_27,negated_conjecture,
( esk3_0 != k1_xboole_0
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_24,c_0_18]) ).
cnf(c_0_28,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26]),c_0_16])]) ).
cnf(c_0_29,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_26])]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU430+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.49 % Computer : n003.cluster.edu
% 0.19/0.49 % Model : x86_64 x86_64
% 0.19/0.49 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.49 % Memory : 8046.5625MB
% 0.19/0.49 % OS : Linux 6.8.0-71-generic
% 0.19/0.49 % CPULimit : 300
% 0.19/0.49 % WCLimit : 300
% 0.19/0.49 % DateTime : Mon Sep 21 06:30:20 UTC 2026
% 0.19/0.50 % CPUTime :
% 0.19/0.50 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.58 Running first-order theorem proving
% 0.23/0.58 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
% 19.21/5.72 % Version: 3.5.1
% 19.21/5.72 % Preprocessing class: FMLLMMLLSSSNFFN.
% 19.21/5.72 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 19.21/5.72 % Starting new_bool_3 with 897s (3) cores
% 19.21/5.72 % Starting new_bool_1 with 897s (3) cores
% 19.21/5.72 % Starting sh5l with 299s (1) cores
% 19.21/5.72 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 299s (1) cores
% 19.21/5.72 % new_bool_1 with pid 3631214 completed with status 0
% 19.21/5.72 % Result found by new_bool_1
% 19.21/5.72 % Preprocessing class: FMLLMMLLSSSNFFN.
% 19.21/5.72 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 19.21/5.72 % Starting new_bool_3 with 897s (3) cores
% 19.21/5.72 % Starting new_bool_1 with 897s (3) cores
% 19.21/5.72 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 19.21/5.72 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.21/5.72 % Search class: FGHSM-SMLM32-MFFFFFNN
% 19.21/5.72 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 19.21/5.72 % Starting SubtermCWHack with 81s (1) cores
% 19.21/5.72 % Starting new_bool_1 with 90s (1) cores
% 19.21/5.72 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 19.21/5.72 % new_bool_1 with pid 3631222 completed with status 0
% 19.21/5.72 % Result found by new_bool_1
% 19.21/5.72 % Preprocessing class: FMLLMMLLSSSNFFN.
% 19.21/5.72 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 19.21/5.72 % Starting new_bool_3 with 897s (3) cores
% 19.21/5.72 % Starting new_bool_1 with 897s (3) cores
% 19.21/5.72 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 19.21/5.72 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 19.21/5.72 % Search class: FGHSM-SMLM32-MFFFFFNN
% 19.21/5.72 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 19.21/5.72 % Starting SubtermCWHack with 81s (1) cores
% 19.21/5.72 % Starting new_bool_1 with 90s (1) cores
% 19.21/5.72 % Preprocessing time : 0.116 s
% 19.21/5.72 % Presaturation interreduction done
% 19.21/5.72
% 19.21/5.72 % Proof found!
% 19.21/5.72 % SZS status Theorem
% 19.21/5.72 % SZS output start CNFRefutation
% See solution above
% 19.21/5.72 % Parsed axioms : 19101
% 19.21/5.72 % Removed by relevancy pruning/SinE : 17533
% 19.21/5.72 % Initial clauses : 3650
% 19.21/5.72 % Removed in clause preprocessing : 125
% 19.21/5.72 % Initial clauses in saturation : 3525
% 19.21/5.72 % Processed clauses : 6888
% 19.21/5.72 % ...of these trivial : 72
% 19.21/5.72 % ...subsumed : 2021
% 19.21/5.72 % ...remaining for further processing : 4795
% 19.21/5.72 % Other redundant clauses eliminated : 514
% 19.21/5.72 % Clauses deleted for lack of memory : 0
% 19.21/5.72 % Backward-subsumed : 122
% 19.21/5.72 % Backward-rewritten : 95
% 19.21/5.72 % Generated clauses : 9921
% 19.21/5.72 % ...of the previous two non-redundant : 8420
% 19.21/5.72 % ...aggressively subsumed : 0
% 19.21/5.72 % Contextual simplify-reflections : 303
% 19.21/5.72 % Paramodulations : 9424
% 19.21/5.72 % Factorizations : 0
% 19.21/5.72 % NegExts : 0
% 19.21/5.72 % Equation resolutions : 514
% 19.21/5.72 % Disequality decompositions : 0
% 19.21/5.72 % Total rewrite steps : 3862
% 19.21/5.72 % ...of those cached : 2639
% 19.21/5.72 % Propositional unsat checks : 0
% 19.21/5.72 % Propositional check models : 0
% 19.21/5.72 % Propositional check unsatisfiable : 0
% 19.21/5.72 % Propositional clauses : 0
% 19.21/5.72 % Propositional clauses after purity: 0
% 19.21/5.72 % Propositional unsat core size : 0
% 19.21/5.72 % Propositional preprocessing time : 0.000
% 19.21/5.72 % Propositional encoding time : 0.000
% 19.21/5.72 % Propositional solver time : 0.000
% 19.21/5.72 % Success case prop preproc time : 0.000
% 19.21/5.72 % Success case prop encoding time : 0.000
% 19.21/5.72 % Success case prop solver time : 0.000
% 19.21/5.72 % Current number of processed clauses : 1073
% 19.21/5.72 % Positive orientable unit clauses : 391
% 19.21/5.72 % Positive unorientable unit clauses: 3
% 19.21/5.72 % Negative unit clauses : 229
% 19.21/5.72 % Non-unit-clauses : 450
% 19.21/5.72 % Current number of unprocessed clauses: 8239
% 19.21/5.72 % ...number of literals in the above : 28465
% 19.21/5.72 % Current number of archived formulas : 0
% 19.21/5.72 % Current number of archived clauses : 3437
% 19.21/5.72 % Clause-clause subsumption calls (NU) : 7196212
% 19.21/5.72 % Rec. Clause-clause subsumption calls : 422609
% 19.21/5.72 % Non-unit clause-clause subsumptions : 890
% 19.21/5.72 % Unit Clause-clause subsumption calls : 54642
% 19.21/5.72 % Rewrite failures with RHS unbound : 0
% 19.21/5.72 % BW rewrite match attempts : 374
% 19.21/5.72 % BW rewrite match successes : 285
% 19.21/5.72 % Condensation attempts : 0
% 19.21/5.72 % Condensation successes : 0
% 19.21/5.72 % Termbank termtop insertions : 1029505
% 19.21/5.72 % Search garbage collected termcells : 240560
% 19.21/5.72
% 19.21/5.72 % -------------------------------------------------
% 19.21/5.72 % User time : 3.077 s
% 19.21/5.72 % System time : 0.140 s
% 19.21/5.72 % Total time : 3.217 s
% 19.21/5.72 % Maximum resident set size: 44680 pages
% 19.21/5.72
% 19.21/5.72 % -------------------------------------------------
% 19.21/5.72 % User time : 9.571 s
% 19.21/5.72 % System time : 0.456 s
% 19.21/5.72 % Total time : 10.027 s
% 19.21/5.72 % Maximum resident set size: 32768 pages
% 19.21/5.72 % E exiting
%------------------------------------------------------------------------------