TSTP Solution File: RNG074+1 by Enigma---0.5.1

View Problem - Process Solution

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

% Computer : n028.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:54 EDT 2022

% Result   : Theorem 7.23s 2.36s
% Output   : CNFRefutation 7.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    3
% Syntax   : Number of clauses     :    8 (   8 unt;   0 nHn;   8 RR)
%            Number of literals    :    8 (   2 equ;   2 neg)
%            Maximal clause size   :    1 (   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   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_95,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9q81ff14/input.p',i_0_95) ).

cnf(i_0_99,hypothesis,
    sdtpldt0(xP,xP) = sdtpldt0(xR,xS),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9q81ff14/input.p',i_0_99) ).

cnf(i_0_94,hypothesis,
    ~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9q81ff14/input.p',i_0_94) ).

cnf(c_0_103,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    i_0_95 ).

cnf(c_0_104,hypothesis,
    sdtpldt0(xP,xP) = sdtpldt0(xR,xS),
    i_0_99 ).

cnf(c_0_105,hypothesis,
    ~ sdtlseqdt0(sdtpldt0(xP,xP),sdtpldt0(xR,xS)),
    i_0_94 ).

cnf(c_0_106,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),
    inference(rw,[status(thm)],[c_0_103,c_0_104]) ).

cnf(c_0_107,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_105,c_0_104]),c_0_106])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : RNG074+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n028.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Mon May 30 11:27:06 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 7.23/2.36  # ENIGMATIC: Solved by autoschedule:
% 7.23/2.36  # No SInE strategy applied
% 7.23/2.36  # Trying AutoSched0 for 150 seconds
% 7.23/2.36  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.23/2.36  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.23/2.36  #
% 7.23/2.36  # Preprocessing time       : 0.013 s
% 7.23/2.36  
% 7.23/2.36  # Proof found!
% 7.23/2.36  # SZS status Theorem
% 7.23/2.36  # SZS output start CNFRefutation
% See solution above
% 7.23/2.36  # Training examples: 0 positive, 0 negative
% 7.23/2.36  
% 7.23/2.36  # -------------------------------------------------
% 7.23/2.36  # User time                : 0.012 s
% 7.23/2.36  # System time              : 0.010 s
% 7.23/2.36  # Total time               : 0.022 s
% 7.23/2.36  # Maximum resident set size: 7124 pages
% 7.23/2.36  
%------------------------------------------------------------------------------