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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS067+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 02:55:30 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_16,plain,
    ( ~ cb(X1)
    | ~ ca(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_16) ).

cnf(i_0_12,plain,
    ( cc(X1)
    | ca(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_12) ).

cnf(i_0_11,plain,
    ( cc(X1)
    | cb(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_11) ).

cnf(i_0_17,plain,
    ( ~ cc(X1)
    | ~ ca(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_17) ).

cnf(i_0_8,plain,
    ( cb(X1)
    | ca(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_8) ).

cnf(i_0_18,plain,
    ( ~ cc(X1)
    | ~ cb(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_18) ).

cnf(i_0_19,plain,
    cUnsatisfiable(i2003_11_14_17_18_1956),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7bg753tf/input.p',i_0_19) ).

cnf(c_0_27,plain,
    ( ~ cb(X1)
    | ~ ca(X1) ),
    i_0_16 ).

cnf(c_0_28,plain,
    ( cc(X1)
    | ca(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_12 ).

cnf(c_0_29,plain,
    ( cc(X1)
    | cb(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_11 ).

cnf(c_0_30,plain,
    ( ~ cc(X1)
    | ~ ca(X1) ),
    i_0_17 ).

cnf(c_0_31,plain,
    ( cb(X1)
    | ca(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_8 ).

cnf(c_0_32,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

cnf(c_0_33,plain,
    ( ~ cc(X1)
    | ~ cb(X1) ),
    i_0_18 ).

cnf(c_0_34,plain,
    ( cb(X1)
    | ~ cUnsatisfiable(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_35,plain,
    cUnsatisfiable(i2003_11_14_17_18_1956),
    i_0_19 ).

cnf(c_0_36,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_32]) ).

cnf(c_0_37,plain,
    $false,
    inference(sr,[status(thm)],[c_0_35,c_0_36]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS067+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n029.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Tue Jun  7 19:01:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 4.51/2.24  # ENIGMATIC: Solved by autoschedule:
% 4.51/2.24  # No SInE strategy applied
% 4.51/2.24  # Trying AutoSched0 for 150 seconds
% 4.51/2.24  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 4.51/2.24  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.51/2.24  #
% 4.51/2.24  # Preprocessing time       : 0.024 s
% 4.51/2.24  
% 4.51/2.24  # Proof found!
% 4.51/2.24  # SZS status Theorem
% 4.51/2.24  # SZS output start CNFRefutation
% See solution above
% 4.51/2.24  # Training examples: 0 positive, 0 negative
% 4.51/2.24  
% 4.51/2.24  # -------------------------------------------------
% 4.51/2.24  # User time                : 0.023 s
% 4.51/2.24  # System time              : 0.008 s
% 4.51/2.24  # Total time               : 0.032 s
% 4.51/2.24  # Maximum resident set size: 7116 pages
% 4.51/2.24  
%------------------------------------------------------------------------------