%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET011+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:13:01 PM UTC 2026
% Result : Theorem 4.85s 1.11s
% Output : CNFRefutation 4.85s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 15 unt; 0 def)
% Number of atoms : 108 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 101 ( 39 ~; 44 |; 12 &)
% ( 5 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 117 ( 9 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( ~ member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
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(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(prove_difference_difference_intersection,conjecture,
! [X1,X2] : difference(X1,difference(X1,X2)) = intersection(X1,X2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_difference_intersection) ).
fof(commutativity_of_intersection,axiom,
! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(c_0_6,plain,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( ~ member(X3,X2)
& member(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
fof(c_0_7,plain,
! [X14,X15,X16,X17,X18] :
( ( subset(X17,X18)
| ~ member(esk1_2(X17,X18),X18) )
& ( subset(X17,X18)
| member(esk1_2(X17,X18),X17) )
& ( member(X16,X15)
| ~ member(X16,X14)
| ~ subset(X14,X15) ) ),
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,plain,
! [X7,X8,X9] :
( ( member(X9,difference(X7,X8))
| member(X9,X8)
| ~ member(X9,X7) )
& ( ~ member(X9,difference(X7,X8))
| ~ member(X9,X8) )
& ( ~ member(X9,difference(X7,X8))
| member(X9,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
cnf(c_0_9,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_10,plain,
( ~ member(X1,X2)
| member(X1,difference(X2,X3))
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X4,X5,X6] :
( ( member(X6,intersection(X4,X5))
| ~ member(X6,X5)
| ~ member(X6,X4) )
& ( ~ member(X6,intersection(X4,X5))
| member(X6,X5) )
& ( ~ member(X6,intersection(X4,X5))
| member(X6,X4) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])]) ).
cnf(c_0_12,plain,
( ~ member(esk1_2(X1,difference(X2,X3)),X2)
| member(esk1_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_14,plain,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,plain,
( ~ member(X1,intersection(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(esk1_2(X1,difference(X1,X2)),X2)
| subset(X1,difference(X1,X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_19,plain,
( ~ member(X1,X3)
| ~ member(X1,X2)
| member(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_20,plain,
( ~ member(esk1_2(difference(X1,X2),X3),X2)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_21,plain,
( member(esk1_2(intersection(X1,X2),X3),X1)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_22,plain,
( member(esk1_2(intersection(X1,X2),X3),X2)
| subset(intersection(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
fof(c_0_23,plain,
! [X10,X11] :
( ( X10 = X11
| ~ subset(X11,X10)
| ~ subset(X10,X11) )
& ( X10 != X11
| subset(X11,X10) )
& ( X10 != X11
| subset(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_24,plain,
( ~ member(esk1_2(X1,difference(X1,difference(X2,X3))),X3)
| subset(X1,difference(X1,difference(X2,X3))) ),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_25,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_26,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_19]) ).
cnf(c_0_27,plain,
( ~ member(esk1_2(difference(X1,difference(X2,X3)),X4),X2)
| member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)
| subset(difference(X1,difference(X2,X3)),X4) ),
inference(spm,[status(thm)],[c_0_20,c_0_10]) ).
cnf(c_0_28,plain,
( ~ member(esk1_2(intersection(difference(X1,X2),X3),X4),X2)
| subset(intersection(difference(X1,X2),X3),X4) ),
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_29,plain,
( member(esk1_2(intersection(X1,X2),difference(X2,X3)),X3)
| subset(intersection(X1,X2),difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_22]) ).
cnf(c_0_30,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_31,plain,
subset(X1,difference(X1,difference(X2,X1))),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_32,plain,
subset(difference(X1,X2),X1),
inference(spm,[status(thm)],[c_0_9,c_0_25]) ).
fof(c_0_33,negated_conjecture,
~ ! [X1,X2] : difference(X1,difference(X1,X2)) = intersection(X1,X2),
inference(assume_negation,[status(cth)],[prove_difference_difference_intersection]) ).
cnf(c_0_34,plain,
( ~ member(esk1_2(difference(X1,X2),intersection(X3,X1)),X3)
| subset(difference(X1,X2),intersection(X3,X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_25]) ).
cnf(c_0_35,plain,
( member(esk1_2(difference(X1,difference(X1,X2)),X3),X2)
| subset(difference(X1,difference(X1,X2)),X3) ),
inference(spm,[status(thm)],[c_0_27,c_0_25]) ).
cnf(c_0_36,plain,
subset(intersection(difference(X1,X2),X3),difference(X3,X2)),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
difference(X1,difference(X2,X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32])]) ).
fof(c_0_38,negated_conjecture,
difference(esk3_0,difference(esk3_0,esk4_0)) != intersection(esk3_0,esk4_0),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])]) ).
cnf(c_0_39,plain,
subset(difference(X1,difference(X1,X2)),intersection(X2,X1)),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_40,plain,
subset(intersection(X1,X2),difference(X2,difference(X3,X1))),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
fof(c_0_41,plain,
! [X12,X13] : intersection(X12,X13) = intersection(X13,X12),
inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).
cnf(c_0_42,negated_conjecture,
difference(esk3_0,difference(esk3_0,esk4_0)) != intersection(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_43,plain,
difference(X1,difference(X1,X2)) = intersection(X2,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_39]),c_0_40])]) ).
cnf(c_0_44,plain,
intersection(X1,X2) = intersection(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_41]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET011+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.10/0.37 % Computer : n015.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % 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 04:44:51 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/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
% 4.85/1.11 % Version: 3.5.1
% 4.85/1.11 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.85/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.85/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.85/1.11 % Starting new_bool_3 with 300s (1) cores
% 4.85/1.11 % Starting new_bool_1 with 300s (1) cores
% 4.85/1.11 % Starting sh5l with 300s (1) cores
% 4.85/1.11 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 582900 completed with status 0
% 4.85/1.11 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.85/1.11 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.85/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.85/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.85/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.85/1.11 % No SInE strategy applied
% 4.85/1.11 % Search class: FGHSS-FFSF22-SFFFFFNN
% 4.85/1.11 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.85/1.11 % Starting SubtermCWHack with 136s (1) cores
% 4.85/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.85/1.11 % Starting G----_0010_evo with 136s (1) cores
% 4.85/1.11 % Starting new_bool_3 with 136s (1) cores
% 4.85/1.11 % Starting new_bool_1 with 136s (1) cores
% 4.85/1.11 % SubtermCWHack with pid 582904 completed with status 0
% 4.85/1.11 % Result found by SubtermCWHack
% 4.85/1.11 % Preprocessing class: FSMSSMSSSSSNFFN.
% 4.85/1.11 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.85/1.11 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.85/1.11 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 4.85/1.11 % No SInE strategy applied
% 4.85/1.11 % Search class: FGHSS-FFSF22-SFFFFFNN
% 4.85/1.11 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 4.85/1.11 % Starting SubtermCWHack with 136s (1) cores
% 4.85/1.11 % Preprocessing time : 0.001 s
% 4.85/1.11
% 4.85/1.11 % Proof found!
% 4.85/1.11 % SZS status Theorem
% 4.85/1.11 % SZS output start CNFRefutation
% See solution above
% 4.85/1.11 % Parsed axioms : 8
% 4.85/1.11 % Removed by relevancy pruning/SinE : 0
% 4.85/1.11 % Initial clauses : 19
% 4.85/1.11 % Removed in clause preprocessing : 2
% 4.85/1.11 % Initial clauses in saturation : 17
% 4.85/1.11 % Processed clauses : 7197
% 4.85/1.11 % ...of these trivial : 373
% 4.85/1.11 % ...subsumed : 6235
% 4.85/1.11 % ...remaining for further processing : 589
% 4.85/1.11 % Other redundant clauses eliminated : 2
% 4.85/1.11 % Clauses deleted for lack of memory : 0
% 4.85/1.11 % Backward-subsumed : 3
% 4.85/1.11 % Backward-rewritten : 57
% 4.85/1.11 % Generated clauses : 87102
% 4.85/1.11 % ...of the previous two non-redundant : 54380
% 4.85/1.11 % ...aggressively subsumed : 0
% 4.85/1.11 % Contextual simplify-reflections : 6
% 4.85/1.11 % Paramodulations : 87004
% 4.85/1.11 % Factorizations : 96
% 4.85/1.11 % NegExts : 0
% 4.85/1.11 % Equation resolutions : 2
% 4.85/1.11 % Disequality decompositions : 0
% 4.85/1.11 % Total rewrite steps : 79866
% 4.85/1.11 % ...of those cached : 73425
% 4.85/1.11 % Propositional unsat checks : 0
% 4.85/1.11 % Propositional check models : 0
% 4.85/1.11 % Propositional check unsatisfiable : 0
% 4.85/1.11 % Propositional clauses : 0
% 4.85/1.11 % Propositional clauses after purity: 0
% 4.85/1.11 % Propositional unsat core size : 0
% 4.85/1.11 % Propositional preprocessing time : 0.000
% 4.85/1.11 % Propositional encoding time : 0.000
% 4.85/1.11 % Propositional solver time : 0.000
% 4.85/1.11 % Success case prop preproc time : 0.000
% 4.85/1.11 % Success case prop encoding time : 0.000
% 4.85/1.11 % Success case prop solver time : 0.000
% 4.85/1.11 % Current number of processed clauses : 527
% 4.85/1.11 % Positive orientable unit clauses : 192
% 4.85/1.11 % Positive unorientable unit clauses: 24
% 4.85/1.11 % Negative unit clauses : 25
% 4.85/1.11 % Non-unit-clauses : 286
% 4.85/1.11 % Current number of unprocessed clauses: 46818
% 4.85/1.11 % ...number of literals in the above : 91457
% 4.85/1.11 % Current number of archived formulas : 0
% 4.85/1.11 % Current number of archived clauses : 60
% 4.85/1.11 % Clause-clause subsumption calls (NU) : 14812
% 4.85/1.11 % Rec. Clause-clause subsumption calls : 10913
% 4.85/1.11 % Non-unit clause-clause subsumptions : 1047
% 4.85/1.11 % Unit Clause-clause subsumption calls : 5659
% 4.85/1.11 % Rewrite failures with RHS unbound : 1590
% 4.85/1.11 % BW rewrite match attempts : 3624
% 4.85/1.11 % BW rewrite match successes : 217
% 4.85/1.11 % Condensation attempts : 0
% 4.85/1.11 % Condensation successes : 0
% 4.85/1.11 % Termbank termtop insertions : 859820
% 4.85/1.11 % Search garbage collected termcells : 298
% 4.85/1.11
% 4.85/1.11 % -------------------------------------------------
% 4.85/1.11 % User time : 0.575 s
% 4.85/1.11 % System time : 0.035 s
% 4.85/1.11 % Total time : 0.609 s
% 4.85/1.11 % Maximum resident set size: 3632 pages
% 4.85/1.11
% 4.85/1.11 % -------------------------------------------------
% 4.85/1.11 % User time : 3.059 s
% 4.85/1.11 % System time : 0.182 s
% 4.85/1.11 % Total time : 3.240 s
% 4.85/1.11 % Maximum resident set size: 4864 pages
% 4.85/1.11 % E exiting
%------------------------------------------------------------------------------