%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM606+3 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 01:49:45 PM UTC 2026
% Result : Theorem 1.38s 0.83s
% Output : CNFRefutation 1.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 48 ( 2 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 41 ( 10 ~; 8 |; 18 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aSubsetOf0(xQ,szNzAzT0)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5078,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(m__4998,hypothesis,
( aSubsetOf0(xO,xS)
& ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ! [X1] :
( aElementOf0(X1,xS)
=> aElementOf0(X1,szNzAzT0) )
& aSet0(xS) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3435) ).
fof(c_0_4,negated_conjecture,
~ ( aSubsetOf0(xQ,szNzAzT0)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,szNzAzT0) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
! [X255] :
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ( aElementOf0(X255,xO)
| ~ aElementOf0(X255,xQ) )
& aSet0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_6,negated_conjecture,
( ~ aSubsetOf0(xQ,szNzAzT0)
& ~ aElementOf0(esk41_0,szNzAzT0)
& aElementOf0(esk41_0,xQ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,hypothesis,
! [X254] :
( aSubsetOf0(xO,xS)
& ( aElementOf0(X254,xS)
| ~ aElementOf0(X254,xO) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])])]) ).
cnf(c_0_8,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,negated_conjecture,
aElementOf0(esk41_0,xQ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
! [X178] :
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0)
& ( aElementOf0(X178,szNzAzT0)
| ~ aElementOf0(X178,xS) )
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3435])])])]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,negated_conjecture,
aElementOf0(esk41_0,xO),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_13,hypothesis,
( ~ aElementOf0(X1,xS)
| aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aElementOf0(esk41_0,xS),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ aElementOf0(esk41_0,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM606+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n015.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 02:47:20 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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
% 1.38/0.83 % Version: 3.5.1
% 1.38/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.38/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.38/0.83 % Starting new_bool_3 with 300s (1) cores
% 1.38/0.83 % Starting new_bool_1 with 300s (1) cores
% 1.38/0.83 % Starting sh5l with 300s (1) cores
% 1.38/0.83 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 389919 completed with status 0
% 1.38/0.83 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 1.38/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.38/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.38/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.38/0.83 % No SInE strategy applied
% 1.38/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.38/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.38/0.83 % Starting SubtermCWHack with 136s (1) cores
% 1.38/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 1.38/0.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S059I with 136s (1) cores
% 1.38/0.83 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 1.38/0.83 % Starting new_bool_3 with 136s (1) cores
% 1.38/0.83 % SubtermCWHack with pid 389941 completed with status 0
% 1.38/0.83 % Result found by SubtermCWHack
% 1.38/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.38/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.38/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.38/0.83 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.38/0.83 % No SInE strategy applied
% 1.38/0.83 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.38/0.83 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.38/0.83 % Starting SubtermCWHack with 136s (1) cores
% 1.38/0.83 % Preprocessing time : 0.101 s
% 1.38/0.83
% 1.38/0.83 % Proof found!
% 1.38/0.83 % SZS status Theorem
% 1.38/0.83 % SZS output start CNFRefutation
% See solution above
% 1.38/0.83 % Parsed axioms : 101
% 1.38/0.83 % Removed by relevancy pruning/SinE : 0
% 1.38/0.83 % Initial clauses : 4887
% 1.38/0.83 % Removed in clause preprocessing : 7
% 1.38/0.83 % Initial clauses in saturation : 4880
% 1.38/0.83 % Processed clauses : 76
% 1.38/0.83 % ...of these trivial : 2
% 1.38/0.83 % ...subsumed : 2
% 1.38/0.83 % ...remaining for further processing : 72
% 1.38/0.83 % Other redundant clauses eliminated : 3
% 1.38/0.83 % Clauses deleted for lack of memory : 0
% 1.38/0.83 % Backward-subsumed : 0
% 1.38/0.83 % Backward-rewritten : 0
% 1.38/0.83 % Generated clauses : 20
% 1.38/0.83 % ...of the previous two non-redundant : 14
% 1.38/0.83 % ...aggressively subsumed : 0
% 1.38/0.83 % Contextual simplify-reflections : 0
% 1.38/0.83 % Paramodulations : 17
% 1.38/0.83 % Factorizations : 0
% 1.38/0.83 % NegExts : 0
% 1.38/0.83 % Equation resolutions : 3
% 1.38/0.83 % Disequality decompositions : 0
% 1.38/0.83 % Total rewrite steps : 19
% 1.38/0.83 % ...of those cached : 7
% 1.38/0.83 % Propositional unsat checks : 0
% 1.38/0.83 % Propositional check models : 0
% 1.38/0.83 % Propositional check unsatisfiable : 0
% 1.38/0.83 % Propositional clauses : 0
% 1.38/0.83 % Propositional clauses after purity: 0
% 1.38/0.83 % Propositional unsat core size : 0
% 1.38/0.83 % Propositional preprocessing time : 0.000
% 1.38/0.83 % Propositional encoding time : 0.000
% 1.38/0.83 % Propositional solver time : 0.000
% 1.38/0.83 % Success case prop preproc time : 0.000
% 1.38/0.83 % Success case prop encoding time : 0.000
% 1.38/0.83 % Success case prop solver time : 0.000
% 1.38/0.83 % Current number of processed clauses : 69
% 1.38/0.83 % Positive orientable unit clauses : 45
% 1.38/0.83 % Positive unorientable unit clauses: 0
% 1.38/0.83 % Negative unit clauses : 7
% 1.38/0.83 % Non-unit-clauses : 17
% 1.38/0.83 % Current number of unprocessed clauses: 4818
% 1.38/0.83 % ...number of literals in the above : 55902
% 1.38/0.83 % Current number of archived formulas : 0
% 1.38/0.83 % Current number of archived clauses : 0
% 1.38/0.83 % Clause-clause subsumption calls (NU) : 23
% 1.38/0.83 % Rec. Clause-clause subsumption calls : 23
% 1.38/0.83 % Non-unit clause-clause subsumptions : 0
% 1.38/0.83 % Unit Clause-clause subsumption calls : 28
% 1.38/0.83 % Rewrite failures with RHS unbound : 0
% 1.38/0.83 % BW rewrite match attempts : 0
% 1.38/0.83 % BW rewrite match successes : 0
% 1.38/0.83 % Condensation attempts : 0
% 1.38/0.83 % Condensation successes : 0
% 1.38/0.83 % Termbank termtop insertions : 382030
% 1.38/0.83 % Search garbage collected termcells : 31866
% 1.38/0.83
% 1.38/0.83 % -------------------------------------------------
% 1.38/0.83 % User time : 0.372 s
% 1.38/0.83 % System time : 0.023 s
% 1.38/0.83 % Total time : 0.395 s
% 1.38/0.83 % Maximum resident set size: 16100 pages
% 1.38/0.83
% 1.38/0.83 % -------------------------------------------------
% 1.38/0.83 % User time : 0.552 s
% 1.38/0.83 % System time : 0.045 s
% 1.38/0.83 % Total time : 0.597 s
% 1.38/0.83 % Maximum resident set size: 5120 pages
% 1.38/0.83 % E exiting
%------------------------------------------------------------------------------