%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET632+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 : n015.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:49 PM UTC 2026
% Result : Theorem 0.03s 0.42s
% Output : CNFRefutation 0.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 44 ( 14 unt; 0 def)
% Number of atoms : 108 ( 11 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 110 ( 46 ~; 40 |; 16 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 74 ( 6 sgn 34 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th114,conjecture,
! [X1,X2,X3] :
( ( disjoint(X2,X3)
& subset(X1,X3)
& subset(X1,X2) )
=> X1 = empty_set ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th114) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_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(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',empty_set_defn) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(disjoint_defn,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',disjoint_defn) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3] :
( ( disjoint(X2,X3)
& subset(X1,X3)
& subset(X1,X2) )
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th114]) ).
fof(c_0_7,plain,
! [X10,X11,X12,X13,X14] :
( ( subset(X13,X14)
| ~ member(esk4_2(X13,X14),X14) )
& ( subset(X13,X14)
| member(esk4_2(X13,X14),X13) )
& ( member(X12,X11)
| ~ member(X12,X10)
| ~ subset(X10,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)],[subset_defn])])])])])])]) ).
fof(c_0_8,negated_conjecture,
( esk1_0 != empty_set
& disjoint(esk2_0,esk3_0)
& subset(esk1_0,esk3_0)
& subset(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])])])]) ).
fof(c_0_9,plain,
! [X19,X20,X22,X23,X24] :
( ( intersect(X22,X23)
| ~ member(X24,X23)
| ~ member(X24,X22) )
& ( ~ intersect(X19,X20)
| member(esk5_2(X19,X20),X20) )
& ( ~ intersect(X19,X20)
| member(esk5_2(X19,X20),X19) ) ),
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_10,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| intersect(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_14,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_16,plain,
! [X16,X17] :
( ( X16 = X17
| ~ subset(X17,X16)
| ~ subset(X16,X17) )
& ( X16 != X17
| subset(X17,X16) )
& ( X16 != X17
| subset(X16,X17) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_17,plain,
( ~ member(esk4_2(X2,X3),X1)
| subset(X2,X3)
| intersect(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
fof(c_0_18,plain,
! [X7] : ~ member(X7,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_14])]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(X2,X1)
| ~ member(X2,esk1_0)
| intersect(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_20,plain,
( ~ intersect(X1,X2)
| member(esk5_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_21,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,plain,
( subset(X1,X2)
| intersect(X1,X1) ),
inference(spm,[status(thm)],[c_0_17,c_0_13]) ).
cnf(c_0_23,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_24,plain,
! [X1,X2] :
( disjoint(X1,X2)
<=> ~ intersect(X1,X2) ),
inference(fof_simplification,[status(thm)],[disjoint_defn]) ).
cnf(c_0_25,plain,
( ~ intersect(X1,X2)
| member(esk5_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk5_2(X2,esk1_0),X1)
| ~ intersect(X2,esk1_0)
| intersect(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ subset(X1,X2)
| intersect(X2,X2)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_28,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_23,c_0_13]) ).
fof(c_0_29,plain,
! [X8,X9] :
( ( disjoint(X8,X9)
| intersect(X8,X9) )
& ( ~ intersect(X8,X9)
| ~ disjoint(X8,X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).
cnf(c_0_30,plain,
( ~ member(esk5_2(X2,X3),X1)
| ~ intersect(X2,X3)
| intersect(X1,X2) ),
inference(spm,[status(thm)],[c_0_12,c_0_25]) ).
cnf(c_0_31,negated_conjecture,
( ~ intersect(X1,esk1_0)
| intersect(esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
cnf(c_0_32,plain,
( intersect(X1,X1)
| empty_set = X1 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_34,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_35,plain,
( ~ intersect(X1,X2)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_36,negated_conjecture,
disjoint(esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_37,plain,
( ~ intersect(X1,X2)
| intersect(X1,X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
intersect(esk1_0,esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).
cnf(c_0_39,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ intersect(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
intersect(esk1_0,esk1_0),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,negated_conjecture,
~ intersect(X1,esk1_0),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_39]),c_0_40]),c_0_20]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_41,c_0_42]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET632+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n015.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 05:33:36 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.40 Running first-order theorem proving
% 0.03/0.40 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.03/0.42 % Version: 3.5.1
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % Starting sh5l with 300s (1) cores
% 0.03/0.42 % new_bool_1 with pid 657036 completed with status 0
% 0.03/0.42 % Result found by new_bool_1
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FGHSF-FFSS22-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % SubtermCWHack with pid 657041 completed with status 0
% 0.03/0.42 % Result found by SubtermCWHack
% 0.03/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.03/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.03/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.03/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.03/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.03/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.03/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.03/0.42 % Search class: FGHSF-FFSS22-SFFFFFNN
% 0.03/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.03/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.03/0.42 % Preprocessing time : 0.001 s
% 0.03/0.42
% 0.03/0.42 % Proof found!
% 0.03/0.42 % SZS status Theorem
% 0.03/0.42 % SZS output start CNFRefutation
% See solution above
% 0.03/0.42 % Parsed axioms : 9
% 0.03/0.42 % Removed by relevancy pruning/SinE : 1
% 0.03/0.42 % Initial clauses : 18
% 0.03/0.42 % Removed in clause preprocessing : 0
% 0.03/0.42 % Initial clauses in saturation : 18
% 0.03/0.42 % Processed clauses : 68
% 0.03/0.42 % ...of these trivial : 1
% 0.03/0.42 % ...subsumed : 13
% 0.03/0.42 % ...remaining for further processing : 54
% 0.03/0.42 % Other redundant clauses eliminated : 2
% 0.03/0.42 % Clauses deleted for lack of memory : 0
% 0.03/0.42 % Backward-subsumed : 5
% 0.03/0.42 % Backward-rewritten : 1
% 0.03/0.42 % Generated clauses : 104
% 0.03/0.42 % ...of the previous two non-redundant : 68
% 0.03/0.42 % ...aggressively subsumed : 0
% 0.03/0.42 % Contextual simplify-reflections : 1
% 0.03/0.42 % Paramodulations : 100
% 0.03/0.42 % Factorizations : 0
% 0.03/0.42 % NegExts : 0
% 0.03/0.42 % Equation resolutions : 2
% 0.03/0.42 % Disequality decompositions : 0
% 0.03/0.42 % Total rewrite steps : 32
% 0.03/0.42 % ...of those cached : 24
% 0.03/0.42 % Propositional unsat checks : 0
% 0.03/0.42 % Propositional check models : 0
% 0.03/0.42 % Propositional check unsatisfiable : 0
% 0.03/0.42 % Propositional clauses : 0
% 0.03/0.42 % Propositional clauses after purity: 0
% 0.03/0.42 % Propositional unsat core size : 0
% 0.03/0.42 % Propositional preprocessing time : 0.000
% 0.03/0.42 % Propositional encoding time : 0.000
% 0.03/0.42 % Propositional solver time : 0.000
% 0.03/0.42 % Success case prop preproc time : 0.000
% 0.03/0.42 % Success case prop encoding time : 0.000
% 0.03/0.42 % Success case prop solver time : 0.000
% 0.03/0.42 % Current number of processed clauses : 44
% 0.03/0.42 % Positive orientable unit clauses : 7
% 0.03/0.42 % Positive unorientable unit clauses: 0
% 0.03/0.42 % Negative unit clauses : 6
% 0.03/0.42 % Non-unit-clauses : 31
% 0.03/0.42 % Current number of unprocessed clauses: 14
% 0.03/0.42 % ...number of literals in the above : 40
% 0.03/0.42 % Current number of archived formulas : 0
% 0.03/0.42 % Current number of archived clauses : 8
% 0.03/0.42 % Clause-clause subsumption calls (NU) : 148
% 0.03/0.42 % Rec. Clause-clause subsumption calls : 137
% 0.03/0.42 % Non-unit clause-clause subsumptions : 12
% 0.03/0.42 % Unit Clause-clause subsumption calls : 38
% 0.03/0.42 % Rewrite failures with RHS unbound : 0
% 0.03/0.42 % BW rewrite match attempts : 4
% 0.03/0.42 % BW rewrite match successes : 2
% 0.03/0.42 % Condensation attempts : 0
% 0.03/0.42 % Condensation successes : 0
% 0.03/0.42 % Termbank termtop insertions : 1873
% 0.03/0.42 % Search garbage collected termcells : 265
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.004 s
% 0.03/0.42 % System time : 0.003 s
% 0.03/0.42 % Total time : 0.007 s
% 0.03/0.42 % Maximum resident set size: 3584 pages
% 0.03/0.42
% 0.03/0.42 % -------------------------------------------------
% 0.03/0.42 % User time : 0.005 s
% 0.03/0.42 % System time : 0.005 s
% 0.03/0.42 % Total time : 0.011 s
% 0.03/0.42 % Maximum resident set size: 4864 pages
% 0.03/0.42 % E exiting
%------------------------------------------------------------------------------