%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM620+3 : 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 : n002.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:48 PM UTC 2026
% Result : Theorem 0.91s 0.69s
% Output : CNFRefutation 0.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 5 unt; 0 def)
% Number of atoms : 39 ( 6 equ)
% Maximal formula atoms : 9 ( 3 avg)
% Number of connectives : 36 ( 10 ~; 7 |; 13 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 9 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__4660,hypothesis,
( ! [X1] :
( aElementOf0(X1,szNzAzT0)
=> ( sdtlpdtrp0(xe,X1) = szmzizndt0(sdtlpdtrp0(xN,X1))
& ! [X2] :
( aElementOf0(X2,sdtlpdtrp0(xN,X1))
=> sdtlseqdt0(sdtlpdtrp0(xe,X1),X2) )
& aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4660) ).
fof(m__5389,hypothesis,
( xx = sdtlpdtrp0(xe,xm)
& aElementOf0(xm,szNzAzT0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5389) ).
fof(c_0_3,negated_conjecture,
~ ( ( aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ! [X1] :
( aElementOf0(X1,sdtlpdtrp0(xN,xm))
=> aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ) )
=> aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
! [X65,X66] :
( ( ~ aElementOf0(X65,szNzAzT0)
| sdtlpdtrp0(xe,X65) = szmzizndt0(sdtlpdtrp0(xN,X65)) )
& ( ~ aElementOf0(X65,szNzAzT0)
| sdtlseqdt0(sdtlpdtrp0(xe,X65),X66)
| ~ aElementOf0(X66,sdtlpdtrp0(xN,X65)) )
& ( ~ aElementOf0(X65,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X65),sdtlpdtrp0(xN,X65)) )
& szDzozmdt0(xe) = szNzAzT0
& aFunction0(xe) ),
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__4660])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X99] :
( ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn)))
& ( aElementOf0(X99,sdtlpdtrp0(xN,szszuzczcdt0(xn)))
| ~ aElementOf0(X99,sdtlpdtrp0(xN,xm)) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
cnf(c_0_6,hypothesis,
( ~ aElementOf0(X1,szNzAzT0)
| aElementOf0(sdtlpdtrp0(xe,X1),sdtlpdtrp0(xN,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
xx = sdtlpdtrp0(xe,xm),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_8,hypothesis,
aElementOf0(xm,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5389]) ).
cnf(c_0_9,negated_conjecture,
~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
( ~ aElementOf0(X1,sdtlpdtrp0(xN,xm))
| aElementOf0(X1,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,hypothesis,
aElementOf0(xx,sdtlpdtrp0(xN,xm)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8])]) ).
cnf(c_0_12,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM620+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35 % Computer : n002.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 02:47:47 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.91/0.69 % Version: 3.5.1
% 0.91/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.91/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.91/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.91/0.69 % Starting new_bool_1 with 300s (1) cores
% 0.91/0.69 % Starting sh5l with 300s (1) cores
% 0.91/0.69 % new_bool_3 with pid 2262785 completed with status 0
% 0.91/0.69 % Result found by new_bool_3
% 0.91/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.91/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.91/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.91/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.91/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.91/0.69 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.91/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.91/0.69 % Starting SubtermCWHack with 31s (1) cores
% 0.91/0.69 % SubtermCWHack with pid 2262788 completed with status 0
% 0.91/0.69 % Result found by SubtermCWHack
% 0.91/0.69 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.91/0.69 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.91/0.69 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.91/0.69 % Starting new_bool_3 with 300s (1) cores
% 0.91/0.69 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.91/0.69 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.91/0.69 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.91/0.69 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.91/0.69 % Starting SubtermCWHack with 31s (1) cores
% 0.91/0.69 % Preprocessing time : 0.098 s
% 0.91/0.69
% 0.91/0.69 % Proof found!
% 0.91/0.69 % SZS status Theorem
% 0.91/0.69 % SZS output start CNFRefutation
% See solution above
% 0.91/0.69 % Parsed axioms : 117
% 0.91/0.69 % Removed by relevancy pruning/SinE : 9
% 0.91/0.69 % Initial clauses : 4903
% 0.91/0.69 % Removed in clause preprocessing : 7
% 0.91/0.69 % Initial clauses in saturation : 4896
% 0.91/0.69 % Processed clauses : 476
% 0.91/0.69 % ...of these trivial : 13
% 0.91/0.69 % ...subsumed : 90
% 0.91/0.69 % ...remaining for further processing : 373
% 0.91/0.69 % Other redundant clauses eliminated : 21
% 0.91/0.69 % Clauses deleted for lack of memory : 0
% 0.91/0.69 % Backward-subsumed : 6
% 0.91/0.69 % Backward-rewritten : 7
% 0.91/0.69 % Generated clauses : 513
% 0.91/0.69 % ...of the previous two non-redundant : 402
% 0.91/0.69 % ...aggressively subsumed : 0
% 0.91/0.69 % Contextual simplify-reflections : 5
% 0.91/0.69 % Paramodulations : 492
% 0.91/0.69 % Factorizations : 0
% 0.91/0.69 % NegExts : 0
% 0.91/0.69 % Equation resolutions : 22
% 0.91/0.69 % Disequality decompositions : 0
% 0.91/0.69 % Total rewrite steps : 461
% 0.91/0.69 % ...of those cached : 390
% 0.91/0.69 % Propositional unsat checks : 0
% 0.91/0.69 % Propositional check models : 0
% 0.91/0.69 % Propositional check unsatisfiable : 0
% 0.91/0.69 % Propositional clauses : 0
% 0.91/0.69 % Propositional clauses after purity: 0
% 0.91/0.69 % Propositional unsat core size : 0
% 0.91/0.69 % Propositional preprocessing time : 0.000
% 0.91/0.69 % Propositional encoding time : 0.000
% 0.91/0.69 % Propositional solver time : 0.000
% 0.91/0.69 % Success case prop preproc time : 0.000
% 0.91/0.69 % Success case prop encoding time : 0.000
% 0.91/0.69 % Success case prop solver time : 0.000
% 0.91/0.69 % Current number of processed clauses : 343
% 0.91/0.69 % Positive orientable unit clauses : 114
% 0.91/0.69 % Positive unorientable unit clauses: 0
% 0.91/0.69 % Negative unit clauses : 28
% 0.91/0.69 % Non-unit-clauses : 201
% 0.91/0.69 % Current number of unprocessed clauses: 4815
% 0.91/0.69 % ...number of literals in the above : 55941
% 0.91/0.69 % Current number of archived formulas : 0
% 0.91/0.69 % Current number of archived clauses : 14
% 0.91/0.69 % Clause-clause subsumption calls (NU) : 5072
% 0.91/0.69 % Rec. Clause-clause subsumption calls : 4031
% 0.91/0.69 % Non-unit clause-clause subsumptions : 62
% 0.91/0.69 % Unit Clause-clause subsumption calls : 900
% 0.91/0.69 % Rewrite failures with RHS unbound : 0
% 0.91/0.69 % BW rewrite match attempts : 8
% 0.91/0.69 % BW rewrite match successes : 6
% 0.91/0.69 % Condensation attempts : 0
% 0.91/0.69 % Condensation successes : 0
% 0.91/0.69 % Termbank termtop insertions : 388050
% 0.91/0.69 % Search garbage collected termcells : 31575
% 0.91/0.69
% 0.91/0.69 % -------------------------------------------------
% 0.91/0.69 % User time : 0.237 s
% 0.91/0.69 % System time : 0.025 s
% 0.91/0.69 % Total time : 0.262 s
% 0.91/0.69 % Maximum resident set size: 16120 pages
% 0.91/0.69
% 0.91/0.69 % -------------------------------------------------
% 0.91/0.69 % User time : 0.243 s
% 0.91/0.69 % System time : 0.031 s
% 0.91/0.69 % Total time : 0.274 s
% 0.91/0.69 % Maximum resident set size: 5120 pages
% 0.91/0.69 % E exiting
%------------------------------------------------------------------------------