TSTP Solution File: NUM525+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM525+3 : 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 08:36:58 EDT 2022

% Result   : Theorem 7.78s 2.30s
% Output   : CNFRefutation 7.78s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   27 (  22 unt;   0 nHn;  27 RR)
%            Number of literals    :   38 (  18 equ;  17 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   11 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_99,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,sdtasdt0(xm,xm)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_99) ).

cnf(i_0_85,hypothesis,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_85) ).

cnf(i_0_94,hypothesis,
    sdtasdt0(xp,esk7_0) = sdtasdt0(xn,xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_94) ).

cnf(i_0_11,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_11) ).

cnf(i_0_75,hypothesis,
    aNaturalNumber0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_75) ).

cnf(i_0_95,hypothesis,
    aNaturalNumber0(esk7_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_95) ).

cnf(i_0_12,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_12) ).

cnf(i_0_97,hypothesis,
    sdtasdt0(xp,xq) = xn,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_97) ).

cnf(i_0_98,hypothesis,
    aNaturalNumber0(xq),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_98) ).

cnf(i_0_77,hypothesis,
    aNaturalNumber0(xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-ldpo8m5d/lgb.p',i_0_77) ).

cnf(c_0_110,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xp,sdtasdt0(xm,xm)),
    i_0_99 ).

cnf(c_0_111,hypothesis,
    sdtasdt0(xp,sdtasdt0(xm,xm)) = sdtasdt0(xn,xn),
    i_0_85 ).

cnf(c_0_112,hypothesis,
    sdtasdt0(xp,esk7_0) = sdtasdt0(xn,xn),
    i_0_94 ).

cnf(c_0_113,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_11 ).

cnf(c_0_114,hypothesis,
    aNaturalNumber0(xp),
    i_0_75 ).

cnf(c_0_115,hypothesis,
    aNaturalNumber0(esk7_0),
    i_0_95 ).

cnf(c_0_116,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(xn,xn),
    inference(rw,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_117,hypothesis,
    sdtasdt0(xn,xn) = sdtasdt0(esk7_0,xp),
    inference(cn,[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])]) ).

cnf(c_0_118,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aNaturalNumber0(X3)
    | ~ aNaturalNumber0(X2)
    | ~ aNaturalNumber0(X1) ),
    i_0_12 ).

cnf(c_0_119,hypothesis,
    sdtasdt0(xp,xq) = xn,
    i_0_97 ).

cnf(c_0_120,hypothesis,
    aNaturalNumber0(xq),
    i_0_98 ).

cnf(c_0_121,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xp,sdtasdt0(xq,xq))) != sdtasdt0(esk7_0,xp),
    inference(rw,[status(thm)],[c_0_116,c_0_117]) ).

cnf(c_0_122,hypothesis,
    ( sdtasdt0(xp,sdtasdt0(xq,X1)) = sdtasdt0(xn,X1)
    | ~ aNaturalNumber0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_118,c_0_119]),c_0_120]),c_0_114])]) ).

cnf(c_0_123,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xn,xq)) != sdtasdt0(esk7_0,xp),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_120])]) ).

cnf(c_0_124,hypothesis,
    aNaturalNumber0(xn),
    i_0_77 ).

cnf(c_0_125,plain,
    sdtasdt0(xp,sdtasdt0(xq,xn)) != sdtasdt0(esk7_0,xp),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_113]),c_0_120]),c_0_124])]) ).

cnf(c_0_126,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_125,c_0_122]),c_0_117]),c_0_124])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM525+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n020.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Tue Jul  5 15:50:01 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.78/2.30  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.78/2.30  # No SInE strategy applied
% 7.78/2.30  # Trying AutoSched0 for 150 seconds
% 7.78/2.30  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 7.78/2.30  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.78/2.30  #
% 7.78/2.30  # Preprocessing time       : 0.013 s
% 7.78/2.30  
% 7.78/2.30  # Proof found!
% 7.78/2.30  # SZS status Theorem
% 7.78/2.30  # SZS output start CNFRefutation
% See solution above
% 7.78/2.30  # Training examples: 0 positive, 0 negative
% 7.78/2.30  
% 7.78/2.30  # -------------------------------------------------
% 7.78/2.30  # User time                : 0.023 s
% 7.78/2.30  # System time              : 0.006 s
% 7.78/2.30  # Total time               : 0.029 s
% 7.78/2.30  # Maximum resident set size: 7128 pages
% 7.78/2.30  
%------------------------------------------------------------------------------