%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : RNG123+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n025.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:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_210,hypothesis,
    sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb) = xr,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_210) ).

cnf(i_0_203,hypothesis,
    smndt0(sdtasdt0(xq,xu)) = sdtpldt0(esk42_0,esk43_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_203) ).

cnf(i_0_202,hypothesis,
    aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_202) ).

cnf(i_0_148,hypothesis,
    ( aElementOf0(sdtpldt0(X1,X2),xI)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xI) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_148) ).

cnf(i_0_206,hypothesis,
    aElementOf0(xb,xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_206) ).

cnf(i_0_211,negated_conjecture,
    ~ aElementOf0(xr,xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-knpm4uke/lgb.p',i_0_211) ).

cnf(c_0_218,hypothesis,
    sdtpldt0(smndt0(sdtasdt0(xq,xu)),xb) = xr,
    i_0_210 ).

cnf(c_0_219,hypothesis,
    smndt0(sdtasdt0(xq,xu)) = sdtpldt0(esk42_0,esk43_0),
    i_0_203 ).

cnf(c_0_220,hypothesis,
    aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    i_0_202 ).

cnf(c_0_221,hypothesis,
    ( aElementOf0(sdtpldt0(X1,X2),xI)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xI) ),
    i_0_148 ).

cnf(c_0_222,hypothesis,
    sdtpldt0(sdtpldt0(esk42_0,esk43_0),xb) = xr,
    inference(rw,[status(thm)],[c_0_218,c_0_219]) ).

cnf(c_0_223,hypothesis,
    aElementOf0(xb,xI),
    i_0_206 ).

cnf(c_0_224,hypothesis,
    aElementOf0(sdtpldt0(esk42_0,esk43_0),xI),
    inference(rw,[status(thm)],[c_0_220,c_0_219]) ).

cnf(c_0_225,negated_conjecture,
    ~ aElementOf0(xr,xI),
    i_0_211 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG123+4 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Mon May 30 11:35:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 6.43/2.11  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.43/2.11  # No SInE strategy applied
% 6.43/2.11  # Trying AutoSched0 for 150 seconds
% 6.43/2.11  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 6.43/2.11  # and selection function SelectMaxLComplexAvoidPosPred.
% 6.43/2.11  #
% 6.43/2.11  # Preprocessing time       : 0.023 s
% 6.43/2.11  
% 6.43/2.11  # Proof found!
% 6.43/2.11  # SZS status Theorem
% 6.43/2.11  # SZS output start CNFRefutation
% See solution above
% 6.43/2.11  # Training examples: 0 positive, 0 negative
% 6.43/2.11  
% 6.43/2.11  # -------------------------------------------------
% 6.43/2.11  # User time                : 0.025 s
% 6.43/2.11  # System time              : 0.005 s
% 6.43/2.11  # Total time               : 0.030 s
% 6.43/2.11  # Maximum resident set size: 7124 pages
% 6.43/2.11  
%------------------------------------------------------------------------------