%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU424+3 : 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 : 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:06 PM UTC 2026
% Result : Theorem 5.28s 1.73s
% Output : CNFRefutation 5.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 2
% Syntax : Number of formulae : 14 ( 5 unt; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 41 ( 16 ~; 7 |; 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 : 29 ( 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/sandbox2/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/sandbox2/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,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_4,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_5,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_3])])]) ).
fof(c_0_6,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_4])])])]) ).
cnf(c_0_7,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_5]) ).
cnf(c_0_8,negated_conjecture,
m2_relset_1(esk4_0,esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,negated_conjecture,
~ v1_xboole_0(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ m1_subset_1(X1,k1_zfmisc_1(esk1_0))
| m1_subset_1(a_4_0_relset_2(esk1_0,esk2_0,X1,esk4_0),k1_zfmisc_1(k1_zfmisc_1(esk2_0))) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9]) ).
cnf(c_0_11,negated_conjecture,
m1_subset_1(esk3_0,k1_zfmisc_1(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,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_6]) ).
cnf(c_0_13,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU424+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n003.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 06:28:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.28/1.73 % Version: 3.5.1
% 5.28/1.73 % Preprocessing class: FMLLMMLLSSSNFFN.
% 5.28/1.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.73 % Starting new_bool_3 with 900s (3) cores
% 5.28/1.73 % Starting new_bool_1 with 900s (3) cores
% 5.28/1.73 % Starting sh5l with 300s (1) cores
% 5.28/1.73 % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 5.28/1.73 % new_bool_3 with pid 3619702 completed with status 0
% 5.28/1.73 % Result found by new_bool_3
% 5.28/1.73 % Preprocessing class: FMLLMMLLSSSNFFN.
% 5.28/1.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.73 % Starting new_bool_3 with 900s (3) cores
% 5.28/1.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.28/1.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.28/1.73 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.28/1.73 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.28/1.73 % Starting SubtermCWHack with 82s (1) cores
% 5.28/1.73 % Starting new_bool_3 with 91s (1) cores
% 5.28/1.73 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 5.28/1.73 % new_bool_3 with pid 3619708 completed with status 0
% 5.28/1.73 % Result found by new_bool_3
% 5.28/1.73 % Preprocessing class: FMLLMMLLSSSNFFN.
% 5.28/1.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.28/1.73 % Starting new_bool_3 with 900s (3) cores
% 5.28/1.73 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.28/1.73 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.28/1.73 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.28/1.73 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 5.28/1.73 % Starting SubtermCWHack with 82s (1) cores
% 5.28/1.73 % Starting new_bool_3 with 91s (1) cores
% 5.28/1.73 % Preprocessing time : 0.041 s
% 5.28/1.73 % Presaturation interreduction done
% 5.28/1.73
% 5.28/1.73 % Proof found!
% 5.28/1.73 % SZS status Theorem
% 5.28/1.73 % SZS output start CNFRefutation
% See solution above
% 5.28/1.73 % Parsed axioms : 19089
% 5.28/1.73 % Removed by relevancy pruning/SinE : 18388
% 5.28/1.73 % Initial clauses : 1494
% 5.28/1.73 % Removed in clause preprocessing : 45
% 5.28/1.73 % Initial clauses in saturation : 1449
% 5.28/1.73 % Processed clauses : 7606
% 5.28/1.73 % ...of these trivial : 95
% 5.28/1.73 % ...subsumed : 4258
% 5.28/1.73 % ...remaining for further processing : 3253
% 5.28/1.73 % Other redundant clauses eliminated : 417
% 5.28/1.73 % Clauses deleted for lack of memory : 0
% 5.28/1.73 % Backward-subsumed : 36
% 5.28/1.73 % Backward-rewritten : 47
% 5.28/1.73 % Generated clauses : 23542
% 5.28/1.73 % ...of the previous two non-redundant : 20372
% 5.28/1.73 % ...aggressively subsumed : 0
% 5.28/1.73 % Contextual simplify-reflections : 32
% 5.28/1.73 % Paramodulations : 23115
% 5.28/1.73 % Factorizations : 2
% 5.28/1.73 % NegExts : 0
% 5.28/1.73 % Equation resolutions : 424
% 5.28/1.73 % Disequality decompositions : 0
% 5.28/1.73 % Total rewrite steps : 5731
% 5.28/1.73 % ...of those cached : 4277
% 5.28/1.73 % Propositional unsat checks : 0
% 5.28/1.73 % Propositional check models : 0
% 5.28/1.73 % Propositional check unsatisfiable : 0
% 5.28/1.73 % Propositional clauses : 0
% 5.28/1.73 % Propositional clauses after purity: 0
% 5.28/1.73 % Propositional unsat core size : 0
% 5.28/1.73 % Propositional preprocessing time : 0.000
% 5.28/1.73 % Propositional encoding time : 0.000
% 5.28/1.73 % Propositional solver time : 0.000
% 5.28/1.73 % Success case prop preproc time : 0.000
% 5.28/1.73 % Success case prop encoding time : 0.000
% 5.28/1.73 % Success case prop solver time : 0.000
% 5.28/1.73 % Current number of processed clauses : 1770
% 5.28/1.73 % Positive orientable unit clauses : 484
% 5.28/1.73 % Positive unorientable unit clauses: 3
% 5.28/1.73 % Negative unit clauses : 374
% 5.28/1.73 % Non-unit-clauses : 909
% 5.28/1.73 % Current number of unprocessed clauses: 15362
% 5.28/1.73 % ...number of literals in the above : 39302
% 5.28/1.73 % Current number of archived formulas : 0
% 5.28/1.73 % Current number of archived clauses : 1378
% 5.28/1.73 % Clause-clause subsumption calls (NU) : 710832
% 5.28/1.73 % Rec. Clause-clause subsumption calls : 193498
% 5.28/1.73 % Non-unit clause-clause subsumptions : 862
% 5.28/1.73 % Unit Clause-clause subsumption calls : 35422
% 5.28/1.73 % Rewrite failures with RHS unbound : 0
% 5.28/1.73 % BW rewrite match attempts : 428
% 5.28/1.73 % BW rewrite match successes : 260
% 5.28/1.73 % Condensation attempts : 0
% 5.28/1.73 % Condensation successes : 0
% 5.28/1.73 % Termbank termtop insertions : 883913
% 5.28/1.73 % Search garbage collected termcells : 200715
% 5.28/1.73
% 5.28/1.73 % -------------------------------------------------
% 5.28/1.73 % User time : 0.760 s
% 5.28/1.73 % System time : 0.103 s
% 5.28/1.73 % Total time : 0.863 s
% 5.28/1.73 % Maximum resident set size: 41020 pages
% 5.28/1.73
% 5.28/1.73 % -------------------------------------------------
% 5.28/1.73 % User time : 2.239 s
% 5.28/1.73 % System time : 0.239 s
% 5.28/1.73 % Total time : 2.478 s
% 5.28/1.73 % Maximum resident set size: 32768 pages
% 5.28/1.73 % E exiting
%------------------------------------------------------------------------------