%------------------------------------------------------------------------------
% File : JavaRes---1.3.0
% Problem : TOP021+1 : TPTP v7.5.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% Computer : n024.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 600s
% DateTime : Tue Mar 29 16:10:41 EDT 2022
% Result : Theorem 0.19s 0.55s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : TOP021+1 : TPTP v7.5.0. Released v3.1.0.
% 0.11/0.12 % Command : java -Xmx15G -cp /export/starexec/sandbox2/solver/bin atp.ProverFOF -i /export/starexec/sandbox2/benchmark --eqax --proof --forward-subsumption --backward_subsumption --delete-tautologies --timeout 0 %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % RAMPerCPU : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Mar 16 07:05:03 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.47 # Using default include path : /export/starexec/sandbox2/benchmark
% 0.19/0.48 # INFO in ProverFOF.main(): Processing file /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # ProverFOF.processTestFile(): filename: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.48 # ProverFOF.processTestFile(): opts: {backward_subsumption=true, delete-tautologies=true, filename=/export/starexec/sandbox2/benchmark/theBenchmark.p, forward-subsumption=true, proof=true, eqax=true, timeout=0}
% 0.19/0.48 # ProverFOF.processTestFile(): evals: [Heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval] litSelect: LARGEST indexing: true delTaut: true forSub: true backSub: true]
% 0.19/0.52 # hasConjecture: true isFOF: true
% 0.19/0.52 # ProofState(): heuristics: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.52 # HeuristicsClauseSet using eval functions: PickGiven5 : [SymbolCountEval21, FIFOEval]
% 0.19/0.55 # -----------------
% 0.19/0.55 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55
% 0.19/0.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 fof(kelley_5_19a,conjecture,(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A)))))),input).
% 0.19/0.55 fof(f17,negated_conjecture,(~(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A))))))),inference(assume_negation, status(cth), [kelley_5_19a])).
% 0.19/0.55 fof(f20,negated_conjecture,(~(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A))))))),inference(fof_simplification, status(thm), [f17])).
% 0.19/0.55 fof(f21,negated_conjecture,(?[X1]:(?[A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))&(?[A]:~a_locally_compact_top_space(apply(X1,A)))))),inference(fof_nnf, status(thm), [f20])).
% 0.19/0.55 fof(f22,negated_conjecture,(?[VAR12]:(?[VAR11]:(a_locally_compact_top_space(the_product_top_space_over(VAR12,VAR11))&(?[VAR10]:~a_locally_compact_top_space(apply(VAR12,VAR10)))))),inference(variable_rename, status(thm), [f21])).
% 0.19/0.55 fof(f23,negated_conjecture,(a_locally_compact_top_space(the_product_top_space_over(skf13,skf14))&~a_locally_compact_top_space(apply(skf13,skf15))),inference(skolemize, status(esa), [f22])).
% 0.19/0.55 fof(f24,negated_conjecture,(a_locally_compact_top_space(the_product_top_space_over(skf13,skf14))&~a_locally_compact_top_space(apply(skf13,skf15))),inference(distribute, status(thm), [f23])).
% 0.19/0.55 cnf(cnf4,negated_conjecture,~a_locally_compact_top_space(apply(skf13,skf15)),inference(split_conjunct, status(thm), [f24])).
% 0.19/0.55 fof(kelley_5_19a,conjecture,(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A)))))),input).
% 0.19/0.55 fof(f17,negated_conjecture,(~(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A))))))),inference(assume_negation, status(cth), [kelley_5_19a])).
% 0.19/0.55 fof(f20,negated_conjecture,(~(![X1]:(![A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))=>(![A]:a_locally_compact_top_space(apply(X1,A))))))),inference(fof_simplification, status(thm), [f17])).
% 0.19/0.55 fof(f21,negated_conjecture,(?[X1]:(?[A1]:(a_locally_compact_top_space(the_product_top_space_over(X1,A1))&(?[A]:~a_locally_compact_top_space(apply(X1,A)))))),inference(fof_nnf, status(thm), [f20])).
% 0.19/0.55 fof(f22,negated_conjecture,(?[VAR12]:(?[VAR11]:(a_locally_compact_top_space(the_product_top_space_over(VAR12,VAR11))&(?[VAR10]:~a_locally_compact_top_space(apply(VAR12,VAR10)))))),inference(variable_rename, status(thm), [f21])).
% 0.19/0.55 fof(f23,negated_conjecture,(a_locally_compact_top_space(the_product_top_space_over(skf13,skf14))&~a_locally_compact_top_space(apply(skf13,skf15))),inference(skolemize, status(esa), [f22])).
% 0.19/0.55 fof(f24,negated_conjecture,(a_locally_compact_top_space(the_product_top_space_over(skf13,skf14))&~a_locally_compact_top_space(apply(skf13,skf15))),inference(distribute, status(thm), [f23])).
% 0.19/0.55 cnf(cnf3,negated_conjecture,a_locally_compact_top_space(the_product_top_space_over(skf13,skf14)),inference(split_conjunct, status(thm), [f24])).
% 0.19/0.55 fof(kelley_3_2,axiom,(![A]:(![X]:(![A1]:(![X1]:an_open_function_from_onto(the_projection_function(A,X,A1),the_product_top_space_over(X1,A1),apply(X1,A)))))),input).
% 0.19/0.55 fof(f7,axiom,(![A]:(![X]:(![A1]:(![X1]:an_open_function_from_onto(the_projection_function(A,X,A1),the_product_top_space_over(X1,A1),apply(X1,A)))))),inference(fof_simplification, status(thm), [kelley_3_2])).
% 0.19/0.55 fof(f8,axiom,(![VAR6]:(![VAR5]:(![VAR4]:(![VAR3]:an_open_function_from_onto(the_projection_function(VAR6,VAR5,VAR4),the_product_top_space_over(VAR3,VAR4),apply(VAR3,VAR6)))))),inference(variable_rename, status(thm), [f7])).
% 0.19/0.55 fof(f9,axiom,an_open_function_from_onto(the_projection_function(VAR6,VAR5,VAR4),the_product_top_space_over(VAR3,VAR4),apply(VAR3,VAR6)),inference(shift_quantors, status(thm), [f8])).
% 0.19/0.55 cnf(cnf1,axiom,an_open_function_from_onto(the_projection_function(X4,X5,X6),the_product_top_space_over(X7,X6),apply(X7,X4)),inference(split_conjunct, status(thm), [f9])).
% 0.19/0.55 fof(kelley_p90a,axiom,(![A]:(![X]:(![A1]:a_continuous_function_from_onto(the_projection_function(A,X,A1),the_product_top_space_over(X,A1),apply(X,A))))),input).
% 0.19/0.55 fof(f2,axiom,(![A]:(![X]:(![A1]:a_continuous_function_from_onto(the_projection_function(A,X,A1),the_product_top_space_over(X,A1),apply(X,A))))),inference(fof_simplification, status(thm), [kelley_p90a])).
% 0.19/0.55 fof(f3,axiom,(![VAR2]:(![VAR1]:(![VAR0]:a_continuous_function_from_onto(the_projection_function(VAR2,VAR1,VAR0),the_product_top_space_over(VAR1,VAR0),apply(VAR1,VAR2))))),inference(variable_rename, status(thm), [f2])).
% 0.19/0.55 fof(f4,axiom,a_continuous_function_from_onto(the_projection_function(VAR2,VAR1,VAR0),the_product_top_space_over(VAR1,VAR0),apply(VAR1,VAR2)),inference(shift_quantors, status(thm), [f3])).
% 0.19/0.55 cnf(cnf0,axiom,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), [f4])).
% 0.19/0.55 fof(kelley_p_147e,axiom,(![F]:(![A]:(![B]:(((an_open_function_from_onto(F,A,B)&a_continuous_function_from_onto(F,A,B))&a_locally_compact_top_space(A))=>a_locally_compact_top_space(B))))),input).
% 0.19/0.55 fof(f12,axiom,(![F]:(![A]:(![B]:(((an_open_function_from_onto(F,A,B)&a_continuous_function_from_onto(F,A,B))&a_locally_compact_top_space(A))=>a_locally_compact_top_space(B))))),inference(fof_simplification, status(thm), [kelley_p_147e])).
% 0.19/0.55 fof(f13,axiom,(![F]:(![A]:(![B]:(((~an_open_function_from_onto(F,A,B)|~a_continuous_function_from_onto(F,A,B))|~a_locally_compact_top_space(A))|a_locally_compact_top_space(B))))),inference(fof_nnf, status(thm), [f12])).
% 0.19/0.55 fof(f14,axiom,(![VAR9]:(![VAR8]:(![VAR7]:(((~an_open_function_from_onto(VAR9,VAR8,VAR7)|~a_continuous_function_from_onto(VAR9,VAR8,VAR7))|~a_locally_compact_top_space(VAR8))|a_locally_compact_top_space(VAR7))))),inference(variable_rename, status(thm), [f13])).
% 0.19/0.55 fof(f15,axiom,(((~an_open_function_from_onto(VAR9,VAR8,VAR7)|~a_continuous_function_from_onto(VAR9,VAR8,VAR7))|~a_locally_compact_top_space(VAR8))|a_locally_compact_top_space(VAR7)),inference(shift_quantors, status(thm), [f14])).
% 0.19/0.55 cnf(cnf2,axiom,~an_open_function_from_onto(X8,X9,X10)|~a_continuous_function_from_onto(X8,X9,X10)|~a_locally_compact_top_space(X9)|a_locally_compact_top_space(X10),inference(split_conjunct, status(thm), [f15])).
% 0.19/0.55 cnf(c0,plain,~an_open_function_from_onto(the_projection_function(X11,X12,X13),the_product_top_space_over(X12,X13),apply(X12,X11))|~a_locally_compact_top_space(the_product_top_space_over(X12,X13))|a_locally_compact_top_space(apply(X12,X11)),inference(resolution, status(thm), [cnf2, cnf0])).
% 0.19/0.55 cnf(c1,plain,~a_locally_compact_top_space(the_product_top_space_over(X14,X15))|a_locally_compact_top_space(apply(X14,X16)),inference(resolution, status(thm), [c0, cnf1])).
% 0.19/0.55 cnf(c2,plain,a_locally_compact_top_space(apply(skf13,X17)),inference(resolution, status(thm), [c1, cnf3])).
% 0.19/0.55 cnf(c3,plain,$false,inference(resolution, status(thm), [c2, cnf4])).
% 0.19/0.55 % SZS output end CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 # Filename : /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 # Indexed : true
% 0.19/0.55 # Eval function name : PickGiven5
% 0.19/0.55 # Initial clauses : 5
% 0.19/0.55 # Processed clauses : 8
% 0.19/0.55 # Factors computed : 0
% 0.19/0.55 # Resolvents computed: 4
% 0.19/0.55 # Tautologies deleted: 0
% 0.19/0.55 # Forward subsumed : 0
% 0.19/0.55 # Backward subsumed : 1
% 0.19/0.55 # SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 # SZS Expected : Theorem
% 0.19/0.55 # time : 21ms
% 0.19/0.55
%------------------------------------------------------------------------------