%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET592+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 : n012.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.07s 0.34s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 11 unt; 0 def)
% Number of atoms : 60 ( 13 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 58 ( 22 ~; 17 |; 13 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 37 ( 2 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_th51,conjecture,
! [X1,X2,X3] :
( ( intersection(X2,X3) = empty_set
& subset(X1,X3)
& subset(X1,X2) )
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_th51) ).
fof(intersection_of_subsets,axiom,
! [X1,X2,X3] :
( ( subset(X1,X3)
& subset(X1,X2) )
=> subset(X1,intersection(X2,X3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_of_subsets) ).
fof(empty_set_defn,axiom,
! [X1] : ~ member(X1,empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',empty_set_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(equal_defn,axiom,
! [X1,X2] :
( X1 = X2
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(c_0_5,negated_conjecture,
~ ! [X1,X2,X3] :
( ( intersection(X2,X3) = empty_set
& subset(X1,X3)
& subset(X1,X2) )
=> X1 = empty_set ),
inference(assume_negation,[status(cth)],[prove_th51]) ).
fof(c_0_6,plain,
! [X9,X10,X11] :
( subset(X9,intersection(X10,X11))
| ~ subset(X9,X11)
| ~ subset(X9,X10) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_of_subsets])])]) ).
fof(c_0_7,negated_conjecture,
( esk1_0 != empty_set
& intersection(esk2_0,esk3_0) = empty_set
& subset(esk1_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_5])])])]) ).
fof(c_0_8,plain,
! [X1] : ~ member(X1,empty_set),
inference(fof_simplification,[status(thm)],[empty_set_defn]) ).
cnf(c_0_9,plain,
( ~ subset(X1,X3)
| ~ subset(X1,X2)
| subset(X1,intersection(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
intersection(esk2_0,esk3_0) = empty_set,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X8] : ~ member(X8,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).
fof(c_0_12,plain,
! [X17,X18,X19,X20,X21] :
( ( subset(X20,X21)
| ~ member(esk4_2(X20,X21),X21) )
& ( subset(X20,X21)
| member(esk4_2(X20,X21),X20) )
& ( member(X19,X18)
| ~ member(X19,X17)
| ~ subset(X17,X18) ) ),
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_13,plain,
! [X23,X24] :
( ( X23 = X24
| ~ subset(X24,X23)
| ~ subset(X23,X24) )
& ( X23 != X24
| subset(X24,X23) )
& ( X23 != X24
| subset(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])]) ).
cnf(c_0_14,negated_conjecture,
( ~ subset(X1,esk2_0)
| ~ subset(X1,esk3_0)
| subset(X1,empty_set) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,negated_conjecture,
subset(esk1_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_16,negated_conjecture,
subset(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,plain,
( subset(X1,X2)
| member(esk4_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_19,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| X1 = X2 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
subset(esk1_0,empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).
cnf(c_0_21,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
esk1_0 != empty_set,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_23,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SET592+3 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.02 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.30 % Computer : n012.cluster.edu
% 0.04/0.30 % Model : x86_64 x86_64
% 0.04/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.30 % Memory : 8046.5625MB
% 0.04/0.30 % OS : Linux 6.8.0-71-generic
% 0.04/0.30 % CPULimit : 300
% 0.04/0.30 % WCLimit : 300
% 0.04/0.30 % DateTime : Mon Sep 21 05:27:38 UTC 2026
% 0.04/0.30 % CPUTime :
% 0.04/0.30 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.32 Running first-order theorem proving
% 0.07/0.32 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.07/0.34 % Version: 3.5.1
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % Starting new_bool_1 with 300s (1) cores
% 0.07/0.34 % Starting sh5l with 300s (1) cores
% 0.07/0.34 % new_bool_3 with pid 1638741 completed with status 0
% 0.07/0.34 % Result found by new_bool_3
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGUSS-FFSS22-SFFFFFNN
% 0.07/0.34 % partial match(1): FGUSS-FFSF22-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % SubtermCWHack with pid 1638744 completed with status 0
% 0.07/0.34 % Result found by SubtermCWHack
% 0.07/0.34 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.07/0.34 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.07/0.34 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.07/0.34 % Starting new_bool_3 with 300s (1) cores
% 0.07/0.34 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.07/0.34 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.07/0.34 % Search class: FGUSS-FFSS22-SFFFFFNN
% 0.07/0.34 % partial match(1): FGUSS-FFSF22-SFFFFFNN
% 0.07/0.34 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.07/0.34 % Starting SubtermCWHack with 31s (1) cores
% 0.07/0.34 % Preprocessing time : 0.001 s
% 0.07/0.34
% 0.07/0.34 % Proof found!
% 0.07/0.34 % SZS status Theorem
% 0.07/0.34 % SZS output start CNFRefutation
% See solution above
% 0.07/0.34 % Parsed axioms : 11
% 0.07/0.34 % Removed by relevancy pruning/SinE : 1
% 0.07/0.34 % Initial clauses : 22
% 0.07/0.34 % Removed in clause preprocessing : 2
% 0.07/0.34 % Initial clauses in saturation : 20
% 0.07/0.34 % Processed clauses : 37
% 0.07/0.34 % ...of these trivial : 0
% 0.07/0.34 % ...subsumed : 8
% 0.07/0.34 % ...remaining for further processing : 29
% 0.07/0.34 % Other redundant clauses eliminated : 2
% 0.07/0.34 % Clauses deleted for lack of memory : 0
% 0.07/0.34 % Backward-subsumed : 0
% 0.07/0.34 % Backward-rewritten : 0
% 0.07/0.34 % Generated clauses : 46
% 0.07/0.34 % ...of the previous two non-redundant : 34
% 0.07/0.34 % ...aggressively subsumed : 0
% 0.07/0.34 % Contextual simplify-reflections : 0
% 0.07/0.34 % Paramodulations : 42
% 0.07/0.34 % Factorizations : 2
% 0.07/0.34 % NegExts : 0
% 0.07/0.34 % Equation resolutions : 2
% 0.07/0.34 % Disequality decompositions : 0
% 0.07/0.34 % Total rewrite steps : 9
% 0.07/0.34 % ...of those cached : 3
% 0.07/0.34 % Propositional unsat checks : 0
% 0.07/0.34 % Propositional check models : 0
% 0.07/0.34 % Propositional check unsatisfiable : 0
% 0.07/0.34 % Propositional clauses : 0
% 0.07/0.34 % Propositional clauses after purity: 0
% 0.07/0.34 % Propositional unsat core size : 0
% 0.07/0.34 % Propositional preprocessing time : 0.000
% 0.07/0.34 % Propositional encoding time : 0.000
% 0.07/0.34 % Propositional solver time : 0.000
% 0.07/0.34 % Success case prop preproc time : 0.000
% 0.07/0.34 % Success case prop encoding time : 0.000
% 0.07/0.34 % Success case prop solver time : 0.000
% 0.07/0.34 % Current number of processed clauses : 27
% 0.07/0.34 % Positive orientable unit clauses : 6
% 0.07/0.34 % Positive unorientable unit clauses: 1
% 0.07/0.34 % Negative unit clauses : 2
% 0.07/0.34 % Non-unit-clauses : 18
% 0.07/0.34 % Current number of unprocessed clauses: 17
% 0.07/0.34 % ...number of literals in the above : 46
% 0.07/0.34 % Current number of archived formulas : 0
% 0.07/0.34 % Current number of archived clauses : 0
% 0.07/0.34 % Clause-clause subsumption calls (NU) : 20
% 0.07/0.34 % Rec. Clause-clause subsumption calls : 20
% 0.07/0.34 % Non-unit clause-clause subsumptions : 5
% 0.07/0.34 % Unit Clause-clause subsumption calls : 0
% 0.07/0.34 % Rewrite failures with RHS unbound : 0
% 0.07/0.34 % BW rewrite match attempts : 4
% 0.07/0.34 % BW rewrite match successes : 2
% 0.07/0.34 % Condensation attempts : 0
% 0.07/0.34 % Condensation successes : 0
% 0.07/0.34 % Termbank termtop insertions : 1630
% 0.07/0.34 % Search garbage collected termcells : 346
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.002 s
% 0.07/0.34 % System time : 0.003 s
% 0.07/0.34 % Total time : 0.005 s
% 0.07/0.34 % Maximum resident set size: 3584 pages
% 0.07/0.34
% 0.07/0.34 % -------------------------------------------------
% 0.07/0.34 % User time : 0.002 s
% 0.07/0.34 % System time : 0.006 s
% 0.07/0.34 % Total time : 0.008 s
% 0.07/0.34 % Maximum resident set size: 4608 pages
% 0.07/0.34 % E exiting
%------------------------------------------------------------------------------