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

View Problem - Process Solution

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

% Computer : n010.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:18 EDT 2022

% Result   : Theorem 13.55s 3.03s
% Output   : CNFRefutation 13.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   14
% Syntax   : Number of clauses     :   42 (  23 unt;   6 nHn;  42 RR)
%            Number of literals    :   75 (  33 equ;  33 neg)
%            Maximal clause size   :    7 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_11) ).

cnf(i_0_47,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_47) ).

cnf(i_0_10,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_10) ).

cnf(i_0_49,hypothesis,
    ( sz00 = xm
    | sdtlseqdt0(sz10,xm) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_49) ).

cnf(i_0_54,negated_conjecture,
    sz00 != xm,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_54) ).

cnf(i_0_48,hypothesis,
    aNaturalNumber0(xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_48) ).

cnf(i_0_53,negated_conjecture,
    ( sdtpldt0(xn,X1) != sdtasdt0(xn,xm)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_53) ).

cnf(i_0_2,plain,
    aNaturalNumber0(sz00),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_2) ).

cnf(i_0_43,plain,
    ( X1 = X2
    | X3 = sz00
    | sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ sdtlseqdt0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_43) ).

cnf(i_0_4,plain,
    aNaturalNumber0(sz10),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_4) ).

cnf(i_0_14,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_14) ).

cnf(i_0_52,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_52) ).

cnf(i_0_16,plain,
    ( sdtasdt0(X1,sz00) = sz00
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_16) ).

cnf(i_0_13,plain,
    ( sdtasdt0(sz10,X1) = X1
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-1r0xh2w9/input.p',i_0_13) ).

cnf(c_0_69,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_11 ).

cnf(c_0_70,hypothesis,
    aNaturalNumber0(xn),
    i_0_47 ).

cnf(c_0_71,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_10 ).

cnf(c_0_72,hypothesis,
    ( sz00 = xm
    | sdtlseqdt0(sz10,xm) ),
    i_0_49 ).

cnf(c_0_73,negated_conjecture,
    sz00 != xm,
    i_0_54 ).

cnf(c_0_74,hypothesis,
    ( sdtasdt0(X1,xn) = sdtasdt0(xn,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_75,hypothesis,
    aNaturalNumber0(xm),
    i_0_48 ).

cnf(c_0_76,negated_conjecture,
    ( sdtpldt0(xn,X1) != sdtasdt0(xn,xm)
    | ~ aNaturalNumber0(X1) ),
    i_0_53 ).

cnf(c_0_77,hypothesis,
    sdtpldt0(xn,sz00) = xn,
    inference(spm,[status(thm)],[c_0_71,c_0_70]) ).

cnf(c_0_78,plain,
    aNaturalNumber0(sz00),
    i_0_2 ).

cnf(c_0_79,plain,
    ( X1 = X2
    | X3 = sz00
    | sdtlseqdt0(sdtasdt0(X3,X1),sdtasdt0(X3,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1)
    | ~ aNaturalNumber0(X3)
    | ~ sdtlseqdt0(X1,X2) ),
    i_0_43 ).

cnf(c_0_80,hypothesis,
    sdtlseqdt0(sz10,xm),
    inference(sr,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_81,plain,
    aNaturalNumber0(sz10),
    i_0_4 ).

cnf(c_0_82,plain,
    ( sdtasdt0(X1,sz10) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_14 ).

cnf(c_0_83,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xn,xm)),
    i_0_52 ).

cnf(c_0_84,hypothesis,
    sdtasdt0(xn,xm) = sdtasdt0(xm,xn),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_85,negated_conjecture,
    sdtasdt0(xn,xm) != xn,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78])]) ).

cnf(c_0_86,hypothesis,
    ( sz10 = xm
    | X1 = sz00
    | sdtlseqdt0(sdtasdt0(X1,sz10),sdtasdt0(X1,xm))
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_79,c_0_80]),c_0_75]),c_0_81])]) ).

cnf(c_0_87,hypothesis,
    sdtasdt0(xn,sz10) = xn,
    inference(spm,[status(thm)],[c_0_82,c_0_70]) ).

cnf(c_0_88,negated_conjecture,
    ~ sdtlseqdt0(xn,sdtasdt0(xm,xn)),
    inference(rw,[status(thm)],[c_0_83,c_0_84]) ).

cnf(c_0_89,plain,
    ( sdtasdt0(X1,sz00) = sz00
    | ~ aNaturalNumber0(X1) ),
    i_0_16 ).

cnf(c_0_90,plain,
    ( sdtasdt0(sz10,X1) = X1
    | ~ aNaturalNumber0(X1) ),
    i_0_13 ).

cnf(c_0_91,negated_conjecture,
    sdtasdt0(xm,xn) != xn,
    inference(rw,[status(thm)],[c_0_85,c_0_84]) ).

cnf(c_0_92,hypothesis,
    ( xn = sz00
    | sz10 = xm ),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_86,c_0_70]),c_0_87]),c_0_84]),c_0_88]) ).

cnf(c_0_93,hypothesis,
    sdtasdt0(xm,sz00) = sz00,
    inference(spm,[status(thm)],[c_0_89,c_0_75]) ).

cnf(c_0_94,hypothesis,
    sdtasdt0(sz10,xn) = xn,
    inference(spm,[status(thm)],[c_0_90,c_0_70]) ).

cnf(c_0_95,negated_conjecture,
    sz10 = xm,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_92]),c_0_93])]) ).

cnf(c_0_96,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_94,c_0_95]),c_0_91]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : NUM465+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 00:24:19 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 13.55/3.03  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 13.55/3.03  # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 13.55/3.03  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 39; version: 991; iters: 150)
% 13.55/3.03  # Preprocessing time       : 0.726 s
% 13.55/3.03  
% 13.55/3.03  # Proof found!
% 13.55/3.03  # SZS status Theorem
% 13.55/3.03  # SZS output start CNFRefutation
% See solution above
% 13.55/3.03  # Training examples: 0 positive, 0 negative
% 13.55/3.03  
% 13.55/3.03  # -------------------------------------------------
% 13.55/3.03  # User time                : 0.664 s
% 13.55/3.03  # System time              : 0.103 s
% 13.55/3.03  # Total time               : 0.767 s
% 13.55/3.03  # ...preprocessing         : 0.726 s
% 13.55/3.03  # ...main loop             : 0.041 s
% 13.55/3.03  # Maximum resident set size: 151504 pages
% 13.55/3.03  
%------------------------------------------------------------------------------