%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM560+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 : n012.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.04s 5.36s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 8 unt; 0 def)
% Number of atoms : 114 ( 15 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 156 ( 66 ~; 69 |; 14 &)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 19 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(mDefPtt,axiom,
! [X1,X2] :
( ( aElement0(X2)
& aFunction0(X1) )
=> ! [X3] :
( X3 = sdtlbdtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sdtlpdtrp0(X1,X4) = X2
& aElementOf0(X4,szDzozmdt0(X1)) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDefPtt) ).
fof(m__,conjecture,
aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
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(mDomSet,axiom,
! [X1] :
( aFunction0(X1)
=> aSet0(szDzozmdt0(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mDomSet) ).
fof(m__2693,hypothesis,
( aElement0(xy)
& aFunction0(xF) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__2693) ).
fof(c_0_5,plain,
! [X23,X24,X25,X26,X27,X28] :
( ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X28 = sdtlbdtrb0(X23,X24)
| ~ aSet0(X28)
| aElementOf0(esk2_3(X23,X24,X28),X28)
| sdtlpdtrp0(X23,esk2_3(X23,X24,X28)) = X24 )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X28 = sdtlbdtrb0(X23,X24)
| ~ aSet0(X28)
| aElementOf0(esk2_3(X23,X24,X28),X28)
| aElementOf0(esk2_3(X23,X24,X28),szDzozmdt0(X23)) )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X28 = sdtlbdtrb0(X23,X24)
| ~ aSet0(X28)
| sdtlpdtrp0(X23,esk2_3(X23,X24,X28)) != X24
| ~ aElementOf0(esk2_3(X23,X24,X28),szDzozmdt0(X23))
| ~ aElementOf0(esk2_3(X23,X24,X28),X28) )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X25 != sdtlbdtrb0(X23,X24)
| aElementOf0(X27,X25)
| sdtlpdtrp0(X23,X27) != X24
| ~ aElementOf0(X27,szDzozmdt0(X23)) )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X25 != sdtlbdtrb0(X23,X24)
| ~ aElementOf0(X26,X25)
| sdtlpdtrp0(X23,X26) = X24 )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X25 != sdtlbdtrb0(X23,X24)
| ~ aElementOf0(X26,X25)
| aElementOf0(X26,szDzozmdt0(X23)) )
& ( ~ aElement0(X24)
| ~ aFunction0(X23)
| X25 != sdtlbdtrb0(X23,X24)
| aSet0(X25) ) ),
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)],[mDefPtt])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(assume_negation,[status(cth)],[m__]) ).
cnf(c_0_7,plain,
( ~ aElement0(X4)
| ~ aFunction0(X2)
| X3 != sdtlbdtrb0(X2,X4)
| ~ aElementOf0(X1,X3)
| aElementOf0(X1,szDzozmdt0(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X10,X11,X12,X13] :
( ( ~ aSet0(X10)
| aSubsetOf0(X13,X10)
| ~ aSet0(X13)
| ~ aElementOf0(esk1_2(X10,X13),X10) )
& ( ~ aSet0(X10)
| aSubsetOf0(X13,X10)
| ~ aSet0(X13)
| aElementOf0(esk1_2(X10,X13),X13) )
& ( ~ aSet0(X10)
| ~ aSubsetOf0(X11,X10)
| aElementOf0(X12,X10)
| ~ aElementOf0(X12,X11) )
& ( ~ aSet0(X10)
| ~ aSubsetOf0(X11,X10)
| aSet0(X11) ) ),
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])])])])])])]) ).
cnf(c_0_9,plain,
( ~ aElement0(X3)
| ~ aFunction0(X2)
| X1 != sdtlbdtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_10,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(fof_simplification,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ aElement0(X3)
| ~ aElementOf0(X1,sdtlbdtrb0(X2,X3))
| ~ aFunction0(X2)
| aElementOf0(X1,szDzozmdt0(X2)) ),
inference(er,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| aSubsetOf0(X2,X1)
| aElementOf0(esk1_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| aSet0(sdtlbdtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_9]) ).
fof(c_0_14,plain,
! [X9] :
( aSet0(szDzozmdt0(X9))
| ~ aFunction0(X9) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mDomSet])])]) ).
fof(c_0_15,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(fof_nnf,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ aSet0(X1)
| ~ aSet0(X2)
| ~ aElementOf0(esk1_2(X1,X2),X1)
| aSubsetOf0(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_17,plain,
( ~ aSet0(X3)
| ~ aElement0(X2)
| ~ aFunction0(X1)
| aElementOf0(esk1_2(X3,sdtlbdtrb0(X1,X2)),szDzozmdt0(X1))
| aSubsetOf0(sdtlbdtrb0(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_18,plain,
( ~ aFunction0(X1)
| aSet0(szDzozmdt0(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_19,negated_conjecture,
~ aSubsetOf0(sdtlbdtrb0(xF,xy),szDzozmdt0(xF)),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,plain,
( ~ aElement0(X2)
| ~ aFunction0(X1)
| aSubsetOf0(sdtlbdtrb0(X1,X2),szDzozmdt0(X1)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),c_0_13]) ).
cnf(c_0_21,hypothesis,
aFunction0(xF),
inference(split_conjunct,[status(thm)],[m__2693]) ).
cnf(c_0_22,hypothesis,
aElement0(xy),
inference(split_conjunct,[status(thm)],[m__2693]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM560+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.32 % Computer : n012.cluster.edu
% 0.04/5.32 % Model : x86_64 x86_64
% 0.04/5.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/5.32 % Memory : 8046.5625MB
% 0.04/5.32 % OS : Linux 6.8.0-71-generic
% 0.04/5.32 % CPULimit : 300
% 0.04/5.32 % WCLimit : 300
% 0.04/5.32 % DateTime : Mon Sep 21 02:40:13 UTC 2026
% 0.04/5.32 % CPUTime :
% 0.04/5.32 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/5.34 Running first-order theorem proving
% 0.04/5.34 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.04/5.36 % Version: 3.5.1
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % Starting new_bool_1 with 300s (1) cores
% 0.04/5.36 % Starting sh5l with 300s (1) cores
% 0.04/5.36 % new_bool_3 with pid 1394326 completed with status 0
% 0.04/5.36 % Result found by new_bool_3
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.36 % Search class: FGUSF-FFMF32-SFFFFFNN
% 0.04/5.36 % partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.04/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.36 % SubtermCWHack with pid 1394329 completed with status 0
% 0.04/5.36 % Result found by SubtermCWHack
% 0.04/5.36 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/5.36 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/5.36 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/5.36 % Starting new_bool_3 with 300s (1) cores
% 0.04/5.36 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.04/5.36 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.04/5.36 % Search class: FGUSF-FFMF32-SFFFFFNN
% 0.04/5.36 % partial match(1): FGHSF-FFMF32-SFFFFFNN
% 0.04/5.36 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.04/5.36 % Starting SubtermCWHack with 31s (1) cores
% 0.04/5.36 % Preprocessing time : 0.001 s
% 0.04/5.36
% 0.04/5.36 % Proof found!
% 0.04/5.36 % SZS status Theorem
% 0.04/5.36 % SZS output start CNFRefutation
% See solution above
% 0.04/5.36 % Parsed axioms : 68
% 0.04/5.36 % Removed by relevancy pruning/SinE : 53
% 0.04/5.36 % Initial clauses : 25
% 0.04/5.36 % Removed in clause preprocessing : 4
% 0.04/5.36 % Initial clauses in saturation : 21
% 0.04/5.36 % Processed clauses : 30
% 0.04/5.36 % ...of these trivial : 0
% 0.04/5.36 % ...subsumed : 2
% 0.04/5.36 % ...remaining for further processing : 28
% 0.04/5.36 % Other redundant clauses eliminated : 5
% 0.04/5.36 % Clauses deleted for lack of memory : 0
% 0.04/5.36 % Backward-subsumed : 1
% 0.04/5.36 % Backward-rewritten : 0
% 0.04/5.36 % Generated clauses : 25
% 0.04/5.36 % ...of the previous two non-redundant : 19
% 0.04/5.36 % ...aggressively subsumed : 0
% 0.04/5.36 % Contextual simplify-reflections : 8
% 0.04/5.36 % Paramodulations : 21
% 0.04/5.36 % Factorizations : 0
% 0.04/5.36 % NegExts : 0
% 0.04/5.36 % Equation resolutions : 5
% 0.04/5.36 % Disequality decompositions : 0
% 0.04/5.36 % Total rewrite steps : 2
% 0.04/5.36 % ...of those cached : 0
% 0.04/5.36 % Propositional unsat checks : 0
% 0.04/5.36 % Propositional check models : 0
% 0.04/5.36 % Propositional check unsatisfiable : 0
% 0.04/5.36 % Propositional clauses : 0
% 0.04/5.36 % Propositional clauses after purity: 0
% 0.04/5.36 % Propositional unsat core size : 0
% 0.04/5.36 % Propositional preprocessing time : 0.000
% 0.04/5.36 % Propositional encoding time : 0.000
% 0.04/5.36 % Propositional solver time : 0.000
% 0.04/5.36 % Success case prop preproc time : 0.000
% 0.04/5.36 % Success case prop encoding time : 0.000
% 0.04/5.36 % Success case prop solver time : 0.000
% 0.04/5.36 % Current number of processed clauses : 23
% 0.04/5.36 % Positive orientable unit clauses : 2
% 0.04/5.36 % Positive unorientable unit clauses: 0
% 0.04/5.36 % Negative unit clauses : 1
% 0.04/5.36 % Non-unit-clauses : 20
% 0.04/5.36 % Current number of unprocessed clauses: 5
% 0.04/5.36 % ...number of literals in the above : 31
% 0.04/5.36 % Current number of archived formulas : 0
% 0.04/5.36 % Current number of archived clauses : 1
% 0.04/5.36 % Clause-clause subsumption calls (NU) : 75
% 0.04/5.36 % Rec. Clause-clause subsumption calls : 29
% 0.04/5.36 % Non-unit clause-clause subsumptions : 11
% 0.04/5.36 % Unit Clause-clause subsumption calls : 0
% 0.04/5.36 % Rewrite failures with RHS unbound : 0
% 0.04/5.36 % BW rewrite match attempts : 0
% 0.04/5.36 % BW rewrite match successes : 0
% 0.04/5.36 % Condensation attempts : 0
% 0.04/5.36 % Condensation successes : 0
% 0.04/5.36 % Termbank termtop insertions : 3217
% 0.04/5.36 % Search garbage collected termcells : 892
% 0.04/5.36
% 0.04/5.36 % -------------------------------------------------
% 0.04/5.36 % User time : 0.003 s
% 0.04/5.36 % System time : 0.003 s
% 0.04/5.36 % Total time : 0.005 s
% 0.04/5.36 % Maximum resident set size: 3712 pages
% 0.04/5.36
% 0.04/5.36 % -------------------------------------------------
% 0.04/5.36 % User time : 0.005 s
% 0.04/5.36 % System time : 0.005 s
% 0.04/5.36 % Total time : 0.010 s
% 0.04/5.36 % Maximum resident set size: 4608 pages
% 0.04/5.36 % E exiting
%------------------------------------------------------------------------------