%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM627+1 : 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 : n013.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:49 PM UTC 2026
% Result : ContradictoryAxioms 0.19s 0.49s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 13 unt; 0 def)
% Number of atoms : 56 ( 5 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 58 ( 28 ~; 17 |; 8 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 9 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5442,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5442) ).
fof(m__5461,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5461) ).
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/sandbox/benchmark/theBenchmark.p',m__3754) ).
fof(m__5389,hypothesis,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5389) ).
fof(mLessTotal,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aElementOf0(X1,szNzAzT0) )
=> ( sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mLessTotal) ).
fof(m__5309,hypothesis,
( sdtlpdtrp0(xe,xn) = xp
& aElementOf0(xn,szNzAzT0)
& aElementOf0(xn,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5309) ).
fof(mSuccNum,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mSuccNum) ).
fof(c_0_7,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(fof_simplification,[status(thm)],[m__5442]) ).
fof(c_0_8,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
inference(fof_simplification,[status(thm)],[m__5461]) ).
fof(c_0_9,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_10,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_11,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_12,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,hypothesis,
( ~ sdtlseqdt0(X2,X1)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| aSubsetOf0(sdtlpdtrp0(xN,X1),sdtlpdtrp0(xN,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
fof(c_0_15,plain,
! [X77,X78] :
( sdtlseqdt0(szszuzczcdt0(X78),X77)
| sdtlseqdt0(X77,X78)
| ~ aElementOf0(X78,szNzAzT0)
| ~ aElementOf0(X77,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])])]) ).
cnf(c_0_16,hypothesis,
~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,hypothesis,
aElementOf0(xn,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5309]) ).
fof(c_0_18,plain,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( szszuzczcdt0(X1) != sz00
& aElementOf0(szszuzczcdt0(X1),szNzAzT0) ) ),
inference(fof_simplification,[status(thm)],[mSuccNum]) ).
cnf(c_0_19,hypothesis,
( ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
| ~ sdtlseqdt0(szszuzczcdt0(xn),xm) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_20,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,szNzAzT0)
| sdtlseqdt0(szszuzczcdt0(X2),X1)
| sdtlseqdt0(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,hypothesis,
~ sdtlseqdt0(xm,xn),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_13]),c_0_14]),c_0_17])]) ).
fof(c_0_22,plain,
! [X58] :
( ( ~ aElementOf0(X58,szNzAzT0)
| szszuzczcdt0(X58) != sz00 )
& ( ~ aElementOf0(X58,szNzAzT0)
| aElementOf0(szszuzczcdt0(X58),szNzAzT0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_23,hypothesis,
~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_14])]),c_0_21]) ).
cnf(c_0_24,plain,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(szszuzczcdt0(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_25,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM627+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:45:20 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 0.19/0.49 % Version: 3.5.1
% 0.19/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.19/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.19/0.49 % Starting sh5l with 300s (1) cores
% 0.19/0.49 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3978254 completed with status 0
% 0.19/0.49 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.19/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.49 % No SInE strategy applied
% 0.19/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.19/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.19/0.49 % SAT001_MinMin_p005000_rr_RG with pid 3978265 completed with status 0
% 0.19/0.49 % Result found by SAT001_MinMin_p005000_rr_RG
% 0.19/0.49 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.19/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.19/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.19/0.49 % No SInE strategy applied
% 0.19/0.49 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.19/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.19/0.49 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.19/0.49 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.19/0.49 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.19/0.49 % Preprocessing time : 0.003 s
% 0.19/0.49 % Presaturation interreduction done
% 0.19/0.49
% 0.19/0.49 % Proof found!
% 0.19/0.49 % SZS status ContradictoryAxioms
% 0.19/0.49 % SZS output start CNFRefutation
% See solution above
% 0.19/0.49 % Parsed axioms : 119
% 0.19/0.49 % Removed by relevancy pruning/SinE : 0
% 0.19/0.49 % Initial clauses : 227
% 0.19/0.49 % Removed in clause preprocessing : 7
% 0.19/0.49 % Initial clauses in saturation : 220
% 0.19/0.49 % Processed clauses : 525
% 0.19/0.49 % ...of these trivial : 7
% 0.19/0.49 % ...subsumed : 19
% 0.19/0.49 % ...remaining for further processing : 499
% 0.19/0.49 % Other redundant clauses eliminated : 50
% 0.19/0.49 % Clauses deleted for lack of memory : 0
% 0.19/0.49 % Backward-subsumed : 10
% 0.19/0.49 % Backward-rewritten : 10
% 0.19/0.49 % Generated clauses : 360
% 0.19/0.49 % ...of the previous two non-redundant : 286
% 0.19/0.49 % ...aggressively subsumed : 0
% 0.19/0.49 % Contextual simplify-reflections : 21
% 0.19/0.49 % Paramodulations : 313
% 0.19/0.49 % Factorizations : 0
% 0.19/0.49 % NegExts : 0
% 0.19/0.49 % Equation resolutions : 52
% 0.19/0.49 % Disequality decompositions : 0
% 0.19/0.49 % Total rewrite steps : 334
% 0.19/0.49 % ...of those cached : 274
% 0.19/0.49 % Propositional unsat checks : 0
% 0.19/0.49 % Propositional check models : 0
% 0.19/0.49 % Propositional check unsatisfiable : 0
% 0.19/0.49 % Propositional clauses : 0
% 0.19/0.49 % Propositional clauses after purity: 0
% 0.19/0.49 % Propositional unsat core size : 0
% 0.19/0.49 % Propositional preprocessing time : 0.000
% 0.19/0.49 % Propositional encoding time : 0.000
% 0.19/0.49 % Propositional solver time : 0.000
% 0.19/0.49 % Success case prop preproc time : 0.000
% 0.19/0.49 % Success case prop encoding time : 0.000
% 0.19/0.49 % Success case prop solver time : 0.000
% 0.19/0.49 % Current number of processed clauses : 221
% 0.19/0.49 % Positive orientable unit clauses : 90
% 0.19/0.49 % Positive unorientable unit clauses: 0
% 0.19/0.49 % Negative unit clauses : 20
% 0.19/0.49 % Non-unit-clauses : 111
% 0.19/0.49 % Current number of unprocessed clauses: 194
% 0.19/0.49 % ...number of literals in the above : 843
% 0.19/0.49 % Current number of archived formulas : 0
% 0.19/0.49 % Current number of archived clauses : 238
% 0.19/0.49 % Clause-clause subsumption calls (NU) : 7361
% 0.19/0.49 % Rec. Clause-clause subsumption calls : 1968
% 0.19/0.49 % Non-unit clause-clause subsumptions : 28
% 0.19/0.49 % Unit Clause-clause subsumption calls : 697
% 0.19/0.49 % Rewrite failures with RHS unbound : 0
% 0.19/0.49 % BW rewrite match attempts : 7
% 0.19/0.49 % BW rewrite match successes : 7
% 0.19/0.49 % Condensation attempts : 0
% 0.19/0.49 % Condensation successes : 0
% 0.19/0.49 % Termbank termtop insertions : 23871
% 0.19/0.49 % Search garbage collected termcells : 3742
% 0.19/0.49
% 0.19/0.49 % -------------------------------------------------
% 0.19/0.49 % User time : 0.035 s
% 0.19/0.49 % System time : 0.006 s
% 0.19/0.49 % Total time : 0.041 s
% 0.19/0.49 % Maximum resident set size: 4288 pages
% 0.19/0.49
% 0.19/0.49 % -------------------------------------------------
% 0.19/0.49 % User time : 0.129 s
% 0.19/0.49 % System time : 0.030 s
% 0.19/0.49 % Total time : 0.159 s
% 0.19/0.49 % Maximum resident set size: 4608 pages
% 0.19/0.49 % E exiting
%------------------------------------------------------------------------------