%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : TOP021+1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n015.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 03:53:50 PM UTC 2026
% Result : Theorem 0.34s 0.61s
% Output : CNFRefutation 0.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 10 unt; 0 def)
% Number of atoms : 33 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 27 ( 12 ~; 9 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 44 ( 5 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(kelley_p_147e,axiom,
! [X5,X1,X6] :
( ( a_locally_compact_top_space(X1)
& a_continuous_function_from_onto(X5,X1,X6)
& an_open_function_from_onto(X5,X1,X6) )
=> a_locally_compact_top_space(X6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kelley_p_147e) ).
fof(kelley_3_2,axiom,
! [X1,X2,X3,X4] : an_open_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X4,X3),apply(X4,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kelley_3_2) ).
fof(kelley_p90a,axiom,
! [X1,X2,X3] : a_continuous_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X2,X3),apply(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kelley_p90a) ).
fof(kelley_5_19a,conjecture,
! [X4,X3] :
( a_locally_compact_top_space(the_product_top_space_over(X4,X3))
=> ! [X1] : a_locally_compact_top_space(apply(X4,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',kelley_5_19a) ).
fof(c_0_4,plain,
! [X14,X15,X16] :
( a_locally_compact_top_space(X16)
| ~ a_locally_compact_top_space(X15)
| ~ a_continuous_function_from_onto(X14,X15,X16)
| ~ an_open_function_from_onto(X14,X15,X16) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kelley_p_147e])])]) ).
fof(c_0_5,plain,
! [X10,X11,X12,X13] : an_open_function_from_onto(the_projection_function(X10,X11,X12),the_product_top_space_over(X13,X12),apply(X13,X10)),
inference(variable_rename,[status(thm)],[kelley_3_2]) ).
cnf(c_0_6,plain,
( ~ a_locally_compact_top_space(X2)
| ~ a_continuous_function_from_onto(X1,X2,X3)
| ~ an_open_function_from_onto(X1,X2,X3)
| a_locally_compact_top_space(X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
an_open_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X4,X3),apply(X4,X1)),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
fof(c_0_8,plain,
! [X7,X8,X9] : a_continuous_function_from_onto(the_projection_function(X7,X8,X9),the_product_top_space_over(X8,X9),apply(X8,X7)),
inference(variable_rename,[status(thm)],[kelley_p90a]) ).
fof(c_0_9,negated_conjecture,
~ ! [X4,X3] :
( a_locally_compact_top_space(the_product_top_space_over(X4,X3))
=> ! [X1] : a_locally_compact_top_space(apply(X4,X1)) ),
inference(assume_negation,[status(cth)],[kelley_5_19a]) ).
cnf(c_0_10,plain,
( ~ a_continuous_function_from_onto(the_projection_function(X2,X4,X3),the_product_top_space_over(X1,X3),apply(X1,X2))
| ~ a_locally_compact_top_space(the_product_top_space_over(X1,X3))
| a_locally_compact_top_space(apply(X1,X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_11,plain,
a_continuous_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X2,X3),apply(X2,X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,negated_conjecture,
( ~ a_locally_compact_top_space(apply(esk1_0,esk3_0))
& a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0)) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_13,plain,
( ~ a_locally_compact_top_space(the_product_top_space_over(X1,X3))
| a_locally_compact_top_space(apply(X1,X2)) ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_14,negated_conjecture,
a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_15,negated_conjecture,
~ a_locally_compact_top_space(apply(esk1_0,esk3_0)),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,negated_conjecture,
a_locally_compact_top_space(apply(esk1_0,X1)),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : TOP021+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 % Computer : n015.cluster.edu
% 0.18/0.50 % Model : x86_64 x86_64
% 0.18/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.50 % Memory : 8046.5625MB
% 0.18/0.50 % OS : Linux 6.8.0-71-generic
% 0.18/0.50 % CPULimit : 300
% 0.18/0.50 % WCLimit : 300
% 0.18/0.50 % DateTime : Mon Sep 21 12:41:36 UTC 2026
% 0.18/0.50 % CPUTime :
% 0.18/0.50 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.57 Running first-order theorem proving
% 0.23/0.57 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.34/0.61 % Version: 3.5.1
% 0.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/0.61 % Starting new_bool_3 with 300s (1) cores
% 0.34/0.61 % Starting new_bool_1 with 300s (1) cores
% 0.34/0.61 % Starting sh5l with 300s (1) cores
% 0.34/0.61 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1468096 completed with status 0
% 0.34/0.61 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.34/0.61 % No SInE strategy applied
% 0.34/0.61 % Search class: FHUNS-FFSF32-SFFFFFNN
% 0.34/0.61 % partial match(1): FHUNF-FFSF32-SFFFFFNN
% 0.34/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.34/0.61 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.34/0.61 % Starting new_bool_3 with 136s (1) cores
% 0.34/0.61 % Starting new_bool_1 with 136s (1) cores
% 0.34/0.61 % SubtermCWHack with pid 1468100 completed with status 0
% 0.34/0.61 % Result found by SubtermCWHack
% 0.34/0.61 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.34/0.61 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.34/0.61 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.34/0.61 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.34/0.61 % No SInE strategy applied
% 0.34/0.61 % Search class: FHUNS-FFSF32-SFFFFFNN
% 0.34/0.61 % partial match(1): FHUNF-FFSF32-SFFFFFNN
% 0.34/0.61 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.34/0.61 % Starting SubtermCWHack with 136s (1) cores
% 0.34/0.61 % Preprocessing time : 0.002 s
% 0.34/0.61
% 0.34/0.61 % Proof found!
% 0.34/0.61 % SZS status Theorem
% 0.34/0.61 % SZS output start CNFRefutation
% See solution above
% 0.34/0.61 % Parsed axioms : 4
% 0.34/0.61 % Removed by relevancy pruning/SinE : 0
% 0.34/0.61 % Initial clauses : 5
% 0.34/0.61 % Removed in clause preprocessing : 0
% 0.34/0.61 % Initial clauses in saturation : 5
% 0.34/0.61 % Processed clauses : 8
% 0.34/0.61 % ...of these trivial : 0
% 0.34/0.61 % ...subsumed : 0
% 0.34/0.61 % ...remaining for further processing : 8
% 0.34/0.61 % Other redundant clauses eliminated : 0
% 0.34/0.61 % Clauses deleted for lack of memory : 0
% 0.34/0.61 % Backward-subsumed : 1
% 0.34/0.61 % Backward-rewritten : 1
% 0.34/0.61 % Generated clauses : 3
% 0.34/0.61 % ...of the previous two non-redundant : 3
% 0.34/0.61 % ...aggressively subsumed : 0
% 0.34/0.61 % Contextual simplify-reflections : 0
% 0.34/0.61 % Paramodulations : 3
% 0.34/0.61 % Factorizations : 0
% 0.34/0.61 % NegExts : 0
% 0.34/0.61 % Equation resolutions : 0
% 0.34/0.61 % Disequality decompositions : 0
% 0.34/0.61 % Total rewrite steps : 1
% 0.34/0.61 % ...of those cached : 0
% 0.34/0.61 % Propositional unsat checks : 0
% 0.34/0.61 % Propositional check models : 0
% 0.34/0.61 % Propositional check unsatisfiable : 0
% 0.34/0.61 % Propositional clauses : 0
% 0.34/0.61 % Propositional clauses after purity: 0
% 0.34/0.61 % Propositional unsat core size : 0
% 0.34/0.61 % Propositional preprocessing time : 0.000
% 0.34/0.61 % Propositional encoding time : 0.000
% 0.34/0.61 % Propositional solver time : 0.000
% 0.34/0.61 % Success case prop preproc time : 0.000
% 0.34/0.61 % Success case prop encoding time : 0.000
% 0.34/0.61 % Success case prop solver time : 0.000
% 0.34/0.61 % Current number of processed clauses : 6
% 0.34/0.61 % Positive orientable unit clauses : 4
% 0.34/0.61 % Positive unorientable unit clauses: 0
% 0.34/0.61 % Negative unit clauses : 0
% 0.34/0.61 % Non-unit-clauses : 2
% 0.34/0.61 % Current number of unprocessed clauses: 0
% 0.34/0.61 % ...number of literals in the above : 0
% 0.34/0.61 % Current number of archived formulas : 0
% 0.34/0.61 % Current number of archived clauses : 2
% 0.34/0.61 % Clause-clause subsumption calls (NU) : 1
% 0.34/0.61 % Rec. Clause-clause subsumption calls : 1
% 0.34/0.61 % Non-unit clause-clause subsumptions : 1
% 0.34/0.61 % Unit Clause-clause subsumption calls : 0
% 0.34/0.61 % Rewrite failures with RHS unbound : 0
% 0.34/0.61 % BW rewrite match attempts : 1
% 0.34/0.61 % BW rewrite match successes : 1
% 0.34/0.61 % Condensation attempts : 0
% 0.34/0.61 % Condensation successes : 0
% 0.34/0.61 % Termbank termtop insertions : 408
% 0.34/0.61 % Search garbage collected termcells : 61
% 0.34/0.61
% 0.34/0.61 % -------------------------------------------------
% 0.34/0.61 % User time : 0.005 s
% 0.34/0.61 % System time : 0.004 s
% 0.34/0.61 % Total time : 0.009 s
% 0.34/0.61 % Maximum resident set size: 3632 pages
% 0.34/0.61
% 0.34/0.61 % -------------------------------------------------
% 0.34/0.61 % User time : 0.010 s
% 0.34/0.61 % System time : 0.020 s
% 0.34/0.61 % Total time : 0.030 s
% 0.34/0.61 % Maximum resident set size: 4608 pages
% 0.34/0.61 % E exiting
%------------------------------------------------------------------------------