%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU323-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/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:24:42 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.44s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 13
% Syntax : Number of clauses : 36 ( 36 unt; 0 nHn; 18 RR)
% Number of literals : 36 ( 35 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 15 usr; 3 con; 0-4 aty)
% Number of variables : 40 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(dt_k3_subset_1,axiom,
ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k3_subset_1) ).
cnf(t51_tops_1_2,negated_conjecture,
element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_tops_1_2) ).
cnf(ifeq_axiom_001,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).
cnf(d1_tops_1,axiom,
ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1)) = interior(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_tops_1) ).
cnf(t51_tops_1,negated_conjecture,
top_str(sK2_t51_tops_1_A) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_tops_1) ).
cnf(ifeq_axiom,axiom,
ifeq2(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(dt_k6_pre_topc,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k6_pre_topc) ).
cnf(dt_k1_tops_1,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',dt_k1_tops_1) ).
cnf(involutiveness_k3_subset_1,axiom,
ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',involutiveness_k3_subset_1) ).
cnf(fc2_tops_1,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc2_tops_1) ).
cnf(t51_tops_1_1,negated_conjecture,
topological_space(sK2_t51_tops_1_A) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_tops_1_1) ).
cnf(t51_tops_1_3,negated_conjecture,
open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_tops_1_3) ).
cnf(fc3_tops_1,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_tops_1) ).
cnf(c_0_13,axiom,
ifeq(element(X1,powerset(X2)),true,element(subset_complement(X2,X1),powerset(X2)),true) = true,
dt_k3_subset_1 ).
cnf(c_0_14,negated_conjecture,
element(sK1_t51_tops_1_B,powerset(the_carrier(sK2_t51_tops_1_A))) = true,
t51_tops_1_2 ).
cnf(c_0_15,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom_001 ).
cnf(c_0_16,axiom,
ifeq2(element(X1,powerset(the_carrier(X2))),true,ifeq2(top_str(X2),true,subset_complement(the_carrier(X2),topstr_closure(X2,subset_complement(the_carrier(X2),X1))),interior(X2,X1)),interior(X2,X1)) = interior(X2,X1),
d1_tops_1 ).
cnf(c_0_17,negated_conjecture,
top_str(sK2_t51_tops_1_A) = true,
t51_tops_1 ).
cnf(c_0_18,axiom,
ifeq2(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_19,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(topstr_closure(X2,X1),powerset(the_carrier(X2))),true),true) = true,
dt_k6_pre_topc ).
cnf(c_0_20,negated_conjecture,
element(subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]) ).
cnf(c_0_21,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(top_str(X2),true,element(interior(X2,X1),powerset(the_carrier(X2))),true),true) = true,
dt_k1_tops_1 ).
cnf(c_0_22,axiom,
ifeq2(element(X1,powerset(X2)),true,subset_complement(X2,subset_complement(X2,X1)),X1) = X1,
involutiveness_k3_subset_1 ).
cnf(c_0_23,negated_conjecture,
subset_complement(the_carrier(sK2_t51_tops_1_A),topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B))) = interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_14]),c_0_17]),c_0_18]),c_0_18]) ).
cnf(c_0_24,negated_conjecture,
element(topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_17]),c_0_15]),c_0_15]) ).
cnf(c_0_25,negated_conjecture,
element(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_17]),c_0_15]),c_0_15]) ).
cnf(c_0_26,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,closed_subset(topstr_closure(X2,X1),X2),true),true),true) = true,
fc2_tops_1 ).
cnf(c_0_27,negated_conjecture,
topstr_closure(sK2_t51_tops_1_A,subset_complement(the_carrier(sK2_t51_tops_1_A),sK1_t51_tops_1_B)) = subset_complement(the_carrier(sK2_t51_tops_1_A),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]),c_0_18]) ).
cnf(c_0_28,negated_conjecture,
topological_space(sK2_t51_tops_1_A) = true,
t51_tops_1_1 ).
cnf(c_0_29,negated_conjecture,
open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true,
inference(fof_simplification,[status(thm)],[t51_tops_1_3]) ).
cnf(c_0_30,axiom,
ifeq(element(X1,powerset(the_carrier(X2))),true,ifeq(closed_subset(X1,X2),true,ifeq(topological_space(X2),true,ifeq(top_str(X2),true,open_subset(subset_complement(the_carrier(X2),X1),X2),true),true),true),true) = true,
fc3_tops_1 ).
cnf(c_0_31,negated_conjecture,
subset_complement(the_carrier(sK2_t51_tops_1_A),subset_complement(the_carrier(sK2_t51_tops_1_A),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B))) = interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_25]),c_0_18]) ).
cnf(c_0_32,negated_conjecture,
element(subset_complement(the_carrier(sK2_t51_tops_1_A),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B)),powerset(the_carrier(sK2_t51_tops_1_A))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_25]),c_0_15]) ).
cnf(c_0_33,negated_conjecture,
closed_subset(subset_complement(the_carrier(sK2_t51_tops_1_A),interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B)),sK2_t51_tops_1_A) = true,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_20]),c_0_28]),c_0_17]),c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_34,negated_conjecture,
open_subset(interior(sK2_t51_tops_1_A,sK1_t51_tops_1_B),sK2_t51_tops_1_A) != true,
c_0_29 ).
cnf(c_0_35,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_33]),c_0_28]),c_0_17]),c_0_15]),c_0_15]),c_0_15]),c_0_15]),c_0_34]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU323-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 06:11:21 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/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.14/0.44 % Version: 3.5.1
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.44 % Starting sh5l with 300s (1) cores
% 0.14/0.44 % new_bool_3 with pid 100429 completed with status 0
% 0.14/0.44 % Result found by new_bool_3
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FUUPM-FFMS32-DFFFFFNN
% 0.14/0.44 % partial match(1): FUUPM-FFMM32-DFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % SubtermCWHack with pid 100438 completed with status 0
% 0.14/0.44 % Result found by SubtermCWHack
% 0.14/0.44 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.44 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.44 % Search class: FUUPM-FFMS32-DFFFFFNN
% 0.14/0.44 % partial match(1): FUUPM-FFMM32-DFFFFFNN
% 0.14/0.44 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.44 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.44 % Preprocessing time : 0.001 s
% 0.14/0.44
% 0.14/0.44 % Proof found!
% 0.14/0.44 % SZS status Unsatisfiable
% 0.14/0.44 % SZS output start CNFRefutation
% See solution above
% 0.14/0.44 % Parsed axioms : 25
% 0.14/0.44 % Removed by relevancy pruning/SinE : 11
% 0.14/0.44 % Initial clauses : 14
% 0.14/0.44 % Removed in clause preprocessing : 0
% 0.14/0.44 % Initial clauses in saturation : 14
% 0.14/0.44 % Processed clauses : 55
% 0.14/0.44 % ...of these trivial : 4
% 0.14/0.44 % ...subsumed : 0
% 0.14/0.44 % ...remaining for further processing : 51
% 0.14/0.44 % Other redundant clauses eliminated : 0
% 0.14/0.44 % Clauses deleted for lack of memory : 0
% 0.14/0.44 % Backward-subsumed : 0
% 0.14/0.44 % Backward-rewritten : 4
% 0.14/0.44 % Generated clauses : 234
% 0.14/0.44 % ...of the previous two non-redundant : 156
% 0.14/0.44 % ...aggressively subsumed : 0
% 0.14/0.44 % Contextual simplify-reflections : 0
% 0.14/0.44 % Paramodulations : 234
% 0.14/0.44 % Factorizations : 0
% 0.14/0.44 % NegExts : 0
% 0.14/0.44 % Equation resolutions : 0
% 0.14/0.44 % Disequality decompositions : 0
% 0.14/0.44 % Total rewrite steps : 621
% 0.14/0.44 % ...of those cached : 442
% 0.14/0.44 % Propositional unsat checks : 0
% 0.14/0.44 % Propositional check models : 0
% 0.14/0.44 % Propositional check unsatisfiable : 0
% 0.14/0.44 % Propositional clauses : 0
% 0.14/0.44 % Propositional clauses after purity: 0
% 0.14/0.44 % Propositional unsat core size : 0
% 0.14/0.44 % Propositional preprocessing time : 0.000
% 0.14/0.44 % Propositional encoding time : 0.000
% 0.14/0.44 % Propositional solver time : 0.000
% 0.14/0.44 % Success case prop preproc time : 0.000
% 0.14/0.44 % Success case prop encoding time : 0.000
% 0.14/0.44 % Success case prop solver time : 0.000
% 0.14/0.44 % Current number of processed clauses : 47
% 0.14/0.44 % Positive orientable unit clauses : 46
% 0.14/0.44 % Positive unorientable unit clauses: 0
% 0.14/0.44 % Negative unit clauses : 1
% 0.14/0.44 % Non-unit-clauses : 0
% 0.14/0.44 % Current number of unprocessed clauses: 112
% 0.14/0.44 % ...number of literals in the above : 112
% 0.14/0.44 % Current number of archived formulas : 0
% 0.14/0.44 % Current number of archived clauses : 4
% 0.14/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.44 % Non-unit clause-clause subsumptions : 0
% 0.14/0.44 % Unit Clause-clause subsumption calls : 0
% 0.14/0.44 % Rewrite failures with RHS unbound : 0
% 0.14/0.44 % BW rewrite match attempts : 39
% 0.14/0.44 % BW rewrite match successes : 2
% 0.14/0.44 % Condensation attempts : 0
% 0.14/0.44 % Condensation successes : 0
% 0.14/0.44 % Termbank termtop insertions : 7356
% 0.14/0.44 % Search garbage collected termcells : 43
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.007 s
% 0.14/0.44 % System time : 0.002 s
% 0.14/0.44 % Total time : 0.009 s
% 0.14/0.44 % Maximum resident set size: 3656 pages
% 0.14/0.44
% 0.14/0.44 % -------------------------------------------------
% 0.14/0.44 % User time : 0.009 s
% 0.14/0.44 % System time : 0.006 s
% 0.14/0.44 % Total time : 0.015 s
% 0.14/0.44 % Maximum resident set size: 4864 pages
% 0.14/0.44 % E exiting
%------------------------------------------------------------------------------