%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM605+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 : n017.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:44 PM UTC 2026
% Result : Theorem 0.20s 0.53s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 17 unt; 0 def)
% Number of atoms : 98 ( 39 equ)
% Maximal formula atoms : 39 ( 3 avg)
% Number of connectives : 124 ( 54 ~; 50 |; 14 &)
% ( 4 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 8 con; 0-3 aty)
% Number of variables : 26 ( 0 sgn 16 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
xQ != slcrc0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
fof(mDefSel,axiom,
! [X1,X2] :
( ( aElementOf0(X2,szNzAzT0)
& aSet0(X1) )
=> ! [X3] :
( X3 = slbdtsldtrb0(X1,X2)
<=> ( ! [X4] :
( aElementOf0(X4,X3)
<=> ( sbrdtbr0(X4) = X2
& aSubsetOf0(X4,X1) ) )
& aSet0(X3) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefSel) ).
fof(mCardEmpty,axiom,
! [X1] :
( aSet0(X1)
=> ( sbrdtbr0(X1) = sz00
<=> X1 = slcrc0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mCardEmpty) ).
fof(m__3462,hypothesis,
xK != sz00,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3462) ).
fof(m__5078,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__5078) ).
fof(m__3418,hypothesis,
aElementOf0(xK,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__3418) ).
fof(m__4891,hypothesis,
( xO = sdtlcdtrc0(xe,sdtlbdtrb0(xd,szDzizrdt0(xd)))
& aSet0(xO) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__4891) ).
fof(c_0_8,negated_conjecture,
~ ( xQ != slcrc0 ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_9,plain,
! [X12,X13,X14] :
( ( X14 = slcrc0
| aElementOf0(esk1_1(X14),X14)
| ~ aSet0(X14) )
& ( X12 != slcrc0
| ~ aElementOf0(X13,X12) )
& ( X12 != slcrc0
| aSet0(X12) ) ),
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)],[mDefEmp])])])])])])]) ).
fof(c_0_10,plain,
! [X120,X121,X122,X123,X124,X125] :
( ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| aElementOf0(esk11_3(X120,X121,X125),X125)
| aSubsetOf0(esk11_3(X120,X121,X125),X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X125 = slbdtsldtrb0(X120,X121)
| ~ aSet0(X125)
| sbrdtbr0(esk11_3(X120,X121,X125)) != X121
| ~ aSubsetOf0(esk11_3(X120,X121,X125),X120)
| ~ aElementOf0(esk11_3(X120,X121,X125),X125) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aElementOf0(X124,X122)
| sbrdtbr0(X124) != X121
| ~ aSubsetOf0(X124,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| sbrdtbr0(X123) = X121 )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| ~ aElementOf0(X123,X122)
| aSubsetOf0(X123,X120) )
& ( ~ aElementOf0(X121,szNzAzT0)
| ~ aSet0(X120)
| X122 != slbdtsldtrb0(X120,X121)
| aSet0(X122) ) ),
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)],[mDefSel])])])])])])]) ).
fof(c_0_11,negated_conjecture,
xQ = slcrc0,
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X84] :
( ( ~ aSet0(X84)
| sbrdtbr0(X84) = sz00
| X84 != slcrc0 )
& ( ~ aSet0(X84)
| X84 = slcrc0
| sbrdtbr0(X84) != sz00 ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCardEmpty])])])]) ).
cnf(c_0_13,plain,
( X1 != slcrc0
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_14,hypothesis,
xK != sz00,
inference(fof_simplification,[status(thm)],[m__3462]) ).
cnf(c_0_15,plain,
( ~ aElementOf0(X2,szNzAzT0)
| ~ aSet0(X4)
| X3 != slbdtsldtrb0(X4,X2)
| ~ aElementOf0(X1,X3)
| sbrdtbr0(X1) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
inference(split_conjunct,[status(thm)],[m__5078]) ).
cnf(c_0_17,negated_conjecture,
xQ = slcrc0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( ~ aSet0(X1)
| X1 != slcrc0
| sbrdtbr0(X1) = sz00 ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
aSet0(slcrc0),
inference(er,[status(thm)],[c_0_13]) ).
fof(c_0_20,hypothesis,
xK != sz00,
inference(fof_nnf,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ aSet0(X3)
| ~ aElementOf0(X2,szNzAzT0)
| ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
| sbrdtbr0(X1) = X2 ),
inference(er,[status(thm)],[c_0_15]) ).
cnf(c_0_22,hypothesis,
aElementOf0(slcrc0,slbdtsldtrb0(xO,xK)),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
sbrdtbr0(slcrc0) = sz00,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_18]),c_0_19])]) ).
cnf(c_0_24,hypothesis,
aElementOf0(xK,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__3418]) ).
cnf(c_0_25,hypothesis,
aSet0(xO),
inference(split_conjunct,[status(thm)],[m__4891]) ).
cnf(c_0_26,hypothesis,
xK != sz00,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_24]),c_0_25])]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM605+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.11/0.37 % Computer : n017.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:39:26 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.44 Running first-order theorem proving
% 0.16/0.44 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.20/0.53 % Version: 3.5.1
% 0.20/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 % Starting new_bool_3 with 300s (1) cores
% 0.20/0.53 % Starting new_bool_1 with 300s (1) cores
% 0.20/0.53 % Starting sh5l with 300s (1) cores
% 0.20/0.53 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 1246433 completed with status 0
% 0.20/0.53 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.20/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.53 % No SInE strategy applied
% 0.20/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.20/0.53 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.20/0.53 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 0.20/0.53 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S070I with 136s (1) cores
% 0.20/0.53 % SubtermCWHack with pid 1246438 completed with status 0
% 0.20/0.53 % Result found by SubtermCWHack
% 0.20/0.53 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.20/0.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.53 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.20/0.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.20/0.53 % No SInE strategy applied
% 0.20/0.53 % Search class: FGHSF-FSLM31-MFFFFFNN
% 0.20/0.53 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.53 % Starting SubtermCWHack with 136s (1) cores
% 0.20/0.53 % Preprocessing time : 0.003 s
% 0.20/0.53
% 0.20/0.53 % Proof found!
% 0.20/0.53 % SZS status Theorem
% 0.20/0.53 % SZS output start CNFRefutation
% See solution above
% 0.20/0.53 % Parsed axioms : 100
% 0.20/0.53 % Removed by relevancy pruning/SinE : 0
% 0.20/0.53 % Initial clauses : 202
% 0.20/0.53 % Removed in clause preprocessing : 7
% 0.20/0.53 % Initial clauses in saturation : 195
% 0.20/0.53 % Processed clauses : 807
% 0.20/0.53 % ...of these trivial : 5
% 0.20/0.53 % ...subsumed : 294
% 0.20/0.53 % ...remaining for further processing : 508
% 0.20/0.53 % Other redundant clauses eliminated : 47
% 0.20/0.53 % Clauses deleted for lack of memory : 0
% 0.20/0.53 % Backward-subsumed : 15
% 0.20/0.53 % Backward-rewritten : 15
% 0.20/0.53 % Generated clauses : 1633
% 0.20/0.53 % ...of the previous two non-redundant : 1437
% 0.20/0.53 % ...aggressively subsumed : 0
% 0.20/0.53 % Contextual simplify-reflections : 34
% 0.20/0.53 % Paramodulations : 1589
% 0.20/0.53 % Factorizations : 0
% 0.20/0.53 % NegExts : 0
% 0.20/0.53 % Equation resolutions : 49
% 0.20/0.53 % Disequality decompositions : 0
% 0.20/0.53 % Total rewrite steps : 1069
% 0.20/0.53 % ...of those cached : 1003
% 0.20/0.53 % Propositional unsat checks : 0
% 0.20/0.53 % Propositional check models : 0
% 0.20/0.53 % Propositional check unsatisfiable : 0
% 0.20/0.53 % Propositional clauses : 0
% 0.20/0.53 % Propositional clauses after purity: 0
% 0.20/0.53 % Propositional unsat core size : 0
% 0.20/0.53 % Propositional preprocessing time : 0.000
% 0.20/0.53 % Propositional encoding time : 0.000
% 0.20/0.53 % Propositional solver time : 0.000
% 0.20/0.53 % Success case prop preproc time : 0.000
% 0.20/0.53 % Success case prop encoding time : 0.000
% 0.20/0.53 % Success case prop solver time : 0.000
% 0.20/0.53 % Current number of processed clauses : 441
% 0.20/0.53 % Positive orientable unit clauses : 74
% 0.20/0.53 % Positive unorientable unit clauses: 0
% 0.20/0.53 % Negative unit clauses : 18
% 0.20/0.53 % Non-unit-clauses : 349
% 0.20/0.53 % Current number of unprocessed clauses: 796
% 0.20/0.53 % ...number of literals in the above : 4190
% 0.20/0.53 % Current number of archived formulas : 0
% 0.20/0.53 % Current number of archived clauses : 30
% 0.20/0.53 % Clause-clause subsumption calls (NU) : 22374
% 0.20/0.53 % Rec. Clause-clause subsumption calls : 12131
% 0.20/0.53 % Non-unit clause-clause subsumptions : 238
% 0.20/0.53 % Unit Clause-clause subsumption calls : 1573
% 0.20/0.53 % Rewrite failures with RHS unbound : 0
% 0.20/0.53 % BW rewrite match attempts : 10
% 0.20/0.53 % BW rewrite match successes : 10
% 0.20/0.53 % Condensation attempts : 0
% 0.20/0.53 % Condensation successes : 0
% 0.20/0.53 % Termbank termtop insertions : 42232
% 0.20/0.53 % Search garbage collected termcells : 3730
% 0.20/0.53
% 0.20/0.53 % -------------------------------------------------
% 0.20/0.53 % User time : 0.044 s
% 0.20/0.53 % System time : 0.007 s
% 0.20/0.53 % Total time : 0.051 s
% 0.20/0.53 % Maximum resident set size: 4020 pages
% 0.20/0.53
% 0.20/0.53 % -------------------------------------------------
% 0.20/0.53 % User time : 0.089 s
% 0.20/0.53 % System time : 0.020 s
% 0.20/0.53 % Total time : 0.110 s
% 0.20/0.53 % Maximum resident set size: 4864 pages
% 0.20/0.53 % E exiting
%------------------------------------------------------------------------------