TSTP Solution File: SEU388+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n028.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:41:47 EDT 2022

% Result   : Theorem 7.90s 2.51s
% Output   : CNFRefutation 7.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   28 (  11 unt;  14 nHn;  28 RR)
%            Number of literals    :   89 (   8 equ;  52 neg)
%            Maximal clause size   :    7 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_193,plain,
    ( esk8_3(X1,X2,X3) = X1
    | empty_carrier(X2)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ element(X3,the_carrier(X2))
    | ~ in(X1,a_2_0_yellow19(X2,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_193) ).

cnf(i_0_72,plain,
    ( a_2_0_yellow19(X1,X2) = neighborhood_system(X1,X2)
    | empty_carrier(X1)
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_72) ).

cnf(i_0_375,negated_conjecture,
    ( point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_375) ).

cnf(i_0_378,negated_conjecture,
    top_str(esk44_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_378) ).

cnf(i_0_379,negated_conjecture,
    topological_space(esk44_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_379) ).

cnf(i_0_377,negated_conjecture,
    element(esk45_0,the_carrier(esk44_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_377) ).

cnf(i_0_380,negated_conjecture,
    ~ empty_carrier(esk44_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_380) ).

cnf(i_0_194,plain,
    ( empty_carrier(X1)
    | point_neighbourhood(esk8_3(X2,X1,X3),X1,X3)
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ in(X2,a_2_0_yellow19(X1,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_194) ).

cnf(i_0_192,plain,
    ( empty_carrier(X1)
    | in(X2,a_2_0_yellow19(X1,X3))
    | X4 != X2
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ point_neighbourhood(X4,X1,X3)
    | ~ element(X3,the_carrier(X1)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_192) ).

cnf(i_0_376,negated_conjecture,
    ( ~ point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | ~ in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-z4x2c3cr/lgb.p',i_0_376) ).

cnf(c_0_391,plain,
    ( esk8_3(X1,X2,X3) = X1
    | empty_carrier(X2)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ element(X3,the_carrier(X2))
    | ~ in(X1,a_2_0_yellow19(X2,X3)) ),
    i_0_193 ).

cnf(c_0_392,plain,
    ( a_2_0_yellow19(X1,X2) = neighborhood_system(X1,X2)
    | empty_carrier(X1)
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X2,the_carrier(X1)) ),
    i_0_72 ).

cnf(c_0_393,plain,
    ( esk8_3(X1,X2,X3) = X1
    | empty_carrier(X2)
    | ~ top_str(X2)
    | ~ topological_space(X2)
    | ~ element(X3,the_carrier(X2))
    | ~ in(X1,neighborhood_system(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_391,c_0_392]) ).

cnf(c_0_394,negated_conjecture,
    ( point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    i_0_375 ).

cnf(c_0_395,negated_conjecture,
    top_str(esk44_0),
    i_0_378 ).

cnf(c_0_396,negated_conjecture,
    topological_space(esk44_0),
    i_0_379 ).

cnf(c_0_397,negated_conjecture,
    element(esk45_0,the_carrier(esk44_0)),
    i_0_377 ).

cnf(c_0_398,negated_conjecture,
    ~ empty_carrier(esk44_0),
    i_0_380 ).

cnf(c_0_399,plain,
    ( empty_carrier(X1)
    | point_neighbourhood(esk8_3(X2,X1,X3),X1,X3)
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ in(X2,a_2_0_yellow19(X1,X3)) ),
    i_0_194 ).

cnf(c_0_400,negated_conjecture,
    ( esk8_3(esk46_0,esk44_0,esk45_0) = esk46_0
    | point_neighbourhood(esk46_0,esk44_0,esk45_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_393,c_0_394]),c_0_395]),c_0_396]),c_0_397])]),c_0_398]) ).

cnf(c_0_401,negated_conjecture,
    ( point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | ~ in(esk46_0,a_2_0_yellow19(esk44_0,esk45_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_399,c_0_400]),c_0_395]),c_0_396]),c_0_397])]),c_0_398]) ).

cnf(c_0_402,plain,
    ( empty_carrier(X1)
    | in(X2,a_2_0_yellow19(X1,X3))
    | X4 != X2
    | ~ topological_space(X1)
    | ~ top_str(X1)
    | ~ point_neighbourhood(X4,X1,X3)
    | ~ element(X3,the_carrier(X1)) ),
    i_0_192 ).

cnf(c_0_403,negated_conjecture,
    ( ~ point_neighbourhood(esk46_0,esk44_0,esk45_0)
    | ~ in(esk46_0,neighborhood_system(esk44_0,esk45_0)) ),
    i_0_376 ).

cnf(c_0_404,plain,
    point_neighbourhood(esk46_0,esk44_0,esk45_0),
    inference(csr,[status(thm)],[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_401,c_0_392]),c_0_395]),c_0_396]),c_0_397])]),c_0_398]),c_0_394]) ).

cnf(c_0_405,plain,
    ( empty_carrier(X1)
    | in(X2,a_2_0_yellow19(X1,X3))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ point_neighbourhood(X2,X1,X3) ),
    inference(er,[status(thm)],[c_0_402]) ).

cnf(c_0_406,negated_conjecture,
    ~ in(esk46_0,neighborhood_system(esk44_0,esk45_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_403,c_0_404])]) ).

cnf(c_0_407,plain,
    ( empty_carrier(X1)
    | in(X2,neighborhood_system(X1,X3))
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ element(X3,the_carrier(X1))
    | ~ point_neighbourhood(X2,X1,X3) ),
    inference(spm,[status(thm)],[c_0_405,c_0_392]) ).

cnf(c_0_408,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_406,c_0_407]),c_0_395]),c_0_396]),c_0_397]),c_0_404])]),c_0_398]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU388+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon Jun 20 10:49:48 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.90/2.51  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.90/2.51  # No SInE strategy applied
% 7.90/2.51  # Trying AutoSched0 for 150 seconds
% 7.90/2.51  # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 7.90/2.51  # and selection function SelectMaxLComplexAPPNTNp.
% 7.90/2.51  #
% 7.90/2.51  # Preprocessing time       : 0.024 s
% 7.90/2.51  
% 7.90/2.51  # Proof found!
% 7.90/2.51  # SZS status Theorem
% 7.90/2.51  # SZS output start CNFRefutation
% See solution above
% 7.90/2.51  # Training examples: 0 positive, 0 negative
% 7.90/2.51  
% 7.90/2.51  # -------------------------------------------------
% 7.90/2.51  # User time                : 0.025 s
% 7.90/2.51  # System time              : 0.011 s
% 7.90/2.51  # Total time               : 0.036 s
% 7.90/2.51  # Maximum resident set size: 7124 pages
% 7.90/2.51  
%------------------------------------------------------------------------------