%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM582+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 : n006.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:39 PM UTC 2026
% Result : Theorem 0.15s 5.46s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 11 unt; 0 def)
% Number of atoms : 50 ( 5 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 49 ( 19 ~; 15 |; 10 &)
% ( 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 : 10 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',m__3623) ).
fof(mZeroLess,axiom,
! [X1] :
( aElementOf0(X1,szNzAzT0)
=> sdtlseqdt0(sz00,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroLess) ).
fof(mZeroNum,axiom,
aElementOf0(sz00,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mZeroNum) ).
fof(m__3989,hypothesis,
aElementOf0(xi,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__3989) ).
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,
! [X15,X16] :
( aSubsetOf0(sdtlpdtrp0(xN,X15),sdtlpdtrp0(xN,X16))
| ~ sdtlseqdt0(X16,X15)
| ~ aElementOf0(X16,szNzAzT0)
| ~ aElementOf0(X15,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__3754])])]) ).
fof(c_0_9,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])])])])]) ).
fof(c_0_10,plain,
! [X84] :
( sdtlseqdt0(sz00,X84)
| ~ aElementOf0(X84,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__3989]) ).
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.03 % Problem : NUM582+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.10/5.37 % Computer : n006.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Mon Sep 21 02:42:05 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.41 Running first-order theorem proving
% 0.15/5.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
% 0.15/5.46 % Version: 3.5.1
% 0.15/5.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % Starting sh5l with 300s (1) cores
% 0.15/5.46 % new_bool_1 with pid 1832487 completed with status 0
% 0.15/5.46 % Result found by new_bool_1
% 0.15/5.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.46 % SubtermCWHack with pid 1832490 completed with status 0
% 0.15/5.46 % Result found by SubtermCWHack
% 0.15/5.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/5.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/5.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/5.46 % Starting new_bool_3 with 300s (1) cores
% 0.15/5.46 % Starting new_bool_1 with 300s (1) cores
% 0.15/5.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/5.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/5.46 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.15/5.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/5.46 % Starting SubtermCWHack with 28s (1) cores
% 0.15/5.46 % Preprocessing time : 0.002 s
% 0.15/5.46
% 0.15/5.46 % Proof found!
% 0.15/5.46 % SZS status Theorem
% 0.15/5.46 % SZS output start CNFRefutation
% See solution above
% 0.15/5.46 % Parsed axioms : 88
% 0.15/5.46 % Removed by relevancy pruning/SinE : 5
% 0.15/5.46 % Initial clauses : 154
% 0.15/5.46 % Removed in clause preprocessing : 7
% 0.15/5.46 % Initial clauses in saturation : 147
% 0.15/5.46 % Processed clauses : 463
% 0.15/5.46 % ...of these trivial : 1
% 0.15/5.46 % ...subsumed : 144
% 0.15/5.46 % ...remaining for further processing : 318
% 0.15/5.46 % Other redundant clauses eliminated : 34
% 0.15/5.46 % Clauses deleted for lack of memory : 0
% 0.15/5.46 % Backward-subsumed : 10
% 0.15/5.46 % Backward-rewritten : 8
% 0.15/5.46 % Generated clauses : 863
% 0.15/5.46 % ...of the previous two non-redundant : 729
% 0.15/5.46 % ...aggressively subsumed : 0
% 0.15/5.46 % Contextual simplify-reflections : 15
% 0.15/5.46 % Paramodulations : 831
% 0.15/5.46 % Factorizations : 0
% 0.15/5.46 % NegExts : 0
% 0.15/5.46 % Equation resolutions : 35
% 0.15/5.46 % Disequality decompositions : 0
% 0.15/5.46 % Total rewrite steps : 541
% 0.15/5.46 % ...of those cached : 499
% 0.15/5.46 % Propositional unsat checks : 0
% 0.15/5.46 % Propositional check models : 0
% 0.15/5.46 % Propositional check unsatisfiable : 0
% 0.15/5.46 % Propositional clauses : 0
% 0.15/5.46 % Propositional clauses after purity: 0
% 0.15/5.46 % Propositional unsat core size : 0
% 0.15/5.46 % Propositional preprocessing time : 0.000
% 0.15/5.46 % Propositional encoding time : 0.000
% 0.15/5.46 % Propositional solver time : 0.000
% 0.15/5.46 % Success case prop preproc time : 0.000
% 0.15/5.46 % Success case prop encoding time : 0.000
% 0.15/5.46 % Success case prop solver time : 0.000
% 0.15/5.46 % Current number of processed clauses : 274
% 0.15/5.46 % Positive orientable unit clauses : 50
% 0.15/5.46 % Positive unorientable unit clauses: 0
% 0.15/5.46 % Negative unit clauses : 17
% 0.15/5.46 % Non-unit-clauses : 207
% 0.15/5.46 % Current number of unprocessed clauses: 403
% 0.15/5.46 % ...number of literals in the above : 2136
% 0.15/5.46 % Current number of archived formulas : 0
% 0.15/5.46 % Current number of archived clauses : 18
% 0.15/5.46 % Clause-clause subsumption calls (NU) : 8266
% 0.15/5.46 % Rec. Clause-clause subsumption calls : 4142
% 0.15/5.46 % Non-unit clause-clause subsumptions : 112
% 0.15/5.46 % Unit Clause-clause subsumption calls : 692
% 0.15/5.46 % Rewrite failures with RHS unbound : 0
% 0.15/5.46 % BW rewrite match attempts : 6
% 0.15/5.46 % BW rewrite match successes : 6
% 0.15/5.46 % Condensation attempts : 0
% 0.15/5.46 % Condensation successes : 0
% 0.15/5.46 % Termbank termtop insertions : 25927
% 0.15/5.46 % Search garbage collected termcells : 3043
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.029 s
% 0.15/5.46 % System time : 0.004 s
% 0.15/5.46 % Total time : 0.033 s
% 0.15/5.46 % Maximum resident set size: 4256 pages
% 0.15/5.46
% 0.15/5.46 % -------------------------------------------------
% 0.15/5.46 % User time : 0.033 s
% 0.15/5.46 % System time : 0.007 s
% 0.15/5.46 % Total time : 0.041 s
% 0.15/5.46 % Maximum resident set size: 4864 pages
% 0.15/5.46 % E exiting
%------------------------------------------------------------------------------