%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:24:01 PM UTC 2026
% Result : Theorem 0.09s 0.44s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 10 unt; 0 def)
% Number of atoms : 114 ( 37 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 122 ( 46 ~; 49 |; 16 &)
% ( 7 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 88 ( 5 sgn 49 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X2)
& in(X4,X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(d1_tarski,axiom,
! [X1,X2] :
( X2 = singleton(X1)
<=> ! [X3] :
( in(X3,X2)
<=> X3 = X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(l28_zfmisc_1,conjecture,
! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l28_zfmisc_1) ).
fof(d10_xboole_0,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d10_xboole_0) ).
fof(t2_xboole_1,axiom,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(c_0_8,plain,
! [X26,X27,X28,X29,X30,X31,X32,X33] :
( ( X33 = set_intersection2(X31,X32)
| in(esk5_3(X31,X32,X33),X33)
| in(esk5_3(X31,X32,X33),X32) )
& ( X33 = set_intersection2(X31,X32)
| in(esk5_3(X31,X32,X33),X33)
| in(esk5_3(X31,X32,X33),X31) )
& ( X33 = set_intersection2(X31,X32)
| ~ in(esk5_3(X31,X32,X33),X32)
| ~ in(esk5_3(X31,X32,X33),X31)
| ~ in(esk5_3(X31,X32,X33),X33) )
& ( X28 != set_intersection2(X26,X27)
| in(X30,X28)
| ~ in(X30,X27)
| ~ in(X30,X26) )
& ( X28 != set_intersection2(X26,X27)
| ~ in(X29,X28)
| in(X29,X27) )
& ( X28 != set_intersection2(X26,X27)
| ~ in(X29,X28)
| in(X29,X26) ) ),
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)],[d3_xboole_0])])])])])])]) ).
cnf(c_0_9,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X36,X37] : set_intersection2(X36,X37) = set_intersection2(X37,X36),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(c_0_11,plain,
! [X11,X12,X13,X14,X15,X16] :
( ( X16 = singleton(X15)
| esk3_2(X15,X16) = X15
| in(esk3_2(X15,X16),X16) )
& ( X16 = singleton(X15)
| esk3_2(X15,X16) != X15
| ~ in(esk3_2(X15,X16),X16) )
& ( X12 != singleton(X11)
| in(X14,X12)
| X14 != X11 )
& ( X12 != singleton(X11)
| X13 = X11
| ~ in(X13,X12) ) ),
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_12,plain,
! [X20,X21,X22,X23,X24] :
( ( subset(X23,X24)
| ~ in(esk4_2(X23,X24),X24) )
& ( subset(X23,X24)
| in(esk4_2(X23,X24),X23) )
& ( in(X22,X21)
| ~ in(X22,X20)
| ~ subset(X20,X21) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(assume_negation,[status(cth)],[l28_zfmisc_1]) ).
cnf(c_0_14,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( X2 != singleton(X3)
| ~ in(X1,X2)
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( subset(X1,X2)
| in(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1,X2] :
( ~ in(X1,X2)
=> disjoint(singleton(X1),X2) ),
inference(fof_simplification,[status(thm)],[c_0_13]) ).
fof(c_0_19,plain,
! [X39,X40] :
( ( X39 = X40
| ~ subset(X40,X39)
| ~ subset(X39,X40) )
& ( X39 != X40
| subset(X40,X39) )
& ( X39 != X40
| subset(X39,X40) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d10_xboole_0])])])]) ).
fof(c_0_20,plain,
! [X35] : subset(empty_set,X35),
inference(variable_rename,[status(thm)],[t2_xboole_1]) ).
cnf(c_0_21,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_22,plain,
( ~ in(X1,singleton(X2))
| X1 = X2 ),
inference(er,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
( in(esk4_2(set_intersection2(X1,X2),X3),X2)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
fof(c_0_24,negated_conjecture,
( ~ disjoint(singleton(esk1_0),esk2_0)
& ~ in(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_18])])])]) ).
fof(c_0_25,plain,
! [X7,X8] :
( ( disjoint(X7,X8)
| set_intersection2(X7,X8) != empty_set )
& ( set_intersection2(X7,X8) = empty_set
| ~ disjoint(X7,X8) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])])]) ).
cnf(c_0_26,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_27,plain,
subset(empty_set,X1),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,plain,
( in(esk4_2(set_intersection2(X1,X2),X3),X1)
| subset(set_intersection2(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_29,plain,
( subset(set_intersection2(X1,singleton(X2)),X3)
| esk4_2(set_intersection2(X1,singleton(X2)),X3) = X2 ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ disjoint(singleton(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,plain,
( set_intersection2(X1,X2) != empty_set
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_32,plain,
( ~ subset(X1,empty_set)
| X1 = empty_set ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_33,plain,
( in(X2,X1)
| subset(set_intersection2(X1,singleton(X2)),X3) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,negated_conjecture,
set_intersection2(esk2_0,singleton(esk1_0)) != empty_set,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_15]) ).
cnf(c_0_35,plain,
( in(X2,X1)
| set_intersection2(X1,singleton(X2)) = empty_set ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
~ in(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SEU154+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 05:53:19 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/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.09/0.44 % Version: 3.5.1
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.09/0.44 % Starting sh5l with 300s (1) cores
% 0.09/0.44 % new_bool_3 with pid 2387314 completed with status 0
% 0.09/0.44 % Result found by new_bool_3
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.44 % SubtermCWHack with pid 2387320 completed with status 0
% 0.09/0.44 % Result found by SubtermCWHack
% 0.09/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.09/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.09/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.09/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.09/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.09/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.09/0.44 % Search class: FGHSM-FFMF32-SFFFFFNN
% 0.09/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.09/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.09/0.44 % Preprocessing time : 0.001 s
% 0.09/0.44
% 0.09/0.44 % Proof found!
% 0.09/0.44 % SZS status Theorem
% 0.09/0.44 % SZS output start CNFRefutation
% See solution above
% 0.09/0.44 % Parsed axioms : 18
% 0.09/0.44 % Removed by relevancy pruning/SinE : 3
% 0.09/0.44 % Initial clauses : 29
% 0.09/0.44 % Removed in clause preprocessing : 0
% 0.09/0.44 % Initial clauses in saturation : 29
% 0.09/0.44 % Processed clauses : 241
% 0.09/0.44 % ...of these trivial : 6
% 0.09/0.44 % ...subsumed : 130
% 0.09/0.44 % ...remaining for further processing : 105
% 0.09/0.44 % Other redundant clauses eliminated : 11
% 0.09/0.44 % Clauses deleted for lack of memory : 0
% 0.09/0.44 % Backward-subsumed : 2
% 0.09/0.44 % Backward-rewritten : 3
% 0.09/0.44 % Generated clauses : 944
% 0.09/0.44 % ...of the previous two non-redundant : 713
% 0.09/0.44 % ...aggressively subsumed : 0
% 0.09/0.44 % Contextual simplify-reflections : 0
% 0.09/0.44 % Paramodulations : 928
% 0.09/0.44 % Factorizations : 6
% 0.09/0.44 % NegExts : 0
% 0.09/0.44 % Equation resolutions : 11
% 0.09/0.44 % Disequality decompositions : 0
% 0.09/0.44 % Total rewrite steps : 242
% 0.09/0.44 % ...of those cached : 203
% 0.09/0.44 % Propositional unsat checks : 0
% 0.09/0.44 % Propositional check models : 0
% 0.09/0.44 % Propositional check unsatisfiable : 0
% 0.09/0.44 % Propositional clauses : 0
% 0.09/0.44 % Propositional clauses after purity: 0
% 0.09/0.44 % Propositional unsat core size : 0
% 0.09/0.44 % Propositional preprocessing time : 0.000
% 0.09/0.44 % Propositional encoding time : 0.000
% 0.09/0.44 % Propositional solver time : 0.000
% 0.09/0.44 % Success case prop preproc time : 0.000
% 0.09/0.44 % Success case prop encoding time : 0.000
% 0.09/0.44 % Success case prop solver time : 0.000
% 0.09/0.44 % Current number of processed clauses : 93
% 0.09/0.44 % Positive orientable unit clauses : 12
% 0.09/0.44 % Positive unorientable unit clauses: 1
% 0.09/0.44 % Negative unit clauses : 6
% 0.09/0.44 % Non-unit-clauses : 74
% 0.09/0.44 % Current number of unprocessed clauses: 494
% 0.09/0.44 % ...number of literals in the above : 1632
% 0.09/0.44 % Current number of archived formulas : 0
% 0.09/0.44 % Current number of archived clauses : 5
% 0.09/0.44 % Clause-clause subsumption calls (NU) : 1117
% 0.09/0.44 % Rec. Clause-clause subsumption calls : 967
% 0.09/0.44 % Non-unit clause-clause subsumptions : 117
% 0.09/0.44 % Unit Clause-clause subsumption calls : 25
% 0.09/0.44 % Rewrite failures with RHS unbound : 0
% 0.09/0.44 % BW rewrite match attempts : 12
% 0.09/0.44 % BW rewrite match successes : 5
% 0.09/0.44 % Condensation attempts : 0
% 0.09/0.44 % Condensation successes : 0
% 0.09/0.44 % Termbank termtop insertions : 10211
% 0.09/0.44 % Search garbage collected termcells : 460
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.021 s
% 0.09/0.44 % System time : 0.002 s
% 0.09/0.44 % Total time : 0.022 s
% 0.09/0.44 % Maximum resident set size: 3640 pages
% 0.09/0.44
% 0.09/0.44 % -------------------------------------------------
% 0.09/0.44 % User time : 0.023 s
% 0.09/0.44 % System time : 0.005 s
% 0.09/0.44 % Total time : 0.028 s
% 0.09/0.44 % Maximum resident set size: 4608 pages
% 0.09/0.44 % E exiting
%------------------------------------------------------------------------------