TSTP Solution File: RNG112+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : RNG112+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 20:25:01 EDT 2022

% Result   : Theorem 7.43s 2.38s
% Output   : CNFRefutation 7.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   25 (  11 unt;  10 nHn;  25 RR)
%            Number of literals    :   58 (  28 equ;  26 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_105,hypothesis,
    aElementOf0(esk21_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_105) ).

cnf(i_0_98,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_98) ).

cnf(i_0_108,hypothesis,
    ( X1 = sz00
    | aElementOf0(esk22_0,xI)
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_108) ).

cnf(i_0_104,hypothesis,
    esk21_0 != sz00,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_104) ).

cnf(i_0_107,hypothesis,
    ( X1 = sz00
    | esk22_0 != sz00
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_107) ).

cnf(i_0_106,hypothesis,
    ( X1 = sz00
    | X2 = sz00
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xI)
    | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk22_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_106) ).

cnf(i_0_109,negated_conjecture,
    ( X1 = sz00
    | iLess0(sbrdtbr0(esk23_1(X1)),sbrdtbr0(X1))
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_109) ).

cnf(i_0_111,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk23_1(X1),xI)
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_111) ).

cnf(i_0_110,negated_conjecture,
    ( X1 = sz00
    | esk23_1(X1) != sz00
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ec1l_nal/lgb.p',i_0_110) ).

cnf(c_0_121,hypothesis,
    aElementOf0(esk21_0,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
    i_0_105 ).

cnf(c_0_122,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    i_0_98 ).

cnf(c_0_123,hypothesis,
    ( X1 = sz00
    | aElementOf0(esk22_0,xI)
    | ~ aElementOf0(X1,xI) ),
    i_0_108 ).

cnf(c_0_124,hypothesis,
    aElementOf0(esk21_0,xI),
    inference(rw,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_125,hypothesis,
    esk21_0 != sz00,
    i_0_104 ).

cnf(c_0_126,hypothesis,
    ( X1 = sz00
    | esk22_0 != sz00
    | ~ aElementOf0(X1,xI) ),
    i_0_107 ).

cnf(c_0_127,hypothesis,
    ( X1 = sz00
    | X2 = sz00
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xI)
    | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(esk22_0)) ),
    i_0_106 ).

cnf(c_0_128,negated_conjecture,
    ( X1 = sz00
    | iLess0(sbrdtbr0(esk23_1(X1)),sbrdtbr0(X1))
    | ~ aElementOf0(X1,xI) ),
    i_0_109 ).

cnf(c_0_129,hypothesis,
    aElementOf0(esk22_0,xI),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]) ).

cnf(c_0_130,hypothesis,
    esk22_0 != sz00,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_124]),c_0_125]) ).

cnf(c_0_131,hypothesis,
    ( esk23_1(esk22_0) = sz00
    | X1 = sz00
    | ~ aElementOf0(esk23_1(esk22_0),xI)
    | ~ aElementOf0(X1,xI) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129])]),c_0_130]) ).

cnf(c_0_132,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk23_1(X1),xI)
    | ~ aElementOf0(X1,xI) ),
    i_0_111 ).

cnf(c_0_133,negated_conjecture,
    ( esk23_1(esk22_0) = sz00
    | X1 = sz00
    | ~ aElementOf0(X1,xI) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_129])]),c_0_130]) ).

cnf(c_0_134,negated_conjecture,
    ( X1 = sz00
    | esk23_1(X1) != sz00
    | ~ aElementOf0(X1,xI) ),
    i_0_110 ).

cnf(c_0_135,hypothesis,
    esk23_1(esk22_0) = sz00,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_124]),c_0_125]) ).

cnf(c_0_136,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_129])]),c_0_130]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG112+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/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 : Mon May 30 09:52:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.43/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.43/2.38  # No SInE strategy applied
% 7.43/2.38  # Trying AutoSched0 for 150 seconds
% 7.43/2.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S0Y_ni
% 7.43/2.38  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.43/2.38  #
% 7.43/2.38  # Preprocessing time       : 0.021 s
% 7.43/2.38  # Presaturation interreduction done
% 7.43/2.38  
% 7.43/2.38  # Proof found!
% 7.43/2.38  # SZS status Theorem
% 7.43/2.38  # SZS output start CNFRefutation
% See solution above
% 7.43/2.38  # Training examples: 0 positive, 0 negative
% 7.43/2.38  
% 7.43/2.38  # -------------------------------------------------
% 7.43/2.38  # User time                : 0.022 s
% 7.43/2.38  # System time              : 0.005 s
% 7.43/2.38  # Total time               : 0.027 s
% 7.43/2.38  # Maximum resident set size: 7128 pages
% 7.43/2.38  
%------------------------------------------------------------------------------