↑ Up

Enigma---0.5.1.UNS-CRf.s

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

% Computer : n007.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:05 AM UTC 2026

% Result   : Unsatisfiable 4.86s 2.74s
% Output   : CNFRefutation 4.86s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    2
% Syntax   : Number of formulae    :    6 (   6 unt;   0 def)
%            Number of atoms       :    6 (   0 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    3 (   3   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    3 (   0 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
    ! [X1] : ~ less(X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',irreflexive) ).

fof(contradiction,axiom,
    less(v0,v0),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',contradiction) ).

fof(c_0_2,plain,
    ! [X16] : ~ less(X16,X16),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[irreflexive])]) ).

cnf(c_0_3,plain,
    less(v0,v0),
    inference(split_conjunct,[status(thm)],[contradiction]) ).

cnf(c_0_4,plain,
    ~ less(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,plain,
    $false,
    inference(sr,[status(thm)],[c_0_3,c_0_4]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : MGT104+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.34  % Computer : n007.cluster.edu
% 0.09/0.34  % Model    : x86_64 x86_64
% 0.09/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.34  % Memory   : 8046.5625MB
% 0.09/0.34  % OS       : Linux 6.8.0-71-generic
% 0.09/0.34  % CPULimit : 300
% 0.09/0.34  % WCLimit  : 300
% 0.09/0.34  % DateTime : Mon Sep  7 14:37:44 UTC 2026
% 0.09/0.34  % CPUTime  : 
% 0.13/0.44  # ENIGMATIC: Selected SinE mode:
% 0.13/0.45  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.45  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.13/0.45  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.13/0.45  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 4.32/2.17  [LightGBM] [Fatal] Data file /export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vju1yy1/test couldn't be read
% 4.32/2.17  [1506775] Failed to execute script predict4sine1
% 4.32/2.17  Traceback (most recent call last):
% 4.32/2.17    File "predict4sine1.py", line 24, in <module>
% 4.32/2.17    File "site-packages/lightgbm/basic.py", line 1037, in construct
% 4.32/2.17    File "site-packages/lightgbm/basic.py", line 833, in _lazy_init
% 4.32/2.17    File "site-packages/lightgbm/basic.py", line 47, in _safe_call
% 4.32/2.17  lightgbm.basic.LightGBMError: Data file /export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3vju1yy1/test couldn't be read
% 4.86/2.74  # ENIGMATIC: Solved by autoschedule:
% 4.86/2.74  # No SInE strategy applied
% 4.86/2.74  # Trying AutoSched0 for 150 seconds
% 4.86/2.74  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 4.86/2.74  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.86/2.74  #
% 4.86/2.74  # Preprocessing time       : 0.028 s
% 4.86/2.74  
% 4.86/2.74  # Proof found!
% 4.86/2.74  # SZS status Theorem
% 4.86/2.74  # SZS output start CNFRefutation
% See solution above
% 4.86/2.74  # Training examples: 0 positive, 0 negative
% 4.86/2.74  
% 4.86/2.74  # -------------------------------------------------
% 4.86/2.74  # User time                : 0.028 s
% 4.86/2.74  # System time              : 0.005 s
% 4.86/2.74  # Total time               : 0.033 s
% 4.86/2.74  # Maximum resident set size: 3584 pages
% 4.86/2.74  
%------------------------------------------------------------------------------