↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n019.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:22 AM UTC 2026

% Result   : Theorem 7.73s 3.96s
% Output   : CNFRefutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (   7 unt;   2 nHn;  18 RR)
%            Number of literals    :   45 (   0 equ;  28 neg)
%            Maximal clause size   :    4 (   2 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   :   18 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( epred1_1(X1)
    | ~ r1(esk4_0,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_3) ).

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

cnf(i_0_125,plain,
    ( r1(X1,esk64_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_125) ).

cnf(i_0_9,plain,
    ( ~ epred1_1(X1)
    | ~ p1(esk64_1(X1))
    | ~ p2(esk64_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_9) ).

cnf(i_0_129,plain,
    ( p1(X1)
    | ~ p2(X1)
    | ~ epred1_1(X2)
    | ~ r1(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_129) ).

cnf(i_0_128,plain,
    ( p2(X1)
    | ~ p1(X1)
    | ~ epred1_1(X2)
    | ~ r1(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_128) ).

cnf(i_0_10,plain,
    ( p1(esk64_1(X1))
    | p2(esk64_1(X1))
    | ~ epred1_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2a2hapnr/input.p',i_0_10) ).

cnf(c_0_137,negated_conjecture,
    ( epred1_1(X1)
    | ~ r1(esk4_0,X1) ),
    i_0_3 ).

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

cnf(c_0_139,plain,
    ( r1(X1,esk64_1(X1))
    | ~ epred1_1(X1) ),
    i_0_125 ).

cnf(c_0_140,plain,
    epred1_1(esk4_0),
    inference(spm,[status(thm)],[c_0_137,c_0_138]) ).

cnf(c_0_141,plain,
    ( ~ epred1_1(X1)
    | ~ p1(esk64_1(X1))
    | ~ p2(esk64_1(X1)) ),
    i_0_9 ).

cnf(c_0_142,plain,
    ( p1(X1)
    | ~ p2(X1)
    | ~ epred1_1(X2)
    | ~ r1(X2,X1) ),
    i_0_129 ).

cnf(c_0_143,plain,
    r1(esk4_0,esk64_1(esk4_0)),
    inference(spm,[status(thm)],[c_0_139,c_0_140]) ).

cnf(c_0_144,plain,
    ( ~ p2(esk64_1(esk4_0))
    | ~ p1(esk64_1(esk4_0)) ),
    inference(spm,[status(thm)],[c_0_141,c_0_140]) ).

cnf(c_0_145,plain,
    ( p2(X1)
    | ~ p1(X1)
    | ~ epred1_1(X2)
    | ~ r1(X2,X1) ),
    i_0_128 ).

cnf(c_0_146,plain,
    ~ p2(esk64_1(esk4_0)),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_142,c_0_143]),c_0_140])]),c_0_144]) ).

cnf(c_0_147,plain,
    ( p1(esk64_1(X1))
    | p2(esk64_1(X1))
    | ~ epred1_1(X1) ),
    i_0_10 ).

cnf(c_0_148,plain,
    ~ p1(esk64_1(esk4_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_145,c_0_143]),c_0_140])]),c_0_146]) ).

cnf(c_0_149,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_147,c_0_140]),c_0_146]),c_0_148]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL686+1.020 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.08/0.35  % Computer : n019.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep  6 00:32:10 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.13/0.46  # ENIGMATIC: Selected complete mode:
% 7.73/3.96  # ENIGMATIC: Solved by autoschedule:
% 7.73/3.96  # No SInE strategy applied
% 7.73/3.96  # Trying AutoSched0 for 150 seconds
% 7.73/3.96  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S085I
% 7.73/3.96  # and selection function SelectCQArNp.
% 7.73/3.96  #
% 7.73/3.96  # Preprocessing time       : 0.029 s
% 7.73/3.96  # Presaturation interreduction done
% 7.73/3.96  
% 7.73/3.96  # Proof found!
% 7.73/3.96  # SZS status Theorem
% 7.73/3.96  # SZS output start CNFRefutation
% See solution above
% 7.73/3.96  # Training examples: 0 positive, 0 negative
% 7.73/3.96  
% 7.73/3.96  # -------------------------------------------------
% 7.73/3.96  # User time                : 0.050 s
% 7.73/3.96  # System time              : 0.007 s
% 7.73/3.96  # Total time               : 0.057 s
% 7.73/3.96  # Maximum resident set size: 3840 pages
% 7.73/3.96  
%------------------------------------------------------------------------------