↑ Up

Enigma---0.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : MGT112+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:06 AM UTC 2026

% Result   : Unsatisfiable 12.62s 3.44s
% Output   : CNFRefutation 12.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   22 (  18 unt;   0 nHn;  22 RR)
%            Number of literals    :   45 (   0 equ;  28 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    9 (   8 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   6 con; 0-0 aty)
%            Number of variables   :   18 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,plain,
    ( ~ proh(X1)
    | ~ disability(X2)
    | ~ aee(X1,X3)
    | ~ aer(X1,X4)
    | ~ act(X1,X5)
    | ~ tgt(X1,X6)
    | ~ bearer(X2,X4)
    | ~ cnt(X2,X5,X6) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_1) ).

cnf(i_0_23,plain,
    cnt(db,read,museum_api),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_23) ).

cnf(i_0_15,plain,
    disability(db),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_15) ).

cnf(i_0_19,plain,
    bearer(db,museen),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_19) ).

cnf(i_0_29,plain,
    tgt(f2,museum_api),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_29) ).

cnf(i_0_28,plain,
    act(f2,read),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_28) ).

cnf(i_0_27,plain,
    aer(f2,museen),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_27) ).

cnf(i_0_25,plain,
    proh(f2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_25) ).

cnf(i_0_26,plain,
    aee(f2,bibliothek),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qrwzet55/input.p',i_0_26) ).

cnf(c_0_39,plain,
    ( ~ proh(X1)
    | ~ disability(X2)
    | ~ aee(X1,X3)
    | ~ aer(X1,X4)
    | ~ act(X1,X5)
    | ~ tgt(X1,X6)
    | ~ bearer(X2,X4)
    | ~ cnt(X2,X5,X6) ),
    i_0_1 ).

cnf(c_0_40,plain,
    cnt(db,read,museum_api),
    i_0_23 ).

cnf(c_0_41,plain,
    disability(db),
    i_0_15 ).

cnf(c_0_42,plain,
    ( ~ bearer(db,X1)
    | ~ tgt(X2,museum_api)
    | ~ act(X2,read)
    | ~ aer(X2,X1)
    | ~ aee(X2,X3)
    | ~ proh(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41])]) ).

cnf(c_0_43,plain,
    bearer(db,museen),
    i_0_19 ).

cnf(c_0_44,plain,
    ( ~ tgt(X1,museum_api)
    | ~ act(X1,read)
    | ~ aer(X1,museen)
    | ~ aee(X1,X2)
    | ~ proh(X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_45,plain,
    tgt(f2,museum_api),
    i_0_29 ).

cnf(c_0_46,plain,
    act(f2,read),
    i_0_28 ).

cnf(c_0_47,plain,
    aer(f2,museen),
    i_0_27 ).

cnf(c_0_48,plain,
    proh(f2),
    i_0_25 ).

cnf(c_0_49,plain,
    aee(f2,bibliothek),
    i_0_26 ).

cnf(c_0_50,plain,
    ~ aee(f2,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_47]),c_0_48])]) ).

cnf(c_0_51,plain,
    $false,
    inference(sr,[status(thm)],[c_0_49,c_0_50]),
    [proof] ).

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