↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU386+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n032.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:45 EDT 2022

% Result   : Theorem 7.99s 2.36s
% Output   : CNFRefutation 7.99s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   17
% Syntax   : Number of clauses     :   40 (  22 unt;  11 nHn;  40 RR)
%            Number of literals    :  141 (   2 equ;  84 neg)
%            Maximal clause size   :   13 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   15 (  13 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-3 aty)
%            Number of variables   :   47 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_eventually_in(X2,X1,X3)
    | X4 != lim_points_of_net(X2,X1)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ in(X5,X4)
    | ~ net_str(X1,X2)
    | ~ point_neighbourhood(X3,X2,X5)
    | ~ element(X5,the_carrier(X2))
    | ~ element(X4,powerset(the_carrier(X2))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_14) ).

cnf(i_0_70,plain,
    ( element(X1,X2)
    | ~ in(X1,X3)
    | ~ element(X3,powerset(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_70) ).

cnf(i_0_18,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | element(lim_points_of_net(X2,X1),powerset(the_carrier(X2)))
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ net_str(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_18) ).

cnf(i_0_58,negated_conjecture,
    in(esk20_0,lim_points_of_net(esk18_0,esk19_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_58) ).

cnf(i_0_61,negated_conjecture,
    directed_relstr(esk19_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_61) ).

cnf(i_0_62,negated_conjecture,
    transitive_relstr(esk19_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_62) ).

cnf(i_0_64,negated_conjecture,
    top_str(esk18_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_64) ).

cnf(i_0_65,negated_conjecture,
    topological_space(esk18_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_65) ).

cnf(i_0_60,negated_conjecture,
    net_str(esk19_0,esk18_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_60) ).

cnf(i_0_66,negated_conjecture,
    ~ empty_carrier(esk18_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_66) ).

cnf(i_0_63,negated_conjecture,
    ~ empty_carrier(esk19_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_63) ).

cnf(i_0_56,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X2,X1,X3)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2)
    | ~ is_eventually_in(X2,X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_56) ).

cnf(i_0_15,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_a_cluster_point_of_netstr(X2,X1,X3)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ net_str(X1,X2)
    | ~ element(X3,the_carrier(X2))
    | ~ is_often_in(X2,X1,esk4_3(X2,X1,X3)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_15) ).

cnf(i_0_16,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_a_cluster_point_of_netstr(X2,X1,X3)
    | point_neighbourhood(esk4_3(X2,X1,X3),X2,X3)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ net_str(X1,X2)
    | ~ element(X3,the_carrier(X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_16) ).

cnf(i_0_59,negated_conjecture,
    element(esk20_0,the_carrier(esk18_0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_59) ).

cnf(i_0_57,negated_conjecture,
    ~ is_a_cluster_point_of_netstr(esk18_0,esk19_0,esk20_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_57) ).

cnf(i_0_22,plain,
    ( one_sorted_str(X1)
    | ~ top_str(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-la_7785h/lgb.p',i_0_22) ).

cnf(c_0_88,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_eventually_in(X2,X1,X3)
    | X4 != lim_points_of_net(X2,X1)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ in(X5,X4)
    | ~ net_str(X1,X2)
    | ~ point_neighbourhood(X3,X2,X5)
    | ~ element(X5,the_carrier(X2))
    | ~ element(X4,powerset(the_carrier(X2))) ),
    i_0_14 ).

cnf(c_0_89,plain,
    ( element(X1,X2)
    | ~ in(X1,X3)
    | ~ element(X3,powerset(X2)) ),
    i_0_70 ).

cnf(c_0_90,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | element(lim_points_of_net(X2,X1),powerset(the_carrier(X2)))
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ net_str(X1,X2) ),
    i_0_18 ).

cnf(c_0_91,plain,
    ( is_eventually_in(X1,X2,X3)
    | empty_carrier(X1)
    | empty_carrier(X2)
    | ~ point_neighbourhood(X3,X1,X4)
    | ~ directed_relstr(X2)
    | ~ transitive_relstr(X2)
    | ~ top_str(X1)
    | ~ topological_space(X1)
    | ~ net_str(X2,X1)
    | ~ in(X4,lim_points_of_net(X1,X2)) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[c_0_88,c_0_89])]),c_0_90]) ).

cnf(c_0_92,negated_conjecture,
    in(esk20_0,lim_points_of_net(esk18_0,esk19_0)),
    i_0_58 ).

cnf(c_0_93,negated_conjecture,
    directed_relstr(esk19_0),
    i_0_61 ).

cnf(c_0_94,negated_conjecture,
    transitive_relstr(esk19_0),
    i_0_62 ).

cnf(c_0_95,negated_conjecture,
    top_str(esk18_0),
    i_0_64 ).

cnf(c_0_96,negated_conjecture,
    topological_space(esk18_0),
    i_0_65 ).

