%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SET947+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n003.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:50 PM UTC 2026
% Result : Theorem 0.16s 0.43s
% Output : CNFRefutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 19 ( 6 unt; 0 def)
% Number of atoms : 50 ( 6 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 51 ( 20 ~; 21 |; 5 &)
% ( 3 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 1 con; 0-2 aty)
% Number of variables : 39 ( 0 sgn 23 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d1_zfmisc_1,axiom,
! [X1,X2] :
( X2 = powerset(X1)
<=> ! [X3] :
( in(X3,X2)
<=> subset(X3,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(l50_zfmisc_1,axiom,
! [X1,X2] :
( in(X1,X2)
=> subset(X1,union(X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l50_zfmisc_1) ).
fof(t100_zfmisc_1,conjecture,
! [X1] : subset(X1,powerset(union(X1))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_zfmisc_1) ).
fof(c_0_4,plain,
! [X12,X13,X14,X15,X16,X17] :
( ( X17 = powerset(X16)
| subset(esk3_2(X16,X17),X16)
| in(esk3_2(X16,X17),X17) )
& ( X17 = powerset(X16)
| ~ subset(esk3_2(X16,X17),X16)
| ~ in(esk3_2(X16,X17),X17) )
& ( X13 != powerset(X12)
| in(X15,X13)
| ~ subset(X15,X12) )
& ( X13 != powerset(X12)
| subset(X14,X12)
| ~ in(X14,X13) ) ),
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)],[d1_zfmisc_1])])])])])])]) ).
fof(c_0_5,plain,
! [X5,X6,X7,X8,X9] :
( ( subset(X8,X9)
| ~ in(esk2_2(X8,X9),X9) )
& ( subset(X8,X9)
| in(esk2_2(X8,X9),X8) )
& ( in(X7,X6)
| ~ in(X7,X5)
| ~ subset(X5,X6) ) ),
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])])])])])])]) ).
cnf(c_0_6,plain,
( X3 != powerset(X2)
| ~ subset(X1,X2)
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
( ~ in(esk2_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ subset(X1,X2)
| in(X1,powerset(X2)) ),
inference(er,[status(thm)],[c_0_6]) ).
fof(c_0_9,plain,
! [X19,X20] :
( subset(X19,union(X20))
| ~ in(X19,X20) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[l50_zfmisc_1])])]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] : subset(X1,powerset(union(X1))),
inference(assume_negation,[status(cth)],[t100_zfmisc_1]) ).
cnf(c_0_11,plain,
( ~ subset(esk2_2(X1,powerset(X2)),X2)
| subset(X1,powerset(X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( ~ in(X1,X2)
| subset(X1,union(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
~ subset(esk1_0,powerset(union(esk1_0))),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_14,plain,
( ~ in(esk2_2(X1,powerset(union(X2))),X2)
| subset(X1,powerset(union(X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
( subset(X1,X2)
| in(esk2_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_16,negated_conjecture,
~ subset(esk1_0,powerset(union(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,plain,
subset(X1,powerset(union(X1))),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SET947+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n003.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 05:46:31 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.41 Running first-order theorem proving
% 0.16/0.41 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.43 % Version: 3.5.1
% 0.16/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.16/0.43 % Starting sh5l with 300s (1) cores
% 0.16/0.43 % new_bool_3 with pid 3535207 completed with status 0
% 0.16/0.43 % Result found by new_bool_3
% 0.16/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.43 % SubtermCWHack with pid 3535210 completed with status 0
% 0.16/0.43 % Result found by SubtermCWHack
% 0.16/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.16/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.16/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.16/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.16/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.16/0.43 % Search class: FGHSF-FFSF21-SFFFFFNN
% 0.16/0.43 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.16/0.43 % Starting SubtermCWHack with 31s (1) cores
% 0.16/0.43 % Preprocessing time : 0.001 s
% 0.16/0.43
% 0.16/0.43 % Proof found!
% 0.16/0.43 % SZS status Theorem
% 0.16/0.43 % SZS output start CNFRefutation
% See solution above
% 0.16/0.43 % Parsed axioms : 8
% 0.16/0.43 % Removed by relevancy pruning/SinE : 2
% 0.16/0.43 % Initial clauses : 11
% 0.16/0.43 % Removed in clause preprocessing : 0
% 0.16/0.43 % Initial clauses in saturation : 11
% 0.16/0.43 % Processed clauses : 35
% 0.16/0.43 % ...of these trivial : 0
% 0.16/0.43 % ...subsumed : 2
% 0.16/0.43 % ...remaining for further processing : 33
% 0.16/0.43 % Other redundant clauses eliminated : 2
% 0.16/0.43 % Clauses deleted for lack of memory : 0
% 0.16/0.43 % Backward-subsumed : 0
% 0.16/0.43 % Backward-rewritten : 1
% 0.16/0.43 % Generated clauses : 45
% 0.16/0.43 % ...of the previous two non-redundant : 37
% 0.16/0.43 % ...aggressively subsumed : 0
% 0.16/0.43 % Contextual simplify-reflections : 0
% 0.16/0.43 % Paramodulations : 43
% 0.16/0.43 % Factorizations : 0
% 0.16/0.43 % NegExts : 0
% 0.16/0.43 % Equation resolutions : 2
% 0.16/0.43 % Disequality decompositions : 0
% 0.16/0.43 % Total rewrite steps : 3
% 0.16/0.43 % ...of those cached : 0
% 0.16/0.43 % Propositional unsat checks : 0
% 0.16/0.43 % Propositional check models : 0
% 0.16/0.43 % Propositional check unsatisfiable : 0
% 0.16/0.43 % Propositional clauses : 0
% 0.16/0.43 % Propositional clauses after purity: 0
% 0.16/0.43 % Propositional unsat core size : 0
% 0.16/0.43 % Propositional preprocessing time : 0.000
% 0.16/0.43 % Propositional encoding time : 0.000
% 0.16/0.43 % Propositional solver time : 0.000
% 0.16/0.43 % Success case prop preproc time : 0.000
% 0.16/0.43 % Success case prop encoding time : 0.000
% 0.16/0.43 % Success case prop solver time : 0.000
% 0.16/0.43 % Current number of processed clauses : 30
% 0.16/0.43 % Positive orientable unit clauses : 2
% 0.16/0.43 % Positive unorientable unit clauses: 0
% 0.16/0.43 % Negative unit clauses : 7
% 0.16/0.43 % Non-unit-clauses : 21
% 0.16/0.43 % Current number of unprocessed clauses: 13
% 0.16/0.43 % ...number of literals in the above : 37
% 0.16/0.43 % Current number of archived formulas : 0
% 0.16/0.43 % Current number of archived clauses : 1
% 0.16/0.43 % Clause-clause subsumption calls (NU) : 46
% 0.16/0.43 % Rec. Clause-clause subsumption calls : 44
% 0.16/0.43 % Non-unit clause-clause subsumptions : 1
% 0.16/0.43 % Unit Clause-clause subsumption calls : 2
% 0.16/0.43 % Rewrite failures with RHS unbound : 0
% 0.16/0.43 % BW rewrite match attempts : 2
% 0.16/0.43 % BW rewrite match successes : 1
% 0.16/0.43 % Condensation attempts : 0
% 0.16/0.43 % Condensation successes : 0
% 0.16/0.43 % Termbank termtop insertions : 1401
% 0.16/0.43 % Search garbage collected termcells : 228
% 0.16/0.43
% 0.16/0.43 % -------------------------------------------------
% 0.16/0.43 % User time : 0.004 s
% 0.16/0.43 % System time : 0.004 s
% 0.16/0.43 % Total time : 0.008 s
% 0.16/0.43 % Maximum resident set size: 3636 pages
% 0.16/0.43
% 0.16/0.43 % -------------------------------------------------
% 0.16/0.43 % User time : 0.006 s
% 0.16/0.43 % System time : 0.008 s
% 0.16/0.43 % Total time : 0.014 s
% 0.16/0.43 % Maximum resident set size: 4864 pages
% 0.16/0.43 % E exiting
%------------------------------------------------------------------------------