TSTP Solution File: SEU341+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n025.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 Jul 19 08:40:58 EDT 2022
% Result : Theorem 7.28s 2.34s
% Output : CNFRefutation 7.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 35 ( 20 unt; 6 nHn; 35 RR)
% Number of literals : 89 ( 4 equ; 52 neg)
% Maximal clause size : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 9 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 36 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_48,plain,
( empty_carrier(X1)
| element(X2,powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ point_neighbourhood(X2,X1,X3)
| ~ element(X3,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_48) ).
cnf(i_0_83,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_83) ).
cnf(i_0_85,negated_conjecture,
top_str(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_85) ).
cnf(i_0_86,negated_conjecture,
topological_space(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_86) ).
cnf(i_0_87,negated_conjecture,
~ empty_carrier(esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_87) ).
cnf(i_0_53,plain,
( empty_carrier(X1)
| point_neighbourhood(esk3_2(X1,X2),X1,X2)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,the_carrier(X1)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_53) ).
cnf(i_0_79,plain,
( interior(X1,X2) = X2
| ~ topological_space(X3)
| ~ top_str(X3)
| ~ top_str(X1)
| ~ open_subset(X2,X1)
| ~ element(X4,powerset(the_carrier(X3)))
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_79) ).
cnf(i_0_41,plain,
( empty_carrier(X1)
| point_neighbourhood(X2,X1,X3)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ in(X3,interior(X1,X2))
| ~ element(X2,powerset(the_carrier(X1))) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_41) ).
cnf(i_0_84,negated_conjecture,
element(esk9_0,powerset(the_carrier(esk8_0))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_84) ).
cnf(i_0_82,negated_conjecture,
open_subset(esk9_0,esk8_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_82) ).
cnf(i_0_77,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_77) ).
cnf(i_0_81,negated_conjecture,
in(esk10_0,esk9_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_81) ).
cnf(i_0_80,negated_conjecture,
~ point_neighbourhood(esk9_0,esk8_0,esk10_0),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-y6s6igqs/input.p',i_0_80) ).
cnf(c_0_101,plain,
( empty_carrier(X1)
| element(X2,powerset(the_carrier(X1)))
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ point_neighbourhood(X2,X1,X3)
| ~ element(X3,the_carrier(X1)) ),
i_0_48 ).
cnf(c_0_102,negated_conjecture,
element(esk10_0,the_carrier(esk8_0)),
i_0_83 ).
cnf(c_0_103,negated_conjecture,
top_str(esk8_0),
i_0_85 ).
cnf(c_0_104,negated_conjecture,
topological_space(esk8_0),
i_0_86 ).
cnf(c_0_105,negated_conjecture,
~ empty_carrier(esk8_0),
i_0_87 ).
cnf(c_0_106,plain,
( empty_carrier(X1)
| point_neighbourhood(esk3_2(X1,X2),X1,X2)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X2,the_carrier(X1)) ),
i_0_53 ).
cnf(c_0_107,negated_conjecture,
( element(X1,powerset(the_carrier(esk8_0)))
| ~ point_neighbourhood(X1,esk8_0,esk10_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]),c_0_104])]),c_0_105]) ).
cnf(c_0_108,negated_conjecture,
point_neighbourhood(esk3_2(esk8_0,esk10_0),esk8_0,esk10_0),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_102]),c_0_103]),c_0_104])]),c_0_105]) ).
cnf(c_0_109,plain,
( interior(X1,X2) = X2
| ~ topological_space(X3)
| ~ top_str(X3)
| ~ top_str(X1)
| ~ open_subset(X2,X1)
| ~ element(X4,powerset(the_carrier(X3)))
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_79 ).
cnf(c_0_110,negated_conjecture,
element(esk3_2(esk8_0,esk10_0),powerset(the_carrier(esk8_0))),
inference(spm,[status(thm)],[c_0_107,c_0_108]) ).
cnf(c_0_111,plain,
( empty_carrier(X1)
| point_neighbourhood(X2,X1,X3)
| ~ topological_space(X1)
| ~ top_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ in(X3,interior(X1,X2))
| ~ element(X2,powerset(the_carrier(X1))) ),
i_0_41 ).
cnf(c_0_112,negated_conjecture,
element(esk9_0,powerset(the_carrier(esk8_0))),
i_0_84 ).
cnf(c_0_113,plain,
( interior(X1,X2) = X2
| ~ element(X2,powerset(the_carrier(X1)))
| ~ open_subset(X2,X1)
| ~ top_str(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_110]),c_0_103]),c_0_104])]) ).
cnf(c_0_114,negated_conjecture,
open_subset(esk9_0,esk8_0),
i_0_82 ).
cnf(c_0_115,plain,
( element(X1,X2)
| ~ in(X1,X3)
| ~ element(X3,powerset(X2)) ),
i_0_77 ).
cnf(c_0_116,negated_conjecture,
( point_neighbourhood(esk9_0,esk8_0,X1)
| ~ element(X1,the_carrier(esk8_0))
| ~ in(X1,interior(esk8_0,esk9_0)) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_103]),c_0_104])]),c_0_105]) ).
cnf(c_0_117,negated_conjecture,
interior(esk8_0,esk9_0) = esk9_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_113,c_0_112]),c_0_114]),c_0_103])]) ).
cnf(c_0_118,negated_conjecture,
( element(X1,the_carrier(esk8_0))
| ~ in(X1,esk9_0) ),
inference(spm,[status(thm)],[c_0_115,c_0_112]) ).
cnf(c_0_119,negated_conjecture,
( point_neighbourhood(esk9_0,esk8_0,X1)
| ~ in(X1,esk9_0) ),
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_116,c_0_117]),c_0_118]) ).
cnf(c_0_120,negated_conjecture,
in(esk10_0,esk9_0),
i_0_81 ).
cnf(c_0_121,negated_conjecture,
~ point_neighbourhood(esk9_0,esk8_0,esk10_0),
i_0_80 ).
cnf(c_0_122,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SEU341+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n025.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 Jun 19 10:49:00 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.43 # ENIGMATIC: Selected complete mode:
% 7.28/2.34 # ENIGMATIC: Solved by autoschedule:
% 7.28/2.34 # No SInE strategy applied
% 7.28/2.34 # Trying AutoSched0 for 150 seconds
% 7.28/2.34 # AutoSched0-Mode selected heuristic G_E___200_B02_F1_SE_CS_SP_PI_S0S
% 7.28/2.34 # and selection function SelectComplexG.
% 7.28/2.34 #
% 7.28/2.34 # Preprocessing time : 0.023 s
% 7.28/2.34
% 7.28/2.34 # Proof found!
% 7.28/2.34 # SZS status Theorem
% 7.28/2.34 # SZS output start CNFRefutation
% See solution above
% 7.28/2.34 # Training examples: 0 positive, 0 negative
% 7.28/2.34
% 7.28/2.34 # -------------------------------------------------
% 7.28/2.34 # User time : 0.036 s
% 7.28/2.34 # System time : 0.004 s
% 7.28/2.34 # Total time : 0.040 s
% 7.28/2.34 # Maximum resident set size: 7120 pages
% 7.28/2.34
%------------------------------------------------------------------------------