%------------------------------------------------------------------------------
% File : E-SAT---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 : n010.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:29:24 PM UTC 2026
% Result : Theorem 9.27s 3.44s
% Output : CNFRefutation 9.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 23 ( 5 unt; 0 def)
% Number of atoms : 66 ( 42 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 76 ( 33 ~; 21 |; 15 &)
% ( 2 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 27 ( 0 sgn 18 !; 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(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(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(c_0_3,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_4,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_5,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_3])])])])])]) ).
fof(c_0_6,plain,
! [X351,X352,X353] :
( ( k3_tarski(X353) = k1_xboole_0
| r2_hidden(esk51_1(X353),X353) )
& ( k3_tarski(X353) = k1_xboole_0
| esk51_1(X353) != k1_xboole_0 )
& ( k3_tarski(X351) != k1_xboole_0
| ~ r2_hidden(X352,X351)
| X352 = 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_4])])])])])])]) ).
fof(c_0_7,plain,
! [X130,X131] :
( k5_setfam_1(X130,X131) = k3_tarski(X131)
| ~ m1_subset_1(X131,k1_zfmisc_1(k1_zfmisc_1(X130))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
cnf(c_0_8,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_5]) ).
cnf(c_0_9,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk51_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( esk51_1(X1) != k1_xboole_0
| k3_tarski(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,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_5]) ).
cnf(c_0_12,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_13,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( k3_tarski(esk2_0) = k1_xboole_0
| k5_setfam_1(esk1_0,esk2_0) = k1_xboole_0 ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_15,negated_conjecture,
( k5_setfam_1(esk1_0,esk2_0) != k1_xboole_0
| esk3_0 != k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_17,negated_conjecture,
k3_tarski(esk2_0) = k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_14]),c_0_13])]) ).
cnf(c_0_18,negated_conjecture,
( esk3_0 != k1_xboole_0
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_12]),c_0_13])]) ).
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_6]) ).
cnf(c_0_20,negated_conjecture,
r2_hidden(esk3_0,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).
cnf(c_0_21,negated_conjecture,
esk3_0 != k1_xboole_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17])]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17])]),c_0_21]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU430+3 : 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.52 % Computer : n010.cluster.edu
% 0.09/0.52 % Model : x86_64 x86_64
% 0.09/0.52 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.52 % Memory : 8046.5625MB
% 0.09/0.52 % OS : Linux 6.8.0-71-generic
% 0.09/0.52 % CPULimit : 300
% 0.09/0.52 % WCLimit : 300
% 0.09/0.52 % DateTime : Mon Sep 21 06:29:11 UTC 2026
% 0.09/0.53 % CPUTime :
% 0.09/0.53 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.57 Running first-order theorem proving
% 0.13/0.57 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
% 9.27/3.44 % Version: 3.5.1
% 9.27/3.44 % Preprocessing class: FMLLMMLLSSSNFFN.
% 9.27/3.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.27/3.44 % Starting new_bool_3 with 900s (3) cores
% 9.27/3.44 % Starting new_bool_1 with 900s (3) cores
% 9.27/3.44 % Starting sh5l with 300s (1) cores
% 9.27/3.44 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 9.27/3.44 % G-E--_211_C18_F1_AE_CS_SP_S0Y with pid 233791 completed with status 0
% 9.27/3.44 % Result found by G-E--_211_C18_F1_AE_CS_SP_S0Y
% 9.27/3.44 % Preprocessing class: FMLLMMLLSSSNFFN.
% 9.27/3.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.27/3.44 % Starting new_bool_3 with 900s (3) cores
% 9.27/3.44 % Starting new_bool_1 with 900s (3) cores
% 9.27/3.44 % Starting sh5l with 300s (1) cores
% 9.27/3.44 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 9.27/3.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.27/3.44 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 9.27/3.44 % Search class: FGHSM-FMLM32-DFFFFFNN
% 9.27/3.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 9.27/3.44 % Starting SubtermCWHack with 28s (1) cores
% 9.27/3.44 % SubtermCWHack with pid 233873 completed with status 0
% 9.27/3.44 % Result found by SubtermCWHack
% 9.27/3.44 % Preprocessing class: FMLLMMLLSSSNFFN.
% 9.27/3.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.27/3.44 % Starting new_bool_3 with 900s (3) cores
% 9.27/3.44 % Starting new_bool_1 with 900s (3) cores
% 9.27/3.44 % Starting sh5l with 300s (1) cores
% 9.27/3.44 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 9.27/3.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.27/3.44 % SinE strategy is gf120_h_gu_RUU_F100_L00500
% 9.27/3.44 % Search class: FGHSM-FMLM32-DFFFFFNN
% 9.27/3.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 9.27/3.44 % Starting SubtermCWHack with 28s (1) cores
% 9.27/3.44 % Preprocessing time : 0.044 s
% 9.27/3.44
% 9.27/3.44 % Proof found!
% 9.27/3.44 % SZS status Theorem
% 9.27/3.44 % SZS output start CNFRefutation
% See solution above
% 9.27/3.44 % Parsed axioms : 19101
% 9.27/3.44 % Removed by relevancy pruning/SinE : 18600
% 9.27/3.44 % Initial clauses : 993
% 9.27/3.44 % Removed in clause preprocessing : 14
% 9.27/3.44 % Initial clauses in saturation : 979
% 9.27/3.44 % Processed clauses : 9380
% 9.27/3.44 % ...of these trivial : 266
% 9.27/3.44 % ...subsumed : 6773
% 9.27/3.44 % ...remaining for further processing : 2341
% 9.27/3.44 % Other redundant clauses eliminated : 307
% 9.27/3.44 % Clauses deleted for lack of memory : 0
% 9.27/3.44 % Backward-subsumed : 67
% 9.27/3.44 % Backward-rewritten : 140
% 9.27/3.44 % Generated clauses : 62154
% 9.27/3.44 % ...of the previous two non-redundant : 52553
% 9.27/3.44 % ...aggressively subsumed : 0
% 9.27/3.44 % Contextual simplify-reflections : 46
% 9.27/3.44 % Paramodulations : 61819
% 9.27/3.44 % Factorizations : 22
% 9.27/3.44 % NegExts : 0
% 9.27/3.44 % Equation resolutions : 319
% 9.27/3.44 % Disequality decompositions : 0
% 9.27/3.44 % Total rewrite steps : 18768
% 9.27/3.44 % ...of those cached : 17091
% 9.27/3.44 % Propositional unsat checks : 0
% 9.27/3.44 % Propositional check models : 0
% 9.27/3.44 % Propositional check unsatisfiable : 0
% 9.27/3.44 % Propositional clauses : 0
% 9.27/3.44 % Propositional clauses after purity: 0
% 9.27/3.44 % Propositional unsat core size : 0
% 9.27/3.44 % Propositional preprocessing time : 0.000
% 9.27/3.44 % Propositional encoding time : 0.000
% 9.27/3.44 % Propositional solver time : 0.000
% 9.27/3.44 % Success case prop preproc time : 0.000
% 9.27/3.44 % Success case prop encoding time : 0.000
% 9.27/3.44 % Success case prop solver time : 0.000
% 9.27/3.44 % Current number of processed clauses : 2050
% 9.27/3.44 % Positive orientable unit clauses : 362
% 9.27/3.44 % Positive unorientable unit clauses: 2
% 9.27/3.44 % Negative unit clauses : 248
% 9.27/3.44 % Non-unit-clauses : 1438
% 9.27/3.44 % Current number of unprocessed clauses: 43869
% 9.27/3.44 % ...number of literals in the above : 159377
% 9.27/3.44 % Current number of archived formulas : 0
% 9.27/3.44 % Current number of archived clauses : 211
% 9.27/3.44 % Clause-clause subsumption calls (NU) : 1016014
% 9.27/3.44 % Rec. Clause-clause subsumption calls : 286166
% 9.27/3.44 % Non-unit clause-clause subsumptions : 3732
% 9.27/3.44 % Unit Clause-clause subsumption calls : 20745
% 9.27/3.44 % Rewrite failures with RHS unbound : 0
% 9.27/3.44 % BW rewrite match attempts : 319
% 9.27/3.44 % BW rewrite match successes : 64
% 9.27/3.44 % Condensation attempts : 0
% 9.27/3.44 % Condensation successes : 0
% 9.27/3.44 % Termbank termtop insertions : 1326138
% 9.27/3.44 % Search garbage collected termcells : 196377
% 9.27/3.44
% 9.27/3.44 % -------------------------------------------------
% 9.27/3.44 % User time : 1.705 s
% 9.27/3.44 % System time : 0.137 s
% 9.27/3.44 % Total time : 1.842 s
% 9.27/3.44 % Maximum resident set size: 40584 pages
% 9.27/3.44
% 9.27/3.44 % -------------------------------------------------
% 9.27/3.44 % User time : 2.621 s
% 9.27/3.44 % System time : 0.178 s
% 9.27/3.44 % Total time : 2.798 s
% 9.27/3.44 % Maximum resident set size: 32768 pages
% 9.27/3.44 % E exiting
%------------------------------------------------------------------------------