%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : TOP021+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n023.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 : Thu Jul 21 21:24:30 EDT 2022
% Result : Theorem 4.34s 2.11s
% Output : CNFRefutation 4.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 13 ( 10 unt; 0 nHn; 7 RR)
% Number of literals : 20 ( 0 equ; 9 neg)
% Maximal clause size : 4 ( 1 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 : 24 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
( a_locally_compact_top_space(X1)
| ~ a_locally_compact_top_space(X2)
| ~ a_continuous_function_from_onto(X3,X2,X1)
| ~ an_open_function_from_onto(X3,X2,X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b7_kkya_/lgb.p',i_0_3) ).
cnf(i_0_1,plain,
a_continuous_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X2,X3),apply(X2,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b7_kkya_/lgb.p',i_0_1) ).
cnf(i_0_2,plain,
an_open_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X4,X3),apply(X4,X1)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b7_kkya_/lgb.p',i_0_2) ).
cnf(i_0_5,negated_conjecture,
a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b7_kkya_/lgb.p',i_0_5) ).
cnf(i_0_4,negated_conjecture,
~ a_locally_compact_top_space(apply(esk1_0,esk3_0)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b7_kkya_/lgb.p',i_0_4) ).
cnf(c_0_11,plain,
( a_locally_compact_top_space(X1)
| ~ a_locally_compact_top_space(X2)
| ~ a_continuous_function_from_onto(X3,X2,X1)
| ~ an_open_function_from_onto(X3,X2,X1) ),
i_0_3 ).
cnf(c_0_12,plain,
a_continuous_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X2,X3),apply(X2,X1)),
i_0_1 ).
cnf(c_0_13,plain,
an_open_function_from_onto(the_projection_function(X1,X2,X3),the_product_top_space_over(X4,X3),apply(X4,X1)),
i_0_2 ).
cnf(c_0_14,plain,
( a_locally_compact_top_space(apply(X1,X2))
| ~ a_locally_compact_top_space(the_product_top_space_over(X1,X3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]) ).
cnf(c_0_15,negated_conjecture,
a_locally_compact_top_space(the_product_top_space_over(esk1_0,esk2_0)),
i_0_5 ).
cnf(c_0_16,negated_conjecture,
~ a_locally_compact_top_space(apply(esk1_0,esk3_0)),
i_0_4 ).
cnf(c_0_17,negated_conjecture,
a_locally_compact_top_space(apply(esk1_0,X1)),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : TOP021+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 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 : Sun May 29 05:01:29 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.18/0.44 # ENIGMATIC: Selected complete mode:
% 4.34/2.11 # ENIGMATIC: Solved by autoschedule-lgb:
% 4.34/2.11 # No SInE strategy applied
% 4.34/2.11 # Trying AutoSched0 for 150 seconds
% 4.34/2.11 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S002I
% 4.34/2.11 # and selection function SelectNegativeLiterals.
% 4.34/2.11 #
% 4.34/2.11 # Preprocessing time : 0.023 s
% 4.34/2.11 # Presaturation interreduction done
% 4.34/2.11
% 4.34/2.11 # Proof found!
% 4.34/2.11 # SZS status Theorem
% 4.34/2.11 # SZS output start CNFRefutation
% See solution above
% 4.34/2.11 # Training examples: 0 positive, 0 negative
% 4.34/2.11
% 4.34/2.11 # -------------------------------------------------
% 4.34/2.11 # User time : 0.024 s
% 4.34/2.11 # System time : 0.003 s
% 4.34/2.11 # Total time : 0.027 s
% 4.34/2.11 # Maximum resident set size: 7124 pages
% 4.34/2.11
%------------------------------------------------------------------------------