%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM602+3 : 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 : n007.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:55:40 PM UTC 2026
% Result : Theorem 1.37s 1.01s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 3 unt; 0 def)
% Number of atoms : 48 ( 18 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 55 ( 20 ~; 17 |; 17 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn 4 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( sdtlpdtrp0(xe,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4982,hypothesis,
! [X1] :
( ( aElementOf0(X1,xO)
| ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) )
=> ? [X2] :
( sdtlpdtrp0(xe,X2) = X1
& aElementOf0(X2,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& sdtlpdtrp0(xd,X2) = szDzizrdt0(xd)
& aElementOf0(X2,szNzAzT0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4982) ).
fof(m__5009,hypothesis,
( aElementOf0(xx,xO)
& ? [X1] :
( sdtlpdtrp0(xe,X1) = xx
& aElementOf0(X1,sdtlbdtrb0(xd,szDzizrdt0(xd))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5009) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( sdtlpdtrp0(xe,X1) = xx
& aElementOf0(X1,szNzAzT0) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X8] :
( sdtlpdtrp0(xe,X8) != xx
| ~ aElementOf0(X8,szNzAzT0) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).
fof(c_0_5,hypothesis,
! [X58,X59] :
( ( ~ aElementOf0(X58,xO)
| sdtlpdtrp0(xe,esk11_1(X58)) = X58 )
& ( ~ aElementOf0(X58,xO)
| aElementOf0(esk11_1(X58),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( ~ aElementOf0(X58,xO)
| sdtlpdtrp0(xd,esk11_1(X58)) = szDzizrdt0(xd) )
& ( ~ aElementOf0(X58,xO)
| aElementOf0(esk11_1(X58),szNzAzT0) )
& ( sdtlpdtrp0(xe,X59) != X58
| ~ aElementOf0(X59,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xe,esk11_1(X58)) = X58 )
& ( sdtlpdtrp0(xe,X59) != X58
| ~ aElementOf0(X59,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk11_1(X58),sdtlbdtrb0(xd,szDzizrdt0(xd))) )
& ( sdtlpdtrp0(xe,X59) != X58
| ~ aElementOf0(X59,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| sdtlpdtrp0(xd,esk11_1(X58)) = szDzizrdt0(xd) )
& ( sdtlpdtrp0(xe,X59) != X58
| ~ aElementOf0(X59,sdtlbdtrb0(xd,szDzizrdt0(xd)))
| aElementOf0(esk11_1(X58),szNzAzT0) ) ),
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)],[m__4982])])])])])]) ).
fof(c_0_6,hypothesis,
( aElementOf0(xx,xO)
& sdtlpdtrp0(xe,esk1_0) = xx
& aElementOf0(esk1_0,sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[m__5009])]) ).
cnf(c_0_7,negated_conjecture,
( sdtlpdtrp0(xe,X1) != xx
| ~ aElementOf0(X1,szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,hypothesis,
( ~ aElementOf0(X1,xO)
| sdtlpdtrp0(xe,esk11_1(X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
aElementOf0(xx,xO),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
~ aElementOf0(esk11_1(xx),szNzAzT0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8])]),c_0_9])]) ).
cnf(c_0_11,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(esk11_1(X1),szNzAzT0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM602+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n007.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 02:41:50 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.28/0.55 Running first-order theorem proving
% 0.28/0.56 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
% 1.37/1.01 % Version: 3.5.1
% 1.37/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.37/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.37/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.37/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.37/1.01 % Starting sh5l with 300s (1) cores
% 1.37/1.01 % sh5l with pid 4190862 completed with status 0
% 1.37/1.01 % Result found by sh5l
% 1.37/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.37/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.37/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.37/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.37/1.01 % Starting sh5l with 300s (1) cores
% 1.37/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.37/1.01 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.37/1.01 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.37/1.01 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.37/1.01 % Starting SubtermCWHack with 28s (1) cores
% 1.37/1.01 % SubtermCWHack with pid 4190863 completed with status 0
% 1.37/1.01 % Result found by SubtermCWHack
% 1.37/1.01 % Preprocessing class: FSLSSMSMSSSNFFN.
% 1.37/1.01 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.37/1.01 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 1.37/1.01 % Starting new_bool_3 with 300s (1) cores
% 1.37/1.01 % Starting new_bool_1 with 300s (1) cores
% 1.37/1.01 % Starting sh5l with 300s (1) cores
% 1.37/1.01 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 1.37/1.01 % SinE strategy is gf500_gu_R04_F100_L20000
% 1.37/1.01 % Search class: FGHSF-SMLM32-MFFFFFNN
% 1.37/1.01 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 1.37/1.01 % Starting SubtermCWHack with 28s (1) cores
% 1.37/1.01 % Preprocessing time : 0.109 s
% 1.37/1.01
% 1.37/1.01 % Proof found!
% 1.37/1.01 % SZS status Theorem
% 1.37/1.01 % SZS output start CNFRefutation
% See solution above
% 1.37/1.01 % Parsed axioms : 99
% 1.37/1.01 % Removed by relevancy pruning/SinE : 2
% 1.37/1.01 % Initial clauses : 4869
% 1.37/1.01 % Removed in clause preprocessing : 7
% 1.37/1.01 % Initial clauses in saturation : 4862
% 1.37/1.01 % Processed clauses : 133
% 1.37/1.01 % ...of these trivial : 2
% 1.37/1.01 % ...subsumed : 7
% 1.37/1.01 % ...remaining for further processing : 124
% 1.37/1.01 % Other redundant clauses eliminated : 8
% 1.37/1.01 % Clauses deleted for lack of memory : 0
% 1.37/1.01 % Backward-subsumed : 1
% 1.37/1.01 % Backward-rewritten : 0
% 1.37/1.01 % Generated clauses : 88
% 1.37/1.01 % ...of the previous two non-redundant : 58
% 1.37/1.01 % ...aggressively subsumed : 0
% 1.37/1.01 % Contextual simplify-reflections : 1
% 1.37/1.01 % Paramodulations : 80
% 1.37/1.01 % Factorizations : 0
% 1.37/1.01 % NegExts : 0
% 1.37/1.01 % Equation resolutions : 8
% 1.37/1.01 % Disequality decompositions : 0
% 1.37/1.01 % Total rewrite steps : 82
% 1.37/1.01 % ...of those cached : 58
% 1.37/1.01 % Propositional unsat checks : 0
% 1.37/1.01 % Propositional check models : 0
% 1.37/1.01 % Propositional check unsatisfiable : 0
% 1.37/1.01 % Propositional clauses : 0
% 1.37/1.01 % Propositional clauses after purity: 0
% 1.37/1.01 % Propositional unsat core size : 0
% 1.37/1.01 % Propositional preprocessing time : 0.000
% 1.37/1.01 % Propositional encoding time : 0.000
% 1.37/1.01 % Propositional solver time : 0.000
% 1.37/1.01 % Success case prop preproc time : 0.000
% 1.37/1.01 % Success case prop encoding time : 0.000
% 1.37/1.01 % Success case prop solver time : 0.000
% 1.37/1.01 % Current number of processed clauses : 118
% 1.37/1.01 % Positive orientable unit clauses : 49
% 1.37/1.01 % Positive unorientable unit clauses: 0
% 1.37/1.01 % Negative unit clauses : 13
% 1.37/1.01 % Non-unit-clauses : 56
% 1.37/1.01 % Current number of unprocessed clauses: 4787
% 1.37/1.01 % ...number of literals in the above : 55821
% 1.37/1.01 % Current number of archived formulas : 0
% 1.37/1.01 % Current number of archived clauses : 1
% 1.37/1.01 % Clause-clause subsumption calls (NU) : 509
% 1.37/1.01 % Rec. Clause-clause subsumption calls : 441
% 1.37/1.01 % Non-unit clause-clause subsumptions : 4
% 1.37/1.01 % Unit Clause-clause subsumption calls : 262
% 1.37/1.01 % Rewrite failures with RHS unbound : 0
% 1.37/1.01 % BW rewrite match attempts : 0
% 1.37/1.01 % BW rewrite match successes : 0
% 1.37/1.01 % Condensation attempts : 0
% 1.37/1.01 % Condensation successes : 0
% 1.37/1.01 % Termbank termtop insertions : 381858
% 1.37/1.01 % Search garbage collected termcells : 31677
% 1.37/1.01
% 1.37/1.01 % -------------------------------------------------
% 1.37/1.01 % User time : 0.363 s
% 1.37/1.01 % System time : 0.028 s
% 1.37/1.01 % Total time : 0.391 s
% 1.37/1.01 % Maximum resident set size: 15840 pages
% 1.37/1.01
% 1.37/1.01 % -------------------------------------------------
% 1.37/1.01 % User time : 0.371 s
% 1.37/1.01 % System time : 0.040 s
% 1.37/1.01 % Total time : 0.411 s
% 1.37/1.01 % Maximum resident set size: 4864 pages
% 1.37/1.01 % E exiting
%------------------------------------------------------------------------------