%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET593+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 : n007.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:27 PM UTC 2026
% Result : Theorem 0.14s 0.48s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 4 unt; 0 def)
% Number of atoms : 78 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 78 ( 28 ~; 32 |; 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 : 57 ( 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/sandbox2/benchmark/theBenchmark.p',prove_th52) ).
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(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(union_defn,axiom,
! [X1,X2,X3] :
( member(X3,union(X1,X2))
<=> ( member(X3,X2)
| member(X3,X1) ) ),
file('/export/starexec/sandbox2/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,
! [X10,X11,X12,X13,X14] :
( ( subset(X13,X14)
| ~ member(esk1_2(X13,X14),X14) )
& ( subset(X13,X14)
| member(esk1_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_6,negated_conjecture,
( ( ~ subset(difference(esk3_0,esk5_0),esk4_0)
| ~ subset(difference(esk3_0,esk4_0),esk5_0) )
& subset(esk3_0,union(esk4_0,esk5_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,
! [X4,X5,X6] :
( ( member(X6,union(X4,X5))
| ~ member(X6,X5) )
& ( member(X6,union(X4,X5))
| ~ member(X6,X4) )
& ( member(X6,X5)
| member(X6,X4)
| ~ member(X6,union(X4,X5)) ) ),
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(esk3_0,union(esk4_0,esk5_0)),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_11,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_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,esk3_0)
| member(X1,union(esk4_0,esk5_0)) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| member(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
( ~ member(X1,esk3_0)
| member(X1,esk5_0)
| member(X1,esk4_0) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( member(esk1_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,plain,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_19,plain,
( ~ member(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
( member(esk1_2(difference(esk3_0,X1),X2),esk4_0)
| member(esk1_2(difference(esk3_0,X1),X2),esk5_0)
| subset(difference(esk3_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
( ~ member(esk1_2(difference(X1,X2),X3),X2)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_22,negated_conjecture,
( member(esk1_2(difference(esk3_0,X1),esk5_0),esk4_0)
| subset(difference(esk3_0,X1),esk5_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ subset(difference(esk3_0,esk5_0),esk4_0)
| ~ subset(difference(esk3_0,esk4_0),esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_24,negated_conjecture,
subset(difference(esk3_0,esk4_0),esk5_0),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( member(esk1_2(difference(esk3_0,esk5_0),X1),esk4_0)
| subset(difference(esk3_0,esk5_0),X1) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_26,negated_conjecture,
~ subset(difference(esk3_0,esk5_0),esk4_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]) ).
cnf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET593+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.10/0.37 % Computer : n007.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 05:25:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/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.14/0.48 % Version: 3.5.1
% 0.14/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.48 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.48 % Starting sh5l with 300s (1) cores
% 0.14/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 260131 completed with status 0
% 0.14/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.48 % Starting G----_0010_evo with 136s (1) cores
% 0.14/0.48 % Starting new_bool_3 with 136s (1) cores
% 0.14/0.48 % Starting new_bool_1 with 136s (1) cores
% 0.14/0.48 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 260139 completed with status 0
% 0.14/0.48 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.14/0.48 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.48 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.48 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/0.48 % No SInE strategy applied
% 0.14/0.48 % Search class: FGHSS-FFSF22-SFFFFFNN
% 0.14/0.48 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/0.48 % Starting SubtermCWHack with 136s (1) cores
% 0.14/0.48 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.14/0.48 % Preprocessing time : 0.001 s
% 0.14/0.48 % Presaturation interreduction done
% 0.14/0.48
% 0.14/0.48 % Proof found!
% 0.14/0.48 % SZS status Theorem
% 0.14/0.48 % SZS output start CNFRefutation
% See solution above
% 0.14/0.48 % Parsed axioms : 7
% 0.14/0.48 % Removed by relevancy pruning/SinE : 0
% 0.14/0.48 % Initial clauses : 17
% 0.14/0.48 % Removed in clause preprocessing : 2
% 0.14/0.48 % Initial clauses in saturation : 15
% 0.14/0.48 % Processed clauses : 486
% 0.14/0.48 % ...of these trivial : 41
% 0.14/0.48 % ...subsumed : 189
% 0.14/0.48 % ...remaining for further processing : 256
% 0.14/0.48 % Other redundant clauses eliminated : 0
% 0.14/0.48 % Clauses deleted for lack of memory : 0
% 0.14/0.48 % Backward-subsumed : 0
% 0.14/0.48 % Backward-rewritten : 1
% 0.14/0.48 % Generated clauses : 3303
% 0.14/0.48 % ...of the previous two non-redundant : 3162
% 0.14/0.48 % ...aggressively subsumed : 0
% 0.14/0.48 % Contextual simplify-reflections : 11
% 0.14/0.48 % Paramodulations : 3265
% 0.14/0.48 % Factorizations : 38
% 0.14/0.48 % NegExts : 0
% 0.14/0.48 % Equation resolutions : 0
% 0.14/0.48 % Disequality decompositions : 0
% 0.14/0.48 % Total rewrite steps : 193
% 0.14/0.48 % ...of those cached : 99
% 0.14/0.48 % Propositional unsat checks : 0
% 0.14/0.48 % Propositional check models : 0
% 0.14/0.48 % Propositional check unsatisfiable : 0
% 0.14/0.48 % Propositional clauses : 0
% 0.14/0.48 % Propositional clauses after purity: 0
% 0.14/0.48 % Propositional unsat core size : 0
% 0.14/0.48 % Propositional preprocessing time : 0.000
% 0.14/0.48 % Propositional encoding time : 0.000
% 0.14/0.48 % Propositional solver time : 0.000
% 0.14/0.48 % Success case prop preproc time : 0.000
% 0.14/0.48 % Success case prop encoding time : 0.000
% 0.14/0.48 % Success case prop solver time : 0.000
% 0.14/0.48 % Current number of processed clauses : 240
% 0.14/0.48 % Positive orientable unit clauses : 79
% 0.14/0.48 % Positive unorientable unit clauses: 1
% 0.14/0.48 % Negative unit clauses : 1
% 0.14/0.48 % Non-unit-clauses : 159
% 0.14/0.48 % Current number of unprocessed clauses: 2697
% 0.14/0.48 % ...number of literals in the above : 8697
% 0.14/0.48 % Current number of archived formulas : 0
% 0.14/0.48 % Current number of archived clauses : 16
% 0.14/0.48 % Clause-clause subsumption calls (NU) : 3207
% 0.14/0.48 % Rec. Clause-clause subsumption calls : 2821
% 0.14/0.48 % Non-unit clause-clause subsumptions : 200
% 0.14/0.48 % Unit Clause-clause subsumption calls : 184
% 0.14/0.48 % Rewrite failures with RHS unbound : 0
% 0.14/0.48 % BW rewrite match attempts : 241
% 0.14/0.48 % BW rewrite match successes : 5
% 0.14/0.48 % Condensation attempts : 0
% 0.14/0.48 % Condensation successes : 0
% 0.14/0.48 % Termbank termtop insertions : 57364
% 0.14/0.48 % Search garbage collected termcells : 296
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.038 s
% 0.14/0.48 % System time : 0.005 s
% 0.14/0.48 % Total time : 0.043 s
% 0.14/0.48 % Maximum resident set size: 3632 pages
% 0.14/0.48
% 0.14/0.48 % -------------------------------------------------
% 0.14/0.48 % User time : 0.152 s
% 0.14/0.48 % System time : 0.021 s
% 0.14/0.48 % Total time : 0.173 s
% 0.14/0.48 % Maximum resident set size: 4864 pages
% 0.14/0.48 % E exiting
%------------------------------------------------------------------------------