↑ Up

Enigma---0.5.1.THM-CRf.s

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

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

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_99,negated_conjecture,
    ~ p10(esk24_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iyhrhxe4/lgb.p',i_0_99) ).

cnf(i_0_97,negated_conjecture,
    p10(esk24_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iyhrhxe4/lgb.p',i_0_97) ).

cnf(c_0_102,negated_conjecture,
    ~ p10(esk24_0),
    i_0_99 ).

cnf(c_0_103,negated_conjecture,
    p10(esk24_0),
    i_0_97 ).

cnf(c_0_104,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL644+1.010 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.09/0.38  % Computer : n006.cluster.edu
% 0.09/0.38  % Model    : x86_64 x86_64
% 0.09/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.38  % Memory   : 8046.5625MB
% 0.09/0.38  % OS       : Linux 6.8.0-71-generic
% 0.09/0.38  % CPULimit : 300
% 0.09/0.38  % WCLimit  : 300
% 0.09/0.38  % DateTime : Fri Sep  4 13:06:18 UTC 2026
% 0.09/0.38  % CPUTime  : 
% 0.22/0.48  # ENIGMATIC: Selected complete mode:
% 12.63/3.41  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.63/3.41  # No SInE strategy applied
% 12.63/3.41  # Trying AutoSched0 for 150 seconds
% 12.63/3.41  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 12.63/3.41  # and selection function SelectComplexExceptUniqMaxHorn.
% 12.63/3.41  #
% 12.63/3.41  # Preprocessing time       : 0.043 s
% 12.63/3.41  # Presaturation interreduction done
% 12.63/3.41  
% 12.63/3.41  # Proof found!
% 12.63/3.41  # SZS status Theorem
% 12.63/3.41  # SZS output start CNFRefutation
% See solution above
% 12.63/3.41  # Training examples: 0 positive, 0 negative
% 12.63/3.41  
% 12.63/3.41  # -------------------------------------------------
% 12.63/3.41  # User time                : 0.049 s
% 12.63/3.41  # System time              : 0.008 s
% 12.63/3.41  # Total time               : 0.057 s
% 12.63/3.41  # Maximum resident set size: 3840 pages
% 12.63/3.41  
%------------------------------------------------------------------------------