TSTP Solution File: NUM613+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n003.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 08:37:55 EDT 2022

% Result   : Theorem 6.19s 3.47s
% Output   : CNFRefutation 6.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   29 (  21 unt;   4 nHn;  29 RR)
%            Number of literals    :   47 (  27 equ;  18 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    :    9 (   9 usr;   6 con; 0-1 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
    ( X1 = sz00
    | aElementOf0(esk5_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_51) ).

cnf(i_0_147,hypothesis,
    aElementOf0(xK,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_147) ).

cnf(i_0_4137,hypothesis,
    sz00 != xK,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4137) ).

cnf(i_0_50,plain,
    ( X1 = sz00
    | szszuzczcdt0(esk5_1(X1)) = X1
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_50) ).

cnf(i_0_49,plain,
    ( X1 = X2
    | szszuzczcdt0(X1) != szszuzczcdt0(X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_49) ).

cnf(i_0_4138,hypothesis,
    szszuzczcdt0(xk) = xK,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4138) ).

cnf(i_0_4139,hypothesis,
    aElementOf0(xk,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4139) ).

cnf(i_0_4280,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4280) ).

cnf(i_0_4248,hypothesis,
    sbrdtbr0(xQ) = xK,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4248) ).

cnf(i_0_4279,hypothesis,
    aElementOf0(sbrdtbr0(xP),szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4279) ).

cnf(i_0_4282,negated_conjecture,
    sbrdtbr0(xP) != xk,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-gtk3h39v/lgb.p',i_0_4282) ).

cnf(c_0_4294,plain,
    ( X1 = sz00
    | aElementOf0(esk5_1(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_51 ).

cnf(c_0_4295,hypothesis,
    aElementOf0(xK,szNzAzT0),
    i_0_147 ).

cnf(c_0_4296,hypothesis,
    sz00 != xK,
    i_0_4137 ).

cnf(c_0_4297,plain,
    ( X1 = sz00
    | szszuzczcdt0(esk5_1(X1)) = X1
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_50 ).

cnf(c_0_4298,plain,
    ( X1 = X2
    | szszuzczcdt0(X1) != szszuzczcdt0(X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_49 ).

cnf(c_0_4299,hypothesis,
    aElementOf0(esk5_1(xK),szNzAzT0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4294,c_0_4295]),c_0_4296]) ).

cnf(c_0_4300,hypothesis,
    szszuzczcdt0(esk5_1(xK)) = xK,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_4297,c_0_4295]),c_0_4296]) ).

cnf(c_0_4301,plain,
    ( X1 = esk5_1(xK)
    | szszuzczcdt0(X1) != xK
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4298,c_0_4299]),c_0_4300]) ).

cnf(c_0_4302,hypothesis,
    szszuzczcdt0(xk) = xK,
    i_0_4138 ).

cnf(c_0_4303,hypothesis,
    aElementOf0(xk,szNzAzT0),
    i_0_4139 ).

cnf(c_0_4304,hypothesis,
    esk5_1(xK) = xk,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4301,c_0_4302]),c_0_4303])]) ).

cnf(c_0_4305,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = sbrdtbr0(xQ),
    i_0_4280 ).

cnf(c_0_4306,hypothesis,
    sbrdtbr0(xQ) = xK,
    i_0_4248 ).

cnf(c_0_4307,plain,
    ( X1 = xk
    | szszuzczcdt0(X1) != xK
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(rw,[status(thm)],[c_0_4301,c_0_4304]) ).

cnf(c_0_4308,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = xK,
    inference(rw,[status(thm)],[c_0_4305,c_0_4306]) ).

cnf(c_0_4309,hypothesis,
    aElementOf0(sbrdtbr0(xP),szNzAzT0),
    i_0_4279 ).

cnf(c_0_4310,negated_conjecture,
    sbrdtbr0(xP) != xk,
    i_0_4282 ).

cnf(c_0_4311,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4307,c_0_4308]),c_0_4309])]),c_0_4310]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM613+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.34  % Computer : n003.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Thu Jul  7 17:22:59 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 6.19/3.47  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.19/3.47  # No SInE strategy applied
% 6.19/3.47  # Trying AutoSched0 for 150 seconds
% 6.19/3.47  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 6.19/3.47  # and selection function SelectNewComplexAHP.
% 6.19/3.47  #
% 6.19/3.47  # Preprocessing time       : 0.027 s
% 6.19/3.47  # Presaturation interreduction done
% 6.19/3.47  
% 6.19/3.47  # Proof found!
% 6.19/3.47  # SZS status Theorem
% 6.19/3.47  # SZS output start CNFRefutation
% See solution above
% 6.19/3.47  # Training examples: 0 positive, 0 negative
% 6.19/3.47  
% 6.19/3.47  # -------------------------------------------------
% 6.19/3.47  # User time                : 0.065 s
% 6.19/3.47  # System time              : 0.010 s
% 6.19/3.47  # Total time               : 0.074 s
% 6.19/3.47  # Maximum resident set size: 7124 pages
% 6.19/3.47  
%------------------------------------------------------------------------------