%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET607+3 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:17:39 PM UTC 2026
% Result : Theorem 30.35s 4.30s
% Output : CNFRefutation 30.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 16 unt; 0 def)
% Number of atoms : 100 ( 14 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 88 ( 31 ~; 40 |; 11 &)
% ( 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 : 107 ( 9 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(subset_defn,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(difference_defn,axiom,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( ~ member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(commutativity_of_union,axiom,
! [X1,X2] : union(X1,X2) = union(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(prove_th79,conjecture,
! [X1,X2] : union(X1,difference(X2,X1)) = union(X1,X2),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th79) ).
fof(c_0_6,plain,
! [X6,X7,X8] :
( ( member(X8,union(X6,X7))
| ~ member(X8,X7) )
& ( member(X8,union(X6,X7))
| ~ member(X8,X6) )
& ( member(X8,X7)
| member(X8,X6)
| ~ member(X8,union(X6,X7)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
fof(c_0_7,plain,
! [X14,X15,X16,X17,X18] :
( ( subset(X17,X18)
| ~ member(esk3_2(X17,X18),X18) )
& ( subset(X17,X18)
| member(esk3_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,
! [X1,X2,X3] :
( member(X3,difference(X1,X2))
<=> ( ~ member(X3,X2)
& member(X3,X1) ) ),
inference(fof_simplification,[status(thm)],[difference_defn]) ).
cnf(c_0_9,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( subset(X1,X2)
| member(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X11,X12,X13] :
( ( member(X13,difference(X11,X12))
| member(X13,X12)
| ~ member(X13,X11) )
& ( ~ member(X13,difference(X11,X12))
| ~ member(X13,X12) )
& ( ~ member(X13,difference(X11,X12))
| member(X13,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
cnf(c_0_12,plain,
( ~ member(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( member(esk3_2(union(X1,X2),X3),X1)
| member(esk3_2(union(X1,X2),X3),X2)
| subset(union(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,X2)
| member(X1,union(X3,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,plain,
( ~ member(X1,X2)
| member(X1,union(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_16,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( member(esk3_2(union(X1,X2),X1),X2)
| subset(union(X1,X2),X1) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(esk3_2(X1,union(X2,X3)),X3)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
fof(c_0_19,plain,
! [X9,X10] : union(X9,X10) = union(X10,X9),
inference(variable_rename,[status(thm)],[commutativity_of_union]) ).
cnf(c_0_20,plain,
( ~ member(esk3_2(X1,union(X2,X3)),X2)
| subset(X1,union(X2,X3)) ),
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_21,plain,
( ~ member(X1,X2)
| member(X1,difference(X2,X3))
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_22,plain,
! [X27,X28] :
( ( X27 = X28
| ~ subset(X28,X27)
| ~ subset(X27,X28) )
& ( X27 != X28
| subset(X28,X27) )
& ( X27 != X28
| subset(X27,X28) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_23,plain,
( member(esk3_2(union(X1,difference(X2,X3)),X1),X2)
| subset(union(X1,difference(X2,X3)),X1) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
subset(X1,union(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_10]) ).
cnf(c_0_25,plain,
union(X1,X2) = union(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_26,plain,
( ~ member(esk3_2(X1,union(difference(X2,X3),X4)),X2)
| member(esk3_2(X1,union(difference(X2,X3),X4)),X3)
| subset(X1,union(difference(X2,X3),X4)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
( member(esk3_2(union(X1,X2),union(X3,X1)),X2)
| subset(union(X1,X2),union(X3,X1)) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_28,plain,
( ~ member(esk3_2(X1,union(X2,union(X3,X4))),X4)
| subset(X1,union(X2,union(X3,X4))) ),
inference(spm,[status(thm)],[c_0_18,c_0_14]) ).
cnf(c_0_29,plain,
( member(esk3_2(union(X1,X2),union(X1,X3)),X2)
| subset(union(X1,X2),union(X1,X3)) ),
inference(spm,[status(thm)],[c_0_20,c_0_13]) ).
cnf(c_0_30,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_31,plain,
subset(union(X1,difference(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_12,c_0_23]) ).
cnf(c_0_32,plain,
subset(X1,union(X1,X2)),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_33,negated_conjecture,
~ ! [X1,X2] : union(X1,difference(X2,X1)) = union(X1,X2),
inference(assume_negation,[status(cth)],[prove_th79]) ).
cnf(c_0_34,plain,
( member(esk3_2(union(X1,X2),union(difference(X2,X3),X1)),X3)
| subset(union(X1,X2),union(difference(X2,X3),X1)) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,plain,
subset(union(X1,X2),union(X1,union(X3,X2))),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
union(X1,difference(X1,X2)) = 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_37,negated_conjecture,
union(esk1_0,difference(esk2_0,esk1_0)) != union(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_33])])])]) ).
cnf(c_0_38,plain,
subset(union(X1,X2),union(X1,difference(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_34]),c_0_25]) ).
cnf(c_0_39,plain,
subset(union(X1,difference(X2,X3)),union(X1,X2)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,negated_conjecture,
union(esk1_0,difference(esk2_0,esk1_0)) != union(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
cnf(c_0_41,plain,
union(X1,difference(X2,X1)) = union(X1,X2),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_38]),c_0_39])]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET607+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n016.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 05:33:22 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 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
% 30.35/4.30 % Version: 3.5.1
% 30.35/4.30 % Preprocessing class: FSMSSMSSSSSNFFN.
% 30.35/4.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.35/4.30 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.35/4.30 % Starting new_bool_3 with 300s (1) cores
% 30.35/4.30 % Starting new_bool_1 with 300s (1) cores
% 30.35/4.30 % Starting sh5l with 300s (1) cores
% 30.35/4.30 % new_bool_1 with pid 1652809 completed with status 0
% 30.35/4.30 % Result found by new_bool_1
% 30.35/4.30 % Preprocessing class: FSMSSMSSSSSNFFN.
% 30.35/4.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.35/4.30 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.35/4.30 % Starting new_bool_3 with 300s (1) cores
% 30.35/4.30 % Starting new_bool_1 with 300s (1) cores
% 30.35/4.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 30.35/4.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.35/4.30 % Search class: FGHSS-FFSF22-SFFFFFNN
% 30.35/4.30 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.35/4.30 % Starting SubtermCWHack with 31s (1) cores
% 30.35/4.30 % SubtermCWHack with pid 1652815 completed with status 0
% 30.35/4.30 % Result found by SubtermCWHack
% 30.35/4.30 % Preprocessing class: FSMSSMSSSSSNFFN.
% 30.35/4.30 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 30.35/4.30 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 30.35/4.30 % Starting new_bool_3 with 300s (1) cores
% 30.35/4.30 % Starting new_bool_1 with 300s (1) cores
% 30.35/4.30 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 30.35/4.30 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 30.35/4.30 % Search class: FGHSS-FFSF22-SFFFFFNN
% 30.35/4.30 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 30.35/4.30 % Starting SubtermCWHack with 31s (1) cores
% 30.35/4.30 % Preprocessing time : 0.001 s
% 30.35/4.30
% 30.35/4.30 % Proof found!
% 30.35/4.30 % SZS status Theorem
% 30.35/4.30 % SZS output start CNFRefutation
% See solution above
% 30.35/4.30 % Parsed axioms : 8
% 30.35/4.30 % Removed by relevancy pruning/SinE : 0
% 30.35/4.30 % Initial clauses : 19
% 30.35/4.30 % Removed in clause preprocessing : 2
% 30.35/4.30 % Initial clauses in saturation : 17
% 30.35/4.30 % Processed clauses : 20198
% 30.35/4.30 % ...of these trivial : 1602
% 30.35/4.30 % ...subsumed : 17228
% 30.35/4.30 % ...remaining for further processing : 1368
% 30.35/4.30 % Other redundant clauses eliminated : 2
% 30.35/4.30 % Clauses deleted for lack of memory : 0
% 30.35/4.30 % Backward-subsumed : 9
% 30.35/4.30 % Backward-rewritten : 87
% 30.35/4.30 % Generated clauses : 335964
% 30.35/4.30 % ...of the previous two non-redundant : 245053
% 30.35/4.30 % ...aggressively subsumed : 0
% 30.35/4.30 % Contextual simplify-reflections : 3
% 30.35/4.30 % Paramodulations : 335022
% 30.35/4.30 % Factorizations : 940
% 30.35/4.30 % NegExts : 0
% 30.35/4.30 % Equation resolutions : 2
% 30.35/4.30 % Disequality decompositions : 0
% 30.35/4.30 % Total rewrite steps : 285188
% 30.35/4.30 % ...of those cached : 267409
% 30.35/4.30 % Propositional unsat checks : 0
% 30.35/4.30 % Propositional check models : 0
% 30.35/4.30 % Propositional check unsatisfiable : 0
% 30.35/4.30 % Propositional clauses : 0
% 30.35/4.30 % Propositional clauses after purity: 0
% 30.35/4.30 % Propositional unsat core size : 0
% 30.35/4.30 % Propositional preprocessing time : 0.000
% 30.35/4.30 % Propositional encoding time : 0.000
% 30.35/4.30 % Propositional solver time : 0.000
% 30.35/4.30 % Success case prop preproc time : 0.000
% 30.35/4.30 % Success case prop encoding time : 0.000
% 30.35/4.30 % Success case prop solver time : 0.000
% 30.35/4.30 % Current number of processed clauses : 1270
% 30.35/4.30 % Positive orientable unit clauses : 491
% 30.35/4.30 % Positive unorientable unit clauses: 19
% 30.35/4.30 % Negative unit clauses : 32
% 30.35/4.30 % Non-unit-clauses : 728
% 30.35/4.30 % Current number of unprocessed clauses: 224113
% 30.35/4.30 % ...number of literals in the above : 637904
% 30.35/4.30 % Current number of archived formulas : 0
% 30.35/4.30 % Current number of archived clauses : 96
% 30.35/4.30 % Clause-clause subsumption calls (NU) : 168432
% 30.35/4.30 % Rec. Clause-clause subsumption calls : 85095
% 30.35/4.30 % Non-unit clause-clause subsumptions : 8189
% 30.35/4.30 % Unit Clause-clause subsumption calls : 32756
% 30.35/4.30 % Rewrite failures with RHS unbound : 1491
% 30.35/4.30 % BW rewrite match attempts : 8798
% 30.35/4.30 % BW rewrite match successes : 179
% 30.35/4.30 % Condensation attempts : 0
% 30.35/4.30 % Condensation successes : 0
% 30.35/4.30 % Termbank termtop insertions : 5690674
% 30.35/4.30 % Search garbage collected termcells : 300
% 30.35/4.30
% 30.35/4.30 % -------------------------------------------------
% 30.35/4.30 % User time : 3.594 s
% 30.35/4.30 % System time : 0.189 s
% 30.35/4.30 % Total time : 3.783 s
% 30.35/4.30 % Maximum resident set size: 3632 pages
% 30.35/4.30
% 30.35/4.30 % -------------------------------------------------
% 30.35/4.30 % User time : 3.595 s
% 30.35/4.30 % System time : 0.194 s
% 30.35/4.30 % Total time : 3.789 s
% 30.35/4.30 % Maximum resident set size: 4608 pages
% 30.35/4.30 % E exiting
%------------------------------------------------------------------------------