↑ Up

Enigma---0.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 6.57s 2.27s
% Output   : CNFRefutation 6.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   16 (   4 unt;   0 nHn;  16 RR)
%            Number of literals    :   28 (   0 equ;  17 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-1 aty)
%            Number of variables   :   15 (   3 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_12) ).

cnf(i_0_14,plain,
    ( ra_Px1(X1,esk2_1(X1))
    | ~ cdxcomp(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_14) ).

cnf(i_0_8,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_8) ).

cnf(i_0_7,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_7) ).

cnf(i_0_6,plain,
    ( cd(X1)
    | ~ cUnsatisfiable(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_6) ).

cnf(i_0_21,plain,
    cUnsatisfiable(i2003_11_14_17_22_02803),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-6zofgvwh/lgb.p',i_0_21) ).

cnf(c_0_28,plain,
    ( ~ cd(X1)
    | ~ ra_Px1(X1,X2) ),
    i_0_12 ).

cnf(c_0_29,plain,
    ( ra_Px1(X1,esk2_1(X1))
    | ~ cdxcomp(X1) ),
    i_0_14 ).

cnf(c_0_30,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_31,plain,
    ( cdxcomp(X1)
    | ~ cc(X1) ),
    i_0_8 ).

cnf(c_0_32,plain,
    ( ~ cc(X1)
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,plain,
    ( cc(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_7 ).

cnf(c_0_34,plain,
    ( cd(X1)
    | ~ cUnsatisfiable(X1) ),
    i_0_6 ).

cnf(c_0_35,plain,
    cUnsatisfiable(i2003_11_14_17_22_02803),
    i_0_21 ).

cnf(c_0_36,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : KRS123+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n023.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 05:46:25 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 6.57/2.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.57/2.27  # No SInE strategy applied
% 6.57/2.27  # Trying AutoSched0 for 150 seconds
% 6.57/2.27  # AutoSched0-Mode selected heuristic G_____0003_C18_F1_SE_CS_SP_S0Y
% 6.57/2.27  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.57/2.27  #
% 6.57/2.27  # Preprocessing time       : 0.012 s
% 6.57/2.27  
% 6.57/2.27  # Proof found!
% 6.57/2.27  # SZS status Theorem
% 6.57/2.27  # SZS output start CNFRefutation
% See solution above
% 6.57/2.27  # Training examples: 0 positive, 0 negative
% 6.57/2.27  
% 6.57/2.27  # -------------------------------------------------
% 6.57/2.27  # User time                : 0.013 s
% 6.57/2.27  # System time              : 0.003 s
% 6.57/2.27  # Total time               : 0.016 s
% 6.57/2.27  # Maximum resident set size: 7124 pages
% 6.57/2.27  
%------------------------------------------------------------------------------