TSTP Solution File: LAT388+4 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n027.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 600s
% DateTime : Sun Jul 17 04:30:48 EDT 2022

% Result   : Theorem 6.61s 2.11s
% Output   : CNFRefutation 6.61s
% 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-3 aty)
%            Number of functors    :    3 (   3 usr;   3 con; 0-0 aty)
%            Number of variables   :    2 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_95,hypothesis,
    aSupremumOfIn0(xp,xT,xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iv5bk5_d/lgb.p',i_0_95) ).

cnf(i_0_104,negated_conjecture,
    ~ aSupremumOfIn0(X1,xT,xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-iv5bk5_d/lgb.p',i_0_104) ).

cnf(c_0_107,hypothesis,
    aSupremumOfIn0(xp,xT,xS),
    i_0_95 ).

cnf(c_0_108,negated_conjecture,
    ~ aSupremumOfIn0(X1,xT,xS),
    i_0_104 ).

cnf(c_0_109,hypothesis,
    $false,
    inference(sr,[status(thm)],[c_0_107,c_0_108]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : LAT388+4 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jun 29 11:42:22 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 6.61/2.11  # ENIGMATIC: Solved by autoschedule-lgb:
% 6.61/2.11  # No SInE strategy applied
% 6.61/2.11  # Trying AutoSched0 for 150 seconds
% 6.61/2.11  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_AE_CS_SP_PI_S0a
% 6.61/2.11  # and selection function SelectNegativeLiterals.
% 6.61/2.11  #
% 6.61/2.11  # Preprocessing time       : 0.024 s
% 6.61/2.11  
% 6.61/2.11  # Proof found!
% 6.61/2.11  # SZS status Theorem
% 6.61/2.11  # SZS output start CNFRefutation
% See solution above
% 6.61/2.11  # Training examples: 0 positive, 0 negative
% 6.61/2.11  
% 6.61/2.11  # -------------------------------------------------
% 6.61/2.11  # User time                : 0.029 s
% 6.61/2.11  # System time              : 0.001 s
% 6.61/2.11  # Total time               : 0.030 s
% 6.61/2.11  # Maximum resident set size: 7124 pages
% 6.61/2.11  
%------------------------------------------------------------------------------