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

View Problem - Process Solution

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

% Computer : n029.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 9.63s 3.41s
% Output   : CNFRefutation 9.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   33 (  21 unt;   0 nHn;  33 RR)
%            Number of literals    :   57 (  14 equ;  29 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   12 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4279,negated_conjecture,
    ( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ)
    | ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_4279) ).

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

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

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

cnf(i_0_67,plain,
    ( isFinite0(X1)
    | ~ aSet0(X1)
    | ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_67) ).

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

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

cnf(i_0_66,plain,
    ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
    | ~ aSet0(X1)
    | ~ isFinite0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_66) ).

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

cnf(i_0_71,plain,
    ( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
    | ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ aElementOf0(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_71) ).

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

cnf(i_0_16,plain,
    ( isFinite0(X1)
    | ~ aSet0(X2)
    | ~ isFinite0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_16) ).

cnf(i_0_4275,hypothesis,
    aSubsetOf0(xP,xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-68fxe0oo/lgb.p',i_0_4275) ).

cnf(c_0_4293,negated_conjecture,
    ( szszuzczcdt0(sbrdtbr0(xP)) != sbrdtbr0(xQ)
    | ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    i_0_4279 ).

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

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

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

cnf(c_0_4297,plain,
    ( isFinite0(X1)
    | ~ aSet0(X1)
    | ~ aElementOf0(sbrdtbr0(X1),szNzAzT0) ),
    i_0_67 ).

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

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

cnf(c_0_4300,negated_conjecture,
    ( szszuzczcdt0(sbrdtbr0(xP)) != xK
    | ~ aElementOf0(sbrdtbr0(xP),szNzAzT0) ),
    inference(rw,[status(thm)],[c_0_4293,c_0_4294]) ).

cnf(c_0_4301,plain,
    ( aElementOf0(sbrdtbr0(X1),szNzAzT0)
    | ~ aSet0(X1)
    | ~ isFinite0(X1) ),
    i_0_66 ).

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

cnf(c_0_4303,plain,
    ( szszuzczcdt0(sbrdtbr0(sdtmndt0(X1,X2))) = sbrdtbr0(X1)
    | ~ aSet0(X1)
    | ~ isFinite0(X1)
    | ~ aElementOf0(X2,X1) ),
    i_0_71 ).

cnf(c_0_4304,hypothesis,
    sdtmndt0(xQ,xp) = xP,
    inference(rw,[status(thm)],[c_0_4295,c_0_4296]) ).

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

cnf(c_0_4306,hypothesis,
    isFinite0(xQ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4297,c_0_4294]),c_0_4298]),c_0_4299])]) ).

cnf(c_0_4307,plain,
    ( szszuzczcdt0(sbrdtbr0(xP)) != xK
    | ~ isFinite0(xP) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4300,c_0_4301]),c_0_4302])]) ).

cnf(c_0_4308,hypothesis,
    szszuzczcdt0(sbrdtbr0(xP)) = xK,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4303,c_0_4304]),c_0_4294]),c_0_4298]),c_0_4305])]),c_0_4306])]) ).

cnf(c_0_4309,plain,
    ( isFinite0(X1)
    | ~ aSet0(X2)
    | ~ isFinite0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    i_0_16 ).

cnf(c_0_4310,hypothesis,
    aSubsetOf0(xP,xQ),
    i_0_4275 ).

cnf(c_0_4311,plain,
    ~ isFinite0(xP),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4307,c_0_4308])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.12  % Problem  : NUM612+3 : TPTP v8.1.0. Released v4.0.0.
% 0.13/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n029.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul  5 22:35:14 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 9.63/3.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.63/3.41  # No SInE strategy applied
% 9.63/3.41  # Trying AutoSched0 for 150 seconds
% 9.63/3.41  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.63/3.41  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.63/3.41  #
% 9.63/3.41  # Preprocessing time       : 0.025 s
% 9.63/3.41  
% 9.63/3.41  # Proof found!
% 9.63/3.41  # SZS status Theorem
% 9.63/3.41  # SZS output start CNFRefutation
% See solution above
% 9.63/3.41  # Training examples: 0 positive, 0 negative
% 9.63/3.41  
% 9.63/3.41  # -------------------------------------------------
% 9.63/3.41  # User time                : 0.034 s
% 9.63/3.41  # System time              : 0.008 s
% 9.63/3.41  # Total time               : 0.042 s
% 9.63/3.41  # Maximum resident set size: 7128 pages
% 9.63/3.41  
%------------------------------------------------------------------------------