%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : NUM607+3 : 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 : n008.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:55:41 PM UTC 2026
% Result : Theorem 0.93s 0.68s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 13 ( 4 unt; 0 def)
% Number of atoms : 47 ( 2 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 45 ( 11 ~; 12 |; 16 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(m__,conjecture,
( aElementOf0(xQ,szDzozmdt0(xc))
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
fof(m__5078,hypothesis,
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xO) )
& aSet0(xQ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__5078) ).
fof(m__4998,hypothesis,
( aSubsetOf0(xO,xS)
& ! [X1] :
( aElementOf0(X1,xO)
=> aElementOf0(X1,xS) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__4998) ).
fof(c_0_3,negated_conjecture,
~ ( aElementOf0(xQ,szDzozmdt0(xc))
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) )
| aSubsetOf0(xQ,xS)
| ! [X1] :
( aElementOf0(X1,xQ)
=> aElementOf0(X1,xS) ) ),
inference(assume_negation,[status(cth)],[m__]) ).
fof(c_0_4,hypothesis,
! [X111] :
( aElementOf0(xQ,slbdtsldtrb0(xO,xK))
& sbrdtbr0(xQ) = xK
& aSubsetOf0(xQ,xO)
& ( aElementOf0(X111,xO)
| ~ aElementOf0(X111,xQ) )
& aSet0(xQ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__5078])])])]) ).
fof(c_0_5,negated_conjecture,
( ~ aElementOf0(xQ,szDzozmdt0(xc))
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(esk2_0,xS)
& aElementOf0(esk2_0,xQ)
& ~ aSubsetOf0(xQ,xS)
& ~ aElementOf0(esk1_0,xS)
& aElementOf0(esk1_0,xQ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
fof(c_0_6,hypothesis,
! [X142] :
( aSubsetOf0(xO,xS)
& ( aElementOf0(X142,xS)
| ~ aElementOf0(X142,xO) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[m__4998])])])]) ).
cnf(c_0_7,hypothesis,
( ~ aElementOf0(X1,xQ)
| aElementOf0(X1,xO) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
aElementOf0(esk2_0,xQ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,hypothesis,
( ~ aElementOf0(X1,xO)
| aElementOf0(X1,xS) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
aElementOf0(esk2_0,xO),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,negated_conjecture,
~ aElementOf0(esk2_0,xS),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_12,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM607+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n008.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 02:45:24 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/0.40 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.93/0.68 % Version: 3.5.1
% 0.93/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.93/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.93/0.68 % Starting sh5l with 300s (1) cores
% 0.93/0.68 % sh5l with pid 4173623 completed with status 0
% 0.93/0.68 % Result found by sh5l
% 0.93/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.93/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.93/0.68 % Starting sh5l with 300s (1) cores
% 0.93/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.93/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.68 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.93/0.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.93/0.68 % SubtermCWHack with pid 4173658 completed with status 0
% 0.93/0.68 % Result found by SubtermCWHack
% 0.93/0.68 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.93/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/0.68 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.93/0.68 % Starting new_bool_3 with 300s (1) cores
% 0.93/0.68 % Starting new_bool_1 with 300s (1) cores
% 0.93/0.68 % Starting sh5l with 300s (1) cores
% 0.93/0.68 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.93/0.68 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.93/0.68 % Search class: FGHSF-SMLM32-MFFFFFNN
% 0.93/0.68 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.93/0.68 % Starting SubtermCWHack with 28s (1) cores
% 0.93/0.68 % Preprocessing time : 0.094 s
% 0.93/0.68
% 0.93/0.68 % Proof found!
% 0.93/0.68 % SZS status Theorem
% 0.93/0.68 % SZS output start CNFRefutation
% See solution above
% 0.93/0.68 % Parsed axioms : 102
% 0.93/0.68 % Removed by relevancy pruning/SinE : 2
% 0.93/0.68 % Initial clauses : 4884
% 0.93/0.68 % Removed in clause preprocessing : 7
% 0.93/0.68 % Initial clauses in saturation : 4877
% 0.93/0.68 % Processed clauses : 84
% 0.93/0.68 % ...of these trivial : 2
% 0.93/0.68 % ...subsumed : 3
% 0.93/0.68 % ...remaining for further processing : 79
% 0.93/0.68 % Other redundant clauses eliminated : 3
% 0.93/0.68 % Clauses deleted for lack of memory : 0
% 0.93/0.68 % Backward-subsumed : 0
% 0.93/0.68 % Backward-rewritten : 0
% 0.93/0.68 % Generated clauses : 23
% 0.93/0.68 % ...of the previous two non-redundant : 17
% 0.93/0.68 % ...aggressively subsumed : 0
% 0.93/0.68 % Contextual simplify-reflections : 0
% 0.93/0.68 % Paramodulations : 20
% 0.93/0.68 % Factorizations : 0
% 0.93/0.68 % NegExts : 0
% 0.93/0.68 % Equation resolutions : 3
% 0.93/0.68 % Disequality decompositions : 0
% 0.93/0.68 % Total rewrite steps : 19
% 0.93/0.68 % ...of those cached : 7
% 0.93/0.68 % Propositional unsat checks : 0
% 0.93/0.68 % Propositional check models : 0
% 0.93/0.68 % Propositional check unsatisfiable : 0
% 0.93/0.68 % Propositional clauses : 0
% 0.93/0.68 % Propositional clauses after purity: 0
% 0.93/0.68 % Propositional unsat core size : 0
% 0.93/0.68 % Propositional preprocessing time : 0.000
% 0.93/0.68 % Propositional encoding time : 0.000
% 0.93/0.68 % Propositional solver time : 0.000
% 0.93/0.68 % Success case prop preproc time : 0.000
% 0.93/0.68 % Success case prop encoding time : 0.000
% 0.93/0.68 % Success case prop solver time : 0.000
% 0.93/0.68 % Current number of processed clauses : 76
% 0.93/0.68 % Positive orientable unit clauses : 49
% 0.93/0.68 % Positive unorientable unit clauses: 0
% 0.93/0.68 % Negative unit clauses : 9
% 0.93/0.68 % Non-unit-clauses : 18
% 0.93/0.68 % Current number of unprocessed clauses: 4810
% 0.93/0.68 % ...number of literals in the above : 55855
% 0.93/0.68 % Current number of archived formulas : 0
% 0.93/0.68 % Current number of archived clauses : 0
% 0.93/0.68 % Clause-clause subsumption calls (NU) : 36
% 0.93/0.68 % Rec. Clause-clause subsumption calls : 30
% 0.93/0.68 % Non-unit clause-clause subsumptions : 0
% 0.93/0.68 % Unit Clause-clause subsumption calls : 64
% 0.93/0.68 % Rewrite failures with RHS unbound : 0
% 0.93/0.68 % BW rewrite match attempts : 0
% 0.93/0.68 % BW rewrite match successes : 0
% 0.93/0.68 % Condensation attempts : 0
% 0.93/0.68 % Condensation successes : 0
% 0.93/0.68 % Termbank termtop insertions : 381549
% 0.93/0.68 % Search garbage collected termcells : 31773
% 0.93/0.68
% 0.93/0.68 % -------------------------------------------------
% 0.93/0.68 % User time : 0.230 s
% 0.93/0.68 % System time : 0.026 s
% 0.93/0.68 % Total time : 0.256 s
% 0.93/0.68 % Maximum resident set size: 16100 pages
% 0.93/0.68
% 0.93/0.68 % -------------------------------------------------
% 0.93/0.68 % User time : 0.233 s
% 0.93/0.68 % System time : 0.029 s
% 0.93/0.68 % Total time : 0.263 s
% 0.93/0.68 % Maximum resident set size: 5120 pages
% 0.93/0.68 % E exiting
%------------------------------------------------------------------------------