TSTP Solution File: SEU341+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU341+2 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n021.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:59 EDT 2022

% Result   : Theorem 16.72s 4.17s
% Output   : CNFRefutation 16.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   16
% Syntax   : Number of clauses     :   42 (  26 unt;   4 nHn;  42 RR)
%            Number of literals    :   83 (   7 equ;  43 neg)
%            Maximal clause size   :    7 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :   11 (   9 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   3 con; 0-2 aty)
%            Number of variables   :   39 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_242,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_242) ).

cnf(i_0_2377,negated_conjecture,
    element(esk412_0,powerset(the_carrier(esk411_0))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2377) ).

cnf(i_0_533,plain,
    ~ empty(powerset(X1)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_533) ).

cnf(i_0_658,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_658) ).

cnf(i_0_2294,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2294) ).

cnf(i_0_468,plain,
    ( element(meet_of_subsets(X1,X2),powerset(X1))
    | ~ element(X2,powerset(powerset(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_468) ).

cnf(i_0_792,plain,
    ( meet_of_subsets(X1,X2) = set_meet(X2)
    | ~ element(X2,powerset(powerset(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_792) ).

cnf(i_0_2369,lemma,
    ( interior(X1,X2) = X2
    | ~ top_str(X3)
    | ~ top_str(X1)
    | ~ topological_space(X3)
    | ~ open_subset(X2,X1)
    | ~ element(X4,powerset(the_carrier(X3)))
    | ~ element(X2,powerset(the_carrier(X1))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2369) ).

cnf(i_0_2375,negated_conjecture,
    open_subset(esk412_0,esk411_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2375) ).

cnf(i_0_2378,negated_conjecture,
    top_str(esk411_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2378) ).

cnf(i_0_2379,negated_conjecture,
    topological_space(esk411_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2379) ).

cnf(i_0_141,plain,
    ( empty_carrier(X1)
    | point_neighbourhood(X2,X1,X3)
    | ~ top_str(X1)
    | ~ topological_space(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-5rndoktv/lgb.p',i_0_141) ).

cnf(i_0_2380,negated_conjecture,
    ~ empty_carrier(esk411_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2380) ).

cnf(i_0_2374,negated_conjecture,
    in(esk413_0,esk412_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2374) ).

cnf(i_0_2376,negated_conjecture,
    element(esk413_0,the_carrier(esk411_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2376) ).

cnf(i_0_2373,negated_conjecture,
    ~ point_neighbourhood(esk412_0,esk411_0,esk413_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-5rndoktv/lgb.p',i_0_2373) ).

cnf(c_0_2397,plain,
    ( empty(X1)
    | in(X2,X1)
    | ~ element(X2,X1) ),
    i_0_242 ).

cnf(c_0_2398,negated_conjecture,
    element(esk412_0,powerset(the_carrier(esk411_0))),
    i_0_2377 ).

cnf(c_0_2399,plain,
    ~ empty(powerset(X1)),
    i_0_533 ).

cnf(c_0_2400,lemma,
    ( subset(unordered_pair(X1,X1),X2)
    | ~ in(X1,X2) ),
    i_0_658 ).

cnf(c_0_2401,negated_conjecture,
    in(esk412_0,powerset(the_carrier(esk411_0))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_2397,c_0_2398]),c_0_2399]) ).

cnf(c_0_2402,plain,
    ( element(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    i_0_2294 ).

cnf(c_0_2403,negated_conjecture,
    subset(unordered_pair(esk412_0,esk412_0),powerset(the_carrier(esk411_0))),
    inference(spm,[status(thm)],[c_0_2400,c_0_2401]) ).

cnf(c_0_2404,plain,
    ( element(meet_of_subsets(X1,X2),powerset(X1))
    | ~ element(X2,powerset(powerset(X1))) ),
    i_0_468 ).

cnf(c_0_2405,plain,
    element(unordered_pair(esk412_0,esk412_0),powerset(powerset(the_carrier(esk411_0)))),
    inference(spm,[status(thm)],[c_0_2402,c_0_2403]) ).

cnf(c_0_2406,plain,
    ( meet_of_subsets(X1,X2) = set_meet(X2)
    | ~ element(X2,powerset(powerset(X1))) ),
    i_0_792 ).

cnf(c_0_2407,lemma,
    ( interior(X1,X2) = X2
    | ~ top_str(X3)
    | ~ top_str(X1)
    | ~ topological_space(X3)
    | ~ open_subset(X2,X1)
    | ~ element(X4,powerset(the_carrier(X3)))
    | ~ element(X2,powerset(the_carrier(X1))) ),
    i_0_2369 ).

cnf(c_0_2408,negated_conjecture,
    open_subset(esk412_0,esk411_0),
    i_0_2375 ).

cnf(c_0_2409,negated_conjecture,
    top_str(esk411_0),
    i_0_2378 ).

cnf(c_0_2410,plain,
    element(meet_of_subsets(the_carrier(esk411_0),unordered_pair(esk412_0,esk412_0)),powerset(the_carrier(esk411_0))),
    inference(spm,[status(thm)],[c_0_2404,c_0_2405]) ).

cnf(c_0_2411,plain,
    meet_of_subsets(the_carrier(esk411_0),unordered_pair(esk412_0,esk412_0)) = set_meet(unordered_pair(esk412_0,esk412_0)),
    inference(spm,[status(thm)],[c_0_2406,c_0_2405]) ).

cnf(c_0_2412,negated_conjecture,
    ( interior(esk411_0,esk412_0) = esk412_0
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X2,powerset(the_carrier(X1))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2407,c_0_2408]),c_0_2409]),c_0_2398])]) ).

cnf(c_0_2413,plain,
    element(set_meet(unordered_pair(esk412_0,esk412_0)),powerset(the_carrier(esk411_0))),
    inference(rw,[status(thm)],[c_0_2410,c_0_2411]) ).

cnf(c_0_2414,negated_conjecture,
    topological_space(esk411_0),
    i_0_2379 ).

cnf(c_0_2415,plain,
    ( empty_carrier(X1)
    | point_neighbourhood(X2,X1,X3)
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ in(X3,interior(X1,X2))
    | ~ element(X2,powerset(the_carrier(X1))) ),
    i_0_141 ).

cnf(c_0_2416,plain,
    interior(esk411_0,esk412_0) = esk412_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2412,c_0_2413]),c_0_2414]),c_0_2409])]) ).

