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

View Problem - Process Solution

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_34,plain,
    ~ cEuroMP(iKinnock),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ntm99_8l/input.p',i_0_34) ).

cnf(i_0_24,plain,
    ( cEuroMP(X1)
    | ~ risEuroMPFrom(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ntm99_8l/input.p',i_0_24) ).

cnf(i_0_28,plain,
    ( risEuroMPFrom(X1,X2)
    | ~ rhasEuroMP(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ntm99_8l/input.p',i_0_28) ).

cnf(i_0_38,plain,
    rhasEuroMP(iUK,iKinnock),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ntm99_8l/input.p',i_0_38) ).

cnf(c_0_43,plain,
    ~ cEuroMP(iKinnock),
    i_0_34 ).

cnf(c_0_44,plain,
    ( cEuroMP(X1)
    | ~ risEuroMPFrom(X1,X2) ),
    i_0_24 ).

cnf(c_0_45,plain,
    ( risEuroMPFrom(X1,X2)
    | ~ rhasEuroMP(X2,X1) ),
    i_0_28 ).

cnf(c_0_46,plain,
    rhasEuroMP(iUK,iKinnock),
    i_0_38 ).

cnf(c_0_47,plain,
    ~ risEuroMPFrom(iKinnock,X1),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_48,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem  : KRS063+1 : TPTP v8.1.0. Released v3.1.0.
% 0.09/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.30  % Computer : n017.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Tue Jun  7 13:47:34 EDT 2022
% 0.10/0.31  % CPUTime  : 
% 0.15/0.41  # ENIGMATIC: Selected complete mode:
% 8.18/2.83  # ENIGMATIC: Solved by autoschedule:
% 8.18/2.83  # No SInE strategy applied
% 8.18/2.83  # Trying AutoSched0 for 150 seconds
% 8.18/2.83  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 8.18/2.83  # and selection function PSelectAllCondOptimalLit.
% 8.18/2.83  #
% 8.18/2.83  # Preprocessing time       : 0.020 s
% 8.18/2.83  # Presaturation interreduction done
% 8.18/2.83  
% 8.18/2.83  # Proof found!
% 8.18/2.83  # SZS status Theorem
% 8.18/2.83  # SZS output start CNFRefutation
% See solution above
% 8.18/2.83  # Training examples: 0 positive, 0 negative
% 8.18/2.83  
% 8.18/2.83  # -------------------------------------------------
% 8.18/2.83  # User time                : 0.023 s
% 8.18/2.83  # System time              : 0.003 s
% 8.18/2.83  # Total time               : 0.026 s
% 8.18/2.83  # Maximum resident set size: 7124 pages
% 8.18/2.83  
%------------------------------------------------------------------------------