%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET945+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:50 PM UTC 2026
% Result : Theorem 0.30s 0.61s
% Output : CNFRefutation 0.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 2 unt; 0 def)
% Number of atoms : 122 ( 24 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 158 ( 67 ~; 63 |; 20 &)
% ( 4 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 2 con; 0-3 aty)
% Number of variables : 94 ( 5 sgn 41 !; 3 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,axiom,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] : in(X3,set_intersection2(X1,X2)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X1,X2))
& ~ disjoint(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_xboole_0) ).
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/sandbox2/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(t98_zfmisc_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t98_zfmisc_1) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& in(X3,X4) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_tarski) ).
fof(c_0_4,plain,
! [X1,X2] :
( ~ ( disjoint(X1,X2)
& ? [X3] : in(X3,set_intersection2(X1,X2)) )
& ~ ( ! [X3] : ~ in(X3,set_intersection2(X1,X2))
& ~ disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(c_0_5,plain,
! [X9,X10,X11,X12,X13,X14,X15,X16] :
( ( X16 = set_intersection2(X14,X15)
| in(esk1_3(X14,X15,X16),X16)
| in(esk1_3(X14,X15,X16),X15) )
& ( X16 = set_intersection2(X14,X15)
| in(esk1_3(X14,X15,X16),X16)
| in(esk1_3(X14,X15,X16),X14) )
& ( X16 = set_intersection2(X14,X15)
| ~ in(esk1_3(X14,X15,X16),X15)
| ~ in(esk1_3(X14,X15,X16),X14)
| ~ in(esk1_3(X14,X15,X16),X16) )
& ( X11 != set_intersection2(X9,X10)
| in(X13,X11)
| ~ in(X13,X10)
| ~ in(X13,X9) )
& ( X11 != set_intersection2(X9,X10)
| ~ in(X12,X11)
| in(X12,X10) )
& ( X11 != set_intersection2(X9,X10)
| ~ in(X12,X11)
| in(X12,X9) ) ),
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])])])])])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> disjoint(X3,X2) )
=> disjoint(union(X1),X2) ),
inference(assume_negation,[status(cth)],[t98_zfmisc_1]) ).
fof(c_0_7,plain,
! [X34,X35,X37,X38,X39] :
( ( ~ disjoint(X37,X38)
| ~ in(X39,set_intersection2(X37,X38)) )
& ( in(esk7_2(X34,X35),set_intersection2(X34,X35))
| disjoint(X34,X35) ) ),
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)],[c_0_4])])])])])]) ).
cnf(c_0_8,plain,
( X4 != set_intersection2(X2,X3)
| ~ in(X1,X3)
| ~ in(X1,X2)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,negated_conjecture,
! [X42] :
( ~ disjoint(union(esk8_0),esk9_0)
& ( disjoint(X42,esk9_0)
| ~ in(X42,esk8_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_10,plain,
! [X18,X19,X20,X22,X23,X24,X25,X27] :
( ( X25 = union(X24)
| in(esk3_2(X24,X25),X25)
| in(esk4_2(X24,X25),X24) )
& ( X25 = union(X24)
| in(esk3_2(X24,X25),X25)
| in(esk3_2(X24,X25),esk4_2(X24,X25)) )
& ( X25 = union(X24)
| ~ in(X27,X24)
| ~ in(esk3_2(X24,X25),X27)
| ~ in(esk3_2(X24,X25),X25) )
& ( X19 != union(X18)
| in(X22,X19)
| ~ in(X23,X18)
| ~ in(X22,X23) )
& ( X19 != union(X18)
| ~ in(X20,X19)
| in(esk2_3(X18,X19,X20),X18) )
& ( X19 != union(X18)
| ~ in(X20,X19)
| in(X20,esk2_3(X18,X19,X20)) ) ),
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)],[d4_tarski])])])])])])]) ).
cnf(c_0_11,plain,
( ~ disjoint(X2,X3)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
( ~ in(X1,X2)
| ~ in(X1,X3)
| in(X1,set_intersection2(X2,X3)) ),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(X1,esk8_0)
| disjoint(X1,esk9_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( X2 != union(X1)
| ~ in(X3,X2)
| in(esk2_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,plain,
( ~ in(X3,X1)
| ~ in(X3,X2)
| ~ disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,negated_conjecture,
( ~ in(X2,X1)
| X1 != union(esk8_0)
| disjoint(esk2_3(esk8_0,X1,X2),esk9_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( X3 != set_intersection2(X4,X2)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_18,negated_conjecture,
( ~ in(X3,X1)
| ~ in(X2,esk9_0)
| ~ in(X2,esk2_3(esk8_0,X1,X3))
| X1 != union(esk8_0) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,plain,
( X3 != union(X2)
| ~ in(X1,X3)
| in(X1,esk2_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,plain,
( ~ in(X1,set_intersection2(X3,X2))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_17]) ).
cnf(c_0_21,plain,
( in(esk7_2(X1,X2),set_intersection2(X1,X2))
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( X3 != set_intersection2(X2,X4)
| ~ in(X1,X3)
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X2,X1)
| ~ in(X2,esk9_0)
| X1 != union(esk8_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( in(esk7_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
( ~ in(X1,set_intersection2(X2,X3))
| in(X1,X2) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ in(esk7_2(X1,esk9_0),X2)
| X2 != union(esk8_0)
| disjoint(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( in(esk7_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(spm,[status(thm)],[c_0_25,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
( X1 != union(esk8_0)
| disjoint(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,negated_conjecture,
~ disjoint(union(esk8_0),esk9_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_30,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_28]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET945+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n017.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:39:56 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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.30/0.61 % Version: 3.5.1
% 0.30/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.30/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.30/0.61 % Starting sh5l with 300s (1) cores
% 0.30/0.61 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1551824 completed with status 0
% 0.30/0.61 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.30/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.61 % No SInE strategy applied
% 0.30/0.61 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.30/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.30/0.61 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.30/0.61 % Starting new_bool_3 with 248s (1) cores
% 0.30/0.61 % Starting new_bool_1 with 241s (1) cores
% 0.30/0.61 % G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with pid 1551831 completed with status 0
% 0.30/0.61 % Result found by G-E--_207_B07_F1_AE_CS_SP_PS_S0Y
% 0.30/0.61 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.30/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.30/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.30/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.30/0.61 % No SInE strategy applied
% 0.30/0.61 % Search class: FGHSS-FFMF32-SFFFFFNN
% 0.30/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.30/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.30/0.61 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.30/0.61 % Starting G-E--_207_B07_F1_AE_CS_SP_PS_S0Y with 253s (1) cores
% 0.30/0.61 % Preprocessing time : 0.002 s
% 0.30/0.61 % Presaturation interreduction done
% 0.30/0.61
% 0.30/0.61 % Proof found!
% 0.30/0.61 % SZS status Theorem
% 0.30/0.61 % SZS output start CNFRefutation
% See solution above
% 0.30/0.61 % Parsed axioms : 10
% 0.30/0.61 % Removed by relevancy pruning/SinE : 0
% 0.30/0.61 % Initial clauses : 22
% 0.30/0.61 % Removed in clause preprocessing : 0
% 0.30/0.61 % Initial clauses in saturation : 22
% 0.30/0.61 % Processed clauses : 772
% 0.30/0.61 % ...of these trivial : 0
% 0.30/0.61 % ...subsumed : 487
% 0.30/0.61 % ...remaining for further processing : 285
% 0.30/0.61 % Other redundant clauses eliminated : 3
% 0.30/0.61 % Clauses deleted for lack of memory : 0
% 0.30/0.61 % Backward-subsumed : 0
% 0.30/0.61 % Backward-rewritten : 0
% 0.30/0.61 % Generated clauses : 3588
% 0.30/0.61 % ...of the previous two non-redundant : 3569
% 0.30/0.61 % ...aggressively subsumed : 0
% 0.30/0.61 % Contextual simplify-reflections : 0
% 0.30/0.61 % Paramodulations : 3536
% 0.30/0.61 % Factorizations : 8
% 0.30/0.61 % NegExts : 0
% 0.30/0.61 % Equation resolutions : 44
% 0.30/0.61 % Disequality decompositions : 0
% 0.30/0.61 % Total rewrite steps : 2
% 0.30/0.61 % ...of those cached : 1
% 0.30/0.61 % Propositional unsat checks : 0
% 0.30/0.61 % Propositional check models : 0
% 0.30/0.61 % Propositional check unsatisfiable : 0
% 0.30/0.61 % Propositional clauses : 0
% 0.30/0.61 % Propositional clauses after purity: 0
% 0.30/0.61 % Propositional unsat core size : 0
% 0.30/0.61 % Propositional preprocessing time : 0.000
% 0.30/0.61 % Propositional encoding time : 0.000
% 0.30/0.61 % Propositional solver time : 0.000
% 0.30/0.61 % Success case prop preproc time : 0.000
% 0.30/0.61 % Success case prop encoding time : 0.000
% 0.30/0.61 % Success case prop solver time : 0.000
% 0.30/0.61 % Current number of processed clauses : 263
% 0.30/0.61 % Positive orientable unit clauses : 2
% 0.30/0.61 % Positive unorientable unit clauses: 1
% 0.30/0.61 % Negative unit clauses : 6
% 0.30/0.61 % Non-unit-clauses : 254
% 0.30/0.61 % Current number of unprocessed clauses: 2841
% 0.30/0.61 % ...number of literals in the above : 8234
% 0.30/0.61 % Current number of archived formulas : 0
% 0.30/0.61 % Current number of archived clauses : 22
% 0.30/0.61 % Clause-clause subsumption calls (NU) : 12266
% 0.30/0.61 % Rec. Clause-clause subsumption calls : 9447
% 0.30/0.61 % Non-unit clause-clause subsumptions : 482
% 0.30/0.61 % Unit Clause-clause subsumption calls : 56
% 0.30/0.61 % Rewrite failures with RHS unbound : 0
% 0.30/0.61 % BW rewrite match attempts : 8
% 0.30/0.61 % BW rewrite match successes : 8
% 0.30/0.61 % Condensation attempts : 0
% 0.30/0.61 % Condensation successes : 0
% 0.30/0.61 % Termbank termtop insertions : 53402
% 0.30/0.61 % Search garbage collected termcells : 464
% 0.30/0.61
% 0.30/0.61 % -------------------------------------------------
% 0.30/0.61 % User time : 0.133 s
% 0.30/0.61 % System time : 0.010 s
% 0.30/0.61 % Total time : 0.143 s
% 0.30/0.61 % Maximum resident set size: 3640 pages
% 0.30/0.61
% 0.30/0.61 % -------------------------------------------------
% 0.30/0.61 % User time : 0.653 s
% 0.30/0.61 % System time : 0.051 s
% 0.30/0.61 % Total time : 0.704 s
% 0.30/0.61 % Maximum resident set size: 4608 pages
% 0.30/0.61 % E exiting
%------------------------------------------------------------------------------