TSTP Solution File: RNG106+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : RNG106+2 : 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:00 EDT 2022

% Result   : Theorem 4.63s 2.29s
% Output   : CNFRefutation 4.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   28 (   9 unt;   5 nHn;  28 RR)
%            Number of literals    :   61 (   0 equ;  33 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   4 sgn)

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

cnf(i_0_98,negated_conjecture,
    ( aElement0(esk28_0)
    | aElementOf0(esk27_0,slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_98) ).

cnf(i_0_103,negated_conjecture,
    aSet0(slsdtgt0(xc)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_103) ).

cnf(i_0_107,negated_conjecture,
    ( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
    | ~ aElement0(X3)
    | ~ aElementOf0(X2,slsdtgt0(xc))
    | ~ aElementOf0(X1,slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_107) ).

cnf(i_0_95,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(esk26_0,esk27_0),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(esk28_0,esk26_0),slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_95) ).

cnf(i_0_99,negated_conjecture,
    aElementOf0(esk26_0,slsdtgt0(xc)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_99) ).

cnf(i_0_97,negated_conjecture,
    ( aElementOf0(esk27_0,slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(esk28_0,esk26_0),slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_97) ).

cnf(i_0_104,negated_conjecture,
    ( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,slsdtgt0(xc))
    | ~ aElementOf0(X2,slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_104) ).

cnf(i_0_51,plain,
    ( aIdeal0(X1)
    | aElementOf0(esk9_1(X1),X1)
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_51) ).

cnf(i_0_94,negated_conjecture,
    ~ aIdeal0(slsdtgt0(xc)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_94) ).

cnf(i_0_96,negated_conjecture,
    ( aElement0(esk28_0)
    | ~ aElementOf0(sdtpldt0(esk26_0,esk27_0),slsdtgt0(xc)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-tv2t46s4/input.p',i_0_96) ).

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

cnf(c_0_120,negated_conjecture,
    ( aElement0(esk28_0)
    | aElementOf0(esk27_0,slsdtgt0(xc)) ),
    i_0_98 ).

cnf(c_0_121,negated_conjecture,
    aSet0(slsdtgt0(xc)),
    i_0_103 ).

cnf(c_0_122,negated_conjecture,
    ( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
    | ~ aElement0(X3)
    | ~ aElementOf0(X2,slsdtgt0(xc))
    | ~ aElementOf0(X1,slsdtgt0(xc)) ),
    i_0_107 ).

cnf(c_0_123,plain,
    ( aElement0(esk28_0)
    | aElement0(esk27_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_121])]) ).

cnf(c_0_124,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(esk26_0,esk27_0),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(esk28_0,esk26_0),slsdtgt0(xc)) ),
    i_0_95 ).

cnf(c_0_125,plain,
    ( aElementOf0(sdtpldt0(X1,X2),slsdtgt0(xc))
    | ~ aElementOf0(X2,slsdtgt0(xc))
    | ~ aElementOf0(X1,slsdtgt0(xc)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_122,c_0_123]),c_0_122]) ).

cnf(c_0_126,negated_conjecture,
    aElementOf0(esk26_0,slsdtgt0(xc)),
    i_0_99 ).

cnf(c_0_127,negated_conjecture,
    ( aElementOf0(esk27_0,slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(esk28_0,esk26_0),slsdtgt0(xc)) ),
    i_0_97 ).

cnf(c_0_128,negated_conjecture,
    ( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
    | ~ aElement0(X1)
    | ~ aElementOf0(X3,slsdtgt0(xc))
    | ~ aElementOf0(X2,slsdtgt0(xc)) ),
    i_0_104 ).

cnf(c_0_129,plain,
    ( aIdeal0(X1)
    | aElementOf0(esk9_1(X1),X1)
    | ~ aSet0(X1) ),
    i_0_51 ).

cnf(c_0_130,negated_conjecture,
    ~ aIdeal0(slsdtgt0(xc)),
    i_0_94 ).

cnf(c_0_131,negated_conjecture,
    ( aElement0(esk28_0)
    | ~ aElementOf0(sdtpldt0(esk26_0,esk27_0),slsdtgt0(xc)) ),
    i_0_96 ).

cnf(c_0_132,negated_conjecture,
    ~ aElementOf0(sdtasdt0(esk28_0,esk26_0),slsdtgt0(xc)),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]),c_0_127]) ).

cnf(c_0_133,plain,
    ( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(xc))
    | ~ aElementOf0(X2,slsdtgt0(xc))
    | ~ aElement0(X1) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_121])]),c_0_130]) ).

cnf(c_0_134,negated_conjecture,
    aElement0(esk28_0),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_125]),c_0_126])]),c_0_120]) ).

cnf(c_0_135,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_126]),c_0_134])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : RNG106+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n029.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon May 30 07:38:15 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 4.63/2.29  # ENIGMATIC: Solved by autoschedule:
% 4.63/2.29  # No SInE strategy applied
% 4.63/2.29  # Trying AutoSched0 for 150 seconds
% 4.63/2.29  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S0Y
% 4.63/2.29  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.63/2.29  #
% 4.63/2.29  # Preprocessing time       : 0.026 s
% 4.63/2.29  # Presaturation interreduction done
% 4.63/2.29  
% 4.63/2.29  # Proof found!
% 4.63/2.29  # SZS status Theorem
% 4.63/2.29  # SZS output start CNFRefutation
% See solution above
% 4.63/2.29  # Training examples: 0 positive, 0 negative
% 4.63/2.29  
% 4.63/2.29  # -------------------------------------------------
% 4.63/2.29  # User time                : 0.046 s
% 4.63/2.29  # System time              : 0.007 s
% 4.63/2.29  # Total time               : 0.054 s
% 4.63/2.29  # Maximum resident set size: 7120 pages
% 4.63/2.29  
%------------------------------------------------------------------------------