↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n027.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:48:16 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_18,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_18) ).

cnf(i_0_1,plain,
    r1(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_1) ).

cnf(i_0_3,negated_conjecture,
    p100(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_3) ).

cnf(i_0_4,negated_conjecture,
    ~ p101(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_4) ).

cnf(i_0_17,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_17) ).

cnf(i_0_19,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p251ngoz/lgb.p',i_0_19) ).

cnf(c_0_26,negated_conjecture,
    ( p101(X1)
    | r1(X1,esk2_1(X1))
    | ~ p100(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_18 ).

cnf(c_0_27,plain,
    r1(X1,X1),
    i_0_1 ).

cnf(c_0_28,negated_conjecture,
    p100(esk1_0),
    i_0_3 ).

cnf(c_0_29,negated_conjecture,
    ~ p101(esk1_0),
    i_0_4 ).

cnf(c_0_30,negated_conjecture,
    ( p101(X1)
    | ~ p100(X1)
    | ~ p2(esk2_1(X1))
    | ~ r1(esk1_0,X1) ),
    i_0_17 ).

cnf(c_0_31,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_19 ).

cnf(c_0_32,plain,
    r1(esk1_0,esk2_1(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_28])]),c_0_29]) ).

cnf(c_0_33,plain,
    ~ p2(esk2_1(esk1_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_27]),c_0_28])]),c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL674+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.37  % Computer : n027.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep  5 02:07:59 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.21/0.47  # ENIGMATIC: Selected complete mode:
% 13.26/3.96  # ENIGMATIC: Solved by autoschedule-lgb:
% 13.26/3.96  # No SInE strategy applied
% 13.26/3.96  # Trying AutoSched0 for 150 seconds
% 13.26/3.96  # AutoSched0-Mode selected heuristic G_E___107_C12_11_nc_F1_PI_AE_Q4_CS_SP_PS_S071I
% 13.26/3.96  # and selection function SelectCQArEqLast.
% 13.26/3.96  #
% 13.26/3.96  # Preprocessing time       : 0.024 s
% 13.26/3.96  # Presaturation interreduction done
% 13.26/3.96  
% 13.26/3.96  # Proof found!
% 13.26/3.96  # SZS status Theorem
% 13.26/3.96  # SZS output start CNFRefutation
% See solution above
% 13.26/3.96  # Training examples: 0 positive, 0 negative
% 13.26/3.96  
% 13.26/3.96  # -------------------------------------------------
% 13.26/3.96  # User time                : 0.024 s
% 13.26/3.96  # System time              : 0.006 s
% 13.26/3.96  # Total time               : 0.029 s
% 13.26/3.96  # Maximum resident set size: 3328 pages
% 13.26/3.96  
%------------------------------------------------------------------------------