↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n024.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  : 300s
% DateTime : Tue Apr  1 02:12:55 AM UTC 2025

% Result   : Theorem 20.39s 3.99s
% Output   : CNFRefutation 20.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  10 unt;   0 nHn;  24 RR)
%            Number of literals    :   59 (  13 equ;  35 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :   47 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_103,plain,
    ( plus_succeeds(X1,X2,X3)
    | '@+'(X1,X2) != X3
    | ~ nat_succeeds(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_103) ).

cnf(i_0_105,plain,
    ( times_succeeds(X1,X2,X3)
    | '@*'(X1,X2) != X3
    | ~ nat_succeeds(X2)
    | ~ nat_succeeds(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_105) ).

cnf(i_0_141,negated_conjecture,
    nat_succeeds(esk37_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_141) ).

cnf(i_0_17,plain,
    ( times_succeeds(X1,X2,X3)
    | X1 != s(X4)
    | ~ times_succeeds(X4,X2,X5)
    | ~ plus_succeeds(X2,X5,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_17) ).

cnf(i_0_142,negated_conjecture,
    nat_succeeds(esk36_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_142) ).

cnf(i_0_104,plain,
    ( '@*'(X1,X2) = X3
    | ~ nat_succeeds(X2)
    | ~ nat_succeeds(X1)
    | ~ times_succeeds(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_104) ).

cnf(i_0_127,plain,
    ( nat_succeeds(X1)
    | ~ times_succeeds(X1,X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_127) ).

cnf(i_0_140,negated_conjecture,
    '@+'(esk37_0,'@*'(esk36_0,esk37_0)) != '@*'(s(esk36_0),esk37_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-nyg4mmee/input.p',i_0_140) ).

cnf(c_0_151,plain,
    ( plus_succeeds(X1,X2,X3)
    | '@+'(X1,X2) != X3
    | ~ nat_succeeds(X1) ),
    i_0_103 ).

cnf(c_0_152,plain,
    ( times_succeeds(X1,X2,X3)
    | '@*'(X1,X2) != X3
    | ~ nat_succeeds(X2)
    | ~ nat_succeeds(X1) ),
    i_0_105 ).

cnf(c_0_153,plain,
    ( plus_succeeds(X1,X2,'@+'(X1,X2))
    | ~ nat_succeeds(X1) ),
    inference(er,[status(thm)],[c_0_151]) ).

cnf(c_0_154,negated_conjecture,
    nat_succeeds(esk37_0),
    i_0_141 ).

cnf(c_0_155,plain,
    ( times_succeeds(X1,X2,'@*'(X1,X2))
    | ~ nat_succeeds(X2)
    | ~ nat_succeeds(X1) ),
    inference(er,[status(thm)],[c_0_152]) ).

cnf(c_0_156,plain,
    ( times_succeeds(X1,X2,X3)
    | X1 != s(X4)
    | ~ times_succeeds(X4,X2,X5)
    | ~ plus_succeeds(X2,X5,X3) ),
    i_0_17 ).

cnf(c_0_157,negated_conjecture,
    plus_succeeds(esk37_0,X1,'@+'(esk37_0,X1)),
    inference(spm,[status(thm)],[c_0_153,c_0_154]) ).

cnf(c_0_158,negated_conjecture,
    ( times_succeeds(X1,esk37_0,'@*'(X1,esk37_0))
    | ~ nat_succeeds(X1) ),
    inference(spm,[status(thm)],[c_0_155,c_0_154]) ).

cnf(c_0_159,negated_conjecture,
    nat_succeeds(esk36_0),
    i_0_142 ).

cnf(c_0_160,plain,
    ( times_succeeds(X1,esk37_0,'@+'(esk37_0,X2))
    | X1 != s(X3)
    | ~ times_succeeds(X3,esk37_0,X2) ),
    inference(spm,[status(thm)],[c_0_156,c_0_157]) ).

cnf(c_0_161,negated_conjecture,
    times_succeeds(esk36_0,esk37_0,'@*'(esk36_0,esk37_0)),
    inference(spm,[status(thm)],[c_0_158,c_0_159]) ).

cnf(c_0_162,plain,
    ( '@*'(X1,X2) = X3
    | ~ nat_succeeds(X2)
    | ~ nat_succeeds(X1)
    | ~ times_succeeds(X1,X2,X3) ),
    i_0_104 ).

cnf(c_0_163,plain,
    ( nat_succeeds(X1)
    | ~ times_succeeds(X1,X2,X3) ),
    i_0_127 ).

cnf(c_0_164,negated_conjecture,
    ( times_succeeds(X1,esk37_0,'@+'(esk37_0,'@*'(esk36_0,esk37_0)))
    | X1 != s(esk36_0) ),
    inference(spm,[status(thm)],[c_0_160,c_0_161]) ).

cnf(c_0_165,plain,
    ( '@*'(X1,X2) = X3
    | ~ times_succeeds(X1,X2,X3)
    | ~ nat_succeeds(X2) ),
    inference(csr,[status(thm)],[c_0_162,c_0_163]) ).

cnf(c_0_166,negated_conjecture,
    times_succeeds(s(esk36_0),esk37_0,'@+'(esk37_0,'@*'(esk36_0,esk37_0))),
    inference(er,[status(thm)],[c_0_164]) ).

cnf(c_0_167,negated_conjecture,
    '@+'(esk37_0,'@*'(esk36_0,esk37_0)) != '@*'(s(esk36_0),esk37_0),
    i_0_140 ).

cnf(c_0_168,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_165,c_0_166]),c_0_154])]),c_0_167]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWX035+1 : TPTP v9.1.0. Released v9.1.0.
% 0.04/0.14  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n024.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  : 300
% 0.14/0.35  % DateTime : Mon Mar 31 14:28:22 EDT 2025
% 0.14/0.36  % CPUTime  : 
% 0.22/0.47  # ENIGMATIC: Selected complete mode:
% 20.39/3.99  # ENIGMATIC: Solved by Enigma+tptp-cade20-model02-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 20.39/3.99  # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 20.39/3.99  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model02-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 36; version: 991; iters: 150)
% 20.39/3.99  # Preprocessing time       : 0.764 s
% 20.39/3.99  
% 20.39/3.99  # Proof found!
% 20.39/3.99  # SZS status Theorem
% 20.39/3.99  # SZS output start CNFRefutation
% See solution above
% 20.39/3.99  # Training examples: 0 positive, 0 negative
% 20.39/3.99  
% 20.39/3.99  # -------------------------------------------------
% 20.39/3.99  # User time                : 1.381 s
% 20.39/3.99  # System time              : 0.109 s
% 20.39/3.99  # Total time               : 1.490 s
% 20.39/3.99  # ...preprocessing         : 0.764 s
% 20.39/3.99  # ...main loop             : 0.725 s
% 20.39/3.99  # Maximum resident set size: 151840 pages
% 20.39/3.99  
%------------------------------------------------------------------------------