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

View Problem - Process Solution

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

% Computer : n020.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 7.31s 2.34s
% Output   : CNFRefutation 7.31s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   20 (  13 unt;   0 nHn;  20 RR)
%            Number of literals    :   35 (  10 equ;  18 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   15 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ubeh8b8/lgb.p',i_0_14) ).

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

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

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

cnf(i_0_102,negated_conjecture,
    sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ubeh8b8/lgb.p',i_0_102) ).

cnf(i_0_94,hypothesis,
    aElement0(xz),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ubeh8b8/lgb.p',i_0_94) ).

cnf(i_0_6,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ubeh8b8/lgb.p',i_0_6) ).

cnf(i_0_13,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8ubeh8b8/lgb.p',i_0_13) ).

cnf(c_0_111,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aElement0(X3)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_14 ).

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

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

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

cnf(c_0_115,negated_conjecture,
    sdtasdt0(xc,sdtasdt0(xu,xz)) != sdtasdt0(xz,xx),
    i_0_102 ).

cnf(c_0_116,hypothesis,
    ( sdtasdt0(xc,sdtasdt0(xu,X1)) = sdtasdt0(xx,X1)
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_111,c_0_112]),c_0_113]),c_0_114])]) ).

cnf(c_0_117,hypothesis,
    aElement0(xz),
    i_0_94 ).

cnf(c_0_118,plain,
    ( aElement0(sdtasdt0(X1,X2))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_6 ).

cnf(c_0_119,negated_conjecture,
    sdtasdt0(xx,xz) != sdtasdt0(xz,xx),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_115,c_0_116]),c_0_117])]) ).

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

cnf(c_0_121,hypothesis,
    aElement0(xx),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_112]),c_0_113]),c_0_114])]) ).

cnf(c_0_122,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_120]),c_0_117]),c_0_121])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : RNG104+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon May 30 13:45:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.31/2.34  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.31/2.34  # No SInE strategy applied
% 7.31/2.34  # Trying AutoSched0 for 150 seconds
% 7.31/2.34  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.31/2.34  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.31/2.34  #
% 7.31/2.34  # Preprocessing time       : 0.024 s
% 7.31/2.34  
% 7.31/2.34  # Proof found!
% 7.31/2.34  # SZS status Theorem
% 7.31/2.34  # SZS output start CNFRefutation
% See solution above
% 7.31/2.34  # Training examples: 0 positive, 0 negative
% 7.31/2.34  
% 7.31/2.34  # -------------------------------------------------
% 7.31/2.34  # User time                : 0.030 s
% 7.31/2.34  # System time              : 0.005 s
% 7.31/2.34  # Total time               : 0.035 s
% 7.31/2.34  # Maximum resident set size: 7120 pages
% 7.31/2.34  
%------------------------------------------------------------------------------