↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : RNG089+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 20:24:57 EDT 2022

% Result   : Theorem 7.42s 2.36s
% Output   : CNFRefutation 7.42s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   16 (  12 unt;   0 nHn;  16 RR)
%            Number of literals    :   24 (   0 equ;  11 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_68,negated_conjecture,
    ( ~ aElementOf0(sdtasdt0(xz,xk),xI)
    | ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_68) ).

cnf(i_0_52,plain,
    ( aElementOf0(sdtasdt0(X1,X2),X3)
    | ~ aElement0(X1)
    | ~ aIdeal0(X3)
    | ~ aElementOf0(X2,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_52) ).

cnf(i_0_55,hypothesis,
    aIdeal0(xJ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_55) ).

cnf(i_0_57,hypothesis,
    aElement0(xz),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_57) ).

cnf(i_0_61,hypothesis,
    aElementOf0(xl,xJ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_61) ).

cnf(i_0_56,hypothesis,
    aIdeal0(xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_56) ).

cnf(i_0_62,hypothesis,
    aElementOf0(xk,xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-gh_aruye/lgb.p',i_0_62) ).

cnf(c_0_76,negated_conjecture,
    ( ~ aElementOf0(sdtasdt0(xz,xk),xI)
    | ~ aElementOf0(sdtasdt0(xz,xl),xJ) ),
    i_0_68 ).

cnf(c_0_77,plain,
    ( aElementOf0(sdtasdt0(X1,X2),X3)
    | ~ aElement0(X1)
    | ~ aIdeal0(X3)
    | ~ aElementOf0(X2,X3) ),
    i_0_52 ).

cnf(c_0_78,hypothesis,
    aIdeal0(xJ),
    i_0_55 ).

cnf(c_0_79,hypothesis,
    aElement0(xz),
    i_0_57 ).

cnf(c_0_80,hypothesis,
    aElementOf0(xl,xJ),
    i_0_61 ).

cnf(c_0_81,negated_conjecture,
    ~ aElementOf0(sdtasdt0(xz,xk),xI),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_78]),c_0_79]),c_0_80])]) ).

cnf(c_0_82,hypothesis,
    aIdeal0(xI),
    i_0_56 ).

cnf(c_0_83,hypothesis,
    aElementOf0(xk,xI),
    i_0_62 ).

cnf(c_0_84,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_77]),c_0_82]),c_0_79]),c_0_83])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG089+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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 : Mon May 30 18:06:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.42/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.36  # No SInE strategy applied
% 7.42/2.36  # Trying AutoSched0 for 150 seconds
% 7.42/2.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.42/2.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.42/2.36  #
% 7.42/2.36  # Preprocessing time       : 0.012 s
% 7.42/2.36  # Presaturation interreduction done
% 7.42/2.36  
% 7.42/2.36  # Proof found!
% 7.42/2.36  # SZS status Theorem
% 7.42/2.36  # SZS output start CNFRefutation
% See solution above
% 7.42/2.36  # Training examples: 0 positive, 0 negative
% 7.42/2.36  
% 7.42/2.36  # -------------------------------------------------
% 7.42/2.36  # User time                : 0.014 s
% 7.42/2.36  # System time              : 0.003 s
% 7.42/2.36  # Total time               : 0.017 s
% 7.42/2.36  # Maximum resident set size: 7124 pages
% 7.42/2.36  
%------------------------------------------------------------------------------