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

View Problem - Process Solution

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

% Computer : n022.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:25:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_101,negated_conjecture,
    sdtasdt0(xc,sdtpldt0(xu,xv)) != sdtpldt0(xx,xy),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_101) ).

cnf(i_0_97,hypothesis,
    sdtasdt0(xc,xu) = xx,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_97) ).

cnf(i_0_99,hypothesis,
    sdtasdt0(xc,xv) = xy,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_99) ).

cnf(i_0_18,plain,
    ( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_18) ).

cnf(i_0_100,hypothesis,
    aElement0(xv),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_100) ).

cnf(i_0_98,hypothesis,
    aElement0(xu),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_98) ).

cnf(i_0_93,hypothesis,
    aElement0(xc),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dpi5ubun/lgb.p',i_0_93) ).

cnf(c_0_109,negated_conjecture,
    sdtasdt0(xc,sdtpldt0(xu,xv)) != sdtpldt0(xx,xy),
    i_0_101 ).

cnf(c_0_110,hypothesis,
    sdtasdt0(xc,xu) = xx,
    i_0_97 ).

cnf(c_0_111,hypothesis,
    sdtasdt0(xc,xv) = xy,
    i_0_99 ).

cnf(c_0_112,negated_conjecture,
    sdtpldt0(sdtasdt0(xc,xu),sdtasdt0(xc,xv)) != sdtasdt0(xc,sdtpldt0(xu,xv)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_109,c_0_110]),c_0_111]) ).

cnf(c_0_113,plain,
    ( sdtpldt0(sdtasdt0(X1,X2),sdtasdt0(X1,X3)) = sdtasdt0(X1,sdtpldt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_18 ).

cnf(c_0_114,hypothesis,
    aElement0(xv),
    i_0_100 ).

cnf(c_0_115,hypothesis,
    aElement0(xu),
    i_0_98 ).

cnf(c_0_116,hypothesis,
    aElement0(xc),
    i_0_93 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : RNG103+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 : n022.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 18:37:24 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.93/2.51  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.93/2.51  # No SInE strategy applied
% 4.93/2.51  # Trying AutoSched0 for 150 seconds
% 4.93/2.51  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S0Y
% 4.93/2.51  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.93/2.51  #
% 4.93/2.51  # Preprocessing time       : 0.024 s
% 4.93/2.51  # Presaturation interreduction done
% 4.93/2.51  
% 4.93/2.51  # Proof found!
% 4.93/2.51  # SZS status Theorem
% 4.93/2.51  # SZS output start CNFRefutation
% See solution above
% 4.93/2.51  # Training examples: 0 positive, 0 negative
% 4.93/2.51  
% 4.93/2.51  # -------------------------------------------------
% 4.93/2.51  # User time                : 0.030 s
% 4.93/2.51  # System time              : 0.006 s
% 4.93/2.51  # Total time               : 0.036 s
% 4.93/2.51  # Maximum resident set size: 7124 pages
% 4.93/2.51  
%------------------------------------------------------------------------------