TSTP Solution File: RNG102+2 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n018.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 20:24:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_103,negated_conjecture,
    ( sdtasdt0(xc,X1) != xy
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v7tgxhe9/lgb.p',i_0_103) ).

cnf(i_0_96,hypothesis,
    sdtasdt0(xc,esk22_0) = xy,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v7tgxhe9/lgb.p',i_0_96) ).

cnf(i_0_97,hypothesis,
    aElement0(esk22_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-v7tgxhe9/lgb.p',i_0_97) ).

cnf(c_0_107,negated_conjecture,
    ( sdtasdt0(xc,X1) != xy
    | ~ aElement0(X1) ),
    i_0_103 ).

cnf(c_0_108,hypothesis,
    sdtasdt0(xc,esk22_0) = xy,
    i_0_96 ).

cnf(c_0_109,negated_conjecture,
    ( sdtasdt0(xc,X1) != sdtasdt0(xc,esk22_0)
    | ~ aElement0(X1) ),
    inference(rw,[status(thm)],[c_0_107,c_0_108]) ).

cnf(c_0_110,hypothesis,
    aElement0(esk22_0),
    i_0_97 ).

cnf(c_0_111,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_109,c_0_110]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : RNG102+2 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n018.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Mon May 30 16:14:13 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.20/0.44  # ENIGMATIC: Selected complete mode:
% 7.71/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.71/2.30  # No SInE strategy applied
% 7.71/2.30  # Trying AutoSched0 for 150 seconds
% 7.71/2.30  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0YI
% 7.71/2.30  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.71/2.30  #
% 7.71/2.30  # Preprocessing time       : 0.023 s
% 7.71/2.30  # Presaturation interreduction done
% 7.71/2.30  
% 7.71/2.30  # Proof found!
% 7.71/2.30  # SZS status Theorem
% 7.71/2.30  # SZS output start CNFRefutation
% See solution above
% 7.71/2.30  # Training examples: 0 positive, 0 negative
% 7.71/2.30  
% 7.71/2.30  # -------------------------------------------------
% 7.71/2.30  # User time                : 0.024 s
% 7.71/2.30  # System time              : 0.007 s
% 7.71/2.30  # Total time               : 0.031 s
% 7.71/2.30  # Maximum resident set size: 7128 pages
% 7.71/2.30  
%------------------------------------------------------------------------------