%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM571+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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:55:32 PM UTC 2026
% Result : Theorem 0.15s 10.47s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 5 unt; 0 def)
% Number of atoms : 56 ( 17 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 52 ( 13 ~; 14 |; 21 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 2 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3702_02,hypothesis,
( xi != sz00
=> ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ? [X1] :
( szszuzczcdt0(X1) = xi
& aElementOf0(X1,szNzAzT0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3702_02) ).
fof(m__3623,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( ( isCountable0(sdtlpdtrp0(xN,X1))
& aSubsetOf0(sdtlpdtrp0(xN,X1),szNzAzT0) )
=> ( isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X1)))
& aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X1)),sdtmndt0(sdtlpdtrp0(xN,X1),szmzizndt0(sdtlpdtrp0(xN,X1)))) ) ) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3623) ).
fof(m__3435,hypothesis,
( isCountable0(xS)
& aSubsetOf0(xS,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3435) ).
fof(c_0_4,negated_conjecture,
~ ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,hypothesis,
( xi != sz00
=> ( isCountable0(sdtlpdtrp0(xN,xi))
& aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0)
& ? [X1] :
( szszuzczcdt0(X1) = xi
& aElementOf0(X1,szNzAzT0) ) ) ),
inference(fof_simplification,[status(thm)],[m__3702_02]) ).
fof(c_0_6,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
fof(c_0_7,hypothesis,
( ( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) )
& ( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) )
& ( xi = sz00
| szszuzczcdt0(esk3_0) = xi )
& ( xi = sz00
| aElementOf0(esk3_0,szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_8,negated_conjecture,
( ~ isCountable0(sdtlpdtrp0(xN,xi))
| ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
( xi = sz00
| isCountable0(sdtlpdtrp0(xN,xi)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
( xi = sz00
| aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,hypothesis,
! [X13] :
( ( ~ aElementOf0(X13,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X13))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X13),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X13))) )
& ( ~ aElementOf0(X13,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X13))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X13),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X13)),sdtmndt0(sdtlpdtrp0(xN,X13),szmzizndt0(sdtlpdtrp0(xN,X13)))) )
& sdtlpdtrp0(xN,sz00) = xS
& szDzozmdt0(xN) = szNzAzT0
& aFunction0(xN) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3623])])])])]) ).
cnf(c_0_12,hypothesis,
xi = sz00,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
cnf(c_0_13,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,hypothesis,
aSubsetOf0(xS,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_15,hypothesis,
isCountable0(xS),
inference(split_conjunct,[status(thm)],[m__3435]) ).
cnf(c_0_16,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_12]),c_0_13]),c_0_14]),c_0_13]),c_0_15])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM571+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/10.39 % Computer : n008.cluster.edu
% 0.12/10.39 % Model : x86_64 x86_64
% 0.12/10.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/10.39 % Memory : 8046.5625MB
% 0.12/10.39 % OS : Linux 6.8.0-71-generic
% 0.12/10.39 % CPULimit : 300
% 0.12/10.39 % WCLimit : 300
% 0.12/10.39 % DateTime : Mon Sep 21 02:41:49 UTC 2026
% 0.12/10.39 % CPUTime :
% 0.12/10.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/10.43 Running first-order theorem proving
% 0.15/10.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
% 0.15/10.47 % Version: 3.5.1
% 0.15/10.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.47 % Starting sh5l with 300s (1) cores
% 0.15/10.47 % new_bool_1 with pid 4167731 completed with status 0
% 0.15/10.47 % Result found by new_bool_1
% 0.15/10.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.47 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/10.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.47 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.47 % SubtermCWHack with pid 4167733 completed with status 0
% 0.15/10.47 % Result found by SubtermCWHack
% 0.15/10.47 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/10.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.47 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/10.47 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.47 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.47 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/10.47 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/10.47 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/10.47 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/10.47 % Starting SubtermCWHack with 28s (1) cores
% 0.15/10.47 % Preprocessing time : 0.003 s
% 0.15/10.47
% 0.15/10.47 % Proof found!
% 0.15/10.47 % SZS status Theorem
% 0.15/10.47 % SZS output start CNFRefutation
% See solution above
% 0.15/10.47 % Parsed axioms : 85
% 0.15/10.47 % Removed by relevancy pruning/SinE : 5
% 0.15/10.47 % Initial clauses : 154
% 0.15/10.47 % Removed in clause preprocessing : 7
% 0.15/10.47 % Initial clauses in saturation : 147
% 0.15/10.47 % Processed clauses : 86
% 0.15/10.47 % ...of these trivial : 0
% 0.15/10.47 % ...subsumed : 4
% 0.15/10.47 % ...remaining for further processing : 82
% 0.15/10.47 % Other redundant clauses eliminated : 6
% 0.15/10.47 % Clauses deleted for lack of memory : 0
% 0.15/10.47 % Backward-subsumed : 2
% 0.15/10.47 % Backward-rewritten : 8
% 0.15/10.47 % Generated clauses : 66
% 0.15/10.47 % ...of the previous two non-redundant : 44
% 0.15/10.47 % ...aggressively subsumed : 0
% 0.15/10.47 % Contextual simplify-reflections : 1
% 0.15/10.47 % Paramodulations : 60
% 0.15/10.47 % Factorizations : 0
% 0.15/10.47 % NegExts : 0
% 0.15/10.47 % Equation resolutions : 6
% 0.15/10.47 % Disequality decompositions : 0
% 0.15/10.47 % Total rewrite steps : 80
% 0.15/10.47 % ...of those cached : 59
% 0.15/10.47 % Propositional unsat checks : 0
% 0.15/10.47 % Propositional check models : 0
% 0.15/10.47 % Propositional check unsatisfiable : 0
% 0.15/10.47 % Propositional clauses : 0
% 0.15/10.47 % Propositional clauses after purity: 0
% 0.15/10.47 % Propositional unsat core size : 0
% 0.15/10.47 % Propositional preprocessing time : 0.000
% 0.15/10.47 % Propositional encoding time : 0.000
% 0.15/10.47 % Propositional solver time : 0.000
% 0.15/10.47 % Success case prop preproc time : 0.000
% 0.15/10.47 % Success case prop encoding time : 0.000
% 0.15/10.47 % Success case prop solver time : 0.000
% 0.15/10.47 % Current number of processed clauses : 67
% 0.15/10.47 % Positive orientable unit clauses : 30
% 0.15/10.47 % Positive unorientable unit clauses: 0
% 0.15/10.47 % Negative unit clauses : 8
% 0.15/10.47 % Non-unit-clauses : 29
% 0.15/10.47 % Current number of unprocessed clauses: 105
% 0.15/10.47 % ...number of literals in the above : 511
% 0.15/10.47 % Current number of archived formulas : 0
% 0.15/10.47 % Current number of archived clauses : 10
% 0.15/10.47 % Clause-clause subsumption calls (NU) : 184
% 0.15/10.47 % Rec. Clause-clause subsumption calls : 155
% 0.15/10.47 % Non-unit clause-clause subsumptions : 3
% 0.15/10.47 % Unit Clause-clause subsumption calls : 95
% 0.15/10.47 % Rewrite failures with RHS unbound : 0
% 0.15/10.47 % BW rewrite match attempts : 1
% 0.15/10.47 % BW rewrite match successes : 1
% 0.15/10.47 % Condensation attempts : 0
% 0.15/10.47 % Condensation successes : 0
% 0.15/10.47 % Termbank termtop insertions : 13225
% 0.15/10.47 % Search garbage collected termcells : 3040
% 0.15/10.47
% 0.15/10.47 % -------------------------------------------------
% 0.15/10.47 % User time : 0.011 s
% 0.15/10.47 % System time : 0.004 s
% 0.15/10.47 % Total time : 0.015 s
% 0.15/10.47 % Maximum resident set size: 4200 pages
% 0.15/10.47
% 0.15/10.47 % -------------------------------------------------
% 0.15/10.47 % User time : 0.015 s
% 0.15/10.47 % System time : 0.009 s
% 0.15/10.47 % Total time : 0.023 s
% 0.15/10.47 % Maximum resident set size: 4864 pages
% 0.15/10.47 % E exiting
%------------------------------------------------------------------------------