↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n005.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:47:46 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,negated_conjecture,
    ( p12(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_aleczy/lgb.p',i_0_12) ).

cnf(i_0_5,negated_conjecture,
    r1(esk1_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_aleczy/lgb.p',i_0_5) ).

cnf(i_0_4,negated_conjecture,
    ~ p12(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-g_aleczy/lgb.p',i_0_4) ).

cnf(c_0_16,negated_conjecture,
    ( p12(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_12 ).

cnf(c_0_17,negated_conjecture,
    r1(esk1_0,esk4_0),
    i_0_5 ).

cnf(c_0_18,negated_conjecture,
    ~ p12(esk4_0),
    i_0_4 ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL664+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.35  % Computer : n005.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep  6 01:40:07 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.13/0.45  # ENIGMATIC: Selected complete mode:
% 11.70/3.53  # ENIGMATIC: Solved by autoschedule-lgb:
% 11.70/3.53  # No SInE strategy applied
% 11.70/3.53  # Trying AutoSched0 for 150 seconds
% 11.70/3.53  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 11.70/3.53  # and selection function SelectCQPrecWNTNp.
% 11.70/3.53  #
% 11.70/3.53  # Preprocessing time       : 0.023 s
% 11.70/3.53  
% 11.70/3.53  # Proof found!
% 11.70/3.53  # SZS status Theorem
% 11.70/3.53  # SZS output start CNFRefutation
% See solution above
% 11.70/3.53  # Training examples: 0 positive, 0 negative
% 11.70/3.53  
% 11.70/3.53  # -------------------------------------------------
% 11.70/3.53  # User time                : 0.024 s
% 11.70/3.53  # System time              : 0.003 s
% 11.70/3.53  # Total time               : 0.027 s
% 11.70/3.53  # Maximum resident set size: 3328 pages
% 11.70/3.53  
%------------------------------------------------------------------------------