%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET063+4 : 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 : 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:13:22 PM UTC 2026
% Result : Theorem 0.11s 0.42s
% Output : CNFRefutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 22 ( 12 unt; 0 def)
% Number of atoms : 51 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 51 ( 22 ~; 17 |; 8 &)
% ( 3 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 5 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(empty_set,axiom,
! [X3] : ~ member(X3,empty_set),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',empty_set) ).
fof(thI17,conjecture,
! [X1] : equal_set(intersection(X1,empty_set),empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',thI17) ).
fof(subset,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( member(X3,X1)
=> member(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',subset) ).
fof(intersection,axiom,
! [X3,X1,X2] :
( member(X3,intersection(X1,X2))
<=> ( member(X3,X2)
& member(X3,X1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',intersection) ).
fof(equal_set,axiom,
! [X1,X2] :
( equal_set(X1,X2)
<=> ( subset(X2,X1)
& subset(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SET006+0.ax',equal_set) ).
fof(c_0_5,plain,
! [X3] : ~ member(X3,empty_set),
inference(fof_simplification,[status(thm)],[empty_set]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] : equal_set(intersection(X1,empty_set),empty_set),
inference(assume_negation,[status(cth)],[thI17]) ).
fof(c_0_7,plain,
! [X9] : ~ member(X9,empty_set),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).
fof(c_0_8,plain,
! [X13,X14,X15,X16,X17] :
( ( subset(X16,X17)
| ~ member(esk2_2(X16,X17),X17) )
& ( subset(X16,X17)
| member(esk2_2(X16,X17),X16) )
& ( member(X15,X14)
| ~ member(X15,X13)
| ~ subset(X13,X14) ) ),
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])])])])])])]) ).
fof(c_0_9,plain,
! [X10,X11,X12] :
( ( member(X10,intersection(X11,X12))
| ~ member(X10,X12)
| ~ member(X10,X11) )
& ( ~ member(X10,intersection(X11,X12))
| member(X10,X12) )
& ( ~ member(X10,intersection(X11,X12))
| member(X10,X11) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection])])])]) ).
fof(c_0_10,negated_conjecture,
~ equal_set(intersection(esk1_0,empty_set),empty_set),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X7,X8] :
( ( equal_set(X7,X8)
| ~ subset(X8,X7)
| ~ subset(X7,X8) )
& ( ~ equal_set(X7,X8)
| subset(X8,X7) )
& ( ~ equal_set(X7,X8)
| subset(X7,X8) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])])]) ).
cnf(c_0_12,plain,
~ member(X1,empty_set),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_13,plain,
( subset(X1,X2)
| member(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( ~ member(X1,intersection(X3,X2))
| member(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,negated_conjecture,
~ equal_set(intersection(esk1_0,empty_set),empty_set),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( ~ subset(X2,X1)
| ~ subset(X1,X2)
| equal_set(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
subset(empty_set,X1),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,plain,
( subset(intersection(X1,X2),X3)
| member(esk2_2(intersection(X1,X2),X3),X2) ),
inference(spm,[status(thm)],[c_0_14,c_0_13]) ).
cnf(c_0_19,negated_conjecture,
~ subset(intersection(esk1_0,empty_set),empty_set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17])]) ).
cnf(c_0_20,plain,
subset(intersection(X1,empty_set),X2),
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET063+4 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n005.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 04:48:49 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42 % Version: 3.5.1
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % Starting new_bool_1 with 300s (1) cores
% 0.11/0.42 % Starting sh5l with 300s (1) cores
% 0.11/0.42 % new_bool_3 with pid 2586509 completed with status 0
% 0.11/0.42 % Result found by new_bool_3
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.11/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42 % SubtermCWHack with pid 2586512 completed with status 0
% 0.11/0.42 % Result found by SubtermCWHack
% 0.11/0.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.11/0.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.11/0.42 % Starting new_bool_3 with 300s (1) cores
% 0.11/0.42 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.42 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.42 % Search class: FGUNF-FFSF22-SFFFFFNN
% 0.11/0.42 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.42 % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.42 % Preprocessing time : 0.001 s
% 0.11/0.42
% 0.11/0.42 % Proof found!
% 0.11/0.42 % SZS status Theorem
% 0.11/0.42 % SZS output start CNFRefutation
% See solution above
% 0.11/0.42 % Parsed axioms : 12
% 0.11/0.42 % Removed by relevancy pruning/SinE : 7
% 0.11/0.42 % Initial clauses : 11
% 0.11/0.42 % Removed in clause preprocessing : 0
% 0.11/0.42 % Initial clauses in saturation : 11
% 0.11/0.42 % Processed clauses : 17
% 0.11/0.42 % ...of these trivial : 0
% 0.11/0.42 % ...subsumed : 1
% 0.11/0.42 % ...remaining for further processing : 16
% 0.11/0.42 % Other redundant clauses eliminated : 0
% 0.11/0.42 % Clauses deleted for lack of memory : 0
% 0.11/0.42 % Backward-subsumed : 0
% 0.11/0.42 % Backward-rewritten : 1
% 0.11/0.42 % Generated clauses : 17
% 0.11/0.42 % ...of the previous two non-redundant : 11
% 0.11/0.42 % ...aggressively subsumed : 0
% 0.11/0.42 % Contextual simplify-reflections : 0
% 0.11/0.42 % Paramodulations : 17
% 0.11/0.42 % Factorizations : 0
% 0.11/0.42 % NegExts : 0
% 0.11/0.42 % Equation resolutions : 0
% 0.11/0.42 % Disequality decompositions : 0
% 0.11/0.42 % Total rewrite steps : 2
% 0.11/0.42 % ...of those cached : 0
% 0.11/0.42 % Propositional unsat checks : 0
% 0.11/0.42 % Propositional check models : 0
% 0.11/0.42 % Propositional check unsatisfiable : 0
% 0.11/0.42 % Propositional clauses : 0
% 0.11/0.42 % Propositional clauses after purity: 0
% 0.11/0.42 % Propositional unsat core size : 0
% 0.11/0.42 % Propositional preprocessing time : 0.000
% 0.11/0.42 % Propositional encoding time : 0.000
% 0.11/0.42 % Propositional solver time : 0.000
% 0.11/0.42 % Success case prop preproc time : 0.000
% 0.11/0.42 % Success case prop encoding time : 0.000
% 0.11/0.42 % Success case prop solver time : 0.000
% 0.11/0.42 % Current number of processed clauses : 15
% 0.11/0.42 % Positive orientable unit clauses : 3
% 0.11/0.42 % Positive unorientable unit clauses: 0
% 0.11/0.42 % Negative unit clauses : 2
% 0.11/0.42 % Non-unit-clauses : 10
% 0.11/0.42 % Current number of unprocessed clauses: 5
% 0.11/0.42 % ...number of literals in the above : 10
% 0.11/0.42 % Current number of archived formulas : 0
% 0.11/0.42 % Current number of archived clauses : 1
% 0.11/0.42 % Clause-clause subsumption calls (NU) : 7
% 0.11/0.42 % Rec. Clause-clause subsumption calls : 7
% 0.11/0.42 % Non-unit clause-clause subsumptions : 0
% 0.11/0.42 % Unit Clause-clause subsumption calls : 8
% 0.11/0.42 % Rewrite failures with RHS unbound : 0
% 0.11/0.42 % BW rewrite match attempts : 3
% 0.11/0.42 % BW rewrite match successes : 1
% 0.11/0.42 % Condensation attempts : 0
% 0.11/0.42 % Condensation successes : 0
% 0.11/0.42 % Termbank termtop insertions : 875
% 0.11/0.42 % Search garbage collected termcells : 222
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.004 s
% 0.11/0.42 % System time : 0.002 s
% 0.11/0.42 % Total time : 0.006 s
% 0.11/0.42 % Maximum resident set size: 3648 pages
% 0.11/0.42
% 0.11/0.42 % -------------------------------------------------
% 0.11/0.42 % User time : 0.005 s
% 0.11/0.42 % System time : 0.005 s
% 0.11/0.42 % Total time : 0.010 s
% 0.11/0.42 % Maximum resident set size: 4864 pages
% 0.11/0.42 % E exiting
%------------------------------------------------------------------------------