%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM617+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 : n014.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:47 PM UTC 2026
% Result : Theorem 0.33s 0.46s
% Output : CNFRefutation 0.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 17 unt; 0 def)
% Number of atoms : 58 ( 4 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 54 ( 24 ~; 18 |; 9 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5093,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5093) ).
fof(mDefSub,axiom,
! [X1] :
( aSet0(X1)
=> ! [X2] :
( aSubsetOf0(X2,X1)
<=> ( ! [X3] :
( aElementOf0(X3,X2)
=> aElementOf0(X3,X1) )
& aSet0(X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4891) ).
fof(m__,conjecture,
aElementOf0(xx,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5195,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5195) ).
fof(m__5106,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5106) ).
fof(mNATSet,axiom,
( isCountable0(szNzAzT0)
& aSet0(szNzAzT0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNATSet) ).
fof(m__5348,hypothesis,
aElementOf0(xx,xP),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5348) ).
fof(c_0_8,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_simplification,[status(thm)],[m__5093]) ).
fof(c_0_9,plain,
! [X50,X51,X52,X53] :
( ( ~ aSet0(X50)
| aSubsetOf0(X53,X50)
| ~ aSet0(X53)
| ~ aElementOf0(esk8_2(X50,X53),X50) )
& ( ~ aSet0(X50)
| aSubsetOf0(X53,X50)
| ~ aSet0(X53)
| aElementOf0(esk8_2(X50,X53),X53) )
& ( ~ aSet0(X50)
| ~ aSubsetOf0(X51,X50)
| aElementOf0(X52,X50)
| ~ aElementOf0(X52,X51) )
& ( ~ aSet0(X50)
| ~ aSubsetOf0(X51,X50)
| aSet0(X51) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefSub])])])])])])]) ).
fof(c_0_10,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
fof(c_0_14,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_15,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_16,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[m__5195]) ).
cnf(c_0_17,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
fof(c_0_18,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(fof_simplification,[status(thm)],[c_0_14]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(xQ,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__5106]) ).
cnf(c_0_20,plain,
aSet0(szNzAzT0),
inference(split_conjunct,[status(thm)],[mNATSet]) ).
cnf(c_0_21,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_22,hypothesis,
aElementOf0(xx,xP),
inference(split_conjunct,[status(thm)],[m__5348]) ).
fof(c_0_23,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_24,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,szNzAzT0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_19]),c_0_20])]) ).
cnf(c_0_25,hypothesis,
aElementOf0(xx,xQ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
~ aElementOf0(xx,szNzAzT0),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM617+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n014.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 02:44:49 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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.33/0.46 % Version: 3.5.1
% 0.33/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.33/0.46 % Starting sh5l with 300s (1) cores
% 0.33/0.46 % new_bool_3 with pid 2980295 completed with status 0
% 0.33/0.46 % Result found by new_bool_3
% 0.33/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.46 % SubtermCWHack with pid 2980300 completed with status 0
% 0.33/0.46 % Result found by SubtermCWHack
% 0.33/0.46 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.33/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.33/0.46 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.33/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.33/0.46 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.33/0.46 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.33/0.46 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.33/0.46 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.33/0.46 % Starting SubtermCWHack with 28s (1) cores
% 0.33/0.46 % Preprocessing time : 0.004 s
% 0.33/0.46
% 0.33/0.46 % Proof found!
% 0.33/0.46 % SZS status Theorem
% 0.33/0.46 % SZS output start CNFRefutation
% See solution above
% 0.33/0.46 % Parsed axioms : 114
% 0.33/0.46 % Removed by relevancy pruning/SinE : 2
% 0.33/0.46 % Initial clauses : 211
% 0.33/0.46 % Removed in clause preprocessing : 7
% 0.33/0.46 % Initial clauses in saturation : 204
% 0.33/0.46 % Processed clauses : 195
% 0.33/0.46 % ...of these trivial : 5
% 0.33/0.46 % ...subsumed : 11
% 0.33/0.46 % ...remaining for further processing : 179
% 0.33/0.46 % Other redundant clauses eliminated : 10
% 0.33/0.46 % Clauses deleted for lack of memory : 0
% 0.33/0.46 % Backward-subsumed : 4
% 0.33/0.46 % Backward-rewritten : 2
% 0.33/0.46 % Generated clauses : 163
% 0.33/0.46 % ...of the previous two non-redundant : 121
% 0.33/0.46 % ...aggressively subsumed : 0
% 0.33/0.46 % Contextual simplify-reflections : 3
% 0.33/0.46 % Paramodulations : 153
% 0.33/0.46 % Factorizations : 0
% 0.33/0.46 % NegExts : 0
% 0.33/0.46 % Equation resolutions : 10
% 0.33/0.46 % Disequality decompositions : 0
% 0.33/0.46 % Total rewrite steps : 169
% 0.33/0.46 % ...of those cached : 130
% 0.33/0.46 % Propositional unsat checks : 0
% 0.33/0.46 % Propositional check models : 0
% 0.33/0.46 % Propositional check unsatisfiable : 0
% 0.33/0.46 % Propositional clauses : 0
% 0.33/0.46 % Propositional clauses after purity: 0
% 0.33/0.46 % Propositional unsat core size : 0
% 0.33/0.46 % Propositional preprocessing time : 0.000
% 0.33/0.46 % Propositional encoding time : 0.000
% 0.33/0.46 % Propositional solver time : 0.000
% 0.33/0.46 % Success case prop preproc time : 0.000
% 0.33/0.46 % Success case prop encoding time : 0.000
% 0.33/0.46 % Success case prop solver time : 0.000
% 0.33/0.46 % Current number of processed clauses : 164
% 0.33/0.46 % Positive orientable unit clauses : 75
% 0.33/0.46 % Positive unorientable unit clauses: 0
% 0.33/0.46 % Negative unit clauses : 14
% 0.33/0.46 % Non-unit-clauses : 75
% 0.33/0.46 % Current number of unprocessed clauses: 124
% 0.33/0.46 % ...number of literals in the above : 593
% 0.33/0.46 % Current number of archived formulas : 0
% 0.33/0.46 % Current number of archived clauses : 6
% 0.33/0.46 % Clause-clause subsumption calls (NU) : 878
% 0.33/0.46 % Rec. Clause-clause subsumption calls : 710
% 0.33/0.46 % Non-unit clause-clause subsumptions : 5
% 0.33/0.46 % Unit Clause-clause subsumption calls : 296
% 0.33/0.46 % Rewrite failures with RHS unbound : 0
% 0.33/0.46 % BW rewrite match attempts : 2
% 0.33/0.46 % BW rewrite match successes : 2
% 0.33/0.46 % Condensation attempts : 0
% 0.33/0.46 % Condensation successes : 0
% 0.33/0.46 % Termbank termtop insertions : 17864
% 0.33/0.46 % Search garbage collected termcells : 3549
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.017 s
% 0.33/0.46 % System time : 0.005 s
% 0.33/0.46 % Total time : 0.022 s
% 0.33/0.46 % Maximum resident set size: 4284 pages
% 0.33/0.46
% 0.33/0.46 % -------------------------------------------------
% 0.33/0.46 % User time : 0.022 s
% 0.33/0.46 % System time : 0.010 s
% 0.33/0.46 % Total time : 0.031 s
% 0.33/0.46 % Maximum resident set size: 4864 pages
% 0.33/0.46 % E exiting
%------------------------------------------------------------------------------