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

View Problem - Process Solution

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

% Computer : n011.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:56 EDT 2022

% Result   : Theorem 6.62s 2.34s
% Output   : CNFRefutation 6.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   28 (  18 unt;   6 nHn;  28 RR)
%            Number of literals    :   62 (  12 equ;  33 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

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

cnf(i_0_44,hypothesis,
    sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_44) ).

cnf(i_0_33,hypothesis,
    aInteger0(xc),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_33) ).

cnf(i_0_37,hypothesis,
    aInteger0(xa),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_37) ).

cnf(i_0_24,plain,
    ( X1 = sz00
    | aDivisorOf0(X1,X2)
    | sdtasdt0(X1,X3) != X2
    | ~ aInteger0(X2)
    | ~ aInteger0(X3)
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_24) ).

cnf(i_0_6,plain,
    ( aInteger0(sdtasdt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_6) ).

cnf(i_0_35,hypothesis,
    aInteger0(xq),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_35) ).

cnf(i_0_34,hypothesis,
    sz00 != xq,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_34) ).

cnf(i_0_45,negated_conjecture,
    ~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_45) ).

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

cnf(i_0_43,hypothesis,
    aInteger0(xm),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_43) ).

cnf(i_0_41,hypothesis,
    aInteger0(xn),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-rurze8rr/input.p',i_0_41) ).

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

cnf(c_0_59,hypothesis,
    sdtasdt0(xq,sdtpldt0(xn,xm)) = sdtpldt0(xa,smndt0(xc)),
    i_0_44 ).

cnf(c_0_60,hypothesis,
    aInteger0(xc),
    i_0_33 ).

cnf(c_0_61,hypothesis,
    aInteger0(xa),
    i_0_37 ).

cnf(c_0_62,plain,
    ( X1 = sz00
    | aDivisorOf0(X1,X2)
    | sdtasdt0(X1,X3) != X2
    | ~ aInteger0(X2)
    | ~ aInteger0(X3)
    | ~ aInteger0(X1) ),
    i_0_24 ).

cnf(c_0_63,plain,
    ( aInteger0(sdtasdt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    i_0_6 ).

cnf(c_0_64,hypothesis,
    ( X1 = sz00
    | sdteqdtlpzmzozddtrp0(xa,xc,X1)
    | ~ aDivisorOf0(X1,sdtasdt0(xq,sdtpldt0(xn,xm)))
    | ~ aInteger0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61])]) ).

cnf(c_0_65,plain,
    ( X1 = sz00
    | aDivisorOf0(X1,sdtasdt0(X1,X2))
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_62]),c_0_63]) ).

cnf(c_0_66,hypothesis,
    aInteger0(xq),
    i_0_35 ).

cnf(c_0_67,hypothesis,
    sz00 != xq,
    i_0_34 ).

cnf(c_0_68,negated_conjecture,
    ~ sdteqdtlpzmzozddtrp0(xa,xc,xq),
    i_0_45 ).

cnf(c_0_69,plain,
    ~ aInteger0(sdtpldt0(xn,xm)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_66])]),c_0_67]),c_0_68]) ).

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

cnf(c_0_71,hypothesis,
    aInteger0(xm),
    i_0_43 ).

cnf(c_0_72,hypothesis,
    aInteger0(xn),
    i_0_41 ).

cnf(c_0_73,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM432+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 : n011.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 : Thu Jul  7 22:07:41 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 6.62/2.34  # ENIGMATIC: Solved by autoschedule:
% 6.62/2.34  # No SInE strategy applied
% 6.62/2.34  # Trying AutoSched0 for 150 seconds
% 6.62/2.34  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 6.62/2.34  # and selection function SelectNewComplexAHP.
% 6.62/2.34  #
% 6.62/2.34  # Preprocessing time       : 0.022 s
% 6.62/2.34  # Presaturation interreduction done
% 6.62/2.34  
% 6.62/2.34  # Proof found!
% 6.62/2.34  # SZS status Theorem
% 6.62/2.34  # SZS output start CNFRefutation
% See solution above
% 6.62/2.34  # Training examples: 0 positive, 0 negative
% 6.62/2.34  
% 6.62/2.34  # -------------------------------------------------
% 6.62/2.34  # User time                : 0.034 s
% 6.62/2.34  # System time              : 0.008 s
% 6.62/2.34  # Total time               : 0.042 s
% 6.62/2.34  # Maximum resident set size: 7124 pages
% 6.62/2.34  
%------------------------------------------------------------------------------