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

View Problem - Process Solution

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

% Computer : n027.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:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_98,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_98) ).

cnf(i_0_38,plain,
    ( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X3,X4))
    | ~ aScalar0(X4)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(X2,X4)
    | ~ sdtlseqdt0(X1,X3)
    | ~ sdtlseqdt0(sz0z00,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_38) ).

cnf(i_0_97,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_97) ).

cnf(i_0_95,hypothesis,
    sdtlseqdt0(sdtpldt0(xR,xS),sdtpldt0(xP,xP)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_95) ).

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

cnf(i_0_85,hypothesis,
    aScalar0(xP),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_85) ).

cnf(i_0_87,hypothesis,
    aScalar0(xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_87) ).

cnf(i_0_83,hypothesis,
    aScalar0(xR),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mvv57nvf/lgb.p',i_0_83) ).

cnf(c_0_107,negated_conjecture,
    ~ sdtlseqdt0(sdtasdt0(sdtpldt0(xR,xS),sdtpldt0(xR,xS)),sdtasdt0(sdtpldt0(xP,xP),sdtpldt0(xP,xP))),
    i_0_98 ).

cnf(c_0_108,plain,
    ( sdtlseqdt0(sdtasdt0(X1,X2),sdtasdt0(X3,X4))
    | ~ aScalar0(X4)
    | ~ aScalar0(X2)
    | ~ aScalar0(X3)
    | ~ aScalar0(X1)
    | ~ sdtlseqdt0(X2,X4)
    | ~ sdtlseqdt0(X1,X3)
    | ~ sdtlseqdt0(sz0z00,X2) ),
    i_0_38 ).

cnf(c_0_109,hypothesis,
    sdtlseqdt0(sz0z00,sdtpldt0(xR,xS)),
    i_0_97 ).

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

cnf(c_0_111,negated_conjecture,
    ( ~ aScalar0(sdtpldt0(xP,xP))
    | ~ aScalar0(sdtpldt0(xR,xS)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_107,c_0_108]),c_0_109]),c_0_110])]) ).

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

cnf(c_0_113,hypothesis,
    aScalar0(xP),
    i_0_85 ).

cnf(c_0_114,plain,
    ~ aScalar0(sdtpldt0(xR,xS)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113])]) ).

cnf(c_0_115,hypothesis,
    aScalar0(xS),
    i_0_87 ).

cnf(c_0_116,hypothesis,
    aScalar0(xR),
    i_0_83 ).

cnf(c_0_117,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_112]),c_0_115]),c_0_116])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : RNG072+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 : Mon May 30 16:57:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.60/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.35  # No SInE strategy applied
% 7.60/2.35  # Trying AutoSched0 for 150 seconds
% 7.60/2.35  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.60/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.60/2.35  #
% 7.60/2.35  # Preprocessing time       : 0.013 s
% 7.60/2.35  
% 7.60/2.35  # Proof found!
% 7.60/2.35  # SZS status Theorem
% 7.60/2.35  # SZS output start CNFRefutation
% See solution above
% 7.60/2.35  # Training examples: 0 positive, 0 negative
% 7.60/2.35  
% 7.60/2.35  # -------------------------------------------------
% 7.60/2.35  # User time                : 0.019 s
% 7.60/2.35  # System time              : 0.004 s
% 7.60/2.35  # Total time               : 0.023 s
% 7.60/2.35  # Maximum resident set size: 7124 pages
% 7.60/2.35  
%------------------------------------------------------------------------------