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

View Problem - Process Solution

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

% Computer : n026.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:35:51 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_30,plain,
    ( X1 = sz00
    | aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
    | ~ aInteger0(X1)
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_30) ).

cnf(i_0_36,hypothesis,
    sdteqdtlpzmzozddtrp0(xa,xb,xq),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_36) ).

cnf(i_0_34,hypothesis,
    aInteger0(xb),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_34) ).

cnf(i_0_35,hypothesis,
    aInteger0(xa),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_35) ).

cnf(i_0_33,hypothesis,
    aInteger0(xq),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_33) ).

cnf(i_0_32,hypothesis,
    sz00 != xq,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_32) ).

cnf(i_0_25,plain,
    ( sdtasdt0(X1,esk1_2(X2,X1)) = X2
    | ~ aInteger0(X2)
    | ~ aDivisorOf0(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_25) ).

cnf(i_0_26,plain,
    ( aInteger0(esk1_2(X1,X2))
    | ~ aInteger0(X1)
    | ~ aDivisorOf0(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_26) ).

cnf(i_0_5,plain,
    ( aInteger0(sdtpldt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_5) ).

cnf(i_0_4,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_4) ).

cnf(i_0_37,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-k80ak0hz/input.p',i_0_37) ).

cnf(c_0_49,plain,
    ( X1 = sz00
    | aDivisorOf0(X1,sdtpldt0(X2,smndt0(X3)))
    | ~ aInteger0(X1)
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ sdteqdtlpzmzozddtrp0(X2,X3,X1) ),
    i_0_30 ).

cnf(c_0_50,hypothesis,
    sdteqdtlpzmzozddtrp0(xa,xb,xq),
    i_0_36 ).

cnf(c_0_51,hypothesis,
    aInteger0(xb),
    i_0_34 ).

cnf(c_0_52,hypothesis,
    aInteger0(xa),
    i_0_35 ).

cnf(c_0_53,hypothesis,
    aInteger0(xq),
    i_0_33 ).

cnf(c_0_54,hypothesis,
    sz00 != xq,
    i_0_32 ).

cnf(c_0_55,plain,
    ( sdtasdt0(X1,esk1_2(X2,X1)) = X2
    | ~ aInteger0(X2)
    | ~ aDivisorOf0(X1,X2) ),
    i_0_25 ).

cnf(c_0_56,hypothesis,
    aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_51]),c_0_52]),c_0_53])]),c_0_54]) ).

cnf(c_0_57,plain,
    ( aInteger0(esk1_2(X1,X2))
    | ~ aInteger0(X1)
    | ~ aDivisorOf0(X2,X1) ),
    i_0_26 ).

cnf(c_0_58,plain,
    ( sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_59,plain,
    ( aInteger0(sdtpldt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    i_0_5 ).

cnf(c_0_60,plain,
    ( aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
    inference(spm,[status(thm)],[c_0_57,c_0_56]) ).

cnf(c_0_61,plain,
    ( sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(smndt0(xb)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_52])]) ).

cnf(c_0_62,plain,
    ( aInteger0(smndt0(X1))
    | ~ aInteger0(X1) ),
    i_0_4 ).

cnf(c_0_63,plain,
    ( aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq))
    | ~ aInteger0(smndt0(xb)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_59]),c_0_52])]) ).

cnf(c_0_64,negated_conjecture,
    ( sdtasdt0(xq,X1) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X1) ),
    i_0_37 ).

cnf(c_0_65,plain,
    sdtasdt0(xq,esk1_2(sdtpldt0(xa,smndt0(xb)),xq)) = sdtpldt0(xa,smndt0(xb)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_51])]) ).

cnf(c_0_66,plain,
    aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),xq)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_63,c_0_62]),c_0_51])]) ).

cnf(c_0_67,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM425+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 : Wed Jul  6 20:47:55 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 8.61/2.50  # ENIGMATIC: Solved by autoschedule:
% 8.61/2.50  # No SInE strategy applied
% 8.61/2.50  # Trying AutoSched0 for 150 seconds
% 8.61/2.50  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.61/2.50  # and selection function SelectNewComplexAHP.
% 8.61/2.50  #
% 8.61/2.50  # Preprocessing time       : 0.023 s
% 8.61/2.50  # Presaturation interreduction done
% 8.61/2.50  
% 8.61/2.50  # Proof found!
% 8.61/2.50  # SZS status Theorem
% 8.61/2.50  # SZS output start CNFRefutation
% See solution above
% 8.61/2.50  # Training examples: 0 positive, 0 negative
% 8.61/2.50  
% 8.61/2.50  # -------------------------------------------------
% 8.61/2.50  # User time                : 0.031 s
% 8.61/2.50  # System time              : 0.005 s
% 8.61/2.50  # Total time               : 0.036 s
% 8.61/2.50  # Maximum resident set size: 7120 pages
% 8.61/2.50  
%------------------------------------------------------------------------------