%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM633+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 : 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:51 PM UTC 2026
% Result : Theorem 0.19s 0.50s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 15 ( 5 unt; 0 def)
% Number of atoms : 67 ( 15 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 78 ( 26 ~; 18 |; 25 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 9 !; 6 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xc))
& aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4998,hypothesis,
aSubsetOf0(xO,xS),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4998) ).
fof(m__4908,hypothesis,
( isCountable0(xO)
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4908) ).
fof(m__4854,hypothesis,
( isCountable0(sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aElementOf0(szDzizrdt0(xd),xT) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4854) ).
fof(c_0_4,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xc))
& aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_5,negated_conjecture,
~ ( ! [X1] :
( aElementOf0(X1,slbdtsldtrb0(xO,xK))
=> ( sdtlpdtrp0(xc,X1) = szDzizrdt0(xd)
& aElementOf0(X1,szDzozmdt0(xc))
& aSubsetOf0(X1,szNzAzT0)
& X1 != slcrc0 ) )
=> ? [X1] :
( ? [X2] :
( ! [X3] :
( aElementOf0(X3,slbdtsldtrb0(X2,xK))
=> sdtlpdtrp0(xc,X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,xS) )
& aElementOf0(X1,xT) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_6,negated_conjecture,
! [X209,X210,X211] :
( ( ~ aElementOf0(X210,xT)
| ~ isCountable0(X211)
| ~ aSubsetOf0(X211,xS)
| sdtlpdtrp0(xc,esk26_2(X210,X211)) != X210 )
& ( ~ aElementOf0(X210,xT)
| ~ isCountable0(X211)
| ~ aSubsetOf0(X211,xS)
| aElementOf0(esk26_2(X210,X211),slbdtsldtrb0(X211,xK)) )
& ( ~ aElementOf0(X209,slbdtsldtrb0(xO,xK))
| sdtlpdtrp0(xc,X209) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X209,slbdtsldtrb0(xO,xK))
| aElementOf0(X209,szDzozmdt0(xc)) )
& ( ~ aElementOf0(X209,slbdtsldtrb0(xO,xK))
| aSubsetOf0(X209,szNzAzT0) )
& ( ~ aElementOf0(X209,slbdtsldtrb0(xO,xK))
| X209 != slcrc0 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])])]) ).
cnf(c_0_7,negated_conjecture,
( ~ aElementOf0(X1,slbdtsldtrb0(xO,xK))
| sdtlpdtrp0(xc,X1) = szDzizrdt0(xd) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| aElementOf0(esk26_2(X1,X2),slbdtsldtrb0(X2,xK)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,hypothesis,
aSubsetOf0(xO,xS),
inference(split_conjunct,[status(thm)],[m__4998]) ).
cnf(c_0_10,hypothesis,
isCountable0(xO),
inference(split_conjunct,[status(thm)],[m__4908]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xS)
| sdtlpdtrp0(xc,esk26_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_12,negated_conjecture,
( ~ aElementOf0(X1,xT)
| sdtlpdtrp0(xc,esk26_2(X1,xO)) = szDzizrdt0(xd) ),
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])]) ).
cnf(c_0_13,hypothesis,
aElementOf0(szDzizrdt0(xd),xT),
inference(split_conjunct,[status(thm)],[m__4854]) ).
cnf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9]),c_0_10])])]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM633+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.13/0.39 % Computer : n015.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Mon Sep 21 02:49:21 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.44 Running first-order theorem proving
% 0.13/0.44 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.19/0.50 % Version: 3.5.1
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.50 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.50 % Starting sh5l with 300s (1) cores
% 0.19/0.50 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 394848 completed with status 0
% 0.19/0.50 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.50 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.19/0.50 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.19/0.50 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 394860 completed with status 0
% 0.19/0.50 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.19/0.50 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.50 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.50 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.50 % No SInE strategy applied
% 0.19/0.50 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.50 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.50 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.50 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.50 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.50 % Preprocessing time : 0.003 s
% 0.19/0.50 % Presaturation interreduction done
% 0.19/0.50
% 0.19/0.50 % Proof found!
% 0.19/0.50 % SZS status Theorem
% 0.19/0.50 % SZS output start CNFRefutation
% See solution above
% 0.19/0.50 % Parsed axioms : 99
% 0.19/0.50 % Removed by relevancy pruning/SinE : 0
% 0.19/0.50 % Initial clauses : 206
% 0.19/0.50 % Removed in clause preprocessing : 7
% 0.19/0.50 % Initial clauses in saturation : 199
% 0.19/0.50 % Processed clauses : 443
% 0.19/0.50 % ...of these trivial : 1
% 0.19/0.50 % ...subsumed : 12
% 0.19/0.50 % ...remaining for further processing : 430
% 0.19/0.50 % Other redundant clauses eliminated : 51
% 0.19/0.50 % Clauses deleted for lack of memory : 0
% 0.19/0.50 % Backward-subsumed : 6
% 0.19/0.50 % Backward-rewritten : 3
% 0.19/0.50 % Generated clauses : 264
% 0.19/0.50 % ...of the previous two non-redundant : 223
% 0.19/0.50 % ...aggressively subsumed : 0
% 0.19/0.50 % Contextual simplify-reflections : 21
% 0.19/0.50 % Paramodulations : 217
% 0.19/0.50 % Factorizations : 0
% 0.19/0.50 % NegExts : 0
% 0.19/0.50 % Equation resolutions : 52
% 0.19/0.50 % Disequality decompositions : 0
% 0.19/0.50 % Total rewrite steps : 191
% 0.19/0.50 % ...of those cached : 153
% 0.19/0.50 % Propositional unsat checks : 0
% 0.19/0.50 % Propositional check models : 0
% 0.19/0.50 % Propositional check unsatisfiable : 0
% 0.19/0.50 % Propositional clauses : 0
% 0.19/0.50 % Propositional clauses after purity: 0
% 0.19/0.50 % Propositional unsat core size : 0
% 0.19/0.50 % Propositional preprocessing time : 0.000
% 0.19/0.50 % Propositional encoding time : 0.000
% 0.19/0.50 % Propositional solver time : 0.000
% 0.19/0.50 % Success case prop preproc time : 0.000
% 0.19/0.50 % Success case prop encoding time : 0.000
% 0.19/0.50 % Success case prop solver time : 0.000
% 0.19/0.50 % Current number of processed clauses : 183
% 0.19/0.50 % Positive orientable unit clauses : 53
% 0.19/0.50 % Positive unorientable unit clauses: 0
% 0.19/0.50 % Negative unit clauses : 13
% 0.19/0.50 % Non-unit-clauses : 117
% 0.19/0.50 % Current number of unprocessed clauses: 174
% 0.19/0.50 % ...number of literals in the above : 757
% 0.19/0.50 % Current number of archived formulas : 0
% 0.19/0.50 % Current number of archived clauses : 206
% 0.19/0.50 % Clause-clause subsumption calls (NU) : 8836
% 0.19/0.50 % Rec. Clause-clause subsumption calls : 2594
% 0.19/0.50 % Non-unit clause-clause subsumptions : 25
% 0.19/0.50 % Unit Clause-clause subsumption calls : 381
% 0.19/0.50 % Rewrite failures with RHS unbound : 0
% 0.19/0.50 % BW rewrite match attempts : 3
% 0.19/0.50 % BW rewrite match successes : 3
% 0.19/0.50 % Condensation attempts : 0
% 0.19/0.50 % Condensation successes : 0
% 0.19/0.50 % Termbank termtop insertions : 22862
% 0.19/0.50 % Search garbage collected termcells : 3877
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.035 s
% 0.19/0.50 % System time : 0.004 s
% 0.19/0.50 % Total time : 0.039 s
% 0.19/0.50 % Maximum resident set size: 4280 pages
% 0.19/0.50
% 0.19/0.50 % -------------------------------------------------
% 0.19/0.50 % User time : 0.122 s
% 0.19/0.50 % System time : 0.025 s
% 0.19/0.50 % Total time : 0.146 s
% 0.19/0.50 % Maximum resident set size: 4864 pages
% 0.19/0.50 % E exiting
%------------------------------------------------------------------------------