↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n025.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 20:25:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_147,hypothesis,
    ( aElementOf0(sdtasdt0(X1,X2),xI)
    | ~ aElement0(X1)
    | ~ aElementOf0(X2,xI) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_147) ).

cnf(i_0_13,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_13) ).

cnf(i_0_105,hypothesis,
    ( sdtasdt0(X1,esk23_1(X1)) = xc
    | sdtasdt0(X1,X2) != xb
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,xa) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_105) ).

cnf(i_0_182,hypothesis,
    sdtasdt0(xu,esk40_0) = xb,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_182) ).

cnf(i_0_184,hypothesis,
    aDivisorOf0(xu,xa),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_184) ).

cnf(i_0_183,hypothesis,
    aElement0(esk40_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_183) ).

cnf(i_0_106,hypothesis,
    ( aElement0(esk23_1(X1))
    | sdtasdt0(X1,X2) != xb
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,xa) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_106) ).

cnf(i_0_77,plain,
    ( aElement0(X1)
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_77) ).

cnf(i_0_180,hypothesis,
    aDivisorOf0(xu,xb),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_180) ).

cnf(i_0_94,hypothesis,
    aElement0(xb),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_94) ).

cnf(i_0_190,negated_conjecture,
    ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_190) ).

cnf(i_0_135,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_135) ).

cnf(i_0_176,hypothesis,
    aElementOf0(xu,xI),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q3o6ui7k/input.p',i_0_176) ).

cnf(c_0_204,hypothesis,
    ( aElementOf0(sdtasdt0(X1,X2),xI)
    | ~ aElement0(X1)
    | ~ aElementOf0(X2,xI) ),
    i_0_147 ).

cnf(c_0_205,plain,
    ( sdtasdt0(X1,X2) = sdtasdt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    i_0_13 ).

cnf(c_0_206,hypothesis,
    ( sdtasdt0(X1,esk23_1(X1)) = xc
    | sdtasdt0(X1,X2) != xb
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,xa) ),
    i_0_105 ).

cnf(c_0_207,hypothesis,
    sdtasdt0(xu,esk40_0) = xb,
    i_0_182 ).

cnf(c_0_208,hypothesis,
    aDivisorOf0(xu,xa),
    i_0_184 ).

cnf(c_0_209,hypothesis,
    aElement0(esk40_0),
    i_0_183 ).

cnf(c_0_210,hypothesis,
    ( aElement0(esk23_1(X1))
    | sdtasdt0(X1,X2) != xb
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,xa) ),
    i_0_106 ).

cnf(c_0_211,plain,
    ( aElement0(X1)
    | ~ aElement0(X2)
    | ~ aDivisorOf0(X1,X2) ),
    i_0_77 ).

cnf(c_0_212,hypothesis,
    aDivisorOf0(xu,xb),
    i_0_180 ).

cnf(c_0_213,hypothesis,
    aElement0(xb),
    i_0_94 ).

cnf(c_0_214,negated_conjecture,
    ~ aElementOf0(xc,sdtpldt1(slsdtgt0(xa),slsdtgt0(xb))),
    i_0_190 ).

cnf(c_0_215,hypothesis,
    sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) = xI,
    i_0_135 ).

cnf(c_0_216,hypothesis,
    ( aElementOf0(sdtasdt0(X1,X2),xI)
    | ~ aElementOf0(X1,xI)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(spm,[status(thm)],[c_0_204,c_0_205]) ).

cnf(c_0_217,hypothesis,
    sdtasdt0(xu,esk23_1(xu)) = xc,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_206,c_0_207]),c_0_208]),c_0_209])]) ).

cnf(c_0_218,hypothesis,
    aElementOf0(xu,xI),
    i_0_176 ).

cnf(c_0_219,hypothesis,
    aElement0(esk23_1(xu)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_210,c_0_207]),c_0_208]),c_0_209])]) ).

cnf(c_0_220,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_211,c_0_212]),c_0_213])]) ).

cnf(c_0_221,negated_conjecture,
    ~ aElementOf0(xc,xI),
    inference(rw,[status(thm)],[c_0_214,c_0_215]) ).

cnf(c_0_222,hypothesis,
    $false,
    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_216,c_0_217]),c_0_218]),c_0_219]),c_0_220])]),c_0_221]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : RNG126+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % 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 : Mon May 30 09:06:58 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 7.28/2.39  # ENIGMATIC: Solved by autoschedule:
% 7.28/2.39  # No SInE strategy applied
% 7.28/2.39  # Trying AutoSched0 for 150 seconds
% 7.28/2.39  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S0Y
% 7.28/2.39  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.28/2.39  #
% 7.28/2.39  # Preprocessing time       : 0.029 s
% 7.28/2.39  # Presaturation interreduction done
% 7.28/2.39  
% 7.28/2.39  # Proof found!
% 7.28/2.39  # SZS status Theorem
% 7.28/2.39  # SZS output start CNFRefutation
% See solution above
% 7.28/2.39  # Training examples: 0 positive, 0 negative
% 7.28/2.39  
% 7.28/2.39  # -------------------------------------------------
% 7.28/2.39  # User time                : 0.110 s
% 7.28/2.39  # System time              : 0.010 s
% 7.28/2.39  # Total time               : 0.120 s
% 7.28/2.39  # Maximum resident set size: 7120 pages
% 7.28/2.39  
%------------------------------------------------------------------------------