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

View Problem - Process Solution

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

% Computer : n027.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 7.50s 2.38s
% Output   : CNFRefutation 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  12 unt;   0 nHn;  20 RR)
%            Number of literals    :   37 (   9 equ;  22 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   13 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_110,negated_conjecture,
    ( sdtasdt0(xc,X1) != sdtpldt0(xx,xy)
    | sdtasdt0(xc,X2) != sdtasdt0(xz,xx)
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4zwc172/lgb.p',i_0_110) ).

cnf(i_0_106,hypothesis,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4zwc172/lgb.p',i_0_106) ).

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

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

cnf(i_0_104,hypothesis,
    aElement0(xv),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4zwc172/lgb.p',i_0_104) ).

cnf(i_0_102,hypothesis,
    aElement0(xu),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-k4zwc172/lgb.p',i_0_102) ).

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

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

cnf(c_0_119,negated_conjecture,
    ( sdtasdt0(xc,X1) != sdtpldt0(xx,xy)
    | sdtasdt0(xc,X2) != sdtasdt0(xz,xx)
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    i_0_110 ).

cnf(c_0_120,hypothesis,
    sdtasdt0(xc,sdtasdt0(xu,xz)) = sdtasdt0(xz,xx),
    i_0_106 ).

cnf(c_0_121,hypothesis,
    ( sdtasdt0(xc,X1) != sdtpldt0(xx,xy)
    | ~ aElement0(sdtasdt0(xu,xz))
    | ~ aElement0(X1) ),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_122,hypothesis,
    sdtasdt0(xc,sdtpldt0(xu,xv)) = sdtpldt0(xx,xy),
    i_0_105 ).

cnf(c_0_123,hypothesis,
    ( ~ aElement0(sdtasdt0(xu,xz))
    | ~ aElement0(sdtpldt0(xu,xv)) ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

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

cnf(c_0_125,hypothesis,
    aElement0(xv),
    i_0_104 ).

cnf(c_0_126,hypothesis,
    aElement0(xu),
    i_0_102 ).

cnf(c_0_127,plain,
    ~ aElement0(sdtasdt0(xu,xz)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_124]),c_0_125]),c_0_126])]) ).

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

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

cnf(c_0_130,plain,
    $false,
    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_126])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG105+2 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 18:25:33 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.50/2.38  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.50/2.38  # No SInE strategy applied
% 7.50/2.38  # Trying AutoSched0 for 150 seconds
% 7.50/2.38  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.50/2.38  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.50/2.38  #
% 7.50/2.38  # Preprocessing time       : 0.023 s
% 7.50/2.38  # Presaturation interreduction done
% 7.50/2.38  
% 7.50/2.38  # Proof found!
% 7.50/2.38  # SZS status Theorem
% 7.50/2.38  # SZS output start CNFRefutation
% See solution above
% 7.50/2.38  # Training examples: 0 positive, 0 negative
% 7.50/2.38  
% 7.50/2.38  # -------------------------------------------------
% 7.50/2.38  # User time                : 0.027 s
% 7.50/2.38  # System time              : 0.007 s
% 7.50/2.38  # Total time               : 0.034 s
% 7.50/2.38  # Maximum resident set size: 7128 pages
% 7.50/2.38  
%------------------------------------------------------------------------------