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

View Problem - Process Solution

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

% Computer : n019.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 13.08s 4.18s
% Output   : CNFRefutation 13.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   26 (  16 unt;   0 nHn;  26 RR)
%            Number of literals    :   47 (   8 equ;  25 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_89,plain,
    ( aElementOf0(X1,X2)
    | X2 != slsdtgt0(X3)
    | sdtasdt0(X3,X4) != X1
    | ~ aElement0(X3)
    | ~ aElement0(X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_89) ).

cnf(i_0_102,hypothesis,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_102) ).

cnf(i_0_93,hypothesis,
    aElement0(xc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_93) ).

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

cnf(i_0_94,hypothesis,
    aElement0(xz),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_94) ).

cnf(i_0_98,hypothesis,
    aElement0(xu),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_98) ).

cnf(i_0_103,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_103) ).

cnf(i_0_101,hypothesis,
    sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_101) ).

cnf(i_0_5,plain,
    ( aElement0(sdtpldt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_5) ).

cnf(i_0_100,hypothesis,
    aElement0(xv),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ybjstjzv/input.p',i_0_100) ).

cnf(c_0_114,plain,
    ( aElementOf0(X1,X2)
    | X2 != slsdtgt0(X3)
    | sdtasdt0(X3,X4) != X1
    | ~ aElement0(X3)
    | ~ aElement0(X4) ),
    i_0_89 ).

cnf(c_0_115,plain,
    ( aElementOf0(sdtasdt0(X1,X2),slsdtgt0(X1))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_114])]) ).

cnf(c_0_116,hypothesis,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
    i_0_102 ).

cnf(c_0_117,hypothesis,
    aElement0(xc),
    i_0_93 ).

cnf(c_0_118,hypothesis,
    ( aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc))
    | ~ aElement0(sdtasdt0(xu,xz)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117])]) ).

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

cnf(c_0_120,hypothesis,
    aElement0(xz),
    i_0_94 ).

cnf(c_0_121,hypothesis,
    aElement0(xu),
    i_0_98 ).

cnf(c_0_122,negated_conjecture,
    ( ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc))
    | ~ aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)) ),
    i_0_103 ).

cnf(c_0_123,plain,
    aElementOf0(sdtasdt0(xz,xx),slsdtgt0(xc)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),c_0_121])]) ).

cnf(c_0_124,hypothesis,
    sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
    i_0_101 ).

cnf(c_0_125,negated_conjecture,
    ~ aElementOf0(sdtpldt0(xx,xy),slsdtgt0(xc)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_123])]) ).

cnf(c_0_126,hypothesis,
    ~ aElement0(sdtpldt0(xu,xv)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_124]),c_0_117])]),c_0_125]) ).

cnf(c_0_127,plain,
    ( aElement0(sdtpldt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_5 ).

cnf(c_0_128,hypothesis,
    aElement0(xv),
    i_0_100 ).

cnf(c_0_129,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_126,c_0_127]),c_0_128]),c_0_121])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem  : RNG105+1 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.30  % Computer : n019.cluster.edu
% 0.09/0.30  % Model    : x86_64 x86_64
% 0.09/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.30  % Memory   : 8042.1875MB
% 0.09/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30  % CPULimit : 300
% 0.09/0.30  % WCLimit  : 600
% 0.09/0.30  % DateTime : Mon May 30 15:07:27 EDT 2022
% 0.09/0.30  % CPUTime  : 
% 0.14/0.40  # ENIGMATIC: Selected complete mode:
% 13.08/4.18  # ENIGMATIC: Solved by autoschedule:
% 13.08/4.18  # No SInE strategy applied
% 13.08/4.18  # Trying AutoSched0 for 150 seconds
% 13.08/4.18  # AutoSched0-Mode selected heuristic G_E___208_B07_F1_SE_CS_SP_PS_S4d
% 13.08/4.18  # and selection function SelectCQIPrecWNTNp.
% 13.08/4.18  #
% 13.08/4.18  # Preprocessing time       : 0.024 s
% 13.08/4.18  # Presaturation interreduction done
% 13.08/4.18  
% 13.08/4.18  # Proof found!
% 13.08/4.18  # SZS status Theorem
% 13.08/4.18  # SZS output start CNFRefutation
% See solution above
% 13.08/4.18  # Training examples: 0 positive, 0 negative
% 13.08/4.18  
% 13.08/4.18  # -------------------------------------------------
% 13.08/4.18  # User time                : 0.046 s
% 13.08/4.18  # System time              : 0.004 s
% 13.08/4.18  # Total time               : 0.050 s
% 13.08/4.18  # Maximum resident set size: 7124 pages
% 13.08/4.18  
%------------------------------------------------------------------------------