↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n029.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 : Mon Sep  7 11:44:48 AM UTC 2026

% Result   : Theorem 11.77s 3.71s
% Output   : CNFRefutation 11.77s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  13 unt;   0 nHn;  16 RR)
%            Number of literals    :   38 (   0 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    6 (   5 usr;   5 prp; 0-1 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   21 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_51,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_51) ).

cnf(i_0_28,plain,
    modus_ponens,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_28) ).

cnf(i_0_39,plain,
    ( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
    | ~ implies_2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_39) ).

cnf(i_0_26,plain,
    implies_2,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_26) ).

cnf(i_0_6,plain,
    ( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
    | ~ and_3 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_6) ).

cnf(i_0_21,plain,
    and_3,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_21) ).

cnf(i_0_42,plain,
    ( kn1
    | ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_42) ).

cnf(i_0_75,negated_conjecture,
    ~ kn1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-1k88k1s7/lgb.p',i_0_75) ).

cnf(c_0_84,plain,
    ( is_a_theorem(X1)
    | ~ modus_ponens
    | ~ is_a_theorem(X2)
    | ~ is_a_theorem(implies(X2,X1)) ),
    i_0_51 ).

cnf(c_0_85,plain,
    modus_ponens,
    i_0_28 ).

cnf(c_0_86,plain,
    ( is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2)))
    | ~ implies_2 ),
    i_0_39 ).

cnf(c_0_87,plain,
    implies_2,
    i_0_26 ).

cnf(c_0_88,plain,
    ( is_a_theorem(X1)
    | ~ is_a_theorem(implies(X2,X1))
    | ~ is_a_theorem(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_84,c_0_85])]) ).

cnf(c_0_89,plain,
    is_a_theorem(implies(implies(X1,implies(X1,X2)),implies(X1,X2))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_86,c_0_87])]) ).

cnf(c_0_90,plain,
    ( is_a_theorem(implies(X1,implies(X2,and(X1,X2))))
    | ~ and_3 ),
    i_0_6 ).

cnf(c_0_91,plain,
    and_3,
    i_0_21 ).

cnf(c_0_92,plain,
    ( kn1
    | ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))) ),
    i_0_42 ).

cnf(c_0_93,negated_conjecture,
    ~ kn1,
    i_0_75 ).

cnf(c_0_94,plain,
    ( is_a_theorem(implies(X1,X2))
    | ~ is_a_theorem(implies(X1,implies(X1,X2))) ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

cnf(c_0_95,plain,
    is_a_theorem(implies(X1,implies(X2,and(X1,X2)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_90,c_0_91])]) ).

cnf(c_0_96,plain,
    ~ is_a_theorem(implies(esk26_0,and(esk26_0,esk26_0))),
    inference(sr,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_97,plain,
    is_a_theorem(implies(X1,and(X1,X1))),
    inference(spm,[status(thm)],[c_0_94,c_0_95]) ).

cnf(c_0_98,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_96,c_0_97])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL459+1 : TPTP v9.3.1. Bugfixed v9.2.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.36  % Computer : n029.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Fri Sep  4 14:31:11 UTC 2026
% 0.09/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
% 11.77/3.71  # ENIGMATIC: Solved by autoschedule-lgb:
% 11.77/3.71  # No SInE strategy applied
% 11.77/3.71  # Trying AutoSched0 for 150 seconds
% 11.77/3.71  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI
% 11.77/3.71  # and selection function SelectComplexExceptUniqMaxHorn.
% 11.77/3.71  #
% 11.77/3.71  # Preprocessing time       : 0.024 s
% 11.77/3.71  # Presaturation interreduction done
% 11.77/3.71  
% 11.77/3.71  # Proof found!
% 11.77/3.71  # SZS status Theorem
% 11.77/3.71  # SZS output start CNFRefutation
% See solution above
% 11.77/3.71  # Training examples: 0 positive, 0 negative
% 11.77/3.71  
% 11.77/3.71  # -------------------------------------------------
% 11.77/3.71  # User time                : 0.032 s
% 11.77/3.71  # System time              : 0.004 s
% 11.77/3.71  # Total time               : 0.036 s
% 11.77/3.71  # Maximum resident set size: 3584 pages
% 11.77/3.71  
%------------------------------------------------------------------------------