↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n024.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:54 EDT 2022

% Result   : Theorem 7.40s 2.34s
% Output   : CNFRefutation 7.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (   8 unt;   6 nHn;  18 RR)
%            Number of literals    :   42 (   0 equ;  20 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   10 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_10,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wxwcrrpj/input.p',i_0_10) ).

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

cnf(i_0_5,plain,
    ( rpath(X1,X2)
    | ~ rpath(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wxwcrrpj/input.p',i_0_5) ).

cnf(i_0_8,plain,
    rpath(iGhent,iAntwerp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wxwcrrpj/input.p',i_0_8) ).

cnf(i_0_9,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wxwcrrpj/input.p',i_0_9) ).

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

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

cnf(c_0_18,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    i_0_10 ).

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

cnf(c_0_20,plain,
    ( rpath(X1,X2)
    | ~ rpath(X2,X1) ),
    i_0_5 ).

cnf(c_0_21,plain,
    rpath(iGhent,iAntwerp),
    i_0_8 ).

cnf(c_0_22,negated_conjecture,
    ( cowlNothing(esk1_0)
    | xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    i_0_9 ).

cnf(c_0_23,negated_conjecture,
    ( xsd_integer(esk2_0)
    | ~ xsd_string(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    inference(sr,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_24,plain,
    rpath(iAntwerp,iGhent),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

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

cnf(c_0_26,negated_conjecture,
    ( xsd_string(esk2_0)
    | ~ xsd_integer(esk2_0)
    | ~ rpath(iAntwerp,iGhent) ),
    inference(sr,[status(thm)],[c_0_22,c_0_19]) ).

cnf(c_0_27,negated_conjecture,
    xsd_integer(esk2_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24])]),c_0_25]) ).

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

cnf(c_0_29,negated_conjecture,
    xsd_string(esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_24])]),c_0_27])]) ).

cnf(c_0_30,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_27]),c_0_29])]),
    [proof] ).

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