%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET589+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 : n005.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:26 PM UTC 2026
% Result : Theorem 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 37 ( 15 ~; 12 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 43 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(transitivity_of_subset,axiom,
! [X1,X2,X3] :
( ( subset(X2,X3)
& subset(X1,X2) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',transitivity_of_subset) ).
fof(difference_subset2,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X3,X2),difference(X3,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_subset2) ).
fof(prove_th48,conjecture,
! [X1,X2,X3,X4] :
( ( subset(X3,X4)
& subset(X1,X2) )
=> subset(difference(X1,X4),difference(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th48) ).
fof(difference_subset1,axiom,
! [X1,X2,X3] :
( subset(X1,X2)
=> subset(difference(X1,X3),difference(X2,X3)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_subset1) ).
fof(c_0_4,plain,
! [X9,X10,X11] :
( subset(X9,X11)
| ~ subset(X10,X11)
| ~ subset(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[transitivity_of_subset])])]) ).
fof(c_0_5,plain,
! [X15,X16,X17] :
( subset(difference(X17,X16),difference(X17,X15))
| ~ subset(X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_subset2])])]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1,X2,X3,X4] :
( ( subset(X3,X4)
& subset(X1,X2) )
=> subset(difference(X1,X4),difference(X2,X3)) ),
inference(assume_negation,[status(cth)],[prove_th48]) ).
cnf(c_0_7,plain,
( ~ subset(X2,X3)
| ~ subset(X1,X2)
| subset(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,plain,
( ~ subset(X1,X2)
| subset(difference(X3,X2),difference(X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_9,plain,
! [X12,X13,X14] :
( subset(difference(X12,X14),difference(X13,X14))
| ~ subset(X12,X13) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[difference_subset1])])]) ).
fof(c_0_10,negated_conjecture,
( ~ subset(difference(esk1_0,esk4_0),difference(esk2_0,esk3_0))
& subset(esk3_0,esk4_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_6])])])]) ).
cnf(c_0_11,plain,
( ~ subset(X3,X4)
| ~ subset(X1,difference(X2,X4))
| subset(X1,difference(X2,X3)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ subset(X1,X2)
| subset(difference(X1,X3),difference(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,negated_conjecture,
~ subset(difference(esk1_0,esk4_0),difference(esk2_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_14,plain,
( ~ subset(X1,X3)
| ~ subset(X4,X2)
| subset(difference(X1,X2),difference(X3,X4)) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,negated_conjecture,
subset(esk3_0,esk4_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SET589+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.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Mon Sep 21 05:27:34 UTC 2026
% 0.15/0.37 % CPUTime :
% 0.15/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % new_bool_3 with pid 2641371 completed with status 0
% 0.15/0.44 % Result found by new_bool_3
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FHUNF-FFSF22-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 2641375 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FHUNF-FFSF22-SFFFFFNN
% 0.15/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Theorem
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 7
% 0.15/0.44 % Removed by relevancy pruning/SinE : 2
% 0.15/0.44 % Initial clauses : 7
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 7
% 0.15/0.44 % Processed clauses : 22
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 5
% 0.15/0.44 % ...remaining for further processing : 17
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 0
% 0.15/0.44 % Generated clauses : 35
% 0.15/0.44 % ...of the previous two non-redundant : 33
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 35
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 2
% 0.15/0.44 % ...of those cached : 0
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 17
% 0.15/0.44 % Positive orientable unit clauses : 3
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 1
% 0.15/0.44 % Non-unit-clauses : 13
% 0.15/0.44 % Current number of unprocessed clauses: 14
% 0.15/0.44 % ...number of literals in the above : 42
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 0
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 43
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 43
% 0.15/0.44 % Non-unit clause-clause subsumptions : 5
% 0.15/0.44 % Unit Clause-clause subsumption calls : 0
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 2
% 0.15/0.44 % BW rewrite match successes : 0
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 904
% 0.15/0.44 % Search garbage collected termcells : 110
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.005 s
% 0.15/0.44 % System time : 0.002 s
% 0.15/0.44 % Total time : 0.007 s
% 0.15/0.44 % Maximum resident set size: 3632 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.006 s
% 0.15/0.44 % System time : 0.007 s
% 0.15/0.44 % Total time : 0.012 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------