%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU430+2 : TPTP v9.3.1. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 5.17s 1.45s
% Output : CNFRefutation 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% 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 : 77 ( 34 ~; 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 : 28 ( 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/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/SET007/SET007+59.ax',t91_orders_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,
! [X138,X139] :
( k5_setfam_1(X138,X139) = k3_tarski(X139)
| ~ m1_subset_1(X139,k1_zfmisc_1(k1_zfmisc_1(X138))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[redefinition_k5_setfam_1])])]) ).
fof(c_0_5,negated_conjecture,
! [X17] :
( ( X17 = k1_xboole_0
| ~ r2_hidden(X17,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,
! [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]) ).
cnf(c_0_7,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_4]) ).
cnf(c_0_8,negated_conjecture,
m1_subset_1(esk2_0,k1_zfmisc_1(k1_zfmisc_1(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X545,X546,X547] :
( ( k3_tarski(X547) = k1_xboole_0
| r2_hidden(esk58_1(X547),X547) )
& ( k3_tarski(X547) = k1_xboole_0
| esk58_1(X547) != k1_xboole_0 )
& ( k3_tarski(X545) != k1_xboole_0
| ~ r2_hidden(X546,X545)
| X546 = 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_6])])])])])])]) ).
cnf(c_0_10,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_11,negated_conjecture,
k5_setfam_1(esk1_0,esk2_0) = k3_tarski(esk2_0),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,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_13,plain,
( k3_tarski(X2) != k1_xboole_0
| ~ r2_hidden(X1,X2)
| X1 = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
( k3_tarski(esk2_0) != k1_xboole_0
| r2_hidden(esk3_0,esk2_0) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,negated_conjecture,
( esk3_0 != k1_xboole_0
| k3_tarski(esk2_0) != k1_xboole_0 ),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_16,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_17,negated_conjecture,
k3_tarski(esk2_0) != k1_xboole_0,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_18,negated_conjecture,
( ~ r2_hidden(X1,esk2_0)
| X1 = k1_xboole_0 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_17]) ).
cnf(c_0_19,plain,
( k3_tarski(X1) = k1_xboole_0
| r2_hidden(esk58_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( esk58_1(X1) != k1_xboole_0
| k3_tarski(X1) = k1_xboole_0 ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,negated_conjecture,
esk58_1(esk2_0) = k1_xboole_0,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_17]) ).
cnf(c_0_22,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU430+2 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n005.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 06:28:03 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 5.17/1.45 % Version: 3.5.1
% 5.17/1.45 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.17/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.17/1.45 % Starting new_bool_3 with 900s (3) cores
% 5.17/1.45 % Starting new_bool_1 with 900s (3) cores
% 5.17/1.45 % Starting sh5l with 300s (1) cores
% 5.17/1.45 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2p with 300s (1) cores
% 5.17/1.45 % new_bool_3 with pid 2772620 completed with status 0
% 5.17/1.45 % Result found by new_bool_3
% 5.17/1.45 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.17/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.17/1.45 % Starting new_bool_3 with 900s (3) cores
% 5.17/1.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.17/1.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.17/1.45 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.17/1.45 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.17/1.45 % Starting SubtermCWHack with 82s (1) cores
% 5.17/1.45 % Starting new_bool_3 with 91s (1) cores
% 5.17/1.45 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.17/1.45 % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2772633 completed with status 0
% 5.17/1.45 % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 5.17/1.45 % Preprocessing class: FMLMSMLLSSSNFFN.
% 5.17/1.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.17/1.45 % Starting new_bool_3 with 900s (3) cores
% 5.17/1.45 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.17/1.45 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.17/1.45 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.17/1.45 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.17/1.45 % Starting SubtermCWHack with 82s (1) cores
% 5.17/1.45 % Starting new_bool_3 with 91s (1) cores
% 5.17/1.45 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.17/1.45 % Preprocessing time : 0.043 s
% 5.17/1.45 % Presaturation interreduction done
% 5.17/1.45
% 5.17/1.45 % Proof found!
% 5.17/1.45 % SZS status Theorem
% 5.17/1.45 % SZS output start CNFRefutation
% See solution above
% 5.17/1.45 % Parsed axioms : 4502
% 5.17/1.45 % Removed by relevancy pruning/SinE : 3622
% 5.17/1.45 % Initial clauses : 1520
% 5.17/1.45 % Removed in clause preprocessing : 40
% 5.17/1.45 % Initial clauses in saturation : 1480
% 5.17/1.45 % Processed clauses : 3582
% 5.17/1.45 % ...of these trivial : 39
% 5.17/1.45 % ...subsumed : 1164
% 5.17/1.45 % ...remaining for further processing : 2379
% 5.17/1.45 % Other redundant clauses eliminated : 176
% 5.17/1.45 % Clauses deleted for lack of memory : 0
% 5.17/1.45 % Backward-subsumed : 84
% 5.17/1.45 % Backward-rewritten : 64
% 5.17/1.45 % Generated clauses : 4857
% 5.17/1.45 % ...of the previous two non-redundant : 3965
% 5.17/1.45 % ...aggressively subsumed : 0
% 5.17/1.45 % Contextual simplify-reflections : 52
% 5.17/1.45 % Paramodulations : 4691
% 5.17/1.45 % Factorizations : 0
% 5.17/1.45 % NegExts : 0
% 5.17/1.45 % Equation resolutions : 177
% 5.17/1.45 % Disequality decompositions : 0
% 5.17/1.45 % Total rewrite steps : 2548
% 5.17/1.45 % ...of those cached : 1725
% 5.17/1.45 % Propositional unsat checks : 0
% 5.17/1.45 % Propositional check models : 0
% 5.17/1.45 % Propositional check unsatisfiable : 0
% 5.17/1.45 % Propositional clauses : 0
% 5.17/1.45 % Propositional clauses after purity: 0
% 5.17/1.45 % Propositional unsat core size : 0
% 5.17/1.45 % Propositional preprocessing time : 0.000
% 5.17/1.45 % Propositional encoding time : 0.000
% 5.17/1.45 % Propositional solver time : 0.000
% 5.17/1.45 % Success case prop preproc time : 0.000
% 5.17/1.45 % Success case prop encoding time : 0.000
% 5.17/1.45 % Success case prop solver time : 0.000
% 5.17/1.45 % Current number of processed clauses : 731
% 5.17/1.45 % Positive orientable unit clauses : 277
% 5.17/1.45 % Positive unorientable unit clauses: 3
% 5.17/1.45 % Negative unit clauses : 198
% 5.17/1.45 % Non-unit-clauses : 253
% 5.17/1.45 % Current number of unprocessed clauses: 3190
% 5.17/1.45 % ...number of literals in the above : 6598
% 5.17/1.45 % Current number of archived formulas : 0
% 5.17/1.45 % Current number of archived clauses : 1499
% 5.17/1.45 % Clause-clause subsumption calls (NU) : 464481
% 5.17/1.45 % Rec. Clause-clause subsumption calls : 161138
% 5.17/1.45 % Non-unit clause-clause subsumptions : 323
% 5.17/1.45 % Unit Clause-clause subsumption calls : 13077
% 5.17/1.45 % Rewrite failures with RHS unbound : 0
% 5.17/1.45 % BW rewrite match attempts : 358
% 5.17/1.45 % BW rewrite match successes : 261
% 5.17/1.45 % Condensation attempts : 0
% 5.17/1.45 % Condensation successes : 0
% 5.17/1.45 % Termbank termtop insertions : 241878
% 5.17/1.45 % Search garbage collected termcells : 52707
% 5.17/1.45
% 5.17/1.45 % -------------------------------------------------
% 5.17/1.45 % User time : 0.700 s
% 5.17/1.45 % System time : 0.046 s
% 5.17/1.45 % Total time : 0.746 s
% 5.17/1.45 % Maximum resident set size: 14292 pages
% 5.17/1.45
% 5.17/1.45 % -------------------------------------------------
% 5.17/1.45 % User time : 2.234 s
% 5.17/1.45 % System time : 0.139 s
% 5.17/1.45 % Total time : 2.373 s
% 5.17/1.45 % Maximum resident set size: 9984 pages
% 5.17/1.45 % E exiting
%------------------------------------------------------------------------------