%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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 02:14:48 PM UTC 2026
% Result : Theorem 0.09s 0.35s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 11 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 32 ( 17 ~; 8 |; 4 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 25 ( 2 sgn 18 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th104,conjecture,
! [X1] : disjoint(X1,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th104) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(intersect_defn,axiom,
! [X1,X2] :
( intersect(X1,X2)
<=> ? [X3] :
( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersect_defn) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] : disjoint(X1,empty_set),
inference(assume_negation,[status(cth)],[prove_th104]) ).
fof(c_0_5,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[disjoint_defn]) ).
fof(c_0_6,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
fof(c_0_7,negated_conjecture,
~ disjoint(esk1_0,empty_set),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_8,plain,
! [X5,X6] :
( ( disjoint(X5,X6)
| intersect(X5,X6) )
& ( ~ intersect(X5,X6)
| ~ disjoint(X5,X6) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_9,plain,
! [X7] : ~ member(X7,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_6])]) ).
fof(c_0_10,plain,
! [X8,X9,X11,X12,X13] :
( ( intersect(X11,X12)
| ~ member(X13,X12)
| ~ member(X13,X11) )
& ( ~ intersect(X8,X9)
| member(esk2_2(X8,X9),X9) )
& ( ~ intersect(X8,X9)
| member(esk2_2(X8,X9),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(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[intersect_defn])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ disjoint(esk1_0,empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( disjoint(X1,X2)
| intersect(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( ~ intersect(X1,X2)
| member(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
intersect(esk1_0,empty_set),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
~ intersect(X1,empty_set),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET627+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.03 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31 % Computer : n012.cluster.edu
% 0.04/0.31 % Model : x86_64 x86_64
% 0.04/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31 % Memory : 8046.5625MB
% 0.04/0.31 % OS : Linux 6.8.0-71-generic
% 0.04/0.31 % CPULimit : 300
% 0.04/0.31 % WCLimit : 300
% 0.04/0.31 % DateTime : Mon Sep 21 05:29:54 UTC 2026
% 0.04/0.31 % CPUTime :
% 0.04/0.31 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.34 Running first-order theorem proving
% 0.09/0.34 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.09/0.35 % Version: 3.5.1
% 0.09/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.35 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.35 % Starting sh5l with 300s (1) cores
% 0.09/0.35 % new_bool_3 with pid 1644011 completed with status 0
% 0.09/0.35 % Result found by new_bool_3
% 0.09/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.35 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.09/0.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.35 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.35 % SubtermCWHack with pid 1644014 completed with status 0
% 0.09/0.35 % Result found by SubtermCWHack
% 0.09/0.35 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.09/0.35 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.35 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.09/0.35 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.35 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.35 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.35 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.09/0.35 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.35 % Starting SubtermCWHack with 31s (1) cores
% 0.09/0.35 % Preprocessing time : 0.001 s
% 0.09/0.35
% 0.09/0.35 % Proof found!
% 0.09/0.35 % SZS status Theorem
% 0.09/0.35 % SZS output start CNFRefutation
% See solution above
% 0.09/0.35 % Parsed axioms : 6
% 0.09/0.35 % Removed by relevancy pruning/SinE : 1
% 0.09/0.35 % Initial clauses : 8
% 0.09/0.35 % Removed in clause preprocessing : 0
% 0.09/0.35 % Initial clauses in saturation : 8
% 0.09/0.35 % Processed clauses : 9
% 0.09/0.35 % ...of these trivial : 0
% 0.09/0.35 % ...subsumed : 0
% 0.09/0.35 % ...remaining for further processing : 9
% 0.09/0.35 % Other redundant clauses eliminated : 0
% 0.09/0.35 % Clauses deleted for lack of memory : 0
% 0.09/0.35 % Backward-subsumed : 0
% 0.09/0.35 % Backward-rewritten : 0
% 0.09/0.35 % Generated clauses : 6
% 0.09/0.35 % ...of the previous two non-redundant : 3
% 0.09/0.35 % ...aggressively subsumed : 0
% 0.09/0.35 % Contextual simplify-reflections : 0
% 0.09/0.35 % Paramodulations : 5
% 0.09/0.35 % Factorizations : 0
% 0.09/0.35 % NegExts : 0
% 0.09/0.35 % Equation resolutions : 0
% 0.09/0.35 % Disequality decompositions : 0
% 0.09/0.35 % Total rewrite steps : 1
% 0.09/0.35 % ...of those cached : 0
% 0.09/0.35 % Propositional unsat checks : 0
% 0.09/0.35 % Propositional check models : 0
% 0.09/0.35 % Propositional check unsatisfiable : 0
% 0.09/0.35 % Propositional clauses : 0
% 0.09/0.35 % Propositional clauses after purity: 0
% 0.09/0.35 % Propositional unsat core size : 0
% 0.09/0.35 % Propositional preprocessing time : 0.000
% 0.09/0.35 % Propositional encoding time : 0.000
% 0.09/0.35 % Propositional solver time : 0.000
% 0.09/0.35 % Success case prop preproc time : 0.000
% 0.09/0.35 % Success case prop encoding time : 0.000
% 0.09/0.35 % Success case prop solver time : 0.000
% 0.09/0.35 % Current number of processed clauses : 8
% 0.09/0.35 % Positive orientable unit clauses : 1
% 0.09/0.35 % Positive unorientable unit clauses: 0
% 0.09/0.35 % Negative unit clauses : 3
% 0.09/0.35 % Non-unit-clauses : 4
% 0.09/0.35 % Current number of unprocessed clauses: 2
% 0.09/0.35 % ...number of literals in the above : 5
% 0.09/0.35 % Current number of archived formulas : 0
% 0.09/0.35 % Current number of archived clauses : 1
% 0.09/0.35 % Clause-clause subsumption calls (NU) : 0
% 0.09/0.35 % Rec. Clause-clause subsumption calls : 0
% 0.09/0.35 % Non-unit clause-clause subsumptions : 0
% 0.09/0.35 % Unit Clause-clause subsumption calls : 3
% 0.09/0.35 % Rewrite failures with RHS unbound : 0
% 0.09/0.35 % BW rewrite match attempts : 0
% 0.09/0.35 % BW rewrite match successes : 0
% 0.09/0.35 % Condensation attempts : 0
% 0.09/0.35 % Condensation successes : 0
% 0.09/0.35 % Termbank termtop insertions : 477
% 0.09/0.35 % Search garbage collected termcells : 115
% 0.09/0.35
% 0.09/0.35 % -------------------------------------------------
% 0.09/0.35 % User time : 0.003 s
% 0.09/0.35 % System time : 0.001 s
% 0.09/0.35 % Total time : 0.004 s
% 0.09/0.35 % Maximum resident set size: 3632 pages
% 0.09/0.35
% 0.09/0.35 % -------------------------------------------------
% 0.09/0.35 % User time : 0.003 s
% 0.09/0.35 % System time : 0.004 s
% 0.09/0.35 % Total time : 0.007 s
% 0.09/0.35 % Maximum resident set size: 4608 pages
% 0.09/0.35 % E exiting
%------------------------------------------------------------------------------