%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SET588+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 : 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:24 PM UTC 2026
% Result : Theorem 0.16s 0.62s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 5 unt; 0 def)
% Number of atoms : 65 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 62 ( 24 ~; 25 |; 7 &)
% ( 3 <=>; 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 58 ( 4 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_difference_subset1,conjecture,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_difference_subset1) ).
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(c_0_3,negated_conjecture,
~ ! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_difference_subset1]) ).
fof(c_0_4,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_5,negated_conjecture,
( ~ subset(difference(esk1_0,esk3_0),difference(esk2_0,esk3_0))
& subset(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_3])])])]) ).
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]) ).
cnf(c_0_7,plain,
( ~ member(X3,X1)
| ~ subset(X1,X2)
| member(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,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_6])])])]) ).
cnf(c_0_10,plain,
( ~ member(esk4_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_11,negated_conjecture,
( ~ member(X1,esk1_0)
| member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ member(X1,difference(X2,X3))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_14,negated_conjecture,
( ~ member(esk4_2(X1,esk2_0),esk1_0)
| subset(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
( member(esk4_2(difference(X1,X2),X3),X1)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,negated_conjecture,
subset(difference(esk1_0,X1),esk2_0),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,plain,
( ~ member(X1,X2)
| member(X1,difference(X2,X3))
| member(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ member(X1,difference(esk1_0,X2))
| member(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_16]) ).
cnf(c_0_19,plain,
( ~ member(X1,difference(X3,X2))
| ~ member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( ~ member(esk4_2(X1,difference(X2,X3)),X2)
| member(esk4_2(X1,difference(X2,X3)),X3)
| subset(X1,difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_10,c_0_17]) ).
cnf(c_0_21,negated_conjecture,
( member(esk4_2(difference(esk1_0,X1),X2),esk2_0)
| subset(difference(esk1_0,X1),X2) ),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_22,plain,
( ~ member(esk4_2(difference(X1,X2),X3),X2)
| subset(difference(X1,X2),X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_13]) ).
cnf(c_0_23,negated_conjecture,
( member(esk4_2(difference(esk1_0,X1),difference(esk2_0,X2)),X2)
| subset(difference(esk1_0,X1),difference(esk2_0,X2)) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_24,negated_conjecture,
~ subset(difference(esk1_0,esk3_0),difference(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_25,negated_conjecture,
subset(difference(esk1_0,X1),difference(esk2_0,X1)),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET588+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.55 % Computer : n016.cluster.edu
% 0.10/0.55 % Model : x86_64 x86_64
% 0.10/0.55 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.55 % Memory : 8046.5625MB
% 0.10/0.55 % OS : Linux 6.8.0-71-generic
% 0.10/0.55 % CPULimit : 300
% 0.10/0.55 % WCLimit : 300
% 0.10/0.55 % DateTime : Mon Sep 21 05:32:24 UTC 2026
% 0.10/0.55 % CPUTime :
% 0.10/0.55 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.60 Running first-order theorem proving
% 0.16/0.60 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.16/0.62 % Version: 3.5.1
% 0.16/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % Starting sh5l with 300s (1) cores
% 0.16/0.62 % new_bool_1 with pid 1649646 completed with status 0
% 0.16/0.62 % Result found by new_bool_1
% 0.16/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.62 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.62 % SubtermCWHack with pid 1649653 completed with status 0
% 0.16/0.62 % Result found by SubtermCWHack
% 0.16/0.62 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.62 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.62 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.62 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.62 % Search class: FGHNF-FFSF22-SFFFFFNN
% 0.16/0.62 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.62 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.62 % Preprocessing time : 0.001 s
% 0.16/0.62
% 0.16/0.62 % Proof found!
% 0.16/0.62 % SZS status Theorem
% 0.16/0.62 % SZS output start CNFRefutation
% See solution above
% 0.16/0.62 % Parsed axioms : 4
% 0.16/0.62 % Removed by relevancy pruning/SinE : 0
% 0.16/0.62 % Initial clauses : 9
% 0.16/0.62 % Removed in clause preprocessing : 0
% 0.16/0.62 % Initial clauses in saturation : 9
% 0.16/0.62 % Processed clauses : 74
% 0.16/0.62 % ...of these trivial : 1
% 0.16/0.62 % ...subsumed : 25
% 0.16/0.62 % ...remaining for further processing : 48
% 0.16/0.62 % Other redundant clauses eliminated : 0
% 0.16/0.62 % Clauses deleted for lack of memory : 0
% 0.16/0.62 % Backward-subsumed : 0
% 0.16/0.62 % Backward-rewritten : 1
% 0.16/0.62 % Generated clauses : 158
% 0.16/0.62 % ...of the previous two non-redundant : 138
% 0.16/0.62 % ...aggressively subsumed : 0
% 0.16/0.62 % Contextual simplify-reflections : 0
% 0.16/0.62 % Paramodulations : 158
% 0.16/0.62 % Factorizations : 0
% 0.16/0.62 % NegExts : 0
% 0.16/0.62 % Equation resolutions : 0
% 0.16/0.62 % Disequality decompositions : 0
% 0.16/0.62 % Total rewrite steps : 15
% 0.16/0.62 % ...of those cached : 3
% 0.16/0.62 % Propositional unsat checks : 0
% 0.16/0.62 % Propositional check models : 0
% 0.16/0.62 % Propositional check unsatisfiable : 0
% 0.16/0.62 % Propositional clauses : 0
% 0.16/0.62 % Propositional clauses after purity: 0
% 0.16/0.62 % Propositional unsat core size : 0
% 0.16/0.62 % Propositional preprocessing time : 0.000
% 0.16/0.62 % Propositional encoding time : 0.000
% 0.16/0.62 % Propositional solver time : 0.000
% 0.16/0.62 % Success case prop preproc time : 0.000
% 0.16/0.62 % Success case prop encoding time : 0.000
% 0.16/0.62 % Success case prop solver time : 0.000
% 0.16/0.62 % Current number of processed clauses : 47
% 0.16/0.62 % Positive orientable unit clauses : 16
% 0.16/0.62 % Positive unorientable unit clauses: 0
% 0.16/0.62 % Negative unit clauses : 0
% 0.16/0.62 % Non-unit-clauses : 31
% 0.16/0.62 % Current number of unprocessed clauses: 73
% 0.16/0.62 % ...number of literals in the above : 157
% 0.16/0.62 % Current number of archived formulas : 0
% 0.16/0.62 % Current number of archived clauses : 1
% 0.16/0.62 % Clause-clause subsumption calls (NU) : 219
% 0.16/0.62 % Rec. Clause-clause subsumption calls : 213
% 0.16/0.62 % Non-unit clause-clause subsumptions : 25
% 0.16/0.62 % Unit Clause-clause subsumption calls : 27
% 0.16/0.62 % Rewrite failures with RHS unbound : 0
% 0.16/0.62 % BW rewrite match attempts : 30
% 0.16/0.62 % BW rewrite match successes : 1
% 0.16/0.62 % Condensation attempts : 0
% 0.16/0.62 % Condensation successes : 0
% 0.16/0.62 % Termbank termtop insertions : 2825
% 0.16/0.62 % Search garbage collected termcells : 140
% 0.16/0.62
% 0.16/0.62 % -------------------------------------------------
% 0.16/0.62 % User time : 0.006 s
% 0.16/0.62 % System time : 0.001 s
% 0.16/0.62 % Total time : 0.008 s
% 0.16/0.62 % Maximum resident set size: 3628 pages
% 0.16/0.62
% 0.16/0.62 % -------------------------------------------------
% 0.16/0.62 % User time : 0.008 s
% 0.16/0.62 % System time : 0.005 s
% 0.16/0.62 % Total time : 0.013 s
% 0.16/0.62 % Maximum resident set size: 4608 pages
% 0.16/0.62 % E exiting
%------------------------------------------------------------------------------