↑ Up

Enigma---0.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : MGT106+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 5.58s 3.03s
% Output   : CNFRefutation 5.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  10 unt;   0 def)
%            Number of atoms       :   66 (  15 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   65 (  27   ~;  25   |;   9   &)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   33 (   1 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(leq_antisym,axiom,
    ! [X1,X2] :
      ( ( leq(X1,X2)
        & leq(X2,X1) )
     => X1 = X2 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_antisym) ).

fof(leq_def,axiom,
    ! [X1,X2] :
      ( leq(X1,X2)
    <=> ( less(X1,X2)
        | X1 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',leq_def) ).

fof(in_lopen,axiom,
    ! [X1,X4,X5] :
      ( in_lopen(X1,X4,X5)
    <=> ( less(X4,X1)
        & leq(X1,X5) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+2.ax',in_lopen) ).

fof(wit_in_lopen,axiom,
    in_lopen(w,v0,v600),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wit_in_lopen) ).

fof(less_leq_trans,axiom,
    ! [X1,X2,X3] :
      ( ( less(X1,X2)
        & leq(X2,X3) )
     => less(X1,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/MGT002+0.ax',less_leq_trans) ).

fof(wit_leq,axiom,
    leq(v800,w),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wit_leq) ).

fof(ord_v600_v800,axiom,
    less(v600,v800),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ord_v600_v800) ).

fof(distinct,axiom,
    ( v0 != v600
    & v0 != v800
    & v600 != v800 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).

fof(c_0_8,plain,
    ! [X21,X22] :
      ( ~ leq(X21,X22)
      | ~ leq(X22,X21)
      | X21 = X22 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_antisym])]) ).

fof(c_0_9,plain,
    ! [X19,X20] :
      ( ( ~ leq(X19,X20)
        | less(X19,X20)
        | X19 = X20 )
      & ( ~ less(X19,X20)
        | leq(X19,X20) )
      & ( X19 != X20
        | leq(X19,X20) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[leq_def])])]) ).

fof(c_0_10,plain,
    ! [X37,X38,X39] :
      ( ( less(X38,X37)
        | ~ in_lopen(X37,X38,X39) )
      & ( leq(X37,X39)
        | ~ in_lopen(X37,X38,X39) )
      & ( ~ less(X38,X37)
        | ~ leq(X37,X39)
        | in_lopen(X37,X38,X39) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[in_lopen])])]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ leq(X1,X2)
    | ~ leq(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( leq(X1,X2)
    | ~ less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( leq(X1,X2)
    | ~ in_lopen(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    in_lopen(w,v0,v600),
    inference(split_conjunct,[status(thm)],[wit_in_lopen]) ).

fof(c_0_15,plain,
    ! [X28,X29,X30] :
      ( ~ less(X28,X29)
      | ~ leq(X29,X30)
      | less(X28,X30) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_leq_trans])]) ).

cnf(c_0_16,plain,
    leq(v800,w),
    inference(split_conjunct,[status(thm)],[wit_leq]) ).

cnf(c_0_17,plain,
    ( X1 = X2
    | ~ leq(X1,X2)
    | ~ less(X2,X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,plain,
    leq(w,v600),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_19,plain,
    ( less(X1,X3)
    | ~ less(X1,X2)
    | ~ leq(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_20,plain,
    ( w = v800
    | ~ leq(w,v800) ),
    inference(spm,[status(thm)],[c_0_11,c_0_16]) ).

cnf(c_0_21,plain,
    ( w = v600
    | ~ less(v600,w) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( less(X1,w)
    | ~ less(X1,v800) ),
    inference(spm,[status(thm)],[c_0_19,c_0_16]) ).

cnf(c_0_23,plain,
    less(v600,v800),
    inference(split_conjunct,[status(thm)],[ord_v600_v800]) ).

cnf(c_0_24,plain,
    ( w = v800
    | ~ less(w,v800) ),
    inference(spm,[status(thm)],[c_0_20,c_0_12]) ).

cnf(c_0_25,plain,
    w = v600,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]) ).

cnf(c_0_26,plain,
    v600 != v800,
    inference(split_conjunct,[status(thm)],[distinct]) ).

cnf(c_0_27,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25]),c_0_25]),c_0_23])]),c_0_26]),
    [proof] ).

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