cnf(c_0_97,negated_conjecture,
    net_str(esk19_0,esk18_0),
    i_0_60 ).

cnf(c_0_98,negated_conjecture,
    ~ empty_carrier(esk18_0),
    i_0_66 ).

cnf(c_0_99,negated_conjecture,
    ~ empty_carrier(esk19_0),
    i_0_63 ).

cnf(c_0_100,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_often_in(X2,X1,X3)
    | ~ transitive_relstr(X1)
    | ~ directed_relstr(X1)
    | ~ one_sorted_str(X2)
    | ~ net_str(X1,X2)
    | ~ is_eventually_in(X2,X1,X3) ),
    i_0_56 ).

cnf(c_0_101,negated_conjecture,
    ( is_eventually_in(esk18_0,esk19_0,X1)
    | ~ point_neighbourhood(X1,esk18_0,esk20_0) ),
    inference(sr,[status(thm)],[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(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93]),c_0_94]),c_0_95]),c_0_96]),c_0_97])]),c_0_98]),c_0_99]) ).

cnf(c_0_102,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_a_cluster_point_of_netstr(X2,X1,X3)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ net_str(X1,X2)
    | ~ element(X3,the_carrier(X2))
    | ~ is_often_in(X2,X1,esk4_3(X2,X1,X3)) ),
    i_0_15 ).

cnf(c_0_103,plain,
    ( is_often_in(esk18_0,esk19_0,X1)
    | ~ one_sorted_str(esk18_0)
    | ~ point_neighbourhood(X1,esk18_0,esk20_0) ),
    inference(sr,[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_100,c_0_101]),c_0_93]),c_0_94]),c_0_97])]),c_0_99]),c_0_98]) ).

cnf(c_0_104,plain,
    ( is_a_cluster_point_of_netstr(esk18_0,esk19_0,X1)
    | ~ one_sorted_str(esk18_0)
    | ~ point_neighbourhood(esk4_3(esk18_0,esk19_0,X1),esk18_0,esk20_0)
    | ~ element(X1,the_carrier(esk18_0)) ),
    inference(sr,[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_102,c_0_103]),c_0_95]),c_0_96]),c_0_97])]),c_0_99]),c_0_98]) ).

cnf(c_0_105,plain,
    ( empty_carrier(X1)
    | empty_carrier(X2)
    | is_a_cluster_point_of_netstr(X2,X1,X3)
    | point_neighbourhood(esk4_3(X2,X1,X3),X2,X3)
    | ~ topological_space(X2)
    | ~ top_str(X2)
    | ~ net_str(X1,X2)
    | ~ element(X3,the_carrier(X2)) ),
    i_0_16 ).

cnf(c_0_106,negated_conjecture,
    element(esk20_0,the_carrier(esk18_0)),
    i_0_59 ).

cnf(c_0_107,negated_conjecture,
    ~ is_a_cluster_point_of_netstr(esk18_0,esk19_0,esk20_0),
    i_0_57 ).

cnf(c_0_108,plain,
    ~ one_sorted_str(esk18_0),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[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_104,c_0_105]),c_0_106]),c_0_95]),c_0_96]),c_0_97])]),c_0_107]),c_0_99]),c_0_98]) ).

cnf(c_0_109,plain,
    ( one_sorted_str(X1)
    | ~ top_str(X1) ),
    i_0_22 ).

cnf(c_0_110,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_95])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : SEU386+1 : TPTP v8.1.0. Released v3.3.0.
% 0.00/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Sun Jun 19 08:48:04 EDT 2022
% 0.10/0.29  % CPUTime  : 
% 0.15/0.38  # ENIGMATIC: Selected complete mode:
% 7.99/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.99/2.36  # No SInE strategy applied
% 7.99/2.36  # Trying AutoSched0 for 150 seconds
% 7.99/2.36  # AutoSched0-Mode selected heuristic G_____0017_C18_F1_SE_CS_SP_S4Y
% 7.99/2.36  # and selection function SelectMaxLComplexAPPNTNp.
% 7.99/2.36  #
% 7.99/2.36  # Preprocessing time       : 0.016 s
% 7.99/2.36  
% 7.99/2.36  # Proof found!
% 7.99/2.36  # SZS status Theorem
% 7.99/2.36  # SZS output start CNFRefutation
% See solution above
% 7.99/2.36  # Training examples: 0 positive, 0 negative
% 7.99/2.36  
% 7.99/2.36  # -------------------------------------------------
% 7.99/2.36  # User time                : 0.020 s
% 7.99/2.36  # System time              : 0.003 s
% 7.99/2.36  # Total time               : 0.023 s
% 7.99/2.36  # Maximum resident set size: 7128 pages
% 7.99/2.36  
%------------------------------------------------------------------------------