↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n008.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:54 EDT 2022

% Result   : Theorem 8.00s 2.31s
% Output   : CNFRefutation 8.00s
% 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_46,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrc1dly6/input.p',i_0_46) ).

cnf(i_0_44,hypothesis,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrc1dly6/input.p',i_0_44) ).

cnf(i_0_45,hypothesis,
    aInteger0(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-qrc1dly6/input.p',i_0_45) ).

cnf(c_0_50,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X1) ),
    i_0_46 ).

cnf(c_0_51,hypothesis,
    sdtpldt0(xa,smndt0(xb)) = sdtasdt0(xq,esk2_0),
    i_0_44 ).

cnf(c_0_52,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtasdt0(xq,esk2_0)
    | ~ aInteger0(X1) ),
    inference(rw,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_53,hypothesis,
    aInteger0(esk2_0),
    i_0_45 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM429+3 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n008.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 05:58:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 8.00/2.31  # ENIGMATIC: Solved by autoschedule:
% 8.00/2.31  # No SInE strategy applied
% 8.00/2.31  # Trying AutoSched0 for 150 seconds
% 8.00/2.31  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.00/2.31  # and selection function SelectNewComplexAHP.
% 8.00/2.31  #
% 8.00/2.31  # Preprocessing time       : 0.013 s
% 8.00/2.31  # Presaturation interreduction done
% 8.00/2.31  
% 8.00/2.31  # Proof found!
% 8.00/2.31  # SZS status Theorem
% 8.00/2.31  # SZS output start CNFRefutation
% See solution above
% 8.00/2.31  # Training examples: 0 positive, 0 negative
% 8.00/2.31  
% 8.00/2.31  # -------------------------------------------------
% 8.00/2.31  # User time                : 0.013 s
% 8.00/2.31  # System time              : 0.005 s
% 8.00/2.31  # Total time               : 0.018 s
% 8.00/2.31  # Maximum resident set size: 7124 pages
% 8.00/2.31  
%------------------------------------------------------------------------------