TSTP Solution File: NUM625+3 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n029.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 : Mon Jul 18 08:38:03 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4262,hypothesis,
    szmzizndt0(xQ) = xp,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x9s6wmaw/lgb.p',i_0_4262) ).

cnf(i_0_4304,hypothesis,
    xx = xp,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x9s6wmaw/lgb.p',i_0_4304) ).

cnf(i_0_4288,hypothesis,
    szmzizndt0(xQ) != xx,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x9s6wmaw/lgb.p',i_0_4288) ).

cnf(c_0_4308,hypothesis,
    szmzizndt0(xQ) = xp,
    i_0_4262 ).

cnf(c_0_4309,hypothesis,
    xx = xp,
    i_0_4304 ).

cnf(c_0_4310,hypothesis,
    szmzizndt0(xQ) != xx,
    i_0_4288 ).

cnf(c_0_4311,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_4308,c_0_4309]),c_0_4310]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM625+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 Jul  6 23:00:00 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.38/3.11  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.38/3.11  # No SInE strategy applied
% 8.38/3.11  # Trying AutoSched0 for 150 seconds
% 8.38/3.11  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 8.38/3.11  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.38/3.11  #
% 8.38/3.11  # Preprocessing time       : 0.015 s
% 8.38/3.11  
% 8.38/3.11  # Proof found!
% 8.38/3.11  # SZS status Theorem
% 8.38/3.11  # SZS output start CNFRefutation
% See solution above
% 8.38/3.11  # Training examples: 0 positive, 0 negative
% 8.38/3.11  
% 8.38/3.11  # -------------------------------------------------
% 8.38/3.11  # User time                : 0.014 s
% 8.38/3.11  # System time              : 0.007 s
% 8.38/3.11  # Total time               : 0.020 s
% 8.38/3.11  # Maximum resident set size: 7120 pages
% 8.38/3.11  
%------------------------------------------------------------------------------