↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LCL662+1.001 : 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:47:42 AM UTC 2026

% Result   : Theorem 15.81s 4.37s
% Output   : CNFRefutation 15.81s
% 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_1,negated_conjecture,
    ~ p1(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iowa91df/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    p1(esk1_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iowa91df/lgb.p',i_0_2) ).

cnf(c_0_5,negated_conjecture,
    ~ p1(esk1_0),
    i_0_1 ).

cnf(c_0_6,negated_conjecture,
    p1(esk1_0),
    i_0_2 ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL662+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.36  % Computer : n019.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Sat Sep  5 15:02:10 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.22/0.46  # ENIGMATIC: Selected complete mode:
% 15.81/4.37  # ENIGMATIC: Solved by autoschedule-lgb:
% 15.81/4.37  # No SInE strategy applied
% 15.81/4.37  # Trying AutoSched0 for 150 seconds
% 15.81/4.37  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 15.81/4.37  # and selection function PSelectComplexExceptRRHorn.
% 15.81/4.37  #
% 15.81/4.37  # Preprocessing time       : 0.012 s
% 15.81/4.37  
% 15.81/4.37  # Proof found!
% 15.81/4.37  # SZS status Theorem
% 15.81/4.37  # SZS output start CNFRefutation
% See solution above
% 15.81/4.37  # Training examples: 0 positive, 0 negative
% 15.81/4.37  
% 15.81/4.37  # -------------------------------------------------
% 15.81/4.37  # User time                : 0.011 s
% 15.81/4.37  # System time              : 0.003 s
% 15.81/4.37  # Total time               : 0.014 s
% 15.81/4.37  # Maximum resident set size: 3328 pages
% 15.81/4.37  
%------------------------------------------------------------------------------