%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET593+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 : n019.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:25 PM UTC 2026
% Result : Theorem 0.27s 0.66s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 29 ( 4 unt; 0 def)
% Number of atoms : 81 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 84 ( 32 ~; 34 |; 11 &)
% ( 4 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 2 sgn 29 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th52,conjecture,
! [X1,X2,X3] :
( subset(X1,union(X2,X3))
=> ( subset(difference(X1,X3),X2)
& subset(difference(X1,X2),X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th52) ).
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(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(c_0_4,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,union(X2,X3))
=> ( subset(difference(X1,X3),X2)
& subset(difference(X1,X2),X3) ) ),
inference(assume_negation,[status(cth)],[prove_th52]) ).
fof(c_0_5,plain,
! [X7,X8,X9,X10,X11] :
( ( subset(X10,X11)
| ~ member(esk4_2(X10,X11),X11) )
& ( subset(X10,X11)
| member(esk4_2(X10,X11),X10) )
& ( member(X9,X8)
| ~ member(X9,X7)
| ~ subset(X7,X8) ) ),
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_6,negated_conjecture,
( ( ~ subset(difference(esk1_0,esk3_0),esk2_0)
| ~ subset(difference(esk1_0,esk2_0),esk3_0) )
& subset(esk1_0,union(esk2_0,esk3_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,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_8,plain,
! [X17,X18,X19] :
( ( member(X19,union(X17,X18))
| ~ member(X19,X18) )
& ( member(X19,union(X17,X18))
| ~ member(X19,X17) )
& ( member(X19,X18)
| member(X19,X17)
| ~ member(X19,union(X17,X18)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])]) ).
cnf(c_0_9,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
subset(esk1_0,union(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,plain,
! [X14,X15,X16] :
( ( member(X16,difference(X14,X15))
| member(X16,X15)
| ~ member(X16,X14) )
& ( ~ member(X16,difference(X14,X15))
| ~ member(X16,X15) )
& ( ~ member(X16,difference(X14,X15))
| member(X16,X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_12,plain,
( ~ member(X1,union(X2,X3))
| member(X1,X3)
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,union(esk2_0,esk3_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,plain,
( ~ member(esk4_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_17,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk2_0)
| member(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( ~ member(esk4_2(difference(X1,X2),X3),X2)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ member(esk4_2(X1,esk3_0),esk1_0)
| member(esk4_2(X1,esk3_0),esk2_0)
| subset(X1,esk3_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,negated_conjecture,
( ~ member(esk4_2(difference(X1,esk2_0),esk3_0),esk1_0)
| subset(difference(X1,esk2_0),esk3_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
( member(esk4_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( ~ member(esk4_2(difference(X1,esk3_0),X2),esk1_0)
| member(esk4_2(difference(X1,esk3_0),X2),esk2_0)
| subset(difference(X1,esk3_0),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_24,negated_conjecture,
( ~ subset(difference(esk1_0,esk3_0),esk2_0)
| ~ subset(difference(esk1_0,esk2_0),esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_25,negated_conjecture,
subset(difference(esk1_0,esk2_0),esk3_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_26,negated_conjecture,
( ~ member(esk4_2(difference(X1,esk3_0),esk2_0),esk1_0)
| subset(difference(X1,esk3_0),esk2_0) ),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_27,negated_conjecture,
~ subset(difference(esk1_0,esk3_0),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
cnf(c_0_28,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_22]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SET593+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n019.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 05:28:05 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.55 Running first-order theorem proving
% 0.27/0.55 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
% 0.27/0.66 % Version: 3.5.1
% 0.27/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.27/0.66 % Starting sh5l with 300s (1) cores
% 0.27/0.66 % new_bool_3 with pid 1769911 completed with status 0
% 0.27/0.66 % Result found by new_bool_3
% 0.27/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.66 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.27/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.66 % SubtermCWHack with pid 1769915 completed with status 0
% 0.27/0.66 % Result found by SubtermCWHack
% 0.27/0.66 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.27/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.27/0.66 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.27/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.27/0.66 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.27/0.66 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.27/0.66 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.27/0.66 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.27/0.66 % Starting SubtermCWHack with 31s (1) cores
% 0.27/0.66 % Preprocessing time : 0.001 s
% 0.27/0.66
% 0.27/0.66 % Proof found!
% 0.27/0.66 % SZS status Theorem
% 0.27/0.66 % SZS output start CNFRefutation
% See solution above
% 0.27/0.66 % Parsed axioms : 7
% 0.27/0.66 % Removed by relevancy pruning/SinE : 0
% 0.27/0.66 % Initial clauses : 17
% 0.27/0.66 % Removed in clause preprocessing : 2
% 0.27/0.66 % Initial clauses in saturation : 15
% 0.27/0.66 % Processed clauses : 516
% 0.27/0.66 % ...of these trivial : 87
% 0.27/0.66 % ...subsumed : 218
% 0.27/0.66 % ...remaining for further processing : 211
% 0.27/0.66 % Other redundant clauses eliminated : 0
% 0.27/0.66 % Clauses deleted for lack of memory : 0
% 0.27/0.66 % Backward-subsumed : 0
% 0.27/0.66 % Backward-rewritten : 1
% 0.27/0.66 % Generated clauses : 3048
% 0.27/0.66 % ...of the previous two non-redundant : 2844
% 0.27/0.66 % ...aggressively subsumed : 0
% 0.27/0.66 % Contextual simplify-reflections : 0
% 0.27/0.66 % Paramodulations : 3016
% 0.27/0.66 % Factorizations : 32
% 0.27/0.66 % NegExts : 0
% 0.27/0.66 % Equation resolutions : 0
% 0.27/0.66 % Disequality decompositions : 0
% 0.27/0.66 % Total rewrite steps : 277
% 0.27/0.66 % ...of those cached : 157
% 0.27/0.66 % Propositional unsat checks : 0
% 0.27/0.66 % Propositional check models : 0
% 0.27/0.66 % Propositional check unsatisfiable : 0
% 0.27/0.66 % Propositional clauses : 0
% 0.27/0.66 % Propositional clauses after purity: 0
% 0.27/0.66 % Propositional unsat core size : 0
% 0.27/0.66 % Propositional preprocessing time : 0.000
% 0.27/0.66 % Propositional encoding time : 0.000
% 0.27/0.66 % Propositional solver time : 0.000
% 0.27/0.66 % Success case prop preproc time : 0.000
% 0.27/0.66 % Success case prop encoding time : 0.000
% 0.27/0.66 % Success case prop solver time : 0.000
% 0.27/0.66 % Current number of processed clauses : 210
% 0.27/0.66 % Positive orientable unit clauses : 80
% 0.27/0.66 % Positive unorientable unit clauses: 1
% 0.27/0.66 % Negative unit clauses : 1
% 0.27/0.66 % Non-unit-clauses : 128
% 0.27/0.66 % Current number of unprocessed clauses: 2341
% 0.27/0.66 % ...number of literals in the above : 6444
% 0.27/0.66 % Current number of archived formulas : 0
% 0.27/0.66 % Current number of archived clauses : 1
% 0.27/0.66 % Clause-clause subsumption calls (NU) : 4185
% 0.27/0.66 % Rec. Clause-clause subsumption calls : 3711
% 0.27/0.66 % Non-unit clause-clause subsumptions : 218
% 0.27/0.66 % Unit Clause-clause subsumption calls : 147
% 0.27/0.66 % Rewrite failures with RHS unbound : 0
% 0.27/0.66 % BW rewrite match attempts : 227
% 0.27/0.66 % BW rewrite match successes : 3
% 0.27/0.66 % Condensation attempts : 0
% 0.27/0.66 % Condensation successes : 0
% 0.27/0.66 % Termbank termtop insertions : 46162
% 0.27/0.66 % Search garbage collected termcells : 292
% 0.27/0.66
% 0.27/0.66 % -------------------------------------------------
% 0.27/0.66 % User time : 0.050 s
% 0.27/0.66 % System time : 0.003 s
% 0.27/0.66 % Total time : 0.053 s
% 0.27/0.66 % Maximum resident set size: 3632 pages
% 0.27/0.66
% 0.27/0.66 % -------------------------------------------------
% 0.27/0.66 % User time : 0.054 s
% 0.27/0.66 % System time : 0.008 s
% 0.27/0.66 % Total time : 0.062 s
% 0.27/0.66 % Maximum resident set size: 4608 pages
% 0.27/0.66 % E exiting
%------------------------------------------------------------------------------