%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET578+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 : n008.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:23 PM UTC 2026
% Result : Theorem 0.32s 0.46s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 7 unt; 0 def)
% Number of atoms : 92 ( 12 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 95 ( 36 ~; 38 |; 13 &)
% ( 5 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 65 ( 2 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th19,conjecture,
! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X3)
& member(X4,X2) ) )
=> X1 = intersection(X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th19) ).
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(intersection_defn,axiom,
! [X1,X2,X3] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',intersection_defn) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ! [X4] :
( member(X4,X1)
<=> ( member(X4,X3)
& member(X4,X2) ) )
=> X1 = intersection(X2,X3) ),
inference(assume_negation,[status(cth)],[prove_th19]) ).
fof(c_0_6,plain,
! [X12,X13,X14,X15,X16] :
( ( subset(X15,X16)
| ~ member(esk1_2(X15,X16),X16) )
& ( subset(X15,X16)
| member(esk1_2(X15,X16),X15) )
& ( member(X14,X13)
| ~ member(X14,X12)
| ~ subset(X12,X13) ) ),
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_7,plain,
! [X5,X6,X7] :
( ( member(X7,intersection(X5,X6))
| ~ member(X7,X6)
| ~ member(X7,X5) )
& ( ~ member(X7,intersection(X5,X6))
| member(X7,X6) )
& ( ~ member(X7,intersection(X5,X6))
| member(X7,X5) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
fof(c_0_8,negated_conjecture,
! [X29] :
( esk3_0 != intersection(esk4_0,esk5_0)
& ( member(X29,esk3_0)
| ~ member(X29,esk5_0)
| ~ member(X29,esk4_0) )
& ( ~ member(X29,esk3_0)
| member(X29,esk5_0) )
& ( ~ member(X29,esk3_0)
| member(X29,esk4_0) ) ),
inference(distribute,[status(thm)],[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_5])])])])])]) ).
cnf(c_0_9,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk4_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( ~ member(esk1_2(X1,intersection(X2,X3)),X2)
| ~ member(esk1_2(X1,intersection(X2,X3)),X3)
| subset(X1,intersection(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
( member(esk1_2(esk3_0,X1),esk4_0)
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_16,plain,
! [X10,X11] : intersection(X10,X11) = intersection(X11,X10),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(X1,esk5_0)
| ~ member(X1,esk4_0)
| member(X1,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_18,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_19,plain,
! [X8,X9] :
( ( X8 = X9
| ~ subset(X9,X8)
| ~ subset(X8,X9) )
& ( X8 != X9
| subset(X9,X8) )
& ( X8 != X9
| subset(X8,X9) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_20,negated_conjecture,
( ~ member(esk1_2(esk3_0,intersection(X1,esk4_0)),X1)
| subset(esk3_0,intersection(X1,esk4_0)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,negated_conjecture,
( member(esk1_2(esk3_0,X1),esk5_0)
| subset(esk3_0,X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_12]) ).
cnf(c_0_22,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk1_2(X1,esk3_0),esk5_0)
| ~ member(esk1_2(X1,esk3_0),esk4_0)
| subset(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_24,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_12]) ).
cnf(c_0_25,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
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,negated_conjecture,
subset(esk3_0,intersection(esk4_0,esk5_0)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).
cnf(c_0_28,negated_conjecture,
esk3_0 != intersection(esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_29,negated_conjecture,
( ~ member(esk1_2(intersection(esk5_0,X1),esk3_0),esk4_0)
| subset(intersection(esk5_0,X1),esk3_0) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_25,c_0_12]) ).
cnf(c_0_31,negated_conjecture,
~ subset(intersection(esk4_0,esk5_0),esk3_0),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_22]),c_0_31]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET578+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 05:27:41 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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.32/0.46 % Version: 3.5.1
% 0.32/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.46 % Starting new_bool_3 with 300s (1) cores
% 0.32/0.46 % Starting new_bool_1 with 300s (1) cores
% 0.32/0.46 % Starting sh5l with 300s (1) cores
% 0.32/0.46 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 226819 completed with status 0
% 0.32/0.46 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.32/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.46 % No SInE strategy applied
% 0.32/0.46 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.32/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.32/0.46 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.32/0.46 % Starting new_bool_3 with 136s (1) cores
% 0.32/0.46 % Starting new_bool_1 with 136s (1) cores
% 0.32/0.46 % U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 226829 completed with status 0
% 0.32/0.46 % Result found by U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 0.32/0.46 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.32/0.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.32/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.32/0.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.32/0.46 % No SInE strategy applied
% 0.32/0.46 % Search class: FGUSS-FFSF22-SFFFFFNN
% 0.32/0.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.32/0.46 % Starting SubtermCWHack with 136s (1) cores
% 0.32/0.46 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.32/0.46 % Starting U----_206e_00_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.32/0.46 % Preprocessing time : 0.001 s
% 0.32/0.46 % Presaturation interreduction done
% 0.32/0.46
% 0.32/0.46 % Proof found!
% 0.32/0.46 % SZS status Theorem
% 0.32/0.46 % SZS output start CNFRefutation
% See solution above
% 0.32/0.46 % Parsed axioms : 7
% 0.32/0.46 % Removed by relevancy pruning/SinE : 0
% 0.32/0.46 % Initial clauses : 19
% 0.32/0.46 % Removed in clause preprocessing : 2
% 0.32/0.46 % Initial clauses in saturation : 17
% 0.32/0.46 % Processed clauses : 216
% 0.32/0.46 % ...of these trivial : 16
% 0.32/0.46 % ...subsumed : 95
% 0.32/0.46 % ...remaining for further processing : 105
% 0.32/0.46 % Other redundant clauses eliminated : 2
% 0.32/0.46 % Clauses deleted for lack of memory : 0
% 0.32/0.46 % Backward-subsumed : 0
% 0.32/0.46 % Backward-rewritten : 10
% 0.32/0.46 % Generated clauses : 579
% 0.32/0.46 % ...of the previous two non-redundant : 439
% 0.32/0.46 % ...aggressively subsumed : 0
% 0.32/0.46 % Contextual simplify-reflections : 4
% 0.32/0.46 % Paramodulations : 559
% 0.32/0.46 % Factorizations : 18
% 0.32/0.46 % NegExts : 0
% 0.32/0.46 % Equation resolutions : 2
% 0.32/0.46 % Disequality decompositions : 0
% 0.32/0.46 % Total rewrite steps : 247
% 0.32/0.46 % ...of those cached : 196
% 0.32/0.46 % Propositional unsat checks : 0
% 0.32/0.46 % Propositional check models : 0
% 0.32/0.46 % Propositional check unsatisfiable : 0
% 0.32/0.46 % Propositional clauses : 0
% 0.32/0.46 % Propositional clauses after purity: 0
% 0.32/0.46 % Propositional unsat core size : 0
% 0.32/0.46 % Propositional preprocessing time : 0.000
% 0.32/0.46 % Propositional encoding time : 0.000
% 0.32/0.46 % Propositional solver time : 0.000
% 0.32/0.46 % Success case prop preproc time : 0.000
% 0.32/0.46 % Success case prop encoding time : 0.000
% 0.32/0.46 % Success case prop solver time : 0.000
% 0.32/0.46 % Current number of processed clauses : 78
% 0.32/0.46 % Positive orientable unit clauses : 12
% 0.32/0.46 % Positive unorientable unit clauses: 1
% 0.32/0.46 % Negative unit clauses : 2
% 0.32/0.46 % Non-unit-clauses : 63
% 0.32/0.46 % Current number of unprocessed clauses: 239
% 0.32/0.46 % ...number of literals in the above : 701
% 0.32/0.46 % Current number of archived formulas : 0
% 0.32/0.46 % Current number of archived clauses : 25
% 0.32/0.46 % Clause-clause subsumption calls (NU) : 694
% 0.32/0.46 % Rec. Clause-clause subsumption calls : 514
% 0.32/0.46 % Non-unit clause-clause subsumptions : 98
% 0.32/0.46 % Unit Clause-clause subsumption calls : 27
% 0.32/0.46 % Rewrite failures with RHS unbound : 0
% 0.32/0.46 % BW rewrite match attempts : 29
% 0.32/0.46 % BW rewrite match successes : 11
% 0.32/0.46 % Condensation attempts : 0
% 0.32/0.46 % Condensation successes : 0
% 0.32/0.46 % Termbank termtop insertions : 7651
% 0.32/0.46 % Search garbage collected termcells : 355
% 0.32/0.46
% 0.32/0.46 % -------------------------------------------------
% 0.32/0.46 % User time : 0.012 s
% 0.32/0.46 % System time : 0.002 s
% 0.32/0.46 % Total time : 0.015 s
% 0.32/0.46 % Maximum resident set size: 3632 pages
% 0.32/0.46
% 0.32/0.46 % -------------------------------------------------
% 0.32/0.46 % User time : 0.049 s
% 0.32/0.46 % System time : 0.013 s
% 0.32/0.46 % Total time : 0.061 s
% 0.32/0.46 % Maximum resident set size: 4864 pages
% 0.32/0.46 % E exiting
%------------------------------------------------------------------------------