%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU424+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 : n007.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:22 PM UTC 2026
% Result : Theorem 12.69s 3.57s
% Output : CNFRefutation 12.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 2
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 37 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 39 ( 15 ~; 6 |; 7 &)
% ( 0 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-4 aty)
% Number of variables : 28 ( 0 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t18_relset_2,conjecture,
! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t18_relset_2) ).
fof(s8_domain_1__e1_22__relset_2,axiom,
! [X1,X2,X3,X4] :
( ( m2_relset_1(X4,X1,X2)
& m1_subset_1(X3,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X1) )
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s8_domain_1__e1_22__relset_2) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
inference(assume_negation,[status(cth)],[t18_relset_2]) ).
fof(c_0_3,negated_conjecture,
~ ! [X1] :
( ~ v1_xboole_0(X1)
=> ! [X2,X3] :
( m1_subset_1(X3,k1_zfmisc_1(X1))
=> ! [X4] :
( m2_relset_1(X4,X1,X2)
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_2]) ).
fof(c_0_4,plain,
! [X1,X2,X3,X4] :
( ( m2_relset_1(X4,X1,X2)
& m1_subset_1(X3,k1_zfmisc_1(X1))
& ~ v1_xboole_0(X1) )
=> m1_subset_1(a_4_0_relset_2(X1,X2,X3,X4),k1_zfmisc_1(k1_zfmisc_1(X2))) ),
inference(fof_simplification,[status(thm)],[s8_domain_1__e1_22__relset_2]) ).
fof(c_0_5,negated_conjecture,
( ~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0)))
& m2_relset_1(esk4_0,esk1_0,esk2_0)
& m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0))
& ~ v1_xboole_0(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,plain,
! [X50,X51,X52,X53] :
( m1_subset_1(a_4_0_relset_2(X50,X51,X52,X53),k1_zfmisc_1(k1_zfmisc_1(X51)))
| ~ m2_relset_1(X53,X50,X51)
| ~ m1_subset_1(X52,k1_zfmisc_1(X50))
| v1_xboole_0(X50) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
cnf(c_0_7,negated_conjecture,
~ m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,esk3_0,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ m2_relset_1(X3,X1,X4)
| ~ m1_subset_1(X2,k1_zfmisc_1(X1))
| m1_subset_1(a_4_0_relset_2(X1,X4,X2,X3),k1_zfmisc_1(k1_zfmisc_1(X4)))
| v1_xboole_0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]),c_0_10])]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU424+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.15/0.40 % Computer : n007.cluster.edu
% 0.15/0.40 % Model : x86_64 x86_64
% 0.15/0.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.40 % Memory : 8046.5625MB
% 0.15/0.40 % OS : Linux 6.8.0-71-generic
% 0.15/0.41 % CPULimit : 300
% 0.15/0.41 % WCLimit : 300
% 0.15/0.41 % DateTime : Mon Sep 21 06:24:54 UTC 2026
% 0.15/0.41 % CPUTime :
% 0.15/0.41 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.46 Running first-order theorem proving
% 0.15/0.46 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
% 12.69/3.57 % Version: 3.5.1
% 12.69/3.57 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.69/3.57 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.69/3.57 % Starting new_bool_3 with 897s (3) cores
% 12.69/3.57 % Starting new_bool_1 with 897s (3) cores
% 12.69/3.57 % Starting sh5l with 299s (1) cores
% 12.69/3.57 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 299s (1) cores
% 12.69/3.57 % new_bool_1 with pid 395087 completed with status 0
% 12.69/3.57 % Result found by new_bool_1
% 12.69/3.57 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.69/3.57 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.69/3.57 % Starting new_bool_3 with 897s (3) cores
% 12.69/3.57 % Starting new_bool_1 with 897s (3) cores
% 12.69/3.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 12.69/3.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.69/3.57 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.69/3.57 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 12.69/3.57 % Starting SubtermCWHack with 81s (1) cores
% 12.69/3.57 % Starting new_bool_1 with 90s (1) cores
% 12.69/3.57 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 12.69/3.57 % SubtermCWHack with pid 395093 completed with status 0
% 12.69/3.57 % Result found by SubtermCWHack
% 12.69/3.57 % Preprocessing class: FMLLMMLLSSSNFFN.
% 12.69/3.57 % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 12.69/3.57 % Starting new_bool_3 with 897s (3) cores
% 12.69/3.57 % Starting new_bool_1 with 897s (3) cores
% 12.69/3.57 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 12.69/3.57 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 12.69/3.57 % Search class: FGHSM-SMLM32-MFFFFFNN
% 12.69/3.57 % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 12.69/3.57 % Starting SubtermCWHack with 81s (1) cores
% 12.69/3.57 % Preprocessing time : 0.042 s
% 12.69/3.57
% 12.69/3.57 % Proof found!
% 12.69/3.57 % SZS status Theorem
% 12.69/3.57 % SZS output start CNFRefutation
% See solution above
% 12.69/3.57 % Parsed axioms : 19089
% 12.69/3.57 % Removed by relevancy pruning/SinE : 18388
% 12.69/3.57 % Initial clauses : 1494
% 12.69/3.57 % Removed in clause preprocessing : 45
% 12.69/3.57 % Initial clauses in saturation : 1449
% 12.69/3.57 % Processed clauses : 11231
% 12.69/3.57 % ...of these trivial : 266
% 12.69/3.57 % ...subsumed : 7729
% 12.69/3.57 % ...remaining for further processing : 3236
% 12.69/3.57 % Other redundant clauses eliminated : 265
% 12.69/3.57 % Clauses deleted for lack of memory : 0
% 12.69/3.57 % Backward-subsumed : 87
% 12.69/3.57 % Backward-rewritten : 143
% 12.69/3.57 % Generated clauses : 55578
% 12.69/3.57 % ...of the previous two non-redundant : 46548
% 12.69/3.57 % ...aggressively subsumed : 0
% 12.69/3.57 % Contextual simplify-reflections : 34
% 12.69/3.57 % Paramodulations : 55291
% 12.69/3.57 % Factorizations : 17
% 12.69/3.57 % NegExts : 0
% 12.69/3.57 % Equation resolutions : 278
% 12.69/3.57 % Disequality decompositions : 0
% 12.69/3.57 % Total rewrite steps : 15926
% 12.69/3.57 % ...of those cached : 13550
% 12.69/3.57 % Propositional unsat checks : 0
% 12.69/3.57 % Propositional check models : 0
% 12.69/3.57 % Propositional check unsatisfiable : 0
% 12.69/3.57 % Propositional clauses : 0
% 12.69/3.57 % Propositional clauses after purity: 0
% 12.69/3.57 % Propositional unsat core size : 0
% 12.69/3.58 % Propositional preprocessing time : 0.000
% 12.69/3.58 % Propositional encoding time : 0.000
% 12.69/3.58 % Propositional solver time : 0.000
% 12.69/3.58 % Success case prop preproc time : 0.000
% 12.69/3.58 % Success case prop encoding time : 0.000
% 12.69/3.58 % Success case prop solver time : 0.000
% 12.69/3.58 % Current number of processed clauses : 2906
% 12.69/3.58 % Positive orientable unit clauses : 623
% 12.69/3.58 % Positive unorientable unit clauses: 4
% 12.69/3.58 % Negative unit clauses : 506
% 12.69/3.58 % Non-unit-clauses : 1773
% 12.69/3.58 % Current number of unprocessed clauses: 36381
% 12.69/3.58 % ...number of literals in the above : 124119
% 12.69/3.58 % Current number of archived formulas : 0
% 12.69/3.58 % Current number of archived clauses : 230
% 12.69/3.58 % Clause-clause subsumption calls (NU) : 1260906
% 12.69/3.58 % Rec. Clause-clause subsumption calls : 459299
% 12.69/3.58 % Non-unit clause-clause subsumptions : 3051
% 12.69/3.58 % Unit Clause-clause subsumption calls : 149823
% 12.69/3.58 % Rewrite failures with RHS unbound : 0
% 12.69/3.58 % BW rewrite match attempts : 301
% 12.69/3.58 % BW rewrite match successes : 86
% 12.69/3.58 % Condensation attempts : 0
% 12.69/3.58 % Condensation successes : 0
% 12.69/3.58 % Termbank termtop insertions : 1216902
% 12.69/3.58 % Search garbage collected termcells : 200715
% 12.69/3.58
% 12.69/3.58 % -------------------------------------------------
% 12.69/3.58 % User time : 1.638 s
% 12.69/3.58 % System time : 0.133 s
% 12.69/3.58 % Total time : 1.771 s
% 12.69/3.58 % Maximum resident set size: 41072 pages
% 12.69/3.58
% 12.69/3.58 % -------------------------------------------------
% 12.69/3.58 % User time : 5.512 s
% 12.69/3.58 % System time : 0.375 s
% 12.69/3.58 % Total time : 5.886 s
% 12.69/3.58 % Maximum resident set size: 32512 pages
% 12.69/3.58 % E exiting
%------------------------------------------------------------------------------