↑ Up

Enigma---0.5.1.THM-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_48,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc))
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2b5jsqqa/input.p',i_0_48) ).

cnf(i_0_40,hypothesis,
    sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2b5jsqqa/input.p',i_0_40) ).

cnf(i_0_41,hypothesis,
    aInteger0(esk3_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-2b5jsqqa/input.p',i_0_41) ).

cnf(c_0_52,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xb,smndt0(xc))
    | ~ aInteger0(X1) ),
    i_0_48 ).

cnf(c_0_53,hypothesis,
    sdtpldt0(xb,smndt0(xc)) = sdtasdt0(xq,esk3_0),
    i_0_40 ).

cnf(c_0_54,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtasdt0(xq,esk3_0)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_55,hypothesis,
    aInteger0(esk3_0),
    i_0_41 ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_54]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM430+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n025.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 : Tue Jul  5 22:32:59 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.77/2.26  # ENIGMATIC: Solved by autoschedule:
% 7.77/2.26  # No SInE strategy applied
% 7.77/2.26  # Trying AutoSched0 for 150 seconds
% 7.77/2.26  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.77/2.26  # and selection function SelectNewComplexAHP.
% 7.77/2.26  #
% 7.77/2.26  # Preprocessing time       : 0.015 s
% 7.77/2.26  # Presaturation interreduction done
% 7.77/2.26  
% 7.77/2.26  # Proof found!
% 7.77/2.26  # SZS status Theorem
% 7.77/2.26  # SZS output start CNFRefutation
% See solution above
% 7.77/2.26  # Training examples: 0 positive, 0 negative
% 7.77/2.26  
% 7.77/2.26  # -------------------------------------------------
% 7.77/2.26  # User time                : 0.019 s
% 7.77/2.26  # System time              : 0.004 s
% 7.77/2.26  # Total time               : 0.023 s
% 7.77/2.26  # Maximum resident set size: 7124 pages
% 7.77/2.26  
%------------------------------------------------------------------------------