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

View Problem - Process Solution

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

% Computer : n018.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 9.91s 2.60s
% Output   : CNFRefutation 9.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  14 unt;   0 nHn;  29 RR)
%            Number of literals    :   56 (   2 equ;  32 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_52,plain,
    ( aElementOf0(sdtasdt0(X1,X2),X3)
    | ~ aElement0(X1)
    | ~ aIdeal0(X3)
    | ~ aElementOf0(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_52) ).

cnf(i_0_20,plain,
    ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_20) ).

cnf(i_0_120,negated_conjecture,
    ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_120) ).

cnf(i_0_99,hypothesis,
    aIdeal0(xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_99) ).

cnf(i_0_4,plain,
    ( aElement0(smndt0(X1))
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_4) ).

cnf(i_0_3,plain,
    aElement0(sz10),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_3) ).

cnf(i_0_54,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_54) ).

cnf(i_0_108,hypothesis,
    aElementOf0(xu,xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_108) ).

cnf(i_0_118,hypothesis,
    aElement0(xq),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_118) ).

cnf(i_0_26,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_26) ).

cnf(i_0_6,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-defa79jg/input.p',i_0_6) ).

cnf(c_0_132,plain,
    ( aElementOf0(sdtasdt0(X1,X2),X3)
    | ~ aElement0(X1)
    | ~ aIdeal0(X3)
    | ~ aElementOf0(X2,X3) ),
    i_0_52 ).

cnf(c_0_133,plain,
    ( sdtasdt0(smndt0(sz10),X1) = smndt0(X1)
    | ~ aElement0(X1) ),
    i_0_20 ).

cnf(c_0_134,negated_conjecture,
    ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    i_0_120 ).

cnf(c_0_135,plain,
    ( aElementOf0(smndt0(X1),X2)
    | ~ aElementOf0(X1,X2)
    | ~ aIdeal0(X2)
    | ~ aElement0(smndt0(sz10))
    | ~ aElement0(X1) ),
    inference(spm,[status(thm)],[c_0_132,c_0_133]) ).

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

cnf(c_0_137,negated_conjecture,
    ( ~ aElementOf0(sdtasdt0(xq,xu),xI)
    | ~ aElement0(sdtasdt0(xq,xu))
    | ~ aElement0(smndt0(sz10)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136])]) ).

cnf(c_0_138,plain,
    ( aElement0(smndt0(X1))
    | ~ aElement0(X1) ),
    i_0_4 ).

cnf(c_0_139,plain,
    aElement0(sz10),
    i_0_3 ).

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

cnf(c_0_141,plain,
    ( ~ aElementOf0(sdtasdt0(xq,xu),xI)
    | ~ aElement0(sdtasdt0(xq,xu)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139])]) ).

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

cnf(c_0_143,hypothesis,
    aElement0(xq),
    i_0_118 ).

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

cnf(c_0_145,hypothesis,
    aSet0(xI),
    inference(spm,[status(thm)],[c_0_140,c_0_136]) ).

cnf(c_0_146,plain,
    ~ aElement0(sdtasdt0(xq,xu)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_132]),c_0_142]),c_0_136]),c_0_143])]) ).

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

cnf(c_0_148,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_144,c_0_142]),c_0_145])]) ).

cnf(c_0_149,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_148]),c_0_143])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : RNG120+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 13:33:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 9.91/2.60  # ENIGMATIC: Solved by autoschedule:
% 9.91/2.60  # No SInE strategy applied
% 9.91/2.60  # Trying AutoSched0 for 150 seconds
% 9.91/2.60  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S050N
% 9.91/2.60  # and selection function PSelectNewComplexExceptUniqMaxHorn.
% 9.91/2.60  #
% 9.91/2.60  # Preprocessing time       : 0.027 s
% 9.91/2.60  # Presaturation interreduction done
% 9.91/2.60  
% 9.91/2.60  # Proof found!
% 9.91/2.60  # SZS status Theorem
% 9.91/2.60  # SZS output start CNFRefutation
% See solution above
% 9.91/2.60  # Training examples: 0 positive, 0 negative
% 9.91/2.60  
% 9.91/2.60  # -------------------------------------------------
% 9.91/2.60  # User time                : 0.065 s
% 9.91/2.60  # System time              : 0.008 s
% 9.91/2.60  # Total time               : 0.073 s
% 9.91/2.60  # Maximum resident set size: 7120 pages
% 9.91/2.60  
%------------------------------------------------------------------------------