%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM610+1 : 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 : 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:49:45 PM UTC 2026
% Result : Theorem 0.15s 0.51s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 6
% Syntax : Number of formulae : 27 ( 12 unt; 0 def)
% Number of atoms : 67 ( 5 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 71 ( 31 ~; 28 |; 9 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 7 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__5093,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p',mDefSub) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(m__5195,hypothesis,
aSubsetOf0(xP,xQ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5195) ).
fof(m__,conjecture,
aSubsetOf0(xP,xO),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__5164,hypothesis,
( xP = sdtmndt0(xQ,szmzizndt0(xQ))
& aSet0(xP) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5164) ).
fof(c_0_6,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_simplification,[status(thm)],[m__5093]) ).
fof(c_0_7,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_8,hypothesis,
( xQ != slcrc0
& aSubsetOf0(xQ,xO) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,hypothesis,
aSubsetOf0(xQ,xO),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_12,plain,
( ~ aSet0(X3)
| ~ aSubsetOf0(X2,X3)
| ~ aElementOf0(X1,X2)
| aElementOf0(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,hypothesis,
aSubsetOf0(xP,xQ),
inference(split_conjunct,[status(thm)],[m__5195]) ).
cnf(c_0_14,hypothesis,
aSet0(xQ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11])]) ).
fof(c_0_15,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_16,hypothesis,
( ~ aElementOf0(X1,xP)
| aElementOf0(X1,xQ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]) ).
cnf(c_0_17,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk8_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_18,hypothesis,
aSet0(xP),
inference(split_conjunct,[status(thm)],[m__5164]) ).
fof(c_0_19,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(fof_simplification,[status(thm)],[c_0_15]) ).
cnf(c_0_20,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_10]),c_0_11])]) ).
cnf(c_0_21,hypothesis,
( ~ aSet0(X1)
| aElementOf0(esk8_2(X1,xP),xQ)
| aSubsetOf0(xP,X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_22,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(fof_nnf,[status(thm)],[c_0_19]) ).
cnf(c_0_23,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk8_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_24,hypothesis,
( ~ aSet0(X1)
| aElementOf0(esk8_2(X1,xP),xO)
| aSubsetOf0(xP,X1) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,negated_conjecture,
~ aSubsetOf0(xP,xO),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_26,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_18]),c_0_11])]),c_0_25]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM610+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 21 02:42:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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.15/0.51 % Version: 3.5.1
% 0.15/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % Starting sh5l with 300s (1) cores
% 0.15/0.51 % new_bool_1 with pid 4192455 completed with status 0
% 0.15/0.51 % Result found by new_bool_1
% 0.15/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.51 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.51 % SubtermCWHack with pid 4192460 completed with status 0
% 0.15/0.51 % Result found by SubtermCWHack
% 0.15/0.51 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.51 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.51 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.15/0.51 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.51 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.51 % Preprocessing time : 0.004 s
% 0.15/0.51
% 0.15/0.51 % Proof found!
% 0.15/0.51 % SZS status Theorem
% 0.15/0.51 % SZS output start CNFRefutation
% See solution above
% 0.15/0.51 % Parsed axioms : 108
% 0.15/0.51 % Removed by relevancy pruning/SinE : 2
% 0.15/0.51 % Initial clauses : 203
% 0.15/0.51 % Removed in clause preprocessing : 7
% 0.15/0.51 % Initial clauses in saturation : 196
% 0.15/0.51 % Processed clauses : 299
% 0.15/0.51 % ...of these trivial : 5
% 0.15/0.51 % ...subsumed : 37
% 0.15/0.51 % ...remaining for further processing : 257
% 0.15/0.51 % Other redundant clauses eliminated : 22
% 0.15/0.51 % Clauses deleted for lack of memory : 0
% 0.15/0.51 % Backward-subsumed : 6
% 0.15/0.51 % Backward-rewritten : 4
% 0.15/0.51 % Generated clauses : 318
% 0.15/0.51 % ...of the previous two non-redundant : 252
% 0.15/0.51 % ...aggressively subsumed : 0
% 0.15/0.51 % Contextual simplify-reflections : 5
% 0.15/0.51 % Paramodulations : 297
% 0.15/0.51 % Factorizations : 0
% 0.15/0.51 % NegExts : 0
% 0.15/0.51 % Equation resolutions : 23
% 0.15/0.51 % Disequality decompositions : 0
% 0.15/0.51 % Total rewrite steps : 264
% 0.15/0.51 % ...of those cached : 219
% 0.15/0.51 % Propositional unsat checks : 0
% 0.15/0.51 % Propositional check models : 0
% 0.15/0.51 % Propositional check unsatisfiable : 0
% 0.15/0.51 % Propositional clauses : 0
% 0.15/0.51 % Propositional clauses after purity: 0
% 0.15/0.51 % Propositional unsat core size : 0
% 0.15/0.51 % Propositional preprocessing time : 0.000
% 0.15/0.51 % Propositional encoding time : 0.000
% 0.15/0.51 % Propositional solver time : 0.000
% 0.15/0.51 % Success case prop preproc time : 0.000
% 0.15/0.51 % Success case prop encoding time : 0.000
% 0.15/0.51 % Success case prop solver time : 0.000
% 0.15/0.51 % Current number of processed clauses : 231
% 0.15/0.51 % Positive orientable unit clauses : 67
% 0.15/0.51 % Positive unorientable unit clauses: 0
% 0.15/0.51 % Negative unit clauses : 14
% 0.15/0.51 % Non-unit-clauses : 150
% 0.15/0.51 % Current number of unprocessed clauses: 145
% 0.15/0.51 % ...number of literals in the above : 712
% 0.15/0.51 % Current number of archived formulas : 0
% 0.15/0.51 % Current number of archived clauses : 10
% 0.15/0.51 % Clause-clause subsumption calls (NU) : 2824
% 0.15/0.51 % Rec. Clause-clause subsumption calls : 2054
% 0.15/0.51 % Non-unit clause-clause subsumptions : 32
% 0.15/0.51 % Unit Clause-clause subsumption calls : 366
% 0.15/0.51 % Rewrite failures with RHS unbound : 0
% 0.15/0.51 % BW rewrite match attempts : 4
% 0.15/0.51 % BW rewrite match successes : 4
% 0.15/0.51 % Condensation attempts : 0
% 0.15/0.51 % Condensation successes : 0
% 0.15/0.51 % Termbank termtop insertions : 20005
% 0.15/0.51 % Search garbage collected termcells : 3548
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.028 s
% 0.15/0.51 % System time : 0.007 s
% 0.15/0.51 % Total time : 0.035 s
% 0.15/0.51 % Maximum resident set size: 4228 pages
% 0.15/0.51
% 0.15/0.51 % -------------------------------------------------
% 0.15/0.51 % User time : 0.030 s
% 0.15/0.51 % System time : 0.014 s
% 0.15/0.51 % Total time : 0.044 s
% 0.15/0.51 % Maximum resident set size: 4608 pages
% 0.15/0.51 % E exiting
%------------------------------------------------------------------------------