%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM561+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 : 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:34 PM UTC 2026
% Result : Theorem 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 80 ( 15 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 103 ( 45 ~; 44 |; 8 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-4 aty)
% Number of variables : 27 ( 0 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefSImg,axiom,
! [X1] :
( aFunction0(X1)
=> ! [X2] :
( aSubsetOf0(X2,szDzozmdt0(X1))
=> ! [X3] :
( X3 = sdtlcdtrc0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ? [X5] :
( sdtlpdtrp0(X1,X5) = X4
& aElementOf0(X5,X2) ) )
& aSet0(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSImg) ).
fof(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDomSet) ).
fof(m__2911,hypothesis,
aFunction0(xF),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2911) ).
fof(m__2911_02,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2911_02) ).
fof(mSubRefl,axiom,
! [X1] :
( aSet0(X1)
=> aSubsetOf0(X1,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSubRefl) ).
fof(c_0_6,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_7,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
fof(c_0_8,plain,
! [X8,X9,X10,X11,X13,X14,X15,X17] :
( ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSet0(X15)
| aElementOf0(esk2_3(X8,X9,X15),X15)
| sdtlpdtrp0(X8,esk3_3(X8,X9,X15)) = esk2_3(X8,X9,X15) )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSet0(X15)
| aElementOf0(esk2_3(X8,X9,X15),X15)
| aElementOf0(esk3_3(X8,X9,X15),X9) )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X15 = sdtlcdtrc0(X8,X9)
| ~ aSet0(X15)
| sdtlpdtrp0(X8,X17) != esk2_3(X8,X9,X15)
| ~ aElementOf0(X17,X9)
| ~ aElementOf0(esk2_3(X8,X9,X15),X15) )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X10 != sdtlcdtrc0(X8,X9)
| aElementOf0(X13,X10)
| sdtlpdtrp0(X8,X14) != X13
| ~ aElementOf0(X14,X9) )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X10 != sdtlcdtrc0(X8,X9)
| ~ aElementOf0(X11,X10)
| sdtlpdtrp0(X8,esk1_4(X8,X9,X10,X11)) = X11 )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X10 != sdtlcdtrc0(X8,X9)
| ~ aElementOf0(X11,X10)
| aElementOf0(esk1_4(X8,X9,X10,X11),X9) )
& ( ~ aFunction0(X8)
| ~ aSubsetOf0(X9,szDzozmdt0(X8))
| X10 != sdtlcdtrc0(X8,X9)
| aSet0(X10) ) ),
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)],[mDefSImg])])])])])])]) ).
fof(c_0_9,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ aFunction0(X3)
| ~ aSubsetOf0(X2,szDzozmdt0(X3))
| X5 != sdtlcdtrc0(X3,X2)
| sdtlpdtrp0(X3,X1) != X4
| ~ aElementOf0(X1,X2)
| aElementOf0(X4,X5) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X7] :
( aSet0(szDzozmdt0(X7))
| ~ aFunction0(X7) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
cnf(c_0_12,negated_conjecture,
~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( ~ aElementOf0(X2,X3)
| ~ aSubsetOf0(X3,szDzozmdt0(X1))
| ~ aFunction0(X1)
| aElementOf0(sdtlpdtrp0(X1,X2),sdtlcdtrc0(X1,X3)) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,hypothesis,
aFunction0(xF),
inference(split_conjunct,[status(thm)],[m__2911]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xx,szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[m__2911_02]) ).
fof(c_0_16,plain,
! [X29] :
( aSubsetOf0(X29,X29)
| ~ aSet0(X29) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSubRefl])])]) ).
cnf(c_0_17,plain,
( ~ aFunction0(X1)
| aSet0(szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)),
inference(cn,[status(thm)],[inference(rw,[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_19,plain,
( ~ aSet0(X1)
| aSubsetOf0(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_20,hypothesis,
aSet0(szDzozmdt0(xF)),
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM561+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n006.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.11/0.35 % CPULimit : 300
% 0.11/0.35 % WCLimit : 300
% 0.11/0.35 % DateTime : Mon Sep 21 02:40:14 UTC 2026
% 0.11/0.35 % CPUTime :
% 0.11/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.40 Running first-order theorem proving
% 0.11/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.11/0.42 % Version: 3.5.1
% 0.11/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 % Starting sh5l with 300s (1) cores
% 0.11/0.42 % new_bool_3 with pid 1828874 completed with status 0
% 0.11/0.42 % Result found by new_bool_3
% 0.11/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 % Search class: FGUSF-FFMF32-SFFFFFNN
% 0.11/0.42 % partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.11/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42 % SubtermCWHack with pid 1828877 completed with status 0
% 0.11/0.42 % Result found by SubtermCWHack
% 0.11/0.42 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 % Search class: FGUSF-FFMF32-SFFFFFNN
% 0.11/0.42 % partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.11/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42 % Preprocessing time : 0.002 s
% 0.11/0.42
% 0.11/0.42 % Proof found!
% 0.11/0.42 % SZS status Theorem
% 0.11/0.42 % SZS output start CNFRefutation
% See solution above
% 0.11/0.42 % Parsed axioms : 71
% 0.11/0.42 % Removed by relevancy pruning/SinE : 55
% 0.11/0.42 % Initial clauses : 25
% 0.11/0.42 % Removed in clause preprocessing : 4
% 0.11/0.42 % Initial clauses in saturation : 21
% 0.11/0.42 % Processed clauses : 24
% 0.11/0.42 % ...of these trivial : 0
% 0.11/0.42 % ...subsumed : 1
% 0.11/0.42 % ...remaining for further processing : 23
% 0.11/0.42 % Other redundant clauses eliminated : 4
% 0.11/0.42 % Clauses deleted for lack of memory : 0
% 0.11/0.42 % Backward-subsumed : 0
% 0.11/0.42 % Backward-rewritten : 0
% 0.11/0.42 % Generated clauses : 14
% 0.11/0.42 % ...of the previous two non-redundant : 9
% 0.11/0.42 % ...aggressively subsumed : 0
% 0.11/0.42 % Contextual simplify-reflections : 3
% 0.11/0.42 % Paramodulations : 11
% 0.11/0.42 % Factorizations : 0
% 0.11/0.42 % NegExts : 0
% 0.11/0.42 % Equation resolutions : 4
% 0.11/0.42 % Disequality decompositions : 0
% 0.11/0.42 % Total rewrite steps : 4
% 0.11/0.42 % ...of those cached : 1
% 0.11/0.42 % Propositional unsat checks : 0
% 0.11/0.42 % Propositional check models : 0
% 0.11/0.42 % Propositional check unsatisfiable : 0
% 0.11/0.42 % Propositional clauses : 0
% 0.11/0.42 % Propositional clauses after purity: 0
% 0.11/0.42 % Propositional unsat core size : 0
% 0.11/0.42 % Propositional preprocessing time : 0.000
% 0.11/0.42 % Propositional encoding time : 0.000
% 0.11/0.42 % Propositional solver time : 0.000
% 0.11/0.42 % Success case prop preproc time : 0.000
% 0.11/0.42 % Success case prop encoding time : 0.000
% 0.11/0.42 % Success case prop solver time : 0.000
% 0.11/0.42 % Current number of processed clauses : 20
% 0.11/0.42 % Positive orientable unit clauses : 4
% 0.11/0.42 % Positive unorientable unit clauses: 0
% 0.11/0.42 % Negative unit clauses : 2
% 0.11/0.42 % Non-unit-clauses : 14
% 0.11/0.42 % Current number of unprocessed clauses: 6
% 0.11/0.42 % ...number of literals in the above : 33
% 0.11/0.42 % Current number of archived formulas : 0
% 0.11/0.42 % Current number of archived clauses : 0
% 0.11/0.42 % Clause-clause subsumption calls (NU) : 42
% 0.11/0.42 % Rec. Clause-clause subsumption calls : 24
% 0.11/0.42 % Non-unit clause-clause subsumptions : 4
% 0.11/0.42 % Unit Clause-clause subsumption calls : 5
% 0.11/0.42 % Rewrite failures with RHS unbound : 0
% 0.11/0.42 % BW rewrite match attempts : 0
% 0.11/0.42 % BW rewrite match successes : 0
% 0.11/0.42 % Condensation attempts : 0
% 0.11/0.42 % Condensation successes : 0
% 0.11/0.42 % Termbank termtop insertions : 3061
% 0.11/0.42 % Search garbage collected termcells : 965
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.005 s
% 0.11/0.42 % System time : 0.002 s
% 0.11/0.42 % Total time : 0.006 s
% 0.11/0.42 % Maximum resident set size: 3972 pages
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.008 s
% 0.11/0.42 % System time : 0.006 s
% 0.11/0.42 % Total time : 0.014 s
% 0.11/0.42 % Maximum resident set size: 4864 pages
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------