↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n001.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:44:17 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( p
    | q ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrprqoy4/lgb.p',i_0_1) ).

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

cnf(i_0_3,negated_conjecture,
    ~ q,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-mrprqoy4/lgb.p',i_0_3) ).

cnf(c_0_8,negated_conjecture,
    ( p
    | q ),
    i_0_1 ).

cnf(c_0_9,negated_conjecture,
    ~ p,
    i_0_4 ).

cnf(c_0_10,negated_conjecture,
    ~ q,
    i_0_3 ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL181+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04  % Command  : enigmatic-eprover.py %s %d 1
% 0.08/0.35  % Computer : n001.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 : Fri Sep  4 23:27:02 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.14/0.45  # ENIGMATIC: Selected complete mode:
% 12.41/3.87  # ENIGMATIC: Solved by autoschedule-lgb:
% 12.41/3.87  # No SInE strategy applied
% 12.41/3.87  # Trying AutoSched0 for 150 seconds
% 12.41/3.87  # AutoSched0-Mode selected heuristic G_E___200_B07_F1_AE_CS_SP_PI_S0Y
% 12.41/3.87  # and selection function SelectMaxLComplexAvoidPosPred.
% 12.41/3.87  #
% 12.41/3.87  # Preprocessing time       : 0.023 s
% 12.41/3.87  
% 12.41/3.87  # Proof found!
% 12.41/3.87  # SZS status Theorem
% 12.41/3.87  # SZS output start CNFRefutation
% See solution above
% 12.41/3.87  # Training examples: 0 positive, 0 negative
% 12.41/3.87  
% 12.41/3.87  # -------------------------------------------------
% 12.41/3.87  # User time                : 0.019 s
% 12.41/3.87  # System time              : 0.007 s
% 12.41/3.87  # Total time               : 0.026 s
% 12.41/3.87  # Maximum resident set size: 3328 pages
% 12.41/3.87  
%------------------------------------------------------------------------------