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

View Problem - Process Solution

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

% Computer : n029.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:02 EDT 2022

% Result   : Theorem 7.69s 2.37s
% Output   : CNFRefutation 7.69s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   36 (  15 unt;   8 nHn;  36 RR)
%            Number of literals    :   89 (  27 equ;  51 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-2 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_26,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_26) ).

cnf(i_0_108,hypothesis,
    aElementOf0(xu,xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_108) ).

cnf(i_0_54,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_54) ).

cnf(i_0_99,hypothesis,
    aIdeal0(xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_99) ).

cnf(i_0_115,negated_conjecture,
    ( sdtpldt0(sdtasdt0(X1,xu),X2) != xb
    | ~ aElement0(X1)
    | ~ aElement0(X2)
    | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_115) ).

cnf(i_0_68,plain,
    ( X1 = sz00
    | esk15_2(X2,X1) = sz00
    | iLess0(sbrdtbr0(esk15_2(X2,X1)),sbrdtbr0(X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_68) ).

cnf(i_0_107,hypothesis,
    sz00 != xu,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_107) ).

cnf(i_0_69,plain,
    ( X1 = sz00
    | sdtpldt0(sdtasdt0(esk14_2(X2,X1),X1),esk15_2(X2,X1)) = X2
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_69) ).

cnf(i_0_94,hypothesis,
    aElement0(xb),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_94) ).

cnf(i_0_71,plain,
    ( X1 = sz00
    | aElement0(esk14_2(X2,X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_71) ).

cnf(i_0_70,plain,
    ( X1 = sz00
    | aElement0(esk15_2(X2,X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_70) ).

cnf(i_0_116,negated_conjecture,
    ( X1 != sz00
    | sdtpldt0(sdtasdt0(X2,xu),X1) != xb
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_116) ).

cnf(i_0_2,plain,
    aElement0(sz00),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6akrtyqz/lgb.p',i_0_2) ).

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

cnf(c_0_131,hypothesis,
    aElementOf0(xu,xI),
    i_0_108 ).

cnf(c_0_132,hypothesis,
    ( aElement0(xu)
    | ~ aSet0(xI) ),
    inference(spm,[status(thm)],[c_0_130,c_0_131]) ).

cnf(c_0_133,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    i_0_54 ).

cnf(c_0_134,hypothesis,
    aIdeal0(xI),
    i_0_99 ).

cnf(c_0_135,negated_conjecture,
    ( sdtpldt0(sdtasdt0(X1,xu),X2) != xb
    | ~ aElement0(X1)
    | ~ aElement0(X2)
    | ~ iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ),
    i_0_115 ).

cnf(c_0_136,plain,
    ( X1 = sz00
    | esk15_2(X2,X1) = sz00
    | iLess0(sbrdtbr0(esk15_2(X2,X1)),sbrdtbr0(X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    i_0_68 ).

cnf(c_0_137,hypothesis,
    sz00 != xu,
    i_0_107 ).

cnf(c_0_138,plain,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_134])]) ).

cnf(c_0_139,negated_conjecture,
    ( esk15_2(X1,xu) = sz00
    | sdtpldt0(sdtasdt0(X2,xu),esk15_2(X1,xu)) != xb
    | ~ aElement0(esk15_2(X1,xu))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_136]),c_0_137]),c_0_138])]) ).

cnf(c_0_140,plain,
    ( X1 = sz00
    | sdtpldt0(sdtasdt0(esk14_2(X2,X1),X1),esk15_2(X2,X1)) = X2
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    i_0_69 ).

cnf(c_0_141,hypothesis,
    aElement0(xb),
    i_0_94 ).

cnf(c_0_142,plain,
    ( esk15_2(xb,xu) = sz00
    | ~ aElement0(esk15_2(xb,xu))
    | ~ aElement0(esk14_2(xb,xu)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_139,c_0_140]),c_0_138])]),c_0_137])]),c_0_141])]) ).

cnf(c_0_143,plain,
    ( X1 = sz00
    | aElement0(esk14_2(X2,X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    i_0_71 ).

cnf(c_0_144,plain,
    ( esk15_2(xb,xu) = sz00
    | ~ aElement0(esk15_2(xb,xu)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_141]),c_0_138])]),c_0_137]) ).

cnf(c_0_145,plain,
    ( X1 = sz00
    | aElement0(esk15_2(X2,X1))
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    i_0_70 ).

cnf(c_0_146,negated_conjecture,
    ( X1 != sz00
    | sdtpldt0(sdtasdt0(X2,xu),X1) != xb
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_116 ).

cnf(c_0_147,plain,
    aElement0(sz00),
    i_0_2 ).

cnf(c_0_148,plain,
    esk15_2(xb,xu) = sz00,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_145]),c_0_141]),c_0_138])]),c_0_137]) ).

cnf(c_0_149,negated_conjecture,
    ( sdtpldt0(sdtasdt0(X1,xu),sz00) != xb
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_146]),c_0_147])]) ).

cnf(c_0_150,plain,
    sdtpldt0(sdtasdt0(esk14_2(xb,xu),xu),sz00) = xb,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_148]),c_0_141]),c_0_138])]),c_0_137]) ).

cnf(c_0_151,negated_conjecture,
    ~ aElement0(esk14_2(xb,xu)),
    inference(spm,[status(thm)],[c_0_149,c_0_150]) ).

cnf(c_0_152,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_143]),c_0_141]),c_0_138])]),c_0_137]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : RNG118+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 16:30:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.69/2.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.69/2.37  # No SInE strategy applied
% 7.69/2.37  # Trying AutoSched0 for 150 seconds
% 7.69/2.37  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.69/2.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.69/2.37  #
% 7.69/2.37  # Preprocessing time       : 0.013 s
% 7.69/2.37  
% 7.69/2.37  # Proof found!
% 7.69/2.37  # SZS status Theorem
% 7.69/2.37  # SZS output start CNFRefutation
% See solution above
% 7.69/2.37  # Training examples: 0 positive, 0 negative
% 7.69/2.37  
% 7.69/2.37  # -------------------------------------------------
% 7.69/2.37  # User time                : 0.015 s
% 7.69/2.37  # System time              : 0.004 s
% 7.69/2.37  # Total time               : 0.019 s
% 7.69/2.37  # Maximum resident set size: 7124 pages
% 7.69/2.37  
%------------------------------------------------------------------------------