↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS160+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:58 EDT 2022

% Result   : Theorem 7.84s 2.37s
% Output   : CNFRefutation 7.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   29 (  13 unt;   6 nHn;  27 RR)
%            Number of literals    :   63 (   0 equ;  32 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_42,negated_conjecture,
    ( cowlNothing(esk9_0)
    | xsd_integer(esk10_0)
    | ~ xsd_string(esk10_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_42) ).

cnf(i_0_1,plain,
    ~ cowlNothing(X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_1) ).

cnf(i_0_30,plain,
    ( cC12(X1)
    | ~ cTEST(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_30) ).

cnf(i_0_32,plain,
    cTEST(iV21080),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_32) ).

cnf(i_0_41,negated_conjecture,
    ( cowlNothing(esk9_0)
    | xsd_string(esk10_0)
    | ~ xsd_integer(esk10_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_41) ).

cnf(i_0_3,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_3) ).

cnf(i_0_5,plain,
    ( cC10(X1)
    | ~ cC4(X1)
    | ~ cC2(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_5) ).

cnf(i_0_39,plain,
    cC2(iV21081),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_39) ).

cnf(i_0_37,plain,
    cC4(iV21081),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_37) ).

cnf(i_0_4,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8j0_gl3c/input.p',i_0_4) ).

cnf(c_0_53,negated_conjecture,
    ( cowlNothing(esk9_0)
    | xsd_integer(esk10_0)
    | ~ xsd_string(esk10_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    i_0_42 ).

cnf(c_0_54,plain,
    ~ cowlNothing(X1),
    i_0_1 ).

cnf(c_0_55,plain,
    ( cC12(X1)
    | ~ cTEST(X1) ),
    i_0_30 ).

cnf(c_0_56,plain,
    cTEST(iV21080),
    i_0_32 ).

cnf(c_0_57,negated_conjecture,
    ( cowlNothing(esk9_0)
    | xsd_string(esk10_0)
    | ~ xsd_integer(esk10_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    i_0_41 ).

cnf(c_0_58,negated_conjecture,
    ( xsd_integer(esk10_0)
    | ~ cC12(iV21080)
    | ~ cC10(iV21081)
    | ~ xsd_string(esk10_0) ),
    inference(sr,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_59,plain,
    cC12(iV21080),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_60,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    i_0_3 ).

cnf(c_0_61,plain,
    ( cC10(X1)
    | ~ cC4(X1)
    | ~ cC2(X1) ),
    i_0_5 ).

cnf(c_0_62,plain,
    cC2(iV21081),
    i_0_39 ).

cnf(c_0_63,plain,
    cC4(iV21081),
    i_0_37 ).

cnf(c_0_64,negated_conjecture,
    ( xsd_string(esk10_0)
    | ~ cC12(iV21080)
    | ~ cC10(iV21081)
    | ~ xsd_integer(esk10_0) ),
    inference(sr,[status(thm)],[c_0_57,c_0_54]) ).

cnf(c_0_65,negated_conjecture,
    ( xsd_integer(esk10_0)
    | ~ cC10(iV21081) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59])]),c_0_60]) ).

cnf(c_0_66,plain,
    cC10(iV21081),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]) ).

cnf(c_0_67,negated_conjecture,
    ( xsd_string(esk10_0)
    | ~ cC10(iV21081) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_64,c_0_59])]),c_0_60]) ).

cnf(c_0_68,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    i_0_4 ).

cnf(c_0_69,negated_conjecture,
    xsd_integer(esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66])]) ).

cnf(c_0_70,negated_conjecture,
    xsd_string(esk10_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_67,c_0_66])]) ).

cnf(c_0_71,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_70])]),
    [proof] ).

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