↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n001.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep  8 06:08:07 AM UTC 2026

% Result   : Theorem 13.70s 3.93s
% Output   : CNFRefutation 13.70s
% 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 (  10 equ;   5 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   2 con; 0-1 aty)
%            Number of variables   :    5 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( X1 = X2
    | issue(X1) != issue(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0oxcik5z/lgb.p',i_0_1) ).

cnf(i_0_5,negated_conjecture,
    issue(pi1) = issue(pi2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0oxcik5z/lgb.p',i_0_5) ).

cnf(i_0_4,plain,
    pi1 != pi2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-0oxcik5z/lgb.p',i_0_4) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | issue(X1) != issue(X2) ),
    i_0_1 ).

cnf(c_0_10,negated_conjecture,
    issue(pi1) = issue(pi2),
    i_0_5 ).

cnf(c_0_11,negated_conjecture,
    ( X1 = pi1
    | issue(X1) != issue(pi2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    pi1 != pi2,
    i_0_4 ).

cnf(c_0_13,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[c_0_11]),c_0_12]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT115+1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.35  % Computer : n001.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Mon Sep  7 14:13:39 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.12/0.45  # ENIGMATIC: Selected complete mode:
% 13.70/3.93  # ENIGMATIC: Solved by autoschedule-lgb:
% 13.70/3.93  # No SInE strategy applied
% 13.70/3.93  # Trying AutoSched0 for 150 seconds
% 13.70/3.93  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S086N
% 13.70/3.93  # and selection function SelectCQIArNp.
% 13.70/3.93  #
% 13.70/3.93  # Preprocessing time       : 0.023 s
% 13.70/3.93  # Presaturation interreduction done
% 13.70/3.93  
% 13.70/3.93  # Proof found!
% 13.70/3.93  # SZS status Theorem
% 13.70/3.93  # SZS output start CNFRefutation
% See solution above
% 13.70/3.93  # Training examples: 0 positive, 0 negative
% 13.70/3.93  
% 13.70/3.93  # -------------------------------------------------
% 13.70/3.93  # User time                : 0.022 s
% 13.70/3.93  # System time              : 0.004 s
% 13.70/3.93  # Total time               : 0.027 s
% 13.70/3.93  # Maximum resident set size: 3328 pages
% 13.70/3.93  
%------------------------------------------------------------------------------