%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM557+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 : n003.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:33 PM UTC 2026
% Result : Theorem 0.68s 0.67s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 78 ( 20 equ)
% Maximal formula atoms : 39 ( 4 avg)
% Number of connectives : 102 ( 43 ~; 40 |; 16 &)
% ( 2 <=>; 1 =>; 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 : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 16 ( 0 sgn 10 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
aElementOf0(xP,slbdtsldtrb0(xS,xk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).
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__2431,hypothesis,
( sbrdtbr0(xP) = xk
& aSubsetOf0(xP,xS) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2431) ).
fof(m__2202,hypothesis,
aElementOf0(xk,szNzAzT0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2202) ).
fof(c_0_5,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_6,plain,
! [X118,X119,X120,X121,X122,X123] :
( ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| aElementOf0(esk11_3(X118,X119,X123),X123)
| sbrdtbr0(esk11_3(X118,X119,X123)) = X119 )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| aElementOf0(esk11_3(X118,X119,X123),X123)
| aSubsetOf0(esk11_3(X118,X119,X123),X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X123 = slbdtsldtrb0(X118,X119)
| ~ aSet0(X123)
| sbrdtbr0(esk11_3(X118,X119,X123)) != X119
| ~ aSubsetOf0(esk11_3(X118,X119,X123),X118)
| ~ aElementOf0(esk11_3(X118,X119,X123),X123) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| aElementOf0(X122,X120)
| sbrdtbr0(X122) != X119
| ~ aSubsetOf0(X122,X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| ~ aElementOf0(X121,X120)
| sbrdtbr0(X121) = X119 )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| ~ aElementOf0(X121,X120)
| aSubsetOf0(X121,X118) )
& ( ~ aElementOf0(X119,szNzAzT0)
| ~ aSet0(X118)
| X120 != slbdtsldtrb0(X118,X119)
| aSet0(X120) ) ),
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_7,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_simplification,[status(thm)],[m__2202_02]) ).
fof(c_0_8,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(fof_simplification,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( ~ aElementOf0(X3,szNzAzT0)
| ~ aSet0(X2)
| X4 != slbdtsldtrb0(X2,X3)
| sbrdtbr0(X1) != X3
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,hypothesis,
( xk != sz00
& aSet0(xT)
& aSet0(xS) ),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
fof(c_0_11,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ aSet0(X2)
| ~ aElementOf0(sbrdtbr0(X1),szNzAzT0)
| ~ aSubsetOf0(X1,X2)
| aElementOf0(X1,slbdtsldtrb0(X2,sbrdtbr0(X1))) ),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_13,hypothesis,
aSubsetOf0(xP,xS),
inference(split_conjunct,[status(thm)],[m__2431]) ).
cnf(c_0_14,hypothesis,
sbrdtbr0(xP) = xk,
inference(split_conjunct,[status(thm)],[m__2431]) ).
cnf(c_0_15,hypothesis,
aElementOf0(xk,szNzAzT0),
inference(split_conjunct,[status(thm)],[m__2202]) ).
cnf(c_0_16,hypothesis,
aSet0(xS),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ aElementOf0(xP,slbdtsldtrb0(xS,xk)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_14]),c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM557+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.43 % Computer : n003.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Mon Sep 21 02:41:30 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.68/0.67 % Version: 3.5.1
% 0.68/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.67 % Starting new_bool_3 with 300s (1) cores
% 0.68/0.67 % Starting new_bool_1 with 300s (1) cores
% 0.68/0.67 % Starting sh5l with 300s (1) cores
% 0.68/0.67 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 3230375 completed with status 0
% 0.68/0.67 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 0.68/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.67 % No SInE strategy applied
% 0.68/0.67 % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.68/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.68/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.68/0.67 % Starting new_bool_3 with 136s (1) cores
% 0.68/0.67 % Starting new_bool_1 with 136s (1) cores
% 0.68/0.67 % new_bool_1 with pid 3230386 completed with status 0
% 0.68/0.67 % Result found by new_bool_1
% 0.68/0.67 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.68/0.67 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.68/0.67 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.67 % No SInE strategy applied
% 0.68/0.67 % Search class: FGHSF-FSMM31-MFFFFFNN
% 0.68/0.67 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.67 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.67 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 0.68/0.67 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.68/0.67 % Starting new_bool_3 with 136s (1) cores
% 0.68/0.67 % Starting new_bool_1 with 136s (1) cores
% 0.68/0.67 % Preprocessing time : 0.004 s
% 0.68/0.67 % Presaturation interreduction done
% 0.68/0.67
% 0.68/0.67 % Proof found!
% 0.68/0.67 % SZS status Theorem
% 0.68/0.67 % SZS output start CNFRefutation
% See solution above
% 0.68/0.67 % Parsed axioms : 73
% 0.68/0.67 % Removed by relevancy pruning/SinE : 0
% 0.68/0.67 % Initial clauses : 131
% 0.68/0.67 % Removed in clause preprocessing : 6
% 0.68/0.67 % Initial clauses in saturation : 125
% 0.68/0.67 % Processed clauses : 556
% 0.68/0.67 % ...of these trivial : 7
% 0.68/0.67 % ...subsumed : 48
% 0.68/0.67 % ...remaining for further processing : 501
% 0.68/0.67 % Other redundant clauses eliminated : 30
% 0.68/0.67 % Clauses deleted for lack of memory : 0
% 0.68/0.67 % Backward-subsumed : 5
% 0.68/0.67 % Backward-rewritten : 17
% 0.68/0.67 % Generated clauses : 1085
% 0.68/0.67 % ...of the previous two non-redundant : 883
% 0.68/0.67 % ...aggressively subsumed : 0
% 0.68/0.67 % Contextual simplify-reflections : 15
% 0.68/0.67 % Paramodulations : 1057
% 0.68/0.67 % Factorizations : 0
% 0.68/0.67 % NegExts : 0
% 0.68/0.67 % Equation resolutions : 31
% 0.68/0.67 % Disequality decompositions : 0
% 0.68/0.67 % Total rewrite steps : 1009
% 0.68/0.67 % ...of those cached : 916
% 0.68/0.67 % Propositional unsat checks : 0
% 0.68/0.67 % Propositional check models : 0
% 0.68/0.67 % Propositional check unsatisfiable : 0
% 0.68/0.67 % Propositional clauses : 0
% 0.68/0.67 % Propositional clauses after purity: 0
% 0.68/0.67 % Propositional unsat core size : 0
% 0.68/0.67 % Propositional preprocessing time : 0.000
% 0.68/0.67 % Propositional encoding time : 0.000
% 0.68/0.67 % Propositional solver time : 0.000
% 0.68/0.67 % Success case prop preproc time : 0.000
% 0.68/0.67 % Success case prop encoding time : 0.000
% 0.68/0.67 % Success case prop solver time : 0.000
% 0.68/0.67 % Current number of processed clauses : 328
% 0.68/0.67 % Positive orientable unit clauses : 126
% 0.68/0.67 % Positive unorientable unit clauses: 0
% 0.68/0.67 % Negative unit clauses : 15
% 0.68/0.67 % Non-unit-clauses : 187
% 0.68/0.67 % Current number of unprocessed clauses: 571
% 0.68/0.67 % ...number of literals in the above : 1638
% 0.68/0.67 % Current number of archived formulas : 0
% 0.68/0.67 % Current number of archived clauses : 146
% 0.68/0.67 % Clause-clause subsumption calls (NU) : 4424
% 0.68/0.67 % Rec. Clause-clause subsumption calls : 1673
% 0.68/0.67 % Non-unit clause-clause subsumptions : 37
% 0.68/0.67 % Unit Clause-clause subsumption calls : 381
% 0.68/0.67 % Rewrite failures with RHS unbound : 0
% 0.68/0.67 % BW rewrite match attempts : 46
% 0.68/0.67 % BW rewrite match successes : 8
% 0.68/0.67 % Condensation attempts : 0
% 0.68/0.67 % Condensation successes : 0
% 0.68/0.67 % Termbank termtop insertions : 27436
% 0.68/0.67 % Search garbage collected termcells : 2314
% 0.68/0.67
% 0.68/0.67 % -------------------------------------------------
% 0.68/0.67 % User time : 0.075 s
% 0.68/0.67 % System time : 0.012 s
% 0.68/0.67 % Total time : 0.087 s
% 0.68/0.67 % Maximum resident set size: 3968 pages
% 0.68/0.67
% 0.68/0.67 % -------------------------------------------------
% 0.68/0.67 % User time : 0.202 s
% 0.68/0.67 % System time : 0.043 s
% 0.68/0.67 % Total time : 0.245 s
% 0.68/0.67 % Maximum resident set size: 4608 pages
% 0.68/0.67 % E exiting
%------------------------------------------------------------------------------