↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM492+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n020.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:35 EDT 2022

% Result   : Theorem 13.81s 3.24s
% Output   : CNFRefutation 13.81s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   30 (  21 unt;   0 nHn;  30 RR)
%            Number of literals    :   61 (   6 equ;  35 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   19 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_58,plain,
    ( doDivides0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ doDivides0(X1,X3)
    | ~ doDivides0(X1,sdtpldt0(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_58) ).

cnf(i_0_82,hypothesis,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_82) ).

cnf(i_0_31,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_31) ).

cnf(i_0_86,negated_conjecture,
    ~ doDivides0(xp,sdtasdt0(xr,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_86) ).

cnf(i_0_75,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_75) ).

cnf(i_0_84,hypothesis,
    doDivides0(xp,sdtasdt0(xp,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_84) ).

cnf(i_0_71,hypothesis,
    aNaturalNumber0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_71) ).

cnf(i_0_78,hypothesis,
    sdtmndt0(xn,xp) = xr,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_78) ).

cnf(i_0_77,hypothesis,
    sdtlseqdt0(xp,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_77) ).

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

cnf(i_0_6,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-nmprc37w/input.p',i_0_6) ).

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

cnf(c_0_99,plain,
    ( doDivides0(X1,X2)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X1)
    | ~ doDivides0(X1,X3)
    | ~ doDivides0(X1,sdtpldt0(X3,X2)) ),
    i_0_58 ).

cnf(c_0_100,hypothesis,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm),
    i_0_82 ).

cnf(c_0_101,plain,
    ( aNaturalNumber0(X1)
    | X1 != sdtmndt0(X2,X3)
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ sdtlseqdt0(X3,X2) ),
    i_0_31 ).

cnf(c_0_102,negated_conjecture,
    ~ doDivides0(xp,sdtasdt0(xr,xm)),
    i_0_86 ).

cnf(c_0_103,hypothesis,
    ( doDivides0(X1,sdtasdt0(xr,xm))
    | ~ doDivides0(X1,sdtasdt0(xn,xm))
    | ~ doDivides0(X1,sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm))
    | ~ aNaturalNumber0(X1) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_104,hypothesis,
    doDivides0(xp,sdtasdt0(xn,xm)),
    i_0_75 ).

cnf(c_0_105,hypothesis,
    doDivides0(xp,sdtasdt0(xp,xm)),
    i_0_84 ).

cnf(c_0_106,hypothesis,
    aNaturalNumber0(xp),
    i_0_71 ).

cnf(c_0_107,plain,
    ( aNaturalNumber0(sdtmndt0(X1,X2))
    | ~ sdtlseqdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    inference(er,[status(thm)],[c_0_101]) ).

cnf(c_0_108,hypothesis,
    sdtmndt0(xn,xp) = xr,
    i_0_78 ).

cnf(c_0_109,hypothesis,
    sdtlseqdt0(xp,xn),
    i_0_77 ).

cnf(c_0_110,hypothesis,
    aNaturalNumber0(xn),
    i_0_73 ).

cnf(c_0_111,negated_conjecture,
    ( ~ aNaturalNumber0(sdtasdt0(xp,xm))
    | ~ aNaturalNumber0(sdtasdt0(xr,xm)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_103]),c_0_104]),c_0_105]),c_0_106])]) ).

cnf(c_0_112,plain,
    ( aNaturalNumber0(sdtasdt0(X1,X2))
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_6 ).

cnf(c_0_113,hypothesis,
    aNaturalNumber0(xm),
    i_0_72 ).

cnf(c_0_114,hypothesis,
    aNaturalNumber0(xr),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_106]),c_0_110])]) ).

cnf(c_0_115,plain,
    ~ aNaturalNumber0(sdtasdt0(xp,xm)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114])]) ).

cnf(c_0_116,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_112]),c_0_113]),c_0_106])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM492+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 : Fri Jul  8 02:10:45 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 13.81/3.24  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l6400-e0.15+coop-mzr02:
% 13.81/3.24  # ENIGMA: LightGBM model '/export/starexec/sandbox/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l6400-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 22; version: 991; iters: 150)
% 13.81/3.24  # Preprocessing time       : 0.852 s
% 13.81/3.24  
% 13.81/3.24  # Proof found!
% 13.81/3.24  # SZS status Theorem
% 13.81/3.24  # SZS output start CNFRefutation
% See solution above
% 13.81/3.24  # Training examples: 0 positive, 0 negative
% 13.81/3.24  
% 13.81/3.24  # -------------------------------------------------
% 13.81/3.24  # User time                : 0.752 s
% 13.81/3.24  # System time              : 0.105 s
% 13.81/3.24  # Total time               : 0.857 s
% 13.81/3.24  # ...preprocessing         : 0.852 s
% 13.81/3.24  # ...main loop             : 0.005 s
% 13.81/3.24  # Maximum resident set size: 168412 pages
% 13.81/3.24  
%------------------------------------------------------------------------------