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