%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU341+2 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n019.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:24:46 PM UTC 2026
% Result : Theorem 18.32s 4.41s
% Output : CNFRefutation 18.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 7
% Syntax : Number of formulae : 37 ( 13 unt; 0 def)
% Number of atoms : 139 ( 11 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 160 ( 58 ~; 46 |; 25 &)
% ( 3 <=>; 28 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-2 aty)
% Number of variables : 51 ( 0 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t5_connsp_2,conjecture,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( in(X3,X2)
& open_subset(X2,X1) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t5_connsp_2) ).
fof(d1_connsp_2,axiom,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( point_neighbourhood(X3,X1,X2)
<=> in(X2,interior(X1,X3)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_connsp_2) ).
fof(d1_tops_1,axiom,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tops_1) ).
fof(t30_tops_1,lemma,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( open_subset(X2,X1)
<=> closed_subset(subset_complement(the_carrier(X1),X2),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_tops_1) ).
fof(t52_pre_topc,lemma,
! [X1] :
( top_str(X1)
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ( ( ( topstr_closure(X1,X2) = X2
& topological_space(X1) )
=> closed_subset(X2,X1) )
& ( closed_subset(X2,X1)
=> topstr_closure(X1,X2) = X2 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t52_pre_topc) ).
fof(involutiveness_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> subset_complement(X1,subset_complement(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
fof(dt_k3_subset_1,axiom,
! [X1,X2] :
( element(X2,powerset(X1))
=> element(subset_complement(X1,X2),powerset(X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).
fof(c_0_7,negated_conjecture,
~ ! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( in(X3,X2)
& open_subset(X2,X1) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
inference(assume_negation,[status(cth)],[t5_connsp_2]) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,powerset(the_carrier(X1)))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( in(X3,X2)
& open_subset(X2,X1) )
=> point_neighbourhood(X2,X1,X3) ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,plain,
! [X1] :
( ( top_str(X1)
& topological_space(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,powerset(the_carrier(X1)))
=> ( point_neighbourhood(X3,X1,X2)
<=> in(X2,interior(X1,X3)) ) ) ) ),
inference(fof_simplification,[status(thm)],[d1_connsp_2]) ).
fof(c_0_10,negated_conjecture,
( ~ point_neighbourhood(esk417_0,esk416_0,esk418_0)
& in(esk418_0,esk417_0)
& open_subset(esk417_0,esk416_0)
& element(esk418_0,the_carrier(esk416_0))
& element(esk417_0,powerset(the_carrier(esk416_0)))
& top_str(esk416_0)
& topological_space(esk416_0)
& ~ empty_carrier(esk416_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).
fof(c_0_11,plain,
! [X169,X170,X171] :
( ( ~ top_str(X169)
| ~ topological_space(X169)
| empty_carrier(X169)
| ~ element(X170,the_carrier(X169))
| ~ element(X171,powerset(the_carrier(X169)))
| point_neighbourhood(X171,X169,X170)
| ~ in(X170,interior(X169,X171)) )
& ( ~ top_str(X169)
| ~ topological_space(X169)
| empty_carrier(X169)
| ~ element(X170,the_carrier(X169))
| ~ element(X171,powerset(the_carrier(X169)))
| in(X170,interior(X169,X171))
| ~ point_neighbourhood(X171,X169,X170) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])])]) ).
cnf(c_0_12,negated_conjecture,
~ point_neighbourhood(esk417_0,esk416_0,esk418_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,plain,
( ~ top_str(X2)
| ~ topological_space(X2)
| ~ element(X1,the_carrier(X2))
| ~ element(X3,powerset(the_carrier(X2)))
| ~ in(X1,interior(X2,X3))
| empty_carrier(X2)
| point_neighbourhood(X3,X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_14,negated_conjecture,
topological_space(esk416_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
top_str(esk416_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
element(esk417_0,powerset(the_carrier(esk416_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
element(esk418_0,the_carrier(esk416_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,negated_conjecture,
~ empty_carrier(esk416_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_19,plain,
! [X255,X256] :
( interior(X255,X256) = subset_complement(the_carrier(X255),topstr_closure(X255,subset_complement(the_carrier(X255),X256)))
| ~ element(X256,powerset(the_carrier(X255)))
| ~ top_str(X255) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d1_tops_1])])])]) ).
fof(c_0_20,lemma,
! [X1645,X1646] :
( ( ~ top_str(X1645)
| ~ element(X1646,powerset(the_carrier(X1645)))
| open_subset(X1646,X1645)
| ~ closed_subset(subset_complement(the_carrier(X1645),X1646),X1645) )
& ( ~ top_str(X1645)
| ~ element(X1646,powerset(the_carrier(X1645)))
| closed_subset(subset_complement(the_carrier(X1645),X1646),X1645)
| ~ open_subset(X1646,X1645) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_tops_1])])])])]) ).
cnf(c_0_21,negated_conjecture,
~ in(esk418_0,interior(esk416_0,esk417_0)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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]),c_0_17])]),c_0_18]) ).
cnf(c_0_22,plain,
( ~ element(X2,powerset(the_carrier(X1)))
| ~ top_str(X1)
| interior(X1,X2) = subset_complement(the_carrier(X1),topstr_closure(X1,subset_complement(the_carrier(X1),X2))) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_23,lemma,
! [X1773,X1774] :
( ( ~ top_str(X1773)
| ~ element(X1774,powerset(the_carrier(X1773)))
| closed_subset(X1774,X1773)
| topstr_closure(X1773,X1774) != X1774
| ~ topological_space(X1773) )
& ( ~ top_str(X1773)
| ~ element(X1774,powerset(the_carrier(X1773)))
| topstr_closure(X1773,X1774) = X1774
| ~ closed_subset(X1774,X1773) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t52_pre_topc])])])])]) ).
cnf(c_0_24,lemma,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ open_subset(X1,X2)
| closed_subset(subset_complement(the_carrier(X2),X1),X2) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_25,negated_conjecture,
open_subset(esk417_0,esk416_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,negated_conjecture,
~ in(esk418_0,subset_complement(the_carrier(esk416_0),topstr_closure(esk416_0,subset_complement(the_carrier(esk416_0),esk417_0)))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_15]),c_0_16])]) ).
cnf(c_0_27,lemma,
( ~ top_str(X2)
| ~ element(X1,powerset(the_carrier(X2)))
| ~ closed_subset(X1,X2)
| topstr_closure(X2,X1) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_28,negated_conjecture,
closed_subset(subset_complement(the_carrier(esk416_0),esk417_0),esk416_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_15]),c_0_16])]) ).
fof(c_0_29,plain,
! [X754,X755] :
( subset_complement(X754,subset_complement(X754,X755)) = X755
| ~ element(X755,powerset(X754)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[involutiveness_k3_subset_1])])]) ).
cnf(c_0_30,lemma,
( ~ in(esk418_0,subset_complement(the_carrier(esk416_0),subset_complement(the_carrier(esk416_0),esk417_0)))
| ~ element(subset_complement(the_carrier(esk416_0),esk417_0),powerset(the_carrier(esk416_0))) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_15])]) ).
cnf(c_0_31,plain,
( ~ element(X1,powerset(X2))
| subset_complement(X2,subset_complement(X2,X1)) = X1 ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_32,negated_conjecture,
in(esk418_0,esk417_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_33,plain,
! [X589,X590] :
( element(subset_complement(X589,X590),powerset(X589))
| ~ element(X590,powerset(X589)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k3_subset_1])])]) ).
cnf(c_0_34,lemma,
~ element(subset_complement(the_carrier(esk416_0),esk417_0),powerset(the_carrier(esk416_0))),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_16])]) ).
cnf(c_0_35,plain,
( ~ element(X1,powerset(X2))
| element(subset_complement(X2,X1),powerset(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_36,lemma,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU341+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.45 % Computer : n019.cluster.edu
% 0.21/0.45 % Model : x86_64 x86_64
% 0.21/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.45 % Memory : 8046.5625MB
% 0.21/0.45 % OS : Linux 6.8.0-71-generic
% 0.21/0.45 % CPULimit : 300
% 0.21/0.45 % WCLimit : 300
% 0.21/0.45 % DateTime : Mon Sep 21 06:14:05 UTC 2026
% 0.21/0.46 % CPUTime :
% 0.21/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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
% 18.32/4.41 % Version: 3.5.1
% 18.32/4.41 % Preprocessing class: FSLMSMSSSSSNFFN.
% 18.32/4.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.32/4.41 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 18.32/4.41 % Starting new_bool_3 with 600s (2) cores
% 18.32/4.41 % Starting new_bool_1 with 600s (2) cores
% 18.32/4.41 % Starting sh5l with 300s (1) cores
% 18.32/4.41 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1857647 completed with status 0
% 18.32/4.41 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 18.32/4.41 % Preprocessing class: FSLMSMSSSSSNFFN.
% 18.32/4.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.32/4.41 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 18.32/4.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.32/4.41 % No SInE strategy applied
% 18.32/4.41 % Search class: FGHSM-SMLM32-MFFFFFNN
% 18.32/4.41 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 18.32/4.41 % Starting SubtermCWHack with 82s (1) cores
% 18.32/4.41 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 18.32/4.41 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 18.32/4.41 % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 1857657 completed with status 0
% 18.32/4.41 % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 18.32/4.41 % Preprocessing class: FSLMSMSSSSSNFFN.
% 18.32/4.41 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.32/4.41 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 18.32/4.41 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.32/4.41 % No SInE strategy applied
% 18.32/4.41 % Search class: FGHSM-SMLM32-MFFFFFNN
% 18.32/4.41 % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 18.32/4.41 % Starting SubtermCWHack with 82s (1) cores
% 18.32/4.41 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 91s (1) cores
% 18.32/4.41 % Preprocessing time : 0.073 s
% 18.32/4.41 % Presaturation interreduction done
% 18.32/4.41
% 18.32/4.41 % Proof found!
% 18.32/4.41 % SZS status Theorem
% 18.32/4.41 % SZS output start CNFRefutation
% See solution above
% 18.32/4.41 % Parsed axioms : 573
% 18.32/4.41 % Removed by relevancy pruning/SinE : 0
% 18.32/4.41 % Initial clauses : 2561
% 18.32/4.41 % Removed in clause preprocessing : 40
% 18.32/4.41 % Initial clauses in saturation : 2521
% 18.32/4.41 % Processed clauses : 10091
% 18.32/4.41 % ...of these trivial : 93
% 18.32/4.41 % ...subsumed : 4279
% 18.32/4.41 % ...remaining for further processing : 5719
% 18.32/4.41 % Other redundant clauses eliminated : 928
% 18.32/4.41 % Clauses deleted for lack of memory : 0
% 18.32/4.41 % Backward-subsumed : 34
% 18.32/4.41 % Backward-rewritten : 61
% 18.32/4.41 % Generated clauses : 29063
% 18.32/4.41 % ...of the previous two non-redundant : 26018
% 18.32/4.41 % ...aggressively subsumed : 0
% 18.32/4.41 % Contextual simplify-reflections : 290
% 18.32/4.41 % Paramodulations : 28361
% 18.32/4.41 % Factorizations : 2
% 18.32/4.41 % NegExts : 0
% 18.32/4.41 % Equation resolutions : 933
% 18.32/4.41 % Disequality decompositions : 0
% 18.32/4.41 % Total rewrite steps : 6098
% 18.32/4.41 % ...of those cached : 5632
% 18.32/4.41 % Propositional unsat checks : 1
% 18.32/4.41 % Propositional check models : 1
% 18.32/4.41 % Propositional check unsatisfiable : 0
% 18.32/4.41 % Propositional clauses : 0
% 18.32/4.41 % Propositional clauses after purity: 0
% 18.32/4.41 % Propositional unsat core size : 0
% 18.32/4.41 % Propositional preprocessing time : 0.000
% 18.32/4.41 % Propositional encoding time : 0.035
% 18.32/4.41 % Propositional solver time : 0.036
% 18.32/4.41 % Success case prop preproc time : 0.000
% 18.32/4.41 % Success case prop encoding time : 0.000
% 18.32/4.41 % Success case prop solver time : 0.000
% 18.32/4.41 % Current number of processed clauses : 2647
% 18.32/4.41 % Positive orientable unit clauses : 238
% 18.32/4.41 % Positive unorientable unit clauses: 4
% 18.32/4.41 % Negative unit clauses : 576
% 18.32/4.41 % Non-unit-clauses : 1829
% 18.32/4.41 % Current number of unprocessed clauses: 20652
% 18.32/4.41 % ...number of literals in the above : 71721
% 18.32/4.41 % Current number of archived formulas : 0
% 18.32/4.41 % Current number of archived clauses : 2446
% 18.32/4.41 % Clause-clause subsumption calls (NU) : 4239692
% 18.32/4.41 % Rec. Clause-clause subsumption calls : 656952
% 18.32/4.41 % Non-unit clause-clause subsumptions : 1762
% 18.32/4.41 % Unit Clause-clause subsumption calls : 41398
% 18.32/4.41 % Rewrite failures with RHS unbound : 3
% 18.32/4.41 % BW rewrite match attempts : 128
% 18.32/4.41 % BW rewrite match successes : 84
% 18.32/4.41 % Condensation attempts : 0
% 18.32/4.41 % Condensation successes : 0
% 18.32/4.41 % Termbank termtop insertions : 603207
% 18.32/4.41 % Search garbage collected termcells : 34984
% 18.32/4.41
% 18.32/4.41 % -------------------------------------------------
% 18.32/4.41 % User time : 3.675 s
% 18.32/4.41 % System time : 0.068 s
% 18.32/4.41 % Total time : 3.744 s
% 18.32/4.41 % Maximum resident set size: 10552 pages
% 18.32/4.41
% 18.32/4.41 % -------------------------------------------------
% 18.32/4.41 % User time : 10.312 s
% 18.32/4.41 % System time : 0.237 s
% 18.32/4.41 % Total time : 10.550 s
% 18.32/4.41 % Maximum resident set size: 5376 pages
% 18.32/4.41 % E exiting
%------------------------------------------------------------------------------