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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : RNG115+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:02 EDT 2022

% Result   : Theorem 17.72s 3.68s
% Output   : CNFRefutation 17.72s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   27 (  10 unt;   0 nHn;  27 RR)
%            Number of literals    :   77 (  16 equ;  56 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   4 con; 0-4 aty)
%            Number of variables   :   46 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_37,plain,
    ( aElementOf0(esk4_4(X1,X2,X3,X4),X2)
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_37) ).

cnf(i_0_110,negated_conjecture,
    ( sdtpldt0(X1,X2) != xu
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_110) ).

cnf(i_0_36,plain,
    ( sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_36) ).

cnf(i_0_38,plain,
    ( aElementOf0(esk3_4(X1,X2,X3,X4),X1)
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_38) ).

cnf(i_0_98,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_98) ).

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

cnf(i_0_92,plain,
    ( aSet0(X1)
    | X1 != slsdtgt0(X2)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_92) ).

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

cnf(i_0_95,hypothesis,
    aElement0(xa),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-d0cbq5t3/input.p',i_0_95) ).

cnf(c_0_120,plain,
    ( aElementOf0(esk4_4(X1,X2,X3,X4),X2)
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    i_0_37 ).

cnf(c_0_121,negated_conjecture,
    ( sdtpldt0(X1,X2) != xu
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    i_0_110 ).

cnf(c_0_122,plain,
    ( aElementOf0(esk4_4(X1,X2,sdtpldt1(X1,X2),X3),X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
    inference(er,[status(thm)],[c_0_120]) ).

cnf(c_0_123,plain,
    ( sdtpldt0(esk3_4(X1,X2,X3,X4),esk4_4(X1,X2,X3,X4)) = X4
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    i_0_36 ).

cnf(c_0_124,negated_conjecture,
    ( sdtpldt0(X1,esk4_4(X2,slsdtgt0(xb),sdtpldt1(X2,slsdtgt0(xb)),X3)) != xu
    | ~ aSet0(slsdtgt0(xb))
    | ~ aSet0(X2)
    | ~ aElementOf0(X3,sdtpldt1(X2,slsdtgt0(xb)))
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_125,plain,
    ( sdtpldt0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),esk4_4(X1,X2,sdtpldt1(X1,X2),X3)) = X3
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
    inference(er,[status(thm)],[c_0_123]) ).

cnf(c_0_126,plain,
    ( aElementOf0(esk3_4(X1,X2,X3,X4),X1)
    | X3 != sdtpldt1(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X4,X3) ),
    i_0_38 ).

cnf(c_0_127,plain,
    ( ~ aSet0(slsdtgt0(xb))
    | ~ aSet0(X1)
    | ~ aElementOf0(esk3_4(X1,slsdtgt0(xb),sdtpldt1(X1,slsdtgt0(xb)),xu),slsdtgt0(xa))
    | ~ aElementOf0(xu,sdtpldt1(X1,slsdtgt0(xb))) ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125])]) ).

cnf(c_0_128,plain,
    ( aElementOf0(esk3_4(X1,X2,sdtpldt1(X1,X2),X3),X1)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X3,sdtpldt1(X1,X2)) ),
    inference(er,[status(thm)],[c_0_126]) ).

cnf(c_0_129,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    i_0_98 ).

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

cnf(c_0_131,plain,
    ( aSet0(X1)
    | X1 != slsdtgt0(X2)
    | ~ aElement0(X2) ),
    i_0_92 ).

cnf(c_0_132,plain,
    ( ~ aSet0(slsdtgt0(xb))
    | ~ aSet0(slsdtgt0(xa)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]),c_0_130])]) ).

cnf(c_0_133,plain,
    ( aSet0(slsdtgt0(X1))
    | ~ aElement0(X1) ),
    inference(er,[status(thm)],[c_0_131]) ).

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

cnf(c_0_135,plain,
    ~ aSet0(slsdtgt0(xa)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_132,c_0_133]),c_0_134])]) ).

cnf(c_0_136,hypothesis,
    aElement0(xa),
    i_0_95 ).

cnf(c_0_137,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_133]),c_0_136])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : RNG115+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 : 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 09:31:21 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 17.72/3.68  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d60-l8000-e0.15+coop-eprover73:
% 17.72/3.68  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d60-l8000-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 37; version: 991; iters: 150)
% 17.72/3.68  # Preprocessing time       : 1.184 s
% 17.72/3.68  # Presaturation interreduction done
% 17.72/3.68  
% 17.72/3.68  # Proof found!
% 17.72/3.68  # SZS status Theorem
% 17.72/3.68  # SZS output start CNFRefutation
% See solution above
% 17.72/3.68  # Training examples: 0 positive, 0 negative
% 17.72/3.68  
% 17.72/3.68  # -------------------------------------------------
% 17.72/3.68  # User time                : 1.067 s
% 17.72/3.68  # System time              : 0.145 s
% 17.72/3.68  # Total time               : 1.212 s
% 17.72/3.68  # ...preprocessing         : 1.184 s
% 17.72/3.68  # ...main loop             : 0.028 s
% 17.72/3.68  # Maximum resident set size: 185092 pages
% 17.72/3.68  
%------------------------------------------------------------------------------