%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : SEU337+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:29:02 PM UTC 2026
% Result : Theorem 5.74s 1.33s
% Output : CNFRefutation 5.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 22 ( 7 unt; 0 def)
% Number of atoms : 57 ( 4 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 57 ( 22 ~; 20 |; 4 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 24 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t17_tops_2,conjecture,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( open_subsets(X2,X1)
<=> closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t17_tops_2) ).
fof(involutiveness_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> complements_of_subsets(X1,complements_of_subsets(X1,X2)) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',involutiveness_k7_setfam_1) ).
fof(dt_k7_setfam_1,axiom,
! [X1,X2] :
( element(X2,powerset(powerset(X1)))
=> element(complements_of_subsets(X1,X2),powerset(powerset(X1))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k7_setfam_1) ).
fof(t16_tops_2,lemma,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( closed_subsets(X2,X1)
<=> open_subsets(complements_of_subsets(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_tops_2) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(powerset(the_carrier(X1))))
=> ( open_subsets(X2,X1)
<=> closed_subsets(complements_of_subsets(the_carrier(X1),X2),X1) ) ) ),
inference(assume_negation,[status(cth)],[t17_tops_2]) ).
fof(c_0_5,plain,
! [X36,X37] :
( complements_of_subsets(X36,complements_of_subsets(X36,X37)) = X37
| ~ element(X37,powerset(powerset(X36))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k7_setfam_1])])]) ).
fof(c_0_6,negated_conjecture,
( ( closed_subsets(complements_of_subsets(the_carrier(esk1_0),esk2_0),esk1_0)
| open_subsets(esk2_0,esk1_0) )
& ( ~ closed_subsets(complements_of_subsets(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ open_subsets(esk2_0,esk1_0) )
& element(esk2_0,powerset(powerset(the_carrier(esk1_0))))
& top_str(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
fof(c_0_7,plain,
! [X34,X35] :
( element(complements_of_subsets(X34,X35),powerset(powerset(X34)))
| ~ element(X35,powerset(powerset(X34))) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k7_setfam_1])])]) ).
fof(c_0_8,lemma,
! [X27,X28] :
( ( ~ top_str(X27)
| ~ element(X28,powerset(powerset(the_carrier(X27))))
| closed_subsets(X28,X27)
| ~ open_subsets(complements_of_subsets(the_carrier(X27),X28),X27) )
& ( ~ top_str(X27)
| ~ element(X28,powerset(powerset(the_carrier(X27))))
| open_subsets(complements_of_subsets(the_carrier(X27),X28),X27)
| ~ closed_subsets(X28,X27) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_tops_2])])])])]) ).
cnf(c_0_9,plain,
( ~ element(X1,powerset(powerset(X2)))
| complements_of_subsets(X2,complements_of_subsets(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_10,negated_conjecture,
element(esk2_0,powerset(powerset(the_carrier(esk1_0)))),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_11,plain,
( ~ element(X1,powerset(powerset(X2)))
| element(complements_of_subsets(X2,X1),powerset(powerset(X2))) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,lemma,
( ~ top_str(X1)
| ~ element(X2,powerset(powerset(the_carrier(X1))))
| ~ open_subsets(complements_of_subsets(the_carrier(X1),X2),X1)
| closed_subsets(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,negated_conjecture,
complements_of_subsets(the_carrier(esk1_0),complements_of_subsets(the_carrier(esk1_0),esk2_0)) = esk2_0,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
top_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_15,negated_conjecture,
element(complements_of_subsets(the_carrier(esk1_0),esk2_0),powerset(powerset(the_carrier(esk1_0)))),
inference(spm,[status(thm)],[c_0_11,c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( closed_subsets(complements_of_subsets(the_carrier(esk1_0),esk2_0),esk1_0)
| open_subsets(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_17,negated_conjecture,
( ~ closed_subsets(complements_of_subsets(the_carrier(esk1_0),esk2_0),esk1_0)
| ~ open_subsets(esk2_0,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_18,negated_conjecture,
closed_subsets(complements_of_subsets(the_carrier(esk1_0),esk2_0),esk1_0),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15])]),c_0_16]) ).
cnf(c_0_19,lemma,
( ~ top_str(X2)
| ~ element(X1,powerset(powerset(the_carrier(X2))))
| ~ closed_subsets(X1,X2)
| open_subsets(complements_of_subsets(the_carrier(X2),X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_20,negated_conjecture,
~ open_subsets(esk2_0,esk1_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_18]),c_0_13]),c_0_14]),c_0_15])]),c_0_20]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU337+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n013.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 06:12:51 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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
% 5.74/1.33 % Version: 3.5.1
% 5.74/1.33 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.74/1.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/1.33 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.74/1.33 % Starting new_bool_3 with 600s (2) cores
% 5.74/1.33 % Starting new_bool_1 with 600s (2) cores
% 5.74/1.33 % Starting sh5l with 300s (1) cores
% 5.74/1.33 % new_bool_1 with pid 102793 completed with status 0
% 5.74/1.33 % Result found by new_bool_1
% 5.74/1.33 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.74/1.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/1.33 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.74/1.33 % Starting new_bool_3 with 600s (2) cores
% 5.74/1.33 % Starting new_bool_1 with 600s (2) cores
% 5.74/1.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.74/1.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.74/1.33 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.74/1.33 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.74/1.33 % Starting SubtermCWHack with 55s (1) cores
% 5.74/1.33 % Starting new_bool_1 with 61s (1) cores
% 5.74/1.33 % new_bool_1 with pid 102796 completed with status 0
% 5.74/1.33 % Result found by new_bool_1
% 5.74/1.33 % Preprocessing class: FSLMSMSSSSSNFFN.
% 5.74/1.33 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.74/1.33 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 5.74/1.33 % Starting new_bool_3 with 600s (2) cores
% 5.74/1.33 % Starting new_bool_1 with 600s (2) cores
% 5.74/1.33 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 5.74/1.33 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.74/1.33 % Search class: FGHSM-SMLM32-MFFFFFNN
% 5.74/1.33 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 5.74/1.33 % Starting SubtermCWHack with 55s (1) cores
% 5.74/1.33 % Starting new_bool_1 with 61s (1) cores
% 5.74/1.33 % Preprocessing time : 0.030 s
% 5.74/1.33 % Presaturation interreduction done
% 5.74/1.33
% 5.74/1.33 % Proof found!
% 5.74/1.33 % SZS status Theorem
% 5.74/1.33 % SZS output start CNFRefutation
% See solution above
% 5.74/1.33 % Parsed axioms : 556
% 5.74/1.33 % Removed by relevancy pruning/SinE : 344
% 5.74/1.33 % Initial clauses : 1452
% 5.74/1.33 % Removed in clause preprocessing : 2
% 5.74/1.33 % Initial clauses in saturation : 1450
% 5.74/1.33 % Processed clauses : 2844
% 5.74/1.33 % ...of these trivial : 20
% 5.74/1.33 % ...subsumed : 498
% 5.74/1.33 % ...remaining for further processing : 2326
% 5.74/1.33 % Other redundant clauses eliminated : 753
% 5.74/1.33 % Clauses deleted for lack of memory : 0
% 5.74/1.33 % Backward-subsumed : 15
% 5.74/1.33 % Backward-rewritten : 29
% 5.74/1.33 % Generated clauses : 3201
% 5.74/1.33 % ...of the previous two non-redundant : 2856
% 5.74/1.33 % ...aggressively subsumed : 0
% 5.74/1.33 % Contextual simplify-reflections : 270
% 5.74/1.33 % Paramodulations : 2635
% 5.74/1.33 % Factorizations : 0
% 5.74/1.33 % NegExts : 0
% 5.74/1.33 % Equation resolutions : 755
% 5.74/1.33 % Disequality decompositions : 0
% 5.74/1.33 % Total rewrite steps : 518
% 5.74/1.33 % ...of those cached : 394
% 5.74/1.33 % Propositional unsat checks : 0
% 5.74/1.33 % Propositional check models : 0
% 5.74/1.33 % Propositional check unsatisfiable : 0
% 5.74/1.33 % Propositional clauses : 0
% 5.74/1.33 % Propositional clauses after purity: 0
% 5.74/1.33 % Propositional unsat core size : 0
% 5.74/1.33 % Propositional preprocessing time : 0.000
% 5.74/1.33 % Propositional encoding time : 0.000
% 5.74/1.33 % Propositional solver time : 0.000
% 5.74/1.33 % Success case prop preproc time : 0.000
% 5.74/1.33 % Success case prop encoding time : 0.000
% 5.74/1.33 % Success case prop solver time : 0.000
% 5.74/1.33 % Current number of processed clauses : 423
% 5.74/1.33 % Positive orientable unit clauses : 107
% 5.74/1.33 % Positive unorientable unit clauses: 3
% 5.74/1.33 % Negative unit clauses : 75
% 5.74/1.33 % Non-unit-clauses : 238
% 5.74/1.33 % Current number of unprocessed clauses: 2804
% 5.74/1.33 % ...number of literals in the above : 10807
% 5.74/1.33 % Current number of archived formulas : 0
% 5.74/1.33 % Current number of archived clauses : 1395
% 5.74/1.33 % Clause-clause subsumption calls (NU) : 1196115
% 5.74/1.33 % Rec. Clause-clause subsumption calls : 51652
% 5.74/1.33 % Non-unit clause-clause subsumptions : 513
% 5.74/1.33 % Unit Clause-clause subsumption calls : 1205
% 5.74/1.33 % Rewrite failures with RHS unbound : 0
% 5.74/1.33 % BW rewrite match attempts : 105
% 5.74/1.33 % BW rewrite match successes : 49
% 5.74/1.33 % Condensation attempts : 0
% 5.74/1.33 % Condensation successes : 0
% 5.74/1.33 % Termbank termtop insertions : 165469
% 5.74/1.33 % Search garbage collected termcells : 19918
% 5.74/1.33
% 5.74/1.33 % -------------------------------------------------
% 5.74/1.33 % User time : 0.855 s
% 5.74/1.33 % System time : 0.021 s
% 5.74/1.33 % Total time : 0.876 s
% 5.74/1.33 % Maximum resident set size: 7204 pages
% 5.74/1.33
% 5.74/1.33 % -------------------------------------------------
% 5.74/1.33 % User time : 1.691 s
% 5.74/1.33 % System time : 0.054 s
% 5.74/1.33 % Total time : 1.745 s
% 5.74/1.33 % Maximum resident set size: 5376 pages
% 5.74/1.33 % E exiting
%------------------------------------------------------------------------------