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

View Problem - Process Solution

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

% Computer : n012.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:38:07 EDT 2022

% Result   : Theorem 10.46s 3.54s
% Output   : CNFRefutation 10.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   33 (  27 unt;   0 nHn;  33 RR)
%            Number of literals    :   47 (  24 equ;  16 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  11 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4210,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xd,X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4210) ).

cnf(i_0_4287,hypothesis,
    aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4287) ).

cnf(i_0_4279,hypothesis,
    sbrdtbr0(xP) = xk,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4279) ).

cnf(i_0_4271,hypothesis,
    aSet0(xP),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4271) ).

cnf(i_0_4282,hypothesis,
    aElementOf0(xn,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4282) ).

cnf(i_0_4265,hypothesis,
    sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4265) ).

cnf(i_0_4262,hypothesis,
    szmzizndt0(xQ) = xp,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4262) ).

cnf(i_0_4299,hypothesis,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4299) ).

cnf(i_0_38,plain,
    ( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_38) ).

cnf(i_0_4251,hypothesis,
    aSet0(xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4251) ).

cnf(i_0_4272,hypothesis,
    aElementOf0(xp,xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4272) ).

cnf(i_0_4204,hypothesis,
    ( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4204) ).

cnf(i_0_4281,hypothesis,
    sdtlpdtrp0(xe,xn) = xp,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4281) ).

cnf(i_0_4306,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != sdtlpdtrp0(xd,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-e46ko3o8/lgb.p',i_0_4306) ).

cnf(c_0_4321,hypothesis,
    ( sdtlpdtrp0(sdtlpdtrp0(xC,X1),X2) = sdtlpdtrp0(xd,X1)
    | sbrdtbr0(X2) != xk
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aSubsetOf0(X2,sdtlpdtrp0(xN,szszuzczcdt0(X1))) ),
    i_0_4210 ).

cnf(c_0_4322,hypothesis,
    aSubsetOf0(xP,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    i_0_4287 ).

cnf(c_0_4323,hypothesis,
    sbrdtbr0(xP) = xk,
    i_0_4279 ).

cnf(c_0_4324,hypothesis,
    aSet0(xP),
    i_0_4271 ).

cnf(c_0_4325,hypothesis,
    aElementOf0(xn,szNzAzT0),
    i_0_4282 ).

cnf(c_0_4326,hypothesis,
    sdtmndt0(xQ,szmzizndt0(xQ)) = xP,
    i_0_4265 ).

cnf(c_0_4327,hypothesis,
    szmzizndt0(xQ) = xp,
    i_0_4262 ).

cnf(c_0_4328,hypothesis,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP),
    i_0_4299 ).

cnf(c_0_4329,hypothesis,
    sdtlpdtrp0(sdtlpdtrp0(xC,xn),xP) = sdtlpdtrp0(xd,xn),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4321,c_0_4322]),c_0_4323]),c_0_4324]),c_0_4325])]) ).

cnf(c_0_4330,plain,
    ( sdtpldt0(sdtmndt0(X1,X2),X2) = X1
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,X1) ),
    i_0_38 ).

cnf(c_0_4331,hypothesis,
    sdtmndt0(xQ,xp) = xP,
    inference(rw,[status(thm)],[c_0_4326,c_0_4327]) ).

cnf(c_0_4332,hypothesis,
    aSet0(xQ),
    i_0_4251 ).

cnf(c_0_4333,hypothesis,
    aElementOf0(xp,xQ),
    i_0_4272 ).

cnf(c_0_4334,hypothesis,
    sdtlpdtrp0(xc,sdtpldt0(xP,szmzizndt0(sdtlpdtrp0(xN,xn)))) = sdtlpdtrp0(xd,xn),
    inference(rw,[status(thm)],[c_0_4328,c_0_4329]) ).

cnf(c_0_4335,hypothesis,
    ( szmzizndt0(sdtlpdtrp0(xN,X1)) = sdtlpdtrp0(xe,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    i_0_4204 ).

cnf(c_0_4336,hypothesis,
    sdtlpdtrp0(xe,xn) = xp,
    i_0_4281 ).

cnf(c_0_4337,hypothesis,
    sdtpldt0(xP,xp) = xQ,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4330,c_0_4331]),c_0_4332]),c_0_4333])]) ).

cnf(c_0_4338,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != sdtlpdtrp0(xd,xn),
    i_0_4306 ).

cnf(c_0_4339,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4334,c_0_4335]),c_0_4336]),c_0_4325])]),c_0_4337]),c_0_4338]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM631+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n012.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 : Thu Jul  7 15:03:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 10.46/3.54  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.46/3.54  # No SInE strategy applied
% 10.46/3.54  # Trying AutoSched0 for 150 seconds
% 10.46/3.54  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 10.46/3.54  # and selection function SelectMaxLComplexAvoidPosPred.
% 10.46/3.54  #
% 10.46/3.54  # Preprocessing time       : 0.029 s
% 10.46/3.54  # Presaturation interreduction done
% 10.46/3.54  
% 10.46/3.54  # Proof found!
% 10.46/3.54  # SZS status Theorem
% 10.46/3.54  # SZS output start CNFRefutation
% See solution above
% 10.46/3.54  # Training examples: 0 positive, 0 negative
% 10.46/3.54  
% 10.46/3.54  # -------------------------------------------------
% 10.46/3.54  # User time                : 0.081 s
% 10.46/3.54  # System time              : 0.010 s
% 10.46/3.54  # Total time               : 0.091 s
% 10.46/3.54  # Maximum resident set size: 7124 pages
% 10.46/3.54  
%------------------------------------------------------------------------------