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

View Problem - Process Solution

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

% Computer : n028.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 8.42s 2.58s
% Output   : CNFRefutation 8.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  13 unt;   8 nHn;  26 RR)
%            Number of literals    :   63 (  24 equ;  34 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-1 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_108,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk24_1(X1),xI)
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_108) ).

cnf(i_0_113,negated_conjecture,
    aElementOf0(esk22_0,xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_113) ).

cnf(i_0_112,negated_conjecture,
    sz00 != esk22_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_112) ).

cnf(i_0_107,negated_conjecture,
    ( X1 = sz00
    | esk24_1(X1) != sz00
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_107) ).

cnf(i_0_106,negated_conjecture,
    ( X1 = sz00
    | iLess0(sbrdtbr0(esk24_1(X1)),sbrdtbr0(X1))
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_106) ).

cnf(i_0_111,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk23_1(X1),xI)
    | ~ aElementOf0(X1,xI)
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_111) ).

cnf(i_0_110,negated_conjecture,
    ( X1 = sz00
    | esk23_1(X1) != sz00
    | ~ aElementOf0(X1,xI)
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-fkjapxwb/lgb.p',i_0_110) ).

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

cnf(c_0_122,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk24_1(X1),xI)
    | ~ aElementOf0(X1,xI) ),
    i_0_108 ).

cnf(c_0_123,negated_conjecture,
    aElementOf0(esk22_0,xI),
    i_0_113 ).

cnf(c_0_124,negated_conjecture,
    sz00 != esk22_0,
    i_0_112 ).

cnf(c_0_125,negated_conjecture,
    ( X1 = sz00
    | esk24_1(X1) != sz00
    | ~ aElementOf0(X1,xI) ),
    i_0_107 ).

cnf(c_0_126,negated_conjecture,
    ( X1 = sz00
    | iLess0(sbrdtbr0(esk24_1(X1)),sbrdtbr0(X1))
    | ~ aElementOf0(X1,xI) ),
    i_0_106 ).

cnf(c_0_127,negated_conjecture,
    ( X1 = sz00
    | aElementOf0(esk23_1(X1),xI)
    | ~ aElementOf0(X1,xI)
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0)) ),
    i_0_111 ).

cnf(c_0_128,negated_conjecture,
    aElementOf0(esk24_1(esk22_0),xI),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_124]) ).

cnf(c_0_129,negated_conjecture,
    esk24_1(esk22_0) != sz00,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_123]),c_0_124]) ).

cnf(c_0_130,negated_conjecture,
    iLess0(sbrdtbr0(esk24_1(esk22_0)),sbrdtbr0(esk22_0)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_123]),c_0_124]) ).

cnf(c_0_131,negated_conjecture,
    ( X1 = sz00
    | esk23_1(X1) != sz00
    | ~ aElementOf0(X1,xI)
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0)) ),
    i_0_110 ).

cnf(c_0_132,negated_conjecture,
    aElementOf0(esk23_1(esk24_1(esk22_0)),xI),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_130])]) ).

cnf(c_0_133,negated_conjecture,
    esk23_1(esk24_1(esk22_0)) != sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_128]),c_0_129]),c_0_130])]) ).

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

cnf(c_0_135,negated_conjecture,
    aElementOf0(esk24_1(esk23_1(esk24_1(esk22_0))),xI),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_132]),c_0_133]) ).

cnf(c_0_136,negated_conjecture,
    esk24_1(esk23_1(esk24_1(esk22_0))) != sz00,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_132]),c_0_133]) ).

cnf(c_0_137,negated_conjecture,
    ( X1 = sz00
    | ~ iLess0(sbrdtbr0(esk24_1(esk23_1(esk24_1(esk22_0)))),sbrdtbr0(esk23_1(X1)))
    | ~ iLess0(sbrdtbr0(X1),sbrdtbr0(esk22_0))
    | ~ aElementOf0(X1,xI) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).

cnf(c_0_138,negated_conjecture,
    iLess0(sbrdtbr0(esk24_1(esk23_1(esk24_1(esk22_0)))),sbrdtbr0(esk23_1(esk24_1(esk22_0)))),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_132]),c_0_133]) ).

cnf(c_0_139,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_128]),c_0_138]),c_0_130])]),c_0_129]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : RNG111+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 : n028.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 21:40:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.42/2.58  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.42/2.58  # No SInE strategy applied
% 8.42/2.58  # Trying AutoSched0 for 150 seconds
% 8.42/2.58  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 8.42/2.58  # and selection function SelectCQPrecWNTNp.
% 8.42/2.58  #
% 8.42/2.58  # Preprocessing time       : 0.023 s
% 8.42/2.58  
% 8.42/2.58  # Proof found!
% 8.42/2.58  # SZS status Theorem
% 8.42/2.58  # SZS output start CNFRefutation
% See solution above
% 8.42/2.58  # Training examples: 0 positive, 0 negative
% 8.42/2.58  
% 8.42/2.58  # -------------------------------------------------
% 8.42/2.58  # User time                : 0.033 s
% 8.42/2.58  # System time              : 0.004 s
% 8.42/2.58  # Total time               : 0.037 s
% 8.42/2.58  # Maximum resident set size: 7124 pages
% 8.42/2.58  
%------------------------------------------------------------------------------