↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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 : Fri Jul 15 02:47:56 EDT 2022

% Result   : Theorem 10.31s 3.55s
% Output   : CNFRefutation 10.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  14 unt;   0 nHn;  23 RR)
%            Number of literals    :   38 (   0 equ;  17 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   17 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_469,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_469) ).

cnf(i_0_2969,plain,
    s__subclass(s__Class32_2,s__Class32_3),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_2969) ).

cnf(i_0_470,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_470) ).

cnf(i_0_2968,plain,
    s__subclass(s__Class32_1,s__Class32_2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_2968) ).

cnf(i_0_493,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_493) ).

cnf(i_0_2970,plain,
    s__subclass(s__Class32_3,s__Class32_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_2970) ).

cnf(i_0_2971,negated_conjecture,
    ~ s__instance(esk139_0,s__Class32_1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_2971) ).

cnf(i_0_2972,negated_conjecture,
    s__instance(esk139_0,s__Class32_2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-9ska5y4r/lgb.p',i_0_2972) ).

cnf(c_0_2981,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    i_0_469 ).

cnf(c_0_2982,plain,
    s__subclass(s__Class32_2,s__Class32_3),
    i_0_2969 ).

cnf(c_0_2983,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    i_0_470 ).

cnf(c_0_2984,plain,
    s__subclass(s__Class32_1,s__Class32_2),
    i_0_2968 ).

cnf(c_0_2985,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    i_0_493 ).

cnf(c_0_2986,plain,
    s__subclass(s__Class32_3,s__Class32_1),
    i_0_2970 ).

cnf(c_0_2987,plain,
    s__instance(s__Class32_3,s__SetOrClass),
    inference(pm,[status(thm)],[c_0_2981,c_0_2982]) ).

cnf(c_0_2988,plain,
    s__instance(s__Class32_1,s__SetOrClass),
    inference(pm,[status(thm)],[c_0_2983,c_0_2984]) ).

cnf(c_0_2989,plain,
    s__instance(s__Class32_2,s__SetOrClass),
    inference(pm,[status(thm)],[c_0_2981,c_0_2984]) ).

cnf(c_0_2990,plain,
    ( s__instance(X1,s__Class32_1)
    | ~ s__instance(X1,s__Class32_3) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_2985,c_0_2986]),c_0_2987]),c_0_2988])]) ).

cnf(c_0_2991,plain,
    ( s__instance(X1,s__Class32_3)
    | ~ s__instance(X1,s__Class32_2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_2985,c_0_2982]),c_0_2989]),c_0_2987])]) ).

cnf(c_0_2992,negated_conjecture,
    ~ s__instance(esk139_0,s__Class32_1),
    i_0_2971 ).

cnf(c_0_2993,plain,
    ( s__instance(X1,s__Class32_1)
    | ~ s__instance(X1,s__Class32_2) ),
    inference(pm,[status(thm)],[c_0_2990,c_0_2991]) ).

cnf(c_0_2994,negated_conjecture,
    s__instance(esk139_0,s__Class32_2),
    i_0_2972 ).

cnf(c_0_2995,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(pm,[status(thm)],[c_0_2992,c_0_2993]),c_0_2994])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : CSR101+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.06/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n017.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 : Sat Jun 11 18:00:23 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected SinE mode:
% 0.47/0.67  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.47/0.67  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.47/0.67  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.47/0.67  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 10.31/3.55  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.31/3.55  # SinE strategy is gf600_h_gu_R05_F100_L20000
% 10.31/3.55  # Trying AutoSched0 for 150 seconds
% 10.31/3.55  # AutoSched0-Mode selected heuristic G_E___300_C01_S00
% 10.31/3.55  # and selection function NoSelection.
% 10.31/3.55  #
% 10.31/3.55  # Preprocessing time       : 0.044 s
% 10.31/3.55  
% 10.31/3.55  # Proof found!
% 10.31/3.55  # SZS status Theorem
% 10.31/3.55  # SZS output start CNFRefutation
% See solution above
% 10.31/3.55  # Training examples: 0 positive, 0 negative
% 10.31/3.55  
% 10.31/3.55  # -------------------------------------------------
% 10.31/3.55  # User time                : 0.166 s
% 10.31/3.55  # System time              : 0.022 s
% 10.31/3.55  # Total time               : 0.188 s
% 10.31/3.55  # Maximum resident set size: 7120 pages
% 10.31/3.55  
%------------------------------------------------------------------------------