↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM433+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n028.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 7.73s 2.31s
% Output   : CNFRefutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   31 (  19 unt;   3 nHn;  31 RR)
%            Number of literals    :   61 (  18 equ;  35 neg)
%            Maximal clause size   :    6 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   6 con; 0-2 aty)
%            Number of variables   :   22 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
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-alsti8xu/lgb.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-alsti8xu/lgb.p',i_0_6) ).

cnf(i_0_51,negated_conjecture,
    sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-alsti8xu/lgb.p',i_0_51) ).

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

cnf(i_0_52,negated_conjecture,
    aInteger0(esk2_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-alsti8xu/lgb.p',i_0_52) ).

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

cnf(i_0_37,hypothesis,
    aInteger0(xp),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-alsti8xu/lgb.p',i_0_37) ).

cnf(i_0_36,hypothesis,
    sz00 != xp,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-alsti8xu/lgb.p',i_0_36) ).

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

cnf(i_0_44,negated_conjecture,
    ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
    | ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-alsti8xu/lgb.p',i_0_44) ).

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

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

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

cnf(c_0_66,negated_conjecture,
    sdtasdt0(sdtasdt0(xp,xq),esk2_0) = sdtpldt0(xa,smndt0(xb)),
    i_0_51 ).

cnf(c_0_67,plain,
    ( sdtasdt0(sdtasdt0(X1,X2),X3) = sdtasdt0(X1,sdtasdt0(X2,X3))
    | ~ aInteger0(X3)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    i_0_13 ).

cnf(c_0_68,negated_conjecture,
    aInteger0(esk2_0),
    i_0_52 ).

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

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

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

cnf(c_0_72,negated_conjecture,
    sdtasdt0(xp,sdtasdt0(xq,esk2_0)) = sdtpldt0(xa,smndt0(xb)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_69]),c_0_70])]) ).

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

cnf(c_0_74,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aInteger0(X2)
    | ~ aInteger0(X1) ),
    i_0_14 ).

cnf(c_0_75,plain,
    ( aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
    | ~ aInteger0(sdtasdt0(xq,esk2_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_70])]),c_0_73]) ).

cnf(c_0_76,negated_conjecture,
    sdtasdt0(sdtasdt0(xq,xp),esk2_0) = sdtpldt0(xa,smndt0(xb)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_74]),c_0_70]),c_0_69])]) ).

cnf(c_0_77,negated_conjecture,
    ( ~ aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb)))
    | ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))) ),
    i_0_44 ).

cnf(c_0_78,plain,
    aDivisorOf0(xp,sdtpldt0(xa,smndt0(xb))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_65]),c_0_68]),c_0_69])]) ).

cnf(c_0_79,plain,
    sdtasdt0(xq,sdtasdt0(xp,esk2_0)) = sdtpldt0(xa,smndt0(xb)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_76]),c_0_68]),c_0_70]),c_0_69])]) ).

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

cnf(c_0_81,negated_conjecture,
    ~ aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_77,c_0_78])]) ).

cnf(c_0_82,plain,
    ~ aInteger0(sdtasdt0(xp,esk2_0)),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_79]),c_0_69])]),c_0_80]),c_0_81]) ).

cnf(c_0_83,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_65]),c_0_68]),c_0_70])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM433+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.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 11:00:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.73/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.73/2.31  # No SInE strategy applied
% 7.73/2.31  # Trying AutoSched0 for 150 seconds
% 7.73/2.31  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.73/2.31  # and selection function SelectNewComplexAHP.
% 7.73/2.31  #
% 7.73/2.31  # Preprocessing time       : 0.024 s
% 7.73/2.31  # Presaturation interreduction done
% 7.73/2.31  
% 7.73/2.31  # Proof found!
% 7.73/2.31  # SZS status Theorem
% 7.73/2.31  # SZS output start CNFRefutation
% See solution above
% 7.73/2.31  # Training examples: 0 positive, 0 negative
% 7.73/2.31  
% 7.73/2.31  # -------------------------------------------------
% 7.73/2.31  # User time                : 0.032 s
% 7.73/2.31  # System time              : 0.007 s
% 7.73/2.31  # Total time               : 0.038 s
% 7.73/2.31  # Maximum resident set size: 7128 pages
% 7.73/2.31  
%------------------------------------------------------------------------------