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

View Problem - Process Solution

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

% Computer : n004.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:07 EDT 2022

% Result   : Theorem 9.44s 3.42s
% Output   : CNFRefutation 9.44s
% 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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4289,hypothesis,
    sdtlpdtrp0(xc,xQ) = sdtlpdtrp0(xd,xn),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7cp44a8f/lgb.p',i_0_4289) ).

cnf(i_0_4286,hypothesis,
    sdtlpdtrp0(xd,xn) = szDzizrdt0(xd),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7cp44a8f/lgb.p',i_0_4286) ).

cnf(i_0_4290,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != szDzizrdt0(xd),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-7cp44a8f/lgb.p',i_0_4290) ).

cnf(c_0_4294,hypothesis,
    sdtlpdtrp0(xc,xQ) = sdtlpdtrp0(xd,xn),
    i_0_4289 ).

cnf(c_0_4295,hypothesis,
    sdtlpdtrp0(xd,xn) = szDzizrdt0(xd),
    i_0_4286 ).

cnf(c_0_4296,negated_conjecture,
    sdtlpdtrp0(xc,xQ) != szDzizrdt0(xd),
    i_0_4290 ).

cnf(c_0_4297,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_4294,c_0_4295]),c_0_4296]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM632+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 : n004.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 : Tue Jul  5 19:19:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 9.44/3.42  # ENIGMATIC: Solved by autoschedule-lgb:
% 9.44/3.42  # No SInE strategy applied
% 9.44/3.42  # Trying AutoSched0 for 150 seconds
% 9.44/3.42  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 9.44/3.42  # and selection function SelectMaxLComplexAvoidPosPred.
% 9.44/3.42  #
% 9.44/3.42  # Preprocessing time       : 0.025 s
% 9.44/3.42  
% 9.44/3.42  # Proof found!
% 9.44/3.42  # SZS status Theorem
% 9.44/3.42  # SZS output start CNFRefutation
% See solution above
% 9.44/3.42  # Training examples: 0 positive, 0 negative
% 9.44/3.42  
% 9.44/3.42  # -------------------------------------------------
% 9.44/3.42  # User time                : 0.025 s
% 9.44/3.42  # System time              : 0.008 s
% 9.44/3.42  # Total time               : 0.033 s
% 9.44/3.42  # Maximum resident set size: 7120 pages
% 9.44/3.42  
%------------------------------------------------------------------------------