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