cnf(c_0_2417,negated_conjecture,
    ~ empty_carrier(esk411_0),
    i_0_2380 ).

cnf(c_0_2418,plain,
    ( point_neighbourhood(esk412_0,esk411_0,X1)
    | ~ in(X1,esk412_0)
    | ~ element(X1,the_carrier(esk411_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2415,c_0_2416]),c_0_2414]),c_0_2409]),c_0_2398])]),c_0_2417]) ).

cnf(c_0_2419,negated_conjecture,
    in(esk413_0,esk412_0),
    i_0_2374 ).

cnf(c_0_2420,negated_conjecture,
    element(esk413_0,the_carrier(esk411_0)),
    i_0_2376 ).

cnf(c_0_2421,negated_conjecture,
    ~ point_neighbourhood(esk412_0,esk411_0,esk413_0),
    i_0_2373 ).

cnf(c_0_2422,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2418,c_0_2419]),c_0_2420])]),c_0_2421]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU341+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n021.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Mon Jun 20 00:08:19 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected SinE mode:
% 0.20/0.50  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.20/0.50  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.20/0.50  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 16.72/4.17  # ENIGMATIC: Solved by autoschedule-lgb:
% 16.72/4.17  # No SInE strategy applied
% 16.72/4.17  # Trying AutoSched0 for 150 seconds
% 16.72/4.17  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 16.72/4.17  # and selection function SelectCQIPrecWNTNp.
% 16.72/4.17  #
% 16.72/4.17  # Preprocessing time       : 0.018 s
% 16.72/4.17  # Presaturation interreduction done
% 16.72/4.17  
% 16.72/4.17  # Proof found!
% 16.72/4.17  # SZS status Theorem
% 16.72/4.17  # SZS output start CNFRefutation
% See solution above
% 16.72/4.17  # Training examples: 0 positive, 0 negative
% 16.72/4.17  
% 16.72/4.17  # -------------------------------------------------
% 16.72/4.17  # User time                : 0.954 s
% 16.72/4.17  # System time              : 0.035 s
% 16.72/4.17  # Total time               : 0.989 s
% 16.72/4.17  # Maximum resident set size: 7232 pages
% 16.72/4.17  
%------------------------------------------------------------------------------