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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n023.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:59 EDT 2022

% Result   : Theorem 7.41s 2.37s
% Output   : CNFRefutation 7.41s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   9 unt;   6 nHn;  19 RR)
%            Number of literals    :   41 (   7 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :    8 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,negated_conjecture,
    ( ia = ib
    | cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_17) ).

cnf(i_0_7,plain,
    ~ cowlNothing(X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_7) ).

cnf(i_0_10,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_10) ).

cnf(i_0_16,negated_conjecture,
    ( ia = ib
    | cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_16) ).

cnf(i_0_9,plain,
    ( xsd_integer(X1)
    | xsd_string(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_9) ).

cnf(i_0_15,plain,
    ( ~ cA(X1)
    | ~ cB(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_15) ).

cnf(i_0_13,plain,
    cB(ib),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_13) ).

cnf(i_0_11,plain,
    cA(ia),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-_lln5shg/input.p',i_0_11) ).

cnf(c_0_26,negated_conjecture,
    ( ia = ib
    | cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0) ),
    i_0_17 ).

cnf(c_0_27,plain,
    ~ cowlNothing(X1),
    i_0_7 ).

cnf(c_0_28,plain,
    ( ~ xsd_integer(X1)
    | ~ xsd_string(X1) ),
    i_0_10 ).

cnf(c_0_29,negated_conjecture,
    ( ia = ib
    | cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0) ),
    i_0_16 ).

cnf(c_0_30,negated_conjecture,
    ( ia = ib
    | ~ xsd_string(esk2_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).

cnf(c_0_31,plain,
    ( xsd_integer(X1)
    | xsd_string(X1) ),
    i_0_9 ).

cnf(c_0_32,negated_conjecture,
    ( ia = ib
    | ~ xsd_integer(esk2_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_29,c_0_27]),c_0_28]) ).

cnf(c_0_33,plain,
    ( ~ cA(X1)
    | ~ cB(X1) ),
    i_0_15 ).

cnf(c_0_34,plain,
    cB(ib),
    i_0_13 ).

cnf(c_0_35,plain,
    cA(ia),
    i_0_11 ).

cnf(c_0_36,negated_conjecture,
    ia = ib,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_37,plain,
    ~ cA(ib),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : KRS163+1 : TPTP v8.1.0. Released v3.1.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n023.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Tue Jun  7 16:50:40 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 7.41/2.37  # ENIGMATIC: Solved by autoschedule:
% 7.41/2.37  # No SInE strategy applied
% 7.41/2.37  # Trying AutoSched0 for 150 seconds
% 7.41/2.37  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 7.41/2.37  # and selection function SelectNewComplexAHP.
% 7.41/2.37  #
% 7.41/2.37  # Preprocessing time       : 0.023 s
% 7.41/2.37  # Presaturation interreduction done
% 7.41/2.37  
% 7.41/2.37  # Proof found!
% 7.41/2.37  # SZS status Theorem
% 7.41/2.37  # SZS output start CNFRefutation
% See solution above
% 7.41/2.37  # Training examples: 0 positive, 0 negative
% 7.41/2.37  
% 7.41/2.37  # -------------------------------------------------
% 7.41/2.37  # User time                : 0.024 s
% 7.41/2.37  # System time              : 0.004 s
% 7.41/2.37  # Total time               : 0.028 s
% 7.41/2.37  # Maximum resident set size: 7120 pages
% 7.41/2.37  
%------------------------------------------------------------------------------