%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET941+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n010.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:15:49 PM UTC 2026
% Result : Theorem 0.14s 0.51s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 21 ( 2 unt; 0 def)
% Number of atoms : 74 ( 9 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 85 ( 32 ~; 36 |; 9 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-3 aty)
% Number of variables : 51 ( 0 sgn 26 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t94_zfmisc_1,conjecture,
! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> subset(X3,X2) )
=> subset(union(X1),X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t94_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(d4_tarski,axiom,
! [X1,X2] :
( X2 = union(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] :
( in(X4,X1)
& in(X3,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d4_tarski) ).
fof(c_0_3,negated_conjecture,
~ ! [X1,X2] :
( ! [X3] :
( in(X3,X1)
=> subset(X3,X2) )
=> subset(union(X1),X2) ),
inference(assume_negation,[status(cth)],[t94_zfmisc_1]) ).
fof(c_0_4,plain,
! [X8,X9,X10,X11,X12] :
( ( subset(X11,X12)
| ~ in(esk3_2(X11,X12),X12) )
& ( subset(X11,X12)
| in(esk3_2(X11,X12),X11) )
& ( in(X10,X9)
| ~ in(X10,X8)
| ~ subset(X8,X9) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_5,negated_conjecture,
! [X7] :
( ~ subset(union(esk1_0),esk2_0)
& ( subset(X7,esk2_0)
| ~ in(X7,esk1_0) ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])])]) ).
fof(c_0_6,plain,
! [X15,X16,X17,X19,X20,X21,X22,X24] :
( ( X22 = union(X21)
| in(esk5_2(X21,X22),X22)
| in(esk6_2(X21,X22),X21) )
& ( X22 = union(X21)
| in(esk5_2(X21,X22),X22)
| in(esk5_2(X21,X22),esk6_2(X21,X22)) )
& ( X22 = union(X21)
| ~ in(X24,X21)
| ~ in(esk5_2(X21,X22),X24)
| ~ in(esk5_2(X21,X22),X22) )
& ( X16 != union(X15)
| in(X19,X16)
| ~ in(X20,X15)
| ~ in(X19,X20) )
& ( X16 != union(X15)
| ~ in(X17,X16)
| in(esk4_3(X15,X16,X17),X15) )
& ( X16 != union(X15)
| ~ in(X17,X16)
| in(X17,esk4_3(X15,X16,X17)) ) ),
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)],[d4_tarski])])])])])])]) ).
cnf(c_0_7,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_8,negated_conjecture,
( ~ in(X1,esk1_0)
| subset(X1,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( X2 != union(X1)
| ~ in(X3,X2)
| in(esk4_3(X1,X2,X3),X1) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
( ~ in(X1,X2)
| ~ in(X2,esk1_0)
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( ~ in(X2,union(X1))
| in(esk4_3(X1,union(X1),X2),X1) ),
inference(er,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( X3 != union(X2)
| ~ in(X1,X3)
| in(X1,esk4_3(X2,X3,X1)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,negated_conjecture,
( ~ in(X2,union(esk1_0))
| ~ in(X1,esk4_3(esk1_0,union(esk1_0),X2))
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,plain,
( ~ in(X1,union(X2))
| in(X1,esk4_3(X2,union(X2),X1)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
( ~ in(X1,union(esk1_0))
| in(X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,plain,
( subset(X1,X2)
| in(esk3_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_17,plain,
( ~ in(esk3_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_18,negated_conjecture,
( in(esk3_2(union(esk1_0),X1),esk2_0)
| subset(union(esk1_0),X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
~ subset(union(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET941+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n010.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.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 05:44:55 UTC 2026
% 0.11/0.36 % CPUTime :
% 0.11/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.43 Running first-order theorem proving
% 0.14/0.43 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.14/0.51 % Version: 3.5.1
% 0.14/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.51 % Starting sh5l with 300s (1) cores
% 0.14/0.51 % new_bool_3 with pid 145157 completed with status 0
% 0.14/0.51 % Result found by new_bool_3
% 0.14/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.14/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.51 % SubtermCWHack with pid 145163 completed with status 0
% 0.14/0.51 % Result found by SubtermCWHack
% 0.14/0.51 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.51 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.51 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.51 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.51 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.51 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.51 % Search class: FGHSF-FFSF32-SFFFFFNN
% 0.14/0.51 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.51 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.51 % Preprocessing time : 0.001 s
% 0.14/0.51
% 0.14/0.51 % Proof found!
% 0.14/0.51 % SZS status Theorem
% 0.14/0.51 % SZS output start CNFRefutation
% See solution above
% 0.14/0.51 % Parsed axioms : 7
% 0.14/0.51 % Removed by relevancy pruning/SinE : 2
% 0.14/0.51 % Initial clauses : 13
% 0.14/0.51 % Removed in clause preprocessing : 0
% 0.14/0.51 % Initial clauses in saturation : 13
% 0.14/0.51 % Processed clauses : 26
% 0.14/0.51 % ...of these trivial : 0
% 0.14/0.51 % ...subsumed : 1
% 0.14/0.51 % ...remaining for further processing : 25
% 0.14/0.51 % Other redundant clauses eliminated : 3
% 0.14/0.51 % Clauses deleted for lack of memory : 0
% 0.14/0.51 % Backward-subsumed : 0
% 0.14/0.51 % Backward-rewritten : 0
% 0.14/0.51 % Generated clauses : 42
% 0.14/0.51 % ...of the previous two non-redundant : 39
% 0.14/0.51 % ...aggressively subsumed : 0
% 0.14/0.51 % Contextual simplify-reflections : 0
% 0.14/0.51 % Paramodulations : 39
% 0.14/0.51 % Factorizations : 0
% 0.14/0.51 % NegExts : 0
% 0.14/0.51 % Equation resolutions : 3
% 0.14/0.51 % Disequality decompositions : 0
% 0.14/0.51 % Total rewrite steps : 1
% 0.14/0.51 % ...of those cached : 0
% 0.14/0.51 % Propositional unsat checks : 0
% 0.14/0.51 % Propositional check models : 0
% 0.14/0.51 % Propositional check unsatisfiable : 0
% 0.14/0.51 % Propositional clauses : 0
% 0.14/0.51 % Propositional clauses after purity: 0
% 0.14/0.51 % Propositional unsat core size : 0
% 0.14/0.51 % Propositional preprocessing time : 0.000
% 0.14/0.51 % Propositional encoding time : 0.000
% 0.14/0.51 % Propositional solver time : 0.000
% 0.14/0.51 % Success case prop preproc time : 0.000
% 0.14/0.51 % Success case prop encoding time : 0.000
% 0.14/0.51 % Success case prop solver time : 0.000
% 0.14/0.51 % Current number of processed clauses : 22
% 0.14/0.51 % Positive orientable unit clauses : 1
% 0.14/0.51 % Positive unorientable unit clauses: 0
% 0.14/0.51 % Negative unit clauses : 3
% 0.14/0.51 % Non-unit-clauses : 18
% 0.14/0.51 % Current number of unprocessed clauses: 24
% 0.14/0.51 % ...number of literals in the above : 81
% 0.14/0.51 % Current number of archived formulas : 0
% 0.14/0.51 % Current number of archived clauses : 0
% 0.14/0.51 % Clause-clause subsumption calls (NU) : 59
% 0.14/0.51 % Rec. Clause-clause subsumption calls : 53
% 0.14/0.51 % Non-unit clause-clause subsumptions : 0
% 0.14/0.51 % Unit Clause-clause subsumption calls : 4
% 0.14/0.51 % Rewrite failures with RHS unbound : 0
% 0.14/0.51 % BW rewrite match attempts : 0
% 0.14/0.51 % BW rewrite match successes : 0
% 0.14/0.51 % Condensation attempts : 0
% 0.14/0.51 % Condensation successes : 0
% 0.14/0.51 % Termbank termtop insertions : 1544
% 0.14/0.51 % Search garbage collected termcells : 325
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.007 s
% 0.14/0.51 % System time : 0.004 s
% 0.14/0.51 % Total time : 0.011 s
% 0.14/0.51 % Maximum resident set size: 3632 pages
% 0.14/0.51
% 0.14/0.51 % -------------------------------------------------
% 0.14/0.51 % User time : 0.011 s
% 0.14/0.51 % System time : 0.008 s
% 0.14/0.51 % Total time : 0.019 s
% 0.14/0.51 % Maximum resident set size: 4864 pages
% 0.14/0.51 % E exiting
%------------------------------------------------------------------------------