%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM547+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 : n020.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:31 PM UTC 2026
% Result : Theorem 0.24s 0.62s
% Output : CNFRefutation 0.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of formulae : 28 ( 12 unt; 0 def)
% Number of atoms : 116 ( 26 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 151 ( 63 ~; 56 |; 25 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 6 con; 0-3 aty)
% Number of variables : 34 ( 1 sgn 22 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
fof(m__2227,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2227) ).
fof(mDefEmp,axiom,
! [X1] :
( X1 = slcrc0
<=> ( ~ ? [X2] : aElementOf0(X2,X1)
& aSet0(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefEmp) ).
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(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(m__2202_02,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202_02) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).
fof(c_0_7,negated_conjecture,
~ ? [X1] : aElementOf0(X1,slbdtsldtrb0(xS,xk)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_8,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
inference(fof_simplification,[status(thm)],[m__2227]) ).
fof(c_0_9,negated_conjecture,
! [X5] : ~ aElementOf0(X5,slbdtsldtrb0(xS,xk)),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).
fof(c_0_10,plain,
! [X15,X16,X17] :
( ( X17 = slcrc0
| aElementOf0(esk2_1(X17),X17)
| ~ aSet0(X17) )
& ( X15 != slcrc0
| ~ aElementOf0(X16,X15) )
& ( X15 != slcrc0
| aSet0(X15) ) ),
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_11,hypothesis,
( slbdtsldtrb0(xS,xk) != slcrc0
& aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)) ),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X31,X32,X33,X34] :
( ( ~ aSet0(X31)
| aSubsetOf0(X34,X31)
| ~ aSet0(X34)
| ~ aElementOf0(esk4_2(X31,X34),X31) )
& ( ~ aSet0(X31)
| aSubsetOf0(X34,X31)
| ~ aSet0(X34)
| aElementOf0(esk4_2(X31,X34),X34) )
& ( ~ aSet0(X31)
| ~ aSubsetOf0(X32,X31)
| aElementOf0(X33,X31)
| ~ aElementOf0(X33,X32) )
& ( ~ aSet0(X31)
| ~ aSubsetOf0(X32,X31)
| aSet0(X32) ) ),
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_13,negated_conjecture,
~ aElementOf0(X1,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ aSet0(X1)
| X1 = slcrc0
| aElementOf0(esk2_1(X1),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,hypothesis,
slbdtsldtrb0(xS,xk) != slcrc0,
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_16,plain,
! [X20,X21,X22,X23,X24,X25] :
( ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X25 = slbdtsldtrb0(X20,X21)
| ~ aSet0(X25)
| aElementOf0(esk3_3(X20,X21,X25),X25)
| sbrdtbr0(esk3_3(X20,X21,X25)) = X21 )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X25 = slbdtsldtrb0(X20,X21)
| ~ aSet0(X25)
| aElementOf0(esk3_3(X20,X21,X25),X25)
| aSubsetOf0(esk3_3(X20,X21,X25),X20) )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X25 = slbdtsldtrb0(X20,X21)
| ~ aSet0(X25)
| sbrdtbr0(esk3_3(X20,X21,X25)) != X21
| ~ aSubsetOf0(esk3_3(X20,X21,X25),X20)
| ~ aElementOf0(esk3_3(X20,X21,X25),X25) )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X22 != slbdtsldtrb0(X20,X21)
| aElementOf0(X24,X22)
| sbrdtbr0(X24) != X21
| ~ aSubsetOf0(X24,X20) )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X22 != slbdtsldtrb0(X20,X21)
| ~ aElementOf0(X23,X22)
| sbrdtbr0(X23) = X21 )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X22 != slbdtsldtrb0(X20,X21)
| ~ aElementOf0(X23,X22)
| aSubsetOf0(X23,X20) )
& ( ~ aElementOf0(X21,szNzAzT0)
| ~ aSet0(X20)
| X22 != slbdtsldtrb0(X20,X21)
| aSet0(X22) ) ),
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_17,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
cnf(c_0_18,plain,
( ~ aSet0(X2)
| ~ aSubsetOf0(X1,X2)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,hypothesis,
aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,negated_conjecture,
~ aSet0(slbdtsldtrb0(xS,xk)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X1 != slbdtsldtrb0(X2,X3)
| aSet0(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_22,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_17]) ).
cnf(c_0_23,hypothesis,
~ aSet0(slbdtsldtrb0(xT,xk)),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).
cnf(c_0_24,plain,
( ~ aSet0(X1)
| ~ aElementOf0(X2,szNzAzT0)
| aSet0(slbdtsldtrb0(X1,X2)) ),
inference(er,[status(thm)],[c_0_21]) ).
cnf(c_0_25,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_26,hypothesis,
aSet0(xT),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,hypothesis,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]),c_0_26])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : NUM547+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46 % Computer : n020.cluster.edu
% 0.19/0.46 % Model : x86_64 x86_64
% 0.19/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46 % Memory : 8046.5625MB
% 0.19/0.46 % OS : Linux 6.8.0-71-generic
% 0.19/0.46 % CPULimit : 300
% 0.19/0.46 % WCLimit : 300
% 0.19/0.46 % DateTime : Mon Sep 21 02:40:18 UTC 2026
% 0.19/0.47 % CPUTime :
% 0.19/0.47 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.54 Running first-order theorem proving
% 0.24/0.54 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.24/0.62 % Version: 3.5.1
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % Starting sh5l with 300s (1) cores
% 0.24/0.62 % new_bool_1 with pid 1817432 completed with status 0
% 0.24/0.62 % Result found by new_bool_1
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % SubtermCWHack with pid 1817439 completed with status 0
% 0.24/0.62 % Result found by SubtermCWHack
% 0.24/0.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.24/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.24/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.24/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.24/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.24/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.24/0.62 % Search class: FGHSF-FFMM31-MFFFFFNN
% 0.24/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.24/0.62 % Preprocessing time : 0.004 s
% 0.24/0.62
% 0.24/0.62 % Proof found!
% 0.24/0.62 % SZS status Theorem
% 0.24/0.62 % SZS output start CNFRefutation
% See solution above
% 0.24/0.62 % Parsed axioms : 65
% 0.24/0.62 % Removed by relevancy pruning/SinE : 5
% 0.24/0.62 % Initial clauses : 107
% 0.24/0.62 % Removed in clause preprocessing : 5
% 0.24/0.62 % Initial clauses in saturation : 102
% 0.24/0.62 % Processed clauses : 76
% 0.24/0.62 % ...of these trivial : 0
% 0.24/0.62 % ...subsumed : 3
% 0.24/0.62 % ...remaining for further processing : 73
% 0.24/0.62 % Other redundant clauses eliminated : 9
% 0.24/0.62 % Clauses deleted for lack of memory : 0
% 0.24/0.62 % Backward-subsumed : 2
% 0.24/0.62 % Backward-rewritten : 0
% 0.24/0.62 % Generated clauses : 57
% 0.24/0.62 % ...of the previous two non-redundant : 37
% 0.24/0.62 % ...aggressively subsumed : 0
% 0.24/0.62 % Contextual simplify-reflections : 1
% 0.24/0.62 % Paramodulations : 48
% 0.24/0.62 % Factorizations : 0
% 0.24/0.62 % NegExts : 0
% 0.24/0.62 % Equation resolutions : 9
% 0.24/0.62 % Disequality decompositions : 0
% 0.24/0.62 % Total rewrite steps : 34
% 0.24/0.62 % ...of those cached : 24
% 0.24/0.62 % Propositional unsat checks : 0
% 0.24/0.62 % Propositional check models : 0
% 0.24/0.62 % Propositional check unsatisfiable : 0
% 0.24/0.62 % Propositional clauses : 0
% 0.24/0.62 % Propositional clauses after purity: 0
% 0.24/0.62 % Propositional unsat core size : 0
% 0.24/0.62 % Propositional preprocessing time : 0.000
% 0.24/0.62 % Propositional encoding time : 0.000
% 0.24/0.62 % Propositional solver time : 0.000
% 0.24/0.62 % Success case prop preproc time : 0.000
% 0.24/0.62 % Success case prop encoding time : 0.000
% 0.24/0.62 % Success case prop solver time : 0.000
% 0.24/0.62 % Current number of processed clauses : 63
% 0.24/0.62 % Positive orientable unit clauses : 15
% 0.24/0.62 % Positive unorientable unit clauses: 0
% 0.24/0.62 % Negative unit clauses : 8
% 0.24/0.62 % Non-unit-clauses : 40
% 0.24/0.62 % Current number of unprocessed clauses: 63
% 0.24/0.62 % ...number of literals in the above : 316
% 0.24/0.62 % Current number of archived formulas : 0
% 0.24/0.62 % Current number of archived clauses : 2
% 0.24/0.62 % Clause-clause subsumption calls (NU) : 292
% 0.24/0.62 % Rec. Clause-clause subsumption calls : 212
% 0.24/0.62 % Non-unit clause-clause subsumptions : 6
% 0.24/0.62 % Unit Clause-clause subsumption calls : 22
% 0.24/0.62 % Rewrite failures with RHS unbound : 0
% 0.24/0.62 % BW rewrite match attempts : 0
% 0.24/0.62 % BW rewrite match successes : 0
% 0.24/0.62 % Condensation attempts : 0
% 0.24/0.62 % Condensation successes : 0
% 0.24/0.62 % Termbank termtop insertions : 9442
% 0.24/0.62 % Search garbage collected termcells : 2074
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.024 s
% 0.24/0.62 % System time : 0.003 s
% 0.24/0.62 % Total time : 0.027 s
% 0.24/0.62 % Maximum resident set size: 3448 pages
% 0.24/0.62
% 0.24/0.62 % -------------------------------------------------
% 0.24/0.62 % User time : 0.027 s
% 0.24/0.62 % System time : 0.011 s
% 0.24/0.62 % Total time : 0.038 s
% 0.24/0.62 % Maximum resident set size: 4608 pages
% 0.24/0.62 % E exiting
%------------------------------------------------------------------------------