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

% Computer : n021.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.50s 2.37s
% Output   : CNFRefutation 7.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   31 (  18 unt;   0 nHn;  31 RR)
%            Number of literals    :   68 (  13 equ;  41 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   17 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_35,plain,
    ( X1 = X2
    | ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_35) ).

cnf(i_0_102,hypothesis,
    sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_102) ).

cnf(i_0_97,hypothesis,
    sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_97) ).

cnf(i_0_13,plain,
    ( aScalar0(sdtasdt0(X1,X2))
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_13) ).

cnf(i_0_43,plain,
    ( X1 = X2
    | sdtasdt0(X1,X1) != sdtasdt0(X2,X2)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(sz0z00,X2)
    | ~ sdtlseqdt0(sz0z00,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_43) ).

cnf(i_0_101,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_101) ).

cnf(i_0_100,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_100) ).

cnf(i_0_103,negated_conjecture,
    sdtpldt0(xP,xP) != sdtpldt0(xR,xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_103) ).

cnf(i_0_12,plain,
    ( aScalar0(sdtpldt0(X1,X2))
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_12) ).

cnf(i_0_89,hypothesis,
    aScalar0(xP),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_89) ).

cnf(i_0_91,hypothesis,
    aScalar0(xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_91) ).

cnf(i_0_87,hypothesis,
    aScalar0(xR),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-uz2vsn38/input.p',i_0_87) ).

cnf(c_0_116,plain,
    ( X1 = X2
    | ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2) ),
    i_0_35 ).

cnf(c_0_117,hypothesis,
    sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    i_0_102 ).

cnf(c_0_118,hypothesis,
    sdtlseqdt0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)),sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))),
    i_0_97 ).

cnf(c_0_119,hypothesis,
    ( sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)) = sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))
    | ~ aScalar0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))
    | ~ aScalar0(sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_117]),c_0_118])]) ).

cnf(c_0_120,plain,
    ( aScalar0(sdtasdt0(X1,X2))
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    i_0_13 ).

cnf(c_0_121,plain,
    ( X1 = X2
    | sdtasdt0(X1,X1) != sdtasdt0(X2,X2)
    | ~ aScalar0(X2)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(sz0z00,X2)
    | ~ sdtlseqdt0(sz0z00,X1) ),
    i_0_43 ).

cnf(c_0_122,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
    i_0_101 ).

cnf(c_0_123,plain,
    ( sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)) = sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))
    | ~ aScalar0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)))
    | ~ aScalar0(sdtpldt0(xP,xP)) ),
    inference(spm,[status(thm)],[c_0_119,c_0_120]) ).

cnf(c_0_124,hypothesis,
    ( X1 = sdtpldt0(xR,xS)
    | sdtasdt0(X1,X1) != sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))
    | ~ sdtlseqdt0(sz0z00,X1)
    | ~ aScalar0(sdtpldt0(xR,xS))
    | ~ aScalar0(X1) ),
    inference(spm,[status(thm)],[c_0_121,c_0_122]) ).

cnf(c_0_125,plain,
    ( sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP)) = sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS))
    | ~ aScalar0(sdtpldt0(xP,xP))
    | ~ aScalar0(sdtpldt0(xR,xS)) ),
    inference(spm,[status(thm)],[c_0_123,c_0_120]) ).

cnf(c_0_126,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xP,xP)),
    i_0_100 ).

cnf(c_0_127,negated_conjecture,
    sdtpldt0(xP,xP) != sdtpldt0(xR,xS),
    i_0_103 ).

cnf(c_0_128,plain,
    ( ~ aScalar0(sdtpldt0(xR,xS))
    | ~ aScalar0(sdtpldt0(xP,xP)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126])]),c_0_127]) ).

cnf(c_0_129,plain,
    ( aScalar0(sdtpldt0(X1,X2))
    | ~ aScalar0(X2)
    | ~ aScalar0(X1) ),
    i_0_12 ).

cnf(c_0_130,hypothesis,
    aScalar0(xP),
    i_0_89 ).

cnf(c_0_131,plain,
    ~ aScalar0(sdtpldt0(xR,xS)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_128,c_0_129]),c_0_130])]) ).

cnf(c_0_132,hypothesis,
    aScalar0(xS),
    i_0_91 ).

cnf(c_0_133,hypothesis,
    aScalar0(xR),
    i_0_87 ).

cnf(c_0_134,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_129]),c_0_132]),c_0_133])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11  % Problem  : RNG073+2 : TPTP v8.1.0. Released v4.0.0.
% 0.09/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n021.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.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Mon May 30 17:05:16 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 7.50/2.37  # ENIGMATIC: Solved by autoschedule:
% 7.50/2.37  # No SInE strategy applied
% 7.50/2.37  # Trying AutoSched0 for 150 seconds
% 7.50/2.37  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.50/2.37  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.50/2.37  #
% 7.50/2.37  # Preprocessing time       : 0.025 s
% 7.50/2.37  
% 7.50/2.37  # Proof found!
% 7.50/2.37  # SZS status Theorem
% 7.50/2.37  # SZS output start CNFRefutation
% See solution above
% 7.50/2.37  # Training examples: 0 positive, 0 negative
% 7.50/2.37  
% 7.50/2.37  # -------------------------------------------------
% 7.50/2.37  # User time                : 0.129 s
% 7.50/2.37  # System time              : 0.010 s
% 7.50/2.37  # Total time               : 0.138 s
% 7.50/2.37  # Maximum resident set size: 7116 pages
% 7.50/2.37  
%------------------------------------------------------------------------------