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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM434+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 08:35:57 EDT 2022

% Result   : Theorem 8.71s 2.51s
% Output   : CNFRefutation 8.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   40 (  16 unt;  12 nHn;  40 RR)
%            Number of literals    :   91 (  28 equ;  45 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    5 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   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-8gg0z36b/input.p',i_0_30) ).

cnf(i_0_40,hypothesis,
    sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gg0z36b/input.p',i_0_40) ).

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

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

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

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

cnf(i_0_37,hypothesis,
    aInteger0(xp),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gg0z36b/input.p',i_0_37) ).

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-8gg0z36b/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-8gg0z36b/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-8gg0z36b/input.p',i_0_5) ).

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

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

cnf(i_0_23,plain,
    ( X1 = sz00
    | X2 = sz00
    | sdtasdt0(X2,X1) != sz00
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gg0z36b/input.p',i_0_23) ).

cnf(i_0_36,hypothesis,
    sz00 != xp,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8gg0z36b/input.p',i_0_36) ).

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

cnf(c_0_57,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_58,hypothesis,
    sdteqdtlpzmzozddtrp0(xa,xb,sdtasdt0(xp,xq)),
    i_0_40 ).

cnf(c_0_59,hypothesis,
    aInteger0(xb),
    i_0_38 ).

cnf(c_0_60,hypothesis,
    aInteger0(xa),
    i_0_39 ).

cnf(c_0_61,hypothesis,
    ( sdtasdt0(xp,xq) = sz00
    | aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb)))
    | ~ aInteger0(sdtasdt0(xp,xq)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60])]) ).

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

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

cnf(c_0_64,hypothesis,
    aInteger0(xp),
    i_0_37 ).

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

cnf(c_0_66,plain,
    ( sdtasdt0(xp,xq) = sz00
    | aDivisorOf0(sdtasdt0(xp,xq),sdtpldt0(xa,smndt0(xb))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63]),c_0_64])]) ).

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

cnf(c_0_68,plain,
    ( sdtasdt0(sdtasdt0(xp,xq),esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) = sdtpldt0(xa,smndt0(xb))
    | sdtasdt0(xp,xq) = sz00
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

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

cnf(c_0_70,plain,
    ( sdtasdt0(xp,xq) = sz00
    | aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq)))
    | ~ aInteger0(sdtpldt0(xa,smndt0(xb))) ),
    inference(spm,[status(thm)],[c_0_67,c_0_66]) ).

cnf(c_0_71,plain,
    ( sdtasdt0(sdtasdt0(xp,xq),esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) = sdtpldt0(xa,smndt0(xb))
    | sdtasdt0(xp,xq) = sz00
    | ~ aInteger0(smndt0(xb)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_68,c_0_69]),c_0_60])]) ).

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

cnf(c_0_73,plain,
    ( sdtasdt0(xp,xq) = sz00
    | aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq)))
    | ~ aInteger0(smndt0(xb)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_69]),c_0_60])]) ).

cnf(c_0_74,negated_conjecture,
    ( sdtasdt0(sdtasdt0(xp,xq),X1) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(X1) ),
    i_0_41 ).

cnf(c_0_75,plain,
    ( sdtasdt0(sdtasdt0(xp,xq),esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) = sdtpldt0(xa,smndt0(xb))
    | sdtasdt0(xp,xq) = sz00 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_59])]) ).

cnf(c_0_76,plain,
    ( sdtasdt0(xp,xq) = sz00
    | aInteger0(esk1_2(sdtpldt0(xa,smndt0(xb)),sdtasdt0(xp,xq))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_72]),c_0_59])]) ).

cnf(c_0_77,plain,
    ( X1 = sz00
    | X2 = sz00
    | sdtasdt0(X2,X1) != sz00
    | ~ aInteger0(X1)
    | ~ aInteger0(X2) ),
    i_0_23 ).

cnf(c_0_78,negated_conjecture,
    sdtasdt0(xp,xq) = sz00,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_76]) ).

cnf(c_0_79,hypothesis,
    sz00 != xp,
    i_0_36 ).

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

cnf(c_0_81,plain,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_78]),c_0_64]),c_0_63])]),c_0_79]),c_0_80]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : NUM434+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jul  6 08:09:01 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.71/2.51  # ENIGMATIC: Solved by autoschedule:
% 8.71/2.51  # No SInE strategy applied
% 8.71/2.51  # Trying AutoSched0 for 150 seconds
% 8.71/2.51  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.71/2.51  # and selection function SelectNewComplexAHP.
% 8.71/2.51  #
% 8.71/2.51  # Preprocessing time       : 0.020 s
% 8.71/2.51  # Presaturation interreduction done
% 8.71/2.51  
% 8.71/2.51  # Proof found!
% 8.71/2.51  # SZS status Theorem
% 8.71/2.51  # SZS output start CNFRefutation
% See solution above
% 8.71/2.51  # Training examples: 0 positive, 0 negative
% 8.71/2.51  
% 8.71/2.51  # -------------------------------------------------
% 8.71/2.51  # User time                : 0.027 s
% 8.71/2.51  # System time              : 0.007 s
% 8.71/2.51  # Total time               : 0.035 s
% 8.71/2.51  # Maximum resident set size: 7120 pages
% 8.71/2.51  
%------------------------------------------------------------------------------