↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n022.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 : Mon Jul 18 20:25:03 EDT 2022

% Result   : Theorem 7.16s 2.39s
% Output   : CNFRefutation 7.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  15 unt;   0 nHn;  26 RR)
%            Number of literals    :   43 (  14 equ;  19 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_198,hypothesis,
    sdtpldt0(sdtasdt0(xq,xu),xr) = xb,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_198) ).

cnf(i_0_201,negated_conjecture,
    xr = sz00,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_201) ).

cnf(i_0_10,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_10) ).

cnf(i_0_26,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_26) ).

cnf(i_0_176,hypothesis,
    aElementOf0(xu,xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_176) ).

cnf(i_0_149,hypothesis,
    aSet0(xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_149) ).

cnf(i_0_6,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_6) ).

cnf(i_0_200,hypothesis,
    aElement0(xq),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_200) ).

cnf(i_0_13,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_13) ).

cnf(i_0_196,hypothesis,
    ( sdtasdt0(xu,X1) != xb
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2rboc1uv/lgb.p',i_0_196) ).

cnf(c_0_212,hypothesis,
    sdtpldt0(sdtasdt0(xq,xu),xr) = xb,
    i_0_198 ).

cnf(c_0_213,negated_conjecture,
    xr = sz00,
    i_0_201 ).

cnf(c_0_214,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aElement0(X1) ),
    i_0_10 ).

cnf(c_0_215,hypothesis,
    sdtpldt0(sdtasdt0(xq,xu),sz00) = xb,
    inference(rw,[status(thm)],[c_0_212,c_0_213]) ).

cnf(c_0_216,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    i_0_26 ).

cnf(c_0_217,hypothesis,
    aElementOf0(xu,xI),
    i_0_176 ).

cnf(c_0_218,hypothesis,
    aSet0(xI),
    i_0_149 ).

cnf(c_0_219,plain,
    ( sdtasdt0(xq,xu) = xb
    | ~ aElement0(sdtasdt0(xq,xu)) ),
    inference(spm,[status(thm)],[c_0_214,c_0_215]) ).

cnf(c_0_220,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_6 ).

cnf(c_0_221,hypothesis,
    aElement0(xq),
    i_0_200 ).

cnf(c_0_222,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_217]),c_0_218])]) ).

cnf(c_0_223,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_13 ).

cnf(c_0_224,plain,
    sdtasdt0(xq,xu) = xb,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221])]),c_0_222])]) ).

cnf(c_0_225,hypothesis,
    ( sdtasdt0(xu,X1) != xb
    | ~ aElement0(X1) ),
    i_0_196 ).

cnf(c_0_226,plain,
    sdtasdt0(xu,xq) = xb,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_223,c_0_224]),c_0_222]),c_0_221])]) ).

cnf(c_0_227,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_225,c_0_226]),c_0_221])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : RNG119+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n022.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.18/0.33  % WCLimit  : 600
% 0.18/0.33  % DateTime : Mon May 30 11:49:39 EDT 2022
% 0.18/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.16/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.16/2.39  # No SInE strategy applied
% 7.16/2.39  # Trying AutoSched0 for 150 seconds
% 7.16/2.39  # AutoSched0-Mode selected heuristic G_E___008_C18_F1_PI_SE_CS_SP_CO_S4S
% 7.16/2.39  # and selection function SelectNewComplexAHPNS.
% 7.16/2.39  #
% 7.16/2.39  # Preprocessing time       : 0.014 s
% 7.16/2.39  
% 7.16/2.39  # Proof found!
% 7.16/2.39  # SZS status Theorem
% 7.16/2.39  # SZS output start CNFRefutation
% See solution above
% 7.16/2.39  # Training examples: 0 positive, 0 negative
% 7.16/2.39  
% 7.16/2.39  # -------------------------------------------------
% 7.16/2.39  # User time                : 0.020 s
% 7.16/2.39  # System time              : 0.002 s
% 7.16/2.39  # Total time               : 0.022 s
% 7.16/2.39  # Maximum resident set size: 7124 pages
% 7.16/2.39  
%------------------------------------------------------------------------------