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

View Problem - Process Solution

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

% Computer : n007.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:36:10 EDT 2022

% Result   : Theorem 8.29s 2.48s
% Output   : CNFRefutation 8.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   31 (  10 unt;   8 nHn;  31 RR)
%            Number of literals    :   59 (  32 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    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_7) ).

cnf(i_0_11,plain,
    ( sdtpldt0(smndt0(X1),X1) = sz00
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_11) ).

cnf(i_0_4,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_4) ).

cnf(i_0_123,negated_conjecture,
    ( sdtpldt0(sz10,xp) = sz10
    | sdtpldt0(sz10,smndt0(xp)) = sz10 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_123) ).

cnf(i_0_3,plain,
    aInteger0(sz10),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_3) ).

cnf(i_0_120,hypothesis,
    aInteger0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_120) ).

cnf(i_0_9,plain,
    ( sdtpldt0(sz00,X1) = X1
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_9) ).

cnf(i_0_12,plain,
    ( sdtpldt0(X1,smndt0(X1)) = sz00
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_12) ).

cnf(i_0_10,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_10) ).

cnf(i_0_119,hypothesis,
    xp != sz00,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-vz21wb20/lgb.p',i_0_119) ).

cnf(c_0_134,plain,
    ( sdtpldt0(sdtpldt0(X1,X2),X3) = sdtpldt0(X1,sdtpldt0(X2,X3))
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    i_0_7 ).

cnf(c_0_135,plain,
    ( sdtpldt0(smndt0(X1),X1) = sz00
    | ~ aInteger0(X1) ),
    i_0_11 ).

cnf(c_0_136,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    i_0_4 ).

cnf(c_0_137,plain,
    ( sdtpldt0(smndt0(X1),sdtpldt0(X1,X2)) = sdtpldt0(sz00,X2)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_136]) ).

cnf(c_0_138,negated_conjecture,
    ( sdtpldt0(sz10,xp) = sz10
    | sdtpldt0(sz10,smndt0(xp)) = sz10 ),
    i_0_123 ).

cnf(c_0_139,plain,
    aInteger0(sz10),
    i_0_3 ).

cnf(c_0_140,negated_conjecture,
    ( sdtpldt0(smndt0(sz10),sz10) = sdtpldt0(sz00,smndt0(xp))
    | sdtpldt0(sz10,xp) = sz10
    | ~ aInteger0(smndt0(xp)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_138]),c_0_139])]) ).

cnf(c_0_141,hypothesis,
    aInteger0(xp),
    i_0_120 ).

cnf(c_0_142,plain,
    ( sdtpldt0(smndt0(sz10),sz10) = sdtpldt0(sz00,smndt0(xp))
    | sdtpldt0(sz10,xp) = sz10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_140,c_0_136]),c_0_141])]) ).

cnf(c_0_143,plain,
    ( sdtpldt0(sz00,X1) = X1
    | ~ aInteger0(X1) ),
    i_0_9 ).

cnf(c_0_144,plain,
    ( sdtpldt0(sz00,smndt0(xp)) = sz00
    | sdtpldt0(sz10,xp) = sz10 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_142]),c_0_139])]) ).

cnf(c_0_145,plain,
    ( sdtpldt0(sz10,xp) = sz10
    | smndt0(xp) = sz00
    | ~ aInteger0(smndt0(xp)) ),
    inference(spm,[status(thm)],[c_0_143,c_0_144]) ).

cnf(c_0_146,plain,
    ( sdtpldt0(X1,smndt0(X1)) = sz00
    | ~ aInteger0(X1) ),
    i_0_12 ).

cnf(c_0_147,plain,
    ( sdtpldt0(sz10,xp) = sz10
    | smndt0(xp) = sz00 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_136]),c_0_141])]) ).

cnf(c_0_148,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aInteger0(X1) ),
    i_0_10 ).

cnf(c_0_149,plain,
    ( sdtpldt0(sz10,xp) = sz10
    | sdtpldt0(xp,sz00) = sz00 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_141])]) ).

cnf(c_0_150,hypothesis,
    xp != sz00,
    i_0_119 ).

cnf(c_0_151,plain,
    sdtpldt0(sz10,xp) = sz10,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_149]),c_0_141])]),c_0_150]) ).

cnf(c_0_152,plain,
    sdtpldt0(smndt0(sz10),sz10) = sdtpldt0(sz00,xp),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_137,c_0_151]),c_0_141]),c_0_139])]) ).

cnf(c_0_153,plain,
    sdtpldt0(sz00,xp) = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_135,c_0_152]),c_0_139])]) ).

cnf(c_0_154,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_143,c_0_153]),c_0_141])]),c_0_150]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM453+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Thu Jul  7 06:30:00 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected complete mode:
% 8.29/2.48  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.29/2.48  # No SInE strategy applied
% 8.29/2.48  # Trying AutoSched0 for 150 seconds
% 8.29/2.48  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.29/2.48  # and selection function SelectNewComplexAHP.
% 8.29/2.48  #
% 8.29/2.48  # Preprocessing time       : 0.022 s
% 8.29/2.48  # Presaturation interreduction done
% 8.29/2.48  
% 8.29/2.48  # Proof found!
% 8.29/2.48  # SZS status Theorem
% 8.29/2.48  # SZS output start CNFRefutation
% See solution above
% 8.29/2.48  # Training examples: 0 positive, 0 negative
% 8.29/2.48  
% 8.29/2.48  # -------------------------------------------------
% 8.29/2.48  # User time                : 0.056 s
% 8.29/2.48  # System time              : 0.005 s
% 8.29/2.48  # Total time               : 0.062 s
% 8.29/2.48  # Maximum resident set size: 7124 pages
% 8.29/2.48  
%------------------------------------------------------------------------------