↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n011.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:01 AM UTC 2026

% Result   : Theorem 11.51s 3.26s
% Output   : CNFRefutation 11.51s
% 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_3,negated_conjecture,
    ~ p2(esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl804knf/input.p',i_0_3) ).

cnf(i_0_9,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl804knf/input.p',i_0_9) ).

cnf(i_0_4,negated_conjecture,
    r1(esk1_0,esk4_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-hl804knf/input.p',i_0_4) ).

cnf(c_0_13,negated_conjecture,
    ~ p2(esk4_0),
    i_0_3 ).

cnf(c_0_14,negated_conjecture,
    ( p2(X1)
    | ~ r1(esk1_0,X1) ),
    i_0_9 ).

cnf(c_0_15,negated_conjecture,
    r1(esk1_0,esk4_0),
    i_0_4 ).

cnf(c_0_16,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : LCL646+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  % Command  : enigmatic-eprover.py %s %d 1
% 0.08/0.34  % Computer : n011.cluster.edu
% 0.08/0.34  % Model    : x86_64 x86_64
% 0.08/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34  % Memory   : 8046.5625MB
% 0.08/0.34  % OS       : Linux 6.8.0-71-generic
% 0.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep  5 11:40:45 UTC 2026
% 0.08/0.34  % CPUTime  : 
% 0.13/0.44  # ENIGMATIC: Selected complete mode:
% 11.51/3.26  # ENIGMATIC: Solved by autoschedule:
% 11.51/3.26  # No SInE strategy applied
% 11.51/3.26  # Trying AutoSched0 for 150 seconds
% 11.51/3.26  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 11.51/3.26  # and selection function SelectMaxLComplexAvoidPosPred.
% 11.51/3.26  #
% 11.51/3.26  # Preprocessing time       : 0.023 s
% 11.51/3.26  
% 11.51/3.26  # Proof found!
% 11.51/3.26  # SZS status Theorem
% 11.51/3.26  # SZS output start CNFRefutation
% See solution above
% 11.51/3.26  # Training examples: 0 positive, 0 negative
% 11.51/3.26  
% 11.51/3.26  # -------------------------------------------------
% 11.51/3.26  # User time                : 0.023 s
% 11.51/3.26  # System time              : 0.004 s
% 11.51/3.26  # Total time               : 0.027 s
% 11.51/3.26  # Maximum resident set size: 3328 pages
% 11.51/3.26  
%------------------------------------------------------------------------------