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

View Problem - Process Solution

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

% Computer : n032.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:24:56 EDT 2022

% Result   : Theorem 16.49s 3.38s
% Output   : CNFRefutation 16.49s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (   9 unt;   0 nHn;  23 RR)
%            Number of literals    :   66 (  17 equ;  49 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   3 con; 0-4 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_63,negated_conjecture,
    ( sdtpldt0(X1,X2) != xy
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5l3_47n/input.p',i_0_63) ).

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-b5l3_47n/input.p',i_0_36) ).

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

cnf(i_0_55,hypothesis,
    aIdeal0(xJ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5l3_47n/input.p',i_0_55) ).

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-b5l3_47n/input.p',i_0_37) ).

cnf(i_0_56,hypothesis,
    aIdeal0(xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5l3_47n/input.p',i_0_56) ).

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-b5l3_47n/input.p',i_0_38) ).

cnf(i_0_58,hypothesis,
    aElementOf0(xy,sdtpldt1(xI,xJ)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-b5l3_47n/input.p',i_0_58) ).

cnf(c_0_72,negated_conjecture,
    ( sdtpldt0(X1,X2) != xy
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI) ),
    i_0_63 ).

cnf(c_0_73,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_74,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    i_0_54 ).

cnf(c_0_75,hypothesis,
    aIdeal0(xJ),
    i_0_55 ).

cnf(c_0_76,negated_conjecture,
    ( X1 != sdtpldt1(X2,X3)
    | X4 != xy
    | ~ aSet0(X3)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk4_4(X2,X3,X1,X4),xJ)
    | ~ aElementOf0(esk3_4(X2,X3,X1,X4),xI)
    | ~ aElementOf0(X4,X1) ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_77,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_78,hypothesis,
    aSet0(xJ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_79,hypothesis,
    aIdeal0(xI),
    i_0_56 ).

cnf(c_0_80,plain,
    ( X1 != sdtpldt1(X2,xJ)
    | X3 != xy
    | ~ aSet0(X2)
    | ~ aElementOf0(esk3_4(X2,xJ,X1,X3),xI)
    | ~ aElementOf0(X3,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78])]) ).

cnf(c_0_81,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_82,hypothesis,
    aSet0(xI),
    inference(spm,[status(thm)],[c_0_74,c_0_79]) ).

cnf(c_0_83,plain,
    ( X1 != sdtpldt1(xI,xJ)
    | X2 != xy
    | ~ aElementOf0(X2,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82]),c_0_78])]) ).

cnf(c_0_84,plain,
    ( X1 != xy
    | ~ aElementOf0(X1,sdtpldt1(xI,xJ)) ),
    inference(er,[status(thm)],[c_0_83]) ).

cnf(c_0_85,hypothesis,
    aElementOf0(xy,sdtpldt1(xI,xJ)),
    i_0_58 ).

cnf(c_0_86,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_84,c_0_85]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : RNG087+1 : TPTP v8.1.0. Released v4.0.0.
% 0.05/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.29  % Computer : n032.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Mon May 30 06:15:28 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 0.13/0.37  # ENIGMATIC: Selected complete mode:
% 16.49/3.38  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 16.49/3.38  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 33; version: 991; iters: 150)
% 16.49/3.38  # Preprocessing time       : 0.858 s
% 16.49/3.38  
% 16.49/3.38  # Proof found!
% 16.49/3.38  # SZS status Theorem
% 16.49/3.38  # SZS output start CNFRefutation
% See solution above
% 16.49/3.38  # Training examples: 0 positive, 0 negative
% 16.49/3.38  
% 16.49/3.38  # -------------------------------------------------
% 16.49/3.38  # User time                : 0.760 s
% 16.49/3.38  # System time              : 0.100 s
% 16.49/3.38  # Total time               : 0.860 s
% 16.49/3.38  # ...preprocessing         : 0.858 s
% 16.49/3.38  # ...main loop             : 0.002 s
% 16.49/3.38  # Maximum resident set size: 168176 pages
% 16.49/3.38  
%------------------------------------------------------------------------------