↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n026.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:56 EDT 2022

% Result   : Theorem 7.44s 2.32s
% Output   : CNFRefutation 7.44s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  11 unt;   6 nHn;  25 RR)
%            Number of literals    :   61 (   0 equ;  36 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_30,negated_conjecture,
    ( cowlNothing(esk3_0)
    | xsd_integer(esk4_0)
    | ~ xsd_string(esk4_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_30) ).

cnf(i_0_1,plain,
    ~ cowlNothing(X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_1) ).

cnf(i_0_29,negated_conjecture,
    ( cowlNothing(esk3_0)
    | xsd_string(esk4_0)
    | ~ xsd_integer(esk4_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_29) ).

cnf(i_0_4,plain,
    ( ~ xsd_string(X1)
    | ~ xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_4) ).

cnf(i_0_3,plain,
    ( xsd_string(X1)
    | xsd_integer(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_3) ).

cnf(i_0_19,plain,
    ( cC12(X1)
    | ~ cTEST(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_19) ).

cnf(i_0_20,plain,
    cTEST(iV21080),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_20) ).

cnf(i_0_5,plain,
    ( cC10(X1)
    | ~ cC2(X1)
    | ~ cC4(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_5) ).

cnf(i_0_27,plain,
    cC2(iV21081),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_27) ).

cnf(i_0_28,plain,
    cC4(iV21081),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6xdoon31/lgb.p',i_0_28) ).

cnf(c_0_41,negated_conjecture,
    ( cowlNothing(esk3_0)
    | xsd_integer(esk4_0)
    | ~ xsd_string(esk4_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    i_0_30 ).

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

cnf(c_0_43,negated_conjecture,
    ( cowlNothing(esk3_0)
    | xsd_string(esk4_0)
    | ~ xsd_integer(esk4_0)
    | ~ cC10(iV21081)
    | ~ cC12(iV21080) ),
    i_0_29 ).

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

cnf(c_0_45,negated_conjecture,
    ( xsd_integer(esk4_0)
    | ~ cC12(iV21080)
    | ~ cC10(iV21081)
    | ~ xsd_string(esk4_0) ),
    inference(sr,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,negated_conjecture,
    ( ~ cC12(iV21080)
    | ~ cC10(iV21081)
    | ~ xsd_integer(esk4_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[c_0_43,c_0_42]),c_0_44]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ cC12(iV21080)
    | ~ cC10(iV21081)
    | ~ xsd_string(esk4_0) ),
    inference(csr,[status(thm)],[c_0_45,c_0_46]) ).

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

cnf(c_0_49,plain,
    ( cC12(X1)
    | ~ cTEST(X1) ),
    i_0_19 ).

cnf(c_0_50,plain,
    cTEST(iV21080),
    i_0_20 ).

cnf(c_0_51,negated_conjecture,
    ( ~ cC12(iV21080)
    | ~ cC10(iV21081) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_46]) ).

cnf(c_0_52,plain,
    cC12(iV21080),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

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

cnf(c_0_54,plain,
    cC2(iV21081),
    i_0_27 ).

cnf(c_0_55,plain,
    cC4(iV21081),
    i_0_28 ).

cnf(c_0_56,negated_conjecture,
    ~ cC10(iV21081),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]) ).

cnf(c_0_57,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),c_0_56]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : KRS152+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun  7 09:18:48 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.44/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.44/2.32  # No SInE strategy applied
% 7.44/2.32  # Trying AutoSched0 for 150 seconds
% 7.44/2.32  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.44/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.44/2.32  #
% 7.44/2.32  # Preprocessing time       : 0.023 s
% 7.44/2.32  # Presaturation interreduction done
% 7.44/2.32  
% 7.44/2.32  # Proof found!
% 7.44/2.32  # SZS status Theorem
% 7.44/2.32  # SZS output start CNFRefutation
% See solution above
% 7.44/2.32  # Training examples: 0 positive, 0 negative
% 7.44/2.32  
% 7.44/2.32  # -------------------------------------------------
% 7.44/2.32  # User time                : 0.023 s
% 7.44/2.32  # System time              : 0.008 s
% 7.44/2.32  # Total time               : 0.031 s
% 7.44/2.32  # Maximum resident set size: 7124 pages
% 7.44/2.32  
%------------------------------------------------------------------------------