%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM592+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 : n001.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:41 PM UTC 2026
% Result : Theorem 0.30s 0.83s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 7 unt; 0 def)
% Number of atoms : 75 ( 13 equ)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 92 ( 38 ~; 33 |; 18 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 9 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 6 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
? [X1] :
( ? [X2] :
( ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xk))
& aSet0(X3) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X1,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__4545,hypothesis,
( ! [X1] :
( ( aElementOf0(X1,slbdtsldtrb0(xX,xk))
& aSet0(X1) )
=> sdtlpdtrp0(xd,X1) = xu )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4545) ).
fof(m__4448_02,hypothesis,
( xd = sdtlpdtrp0(xC,xi)
& xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4448_02) ).
fof(c_0_3,negated_conjecture,
~ ? [X1] :
( ? [X2] :
( ! [X3] :
( ( aElementOf0(X3,slbdtsldtrb0(X2,xk))
& aSet0(X3) )
=> sdtlpdtrp0(sdtlpdtrp0(xC,xi),X3) = X1 )
& isCountable0(X2)
& aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi)))) )
& aElementOf0(X1,xT) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,negated_conjecture,
! [X7,X8] :
( ( ~ aElementOf0(X7,xT)
| ~ isCountable0(X8)
| ~ aSubsetOf0(X8,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk1_2(X7,X8)) != X7 )
& ( ~ aElementOf0(X7,xT)
| ~ isCountable0(X8)
| ~ aSubsetOf0(X8,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(esk1_2(X7,X8),slbdtsldtrb0(X8,xk)) )
& ( ~ aElementOf0(X7,xT)
| ~ isCountable0(X8)
| ~ aSubsetOf0(X8,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aSet0(esk1_2(X7,X8)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])])]) ).
fof(c_0_5,hypothesis,
! [X186] :
( ( sdtlpdtrp0(xd,X186) = xu
| ~ aElementOf0(X186,slbdtsldtrb0(xX,xk))
| ~ aSet0(X186) )
& isCountable0(xX)
& aSubsetOf0(xX,xY)
& aElementOf0(xu,xT) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4545])])])]) ).
cnf(c_0_6,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aElementOf0(esk1_2(X1,X2),slbdtsldtrb0(X2,xk)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,hypothesis,
xY = sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),
inference(split_conjunct,[status(thm)],[m__4448_02]) ).
cnf(c_0_8,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| sdtlpdtrp0(sdtlpdtrp0(xC,xi),esk1_2(X1,X2)) != X1 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,hypothesis,
xd = sdtlpdtrp0(xC,xi),
inference(split_conjunct,[status(thm)],[m__4448_02]) ).
cnf(c_0_10,hypothesis,
( ~ aElementOf0(X1,slbdtsldtrb0(xX,xk))
| ~ aSet0(X1)
| sdtlpdtrp0(xd,X1) = xu ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_11,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xY)
| aElementOf0(esk1_2(X1,X2),slbdtsldtrb0(X2,xk)) ),
inference(rw,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_12,hypothesis,
aSubsetOf0(xX,xY),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_13,hypothesis,
isCountable0(xX),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_14,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xY)
| sdtlpdtrp0(xd,esk1_2(X1,X2)) != X1 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_7]) ).
cnf(c_0_15,hypothesis,
( ~ aSet0(esk1_2(X1,xX))
| ~ aElementOf0(X1,xT)
| sdtlpdtrp0(xd,esk1_2(X1,xX)) = xu ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]),c_0_13])]) ).
cnf(c_0_16,hypothesis,
aElementOf0(xu,xT),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
| aSet0(esk1_2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
~ aSet0(esk1_2(xu,xX)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_12]),c_0_13])])]),c_0_16])]) ).
cnf(c_0_19,negated_conjecture,
( ~ aElementOf0(X1,xT)
| ~ isCountable0(X2)
| ~ aSubsetOf0(X2,xY)
| aSet0(esk1_2(X1,X2)) ),
inference(rw,[status(thm)],[c_0_17,c_0_7]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_12]),c_0_13]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM592+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.46 % Computer : n001.cluster.edu
% 0.18/0.46 % Model : x86_64 x86_64
% 0.18/0.46 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46 % Memory : 8046.5625MB
% 0.18/0.46 % OS : Linux 6.8.0-71-generic
% 0.18/0.46 % CPULimit : 300
% 0.18/0.46 % WCLimit : 300
% 0.18/0.46 % DateTime : Mon Sep 21 02:48:28 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.53 Running first-order theorem proving
% 0.20/0.53 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.30/0.83 % Version: 3.5.1
% 0.30/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.83 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.83 % Starting sh5l with 300s (1) cores
% 0.30/0.83 % sh5l with pid 2026140 completed with status 0
% 0.30/0.83 % Result found by sh5l
% 0.30/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.83 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.83 % Starting sh5l with 300s (1) cores
% 0.30/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.83 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.30/0.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.83 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.83 % SubtermCWHack with pid 2026147 completed with status 0
% 0.30/0.83 % Result found by SubtermCWHack
% 0.30/0.83 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.30/0.83 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.83 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.30/0.83 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.83 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.83 % Starting sh5l with 300s (1) cores
% 0.30/0.83 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.30/0.83 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.30/0.83 % Search class: FGHSF-FSLM32-MFFFFFNN
% 0.30/0.83 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.30/0.83 % Starting SubtermCWHack with 28s (1) cores
% 0.30/0.83 % Preprocessing time : 0.005 s
% 0.30/0.83
% 0.30/0.83 % Proof found!
% 0.30/0.83 % SZS status Theorem
% 0.30/0.83 % SZS output start CNFRefutation
% See solution above
% 0.30/0.83 % Parsed axioms : 94
% 0.30/0.83 % Removed by relevancy pruning/SinE : 2
% 0.30/0.83 % Initial clauses : 184
% 0.30/0.83 % Removed in clause preprocessing : 7
% 0.30/0.83 % Initial clauses in saturation : 177
% 0.30/0.83 % Processed clauses : 1281
% 0.30/0.83 % ...of these trivial : 5
% 0.30/0.83 % ...subsumed : 505
% 0.30/0.83 % ...remaining for further processing : 771
% 0.30/0.83 % Other redundant clauses eliminated : 44
% 0.30/0.83 % Clauses deleted for lack of memory : 0
% 0.30/0.83 % Backward-subsumed : 18
% 0.30/0.83 % Backward-rewritten : 12
% 0.30/0.83 % Generated clauses : 3119
% 0.30/0.83 % ...of the previous two non-redundant : 2761
% 0.30/0.83 % ...aggressively subsumed : 0
% 0.30/0.83 % Contextual simplify-reflections : 52
% 0.30/0.83 % Paramodulations : 3078
% 0.30/0.83 % Factorizations : 0
% 0.30/0.83 % NegExts : 0
% 0.30/0.83 % Equation resolutions : 46
% 0.30/0.83 % Disequality decompositions : 0
% 0.30/0.83 % Total rewrite steps : 1912
% 0.30/0.83 % ...of those cached : 1833
% 0.30/0.83 % Propositional unsat checks : 0
% 0.30/0.83 % Propositional check models : 0
% 0.30/0.83 % Propositional check unsatisfiable : 0
% 0.30/0.83 % Propositional clauses : 0
% 0.30/0.83 % Propositional clauses after purity: 0
% 0.30/0.83 % Propositional unsat core size : 0
% 0.30/0.83 % Propositional preprocessing time : 0.000
% 0.30/0.83 % Propositional encoding time : 0.000
% 0.30/0.83 % Propositional solver time : 0.000
% 0.30/0.83 % Success case prop preproc time : 0.000
% 0.30/0.83 % Success case prop encoding time : 0.000
% 0.30/0.83 % Success case prop solver time : 0.000
% 0.30/0.83 % Current number of processed clauses : 708
% 0.30/0.83 % Positive orientable unit clauses : 86
% 0.30/0.83 % Positive unorientable unit clauses: 0
% 0.30/0.83 % Negative unit clauses : 34
% 0.30/0.83 % Non-unit-clauses : 588
% 0.30/0.83 % Current number of unprocessed clauses: 1650
% 0.30/0.83 % ...number of literals in the above : 9197
% 0.30/0.83 % Current number of archived formulas : 0
% 0.30/0.83 % Current number of archived clauses : 30
% 0.30/0.83 % Clause-clause subsumption calls (NU) : 42707
% 0.30/0.83 % Rec. Clause-clause subsumption calls : 21436
% 0.30/0.83 % Non-unit clause-clause subsumptions : 421
% 0.30/0.83 % Unit Clause-clause subsumption calls : 1164
% 0.30/0.83 % Rewrite failures with RHS unbound : 0
% 0.30/0.83 % BW rewrite match attempts : 9
% 0.30/0.83 % BW rewrite match successes : 7
% 0.30/0.83 % Condensation attempts : 0
% 0.30/0.83 % Condensation successes : 0
% 0.30/0.83 % Termbank termtop insertions : 69236
% 0.30/0.83 % Search garbage collected termcells : 3473
% 0.30/0.83
% 0.30/0.83 % -------------------------------------------------
% 0.30/0.83 % User time : 0.222 s
% 0.30/0.83 % System time : 0.011 s
% 0.30/0.83 % Total time : 0.233 s
% 0.30/0.83 % Maximum resident set size: 4272 pages
% 0.30/0.83
% 0.30/0.83 % -------------------------------------------------
% 0.30/0.83 % User time : 0.227 s
% 0.30/0.83 % System time : 0.020 s
% 0.30/0.83 % Total time : 0.246 s
% 0.30/0.83 % Maximum resident set size: 4864 pages
% 0.30/0.83 % E exiting
%------------------------------------------------------------------------------