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

View Problem - Process Solution

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

% Computer : n029.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:39 EDT 2022

% Result   : Theorem 12.21s 3.69s
% Output   : CNFRefutation 12.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   18 (   8 unt;   0 nHn;  18 RR)
%            Number of literals    :   37 (   0 equ;  21 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   4 con; 0-1 aty)
%            Number of variables   :   22 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_639,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_639) ).

cnf(i_0_612,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_612) ).

cnf(i_0_613,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_613) ).

cnf(i_0_2738,plain,
    s__instance(s__Arc13_1,s__GraphLoop),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_2738) ).

cnf(i_0_919,plain,
    s__subclass(s__GraphLoop,s__GraphArc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_919) ).

cnf(i_0_922,plain,
    ( s__links(esk31_1(X1),esk31_1(X1),X1)
    | ~ s__instance(X1,s__GraphArc)
    | ~ s__instance(X1,s__GraphLoop) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_922) ).

cnf(i_0_2739,negated_conjecture,
    ~ s__links(X1,X1,s__Arc13_1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ynjsatmu/lgb.p',i_0_2739) ).

cnf(c_0_2747,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    i_0_639 ).

cnf(c_0_2748,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    i_0_612 ).

cnf(c_0_2749,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    i_0_613 ).

cnf(c_0_2750,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_2747,c_0_2748]),c_0_2749]) ).

cnf(c_0_2751,plain,
    s__instance(s__Arc13_1,s__GraphLoop),
    i_0_2738 ).

cnf(c_0_2752,plain,
    ( s__instance(s__Arc13_1,X1)
    | ~ s__subclass(s__GraphLoop,X1) ),
    inference(spm,[status(thm)],[c_0_2750,c_0_2751]) ).

cnf(c_0_2753,plain,
    s__subclass(s__GraphLoop,s__GraphArc),
    i_0_919 ).

cnf(c_0_2754,plain,
    ( s__links(esk31_1(X1),esk31_1(X1),X1)
    | ~ s__instance(X1,s__GraphArc)
    | ~ s__instance(X1,s__GraphLoop) ),
    i_0_922 ).

cnf(c_0_2755,plain,
    s__instance(s__Arc13_1,s__GraphArc),
    inference(spm,[status(thm)],[c_0_2752,c_0_2753]) ).

cnf(c_0_2756,negated_conjecture,
    ~ s__links(X1,X1,s__Arc13_1),
    i_0_2739 ).

cnf(c_0_2757,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2754,c_0_2755]),c_0_2751])]),c_0_2756]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : CSR086+1 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jun  9 19:23:39 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.47/0.65  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.47/0.65  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.47/0.65  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.47/0.65  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 12.21/3.69  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.21/3.69  # SinE strategy is gf600_h_gu_R05_F100_L20000
% 12.21/3.69  # Trying AutoSched0 for 150 seconds
% 12.21/3.69  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 12.21/3.69  # and selection function SelectCQIPrecWNTNp.
% 12.21/3.69  #
% 12.21/3.69  # Preprocessing time       : 0.034 s
% 12.21/3.69  # Presaturation interreduction done
% 12.21/3.69  
% 12.21/3.69  # Proof found!
% 12.21/3.69  # SZS status Theorem
% 12.21/3.69  # SZS output start CNFRefutation
% See solution above
% 12.21/3.69  # Training examples: 0 positive, 0 negative
% 12.21/3.69  
% 12.21/3.69  # -------------------------------------------------
% 12.21/3.69  # User time                : 0.411 s
% 12.21/3.69  # System time              : 0.021 s
% 12.21/3.69  # Total time               : 0.432 s
% 12.21/3.69  # Maximum resident set size: 7128 pages
% 12.21/3.69  
%------------------------------------------------------------------------------