↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n005.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:24:17 EDT 2022

% Result   : Theorem 8.57s 2.35s
% Output   : CNFRefutation 8.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   18 (  10 unt;   0 nHn;  18 RR)
%            Number of literals    :   37 (   0 equ;  21 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-4 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :   33 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_156,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(X4))
    | ~ rdn_translate(X2,rdn_pos(X5))
    | ~ rdn_translate(X1,rdn_pos(X6))
    | ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_156) ).

cnf(i_0_19,plain,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_19) ).

cnf(i_0_1,plain,
    ( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
    | ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
    | ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_1) ).

cnf(i_0_47,plain,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_47) ).

cnf(i_0_18,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_18) ).

cnf(i_0_158,negated_conjecture,
    ~ sum(X1,n0,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-llq6ww9l/lgb.p',i_0_158) ).

cnf(c_0_165,plain,
    ( sum(X1,X2,X3)
    | ~ rdn_translate(X3,rdn_pos(X4))
    | ~ rdn_translate(X2,rdn_pos(X5))
    | ~ rdn_translate(X1,rdn_pos(X6))
    | ~ rdn_add_with_carry(rdnn(n0),X6,X5,X4) ),
    i_0_156 ).

cnf(c_0_166,plain,
    rdn_translate(n1,rdn_pos(rdnn(n1))),
    i_0_19 ).

cnf(c_0_167,plain,
    ( rdn_add_with_carry(rdnn(X1),rdnn(X2),rdnn(X3),rdnn(X4))
    | ~ rdn_digit_add(rdnn(X5),rdnn(X1),rdnn(X4),rdnn(n0))
    | ~ rdn_digit_add(rdnn(X2),rdnn(X3),rdnn(X5),rdnn(n0)) ),
    i_0_1 ).

cnf(c_0_168,plain,
    rdn_digit_add(rdnn(n1),rdnn(n0),rdnn(n1),rdnn(n0)),
    i_0_47 ).

cnf(c_0_169,plain,
    ( sum(X1,X2,n1)
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_translate(X1,rdn_pos(X4))
    | ~ rdn_add_with_carry(rdnn(n0),X4,X3,rdnn(n1)) ),
    inference(spm,[status(thm)],[c_0_165,c_0_166]) ).

cnf(c_0_170,plain,
    rdn_translate(n0,rdn_pos(rdnn(n0))),
    i_0_18 ).

cnf(c_0_171,plain,
    ( rdn_add_with_carry(rdnn(n0),rdnn(X1),rdnn(X2),rdnn(n1))
    | ~ rdn_digit_add(rdnn(X1),rdnn(X2),rdnn(n1),rdnn(n0)) ),
    inference(spm,[status(thm)],[c_0_167,c_0_168]) ).

cnf(c_0_172,plain,
    ( sum(X1,n0,n1)
    | ~ rdn_translate(X1,rdn_pos(X2))
    | ~ rdn_add_with_carry(rdnn(n0),X2,rdnn(n0),rdnn(n1)) ),
    inference(spm,[status(thm)],[c_0_169,c_0_170]) ).

cnf(c_0_173,plain,
    rdn_add_with_carry(rdnn(n0),rdnn(n1),rdnn(n0),rdnn(n1)),
    inference(spm,[status(thm)],[c_0_171,c_0_168]) ).

cnf(c_0_174,plain,
    ( sum(X1,n0,n1)
    | ~ rdn_translate(X1,rdn_pos(rdnn(n1))) ),
    inference(spm,[status(thm)],[c_0_172,c_0_173]) ).

cnf(c_0_175,negated_conjecture,
    ~ sum(X1,n0,X1),
    i_0_158 ).

cnf(c_0_176,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_166]),c_0_175]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11  % Problem  : NUM327+1 : TPTP v8.1.0. Released v3.1.0.
% 0.05/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n005.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Wed Jul  6 00:27:39 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.41  # ENIGMATIC: Selected SinE mode:
% 0.17/0.42  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.42  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.17/0.42  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.17/0.42  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 8.57/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.57/2.35  # No SInE strategy applied
% 8.57/2.35  # Trying AutoSched0 for 150 seconds
% 8.57/2.35  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S048A
% 8.57/2.35  # and selection function SelectComplexPreferEQ.
% 8.57/2.35  #
% 8.57/2.35  # Preprocessing time       : 0.023 s
% 8.57/2.35  # Presaturation interreduction done
% 8.57/2.35  
% 8.57/2.35  # Proof found!
% 8.57/2.35  # SZS status Theorem
% 8.57/2.35  # SZS output start CNFRefutation
% See solution above
% 8.57/2.35  # Training examples: 0 positive, 0 negative
% 8.57/2.35  
% 8.57/2.35  # -------------------------------------------------
% 8.57/2.35  # User time                : 0.030 s
% 8.57/2.35  # System time              : 0.004 s
% 8.57/2.35  # Total time               : 0.034 s
% 8.57/2.35  # Maximum resident set size: 7128 pages
% 8.57/2.35  
%------------------------------------------------------------------------------