%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM603+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 : n017.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:44 PM UTC 2026
% Result : Theorem 0.25s 0.68s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 10 unt; 0 def)
% Number of atoms : 51 ( 6 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 50 ( 19 ~; 15 |; 11 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__3754,hypothesis,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(X2,X1)
=> aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3754) ).
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(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroLess) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__5034,hypothesis,
( sdtlpdtrp0(xe,xi) = xx
& aElementOf0(xi,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5034) ).
fof(c_0_6,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,hypothesis,
! [X185,X186] :
( aSubsetOf0(sdtlpdtrp0(xN,X185),sdtlpdtrp0(xN,X186))
| ~ sdtlseqdt0(X186,X185)
| ~ aElementOf0(X186,szNzAzT0)
| ~ aElementOf0(X185,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])]) ).
fof(c_0_9,hypothesis,
! [X183] :
( ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| isCountable0(sdtlpdtrp0(xN,szszuzczcdt0(X183))) )
& ( ~ aElementOf0(X183,szNzAzT0)
| ~ isCountable0(sdtlpdtrp0(xN,X183))
| ~ aSubsetOf0(sdtlpdtrp0(xN,X183),szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,szszuzczcdt0(X183)),sdtmndt0(sdtlpdtrp0(xN,X183),szmzizndt0(sdtlpdtrp0(xN,X183)))) )
& 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])])])])]) ).
fof(c_0_10,plain,
! [X66] :
( sdtlseqdt0(sz00,X66)
| ~ aElementOf0(X66,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mZeroLess])])]) ).
fof(c_0_11,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_12,hypothesis,
( ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,hypothesis,
sdtlpdtrp0(xN,sz00) = xS,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
aElementOf0(sz00,szNzAzT0),
inference(split_conjunct,[status(thm)],[mZeroNum]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(sz00,X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),xS) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),c_0_15]) ).
cnf(c_0_18,hypothesis,
aElementOf0(xi,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5034]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM603+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.44 % Computer : n017.cluster.edu
% 0.17/0.44 % Model : x86_64 x86_64
% 0.17/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.44 % Memory : 8046.5625MB
% 0.17/0.44 % OS : Linux 6.8.0-71-generic
% 0.17/0.44 % CPULimit : 300
% 0.17/0.44 % WCLimit : 300
% 0.17/0.44 % DateTime : Mon Sep 21 02:38:57 UTC 2026
% 0.17/0.45 % CPUTime :
% 0.17/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.53 Running first-order theorem proving
% 0.25/0.53 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.25/0.68 % Version: 3.5.1
% 0.25/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.25/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.25/0.68 % Starting sh5l with 300s (1) cores
% 0.25/0.68 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1244813 completed with status 0
% 0.25/0.68 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.25/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.68 % No SInE strategy applied
% 0.25/0.68 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.25/0.68 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.25/0.68 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.25/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.25/0.68 % SubtermCWHack with pid 1244817 completed with status 0
% 0.25/0.68 % Result found by SubtermCWHack
% 0.25/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.25/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.25/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.25/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.25/0.68 % No SInE strategy applied
% 0.25/0.68 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.25/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.25/0.68 % Starting SubtermCWHack with 136s (1) cores
% 0.25/0.68 % Preprocessing time : 0.005 s
% 0.25/0.68
% 0.25/0.68 % Proof found!
% 0.25/0.68 % SZS status Theorem
% 0.25/0.68 % SZS output start CNFRefutation
% See solution above
% 0.25/0.68 % Parsed axioms : 100
% 0.25/0.68 % Removed by relevancy pruning/SinE : 0
% 0.25/0.68 % Initial clauses : 203
% 0.25/0.68 % Removed in clause preprocessing : 7
% 0.25/0.68 % Initial clauses in saturation : 196
% 0.25/0.68 % Processed clauses : 617
% 0.25/0.68 % ...of these trivial : 2
% 0.25/0.68 % ...subsumed : 193
% 0.25/0.68 % ...remaining for further processing : 422
% 0.25/0.68 % Other redundant clauses eliminated : 44
% 0.25/0.68 % Clauses deleted for lack of memory : 0
% 0.25/0.68 % Backward-subsumed : 12
% 0.25/0.68 % Backward-rewritten : 12
% 0.25/0.68 % Generated clauses : 1141
% 0.25/0.68 % ...of the previous two non-redundant : 992
% 0.25/0.68 % ...aggressively subsumed : 0
% 0.25/0.68 % Contextual simplify-reflections : 19
% 0.25/0.68 % Paramodulations : 1100
% 0.25/0.68 % Factorizations : 0
% 0.25/0.68 % NegExts : 0
% 0.25/0.68 % Equation resolutions : 45
% 0.25/0.68 % Disequality decompositions : 0
% 0.25/0.68 % Total rewrite steps : 706
% 0.25/0.68 % ...of those cached : 649
% 0.25/0.68 % Propositional unsat checks : 0
% 0.25/0.68 % Propositional check models : 0
% 0.25/0.68 % Propositional check unsatisfiable : 0
% 0.25/0.68 % Propositional clauses : 0
% 0.25/0.68 % Propositional clauses after purity: 0
% 0.25/0.68 % Propositional unsat core size : 0
% 0.25/0.68 % Propositional preprocessing time : 0.000
% 0.25/0.68 % Propositional encoding time : 0.000
% 0.25/0.68 % Propositional solver time : 0.000
% 0.25/0.68 % Success case prop preproc time : 0.000
% 0.25/0.68 % Success case prop encoding time : 0.000
% 0.25/0.68 % Success case prop solver time : 0.000
% 0.25/0.68 % Current number of processed clauses : 363
% 0.25/0.68 % Positive orientable unit clauses : 69
% 0.25/0.68 % Positive unorientable unit clauses: 0
% 0.25/0.68 % Negative unit clauses : 19
% 0.25/0.68 % Non-unit-clauses : 275
% 0.25/0.68 % Current number of unprocessed clauses: 559
% 0.25/0.68 % ...number of literals in the above : 2961
% 0.25/0.68 % Current number of archived formulas : 0
% 0.25/0.68 % Current number of archived clauses : 24
% 0.25/0.68 % Clause-clause subsumption calls (NU) : 12228
% 0.25/0.68 % Rec. Clause-clause subsumption calls : 6644
% 0.25/0.68 % Non-unit clause-clause subsumptions : 159
% 0.25/0.68 % Unit Clause-clause subsumption calls : 834
% 0.25/0.68 % Rewrite failures with RHS unbound : 0
% 0.25/0.68 % BW rewrite match attempts : 7
% 0.25/0.68 % BW rewrite match successes : 7
% 0.25/0.68 % Condensation attempts : 0
% 0.25/0.68 % Condensation successes : 0
% 0.25/0.68 % Termbank termtop insertions : 33771
% 0.25/0.68 % Search garbage collected termcells : 3728
% 0.25/0.68
% 0.25/0.68 % -------------------------------------------------
% 0.25/0.68 % User time : 0.060 s
% 0.25/0.68 % System time : 0.006 s
% 0.25/0.68 % Total time : 0.066 s
% 0.25/0.68 % Maximum resident set size: 3968 pages
% 0.25/0.68
% 0.25/0.68 % -------------------------------------------------
% 0.25/0.68 % User time : 0.133 s
% 0.25/0.68 % System time : 0.025 s
% 0.25/0.68 % Total time : 0.158 s
% 0.25/0.68 % Maximum resident set size: 4608 pages
% 0.25/0.68 % E exiting
%------------------------------------------------------------------------------