↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n019.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 8.90s 2.55s
% Output   : CNFRefutation 8.90s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   22 (  15 unt;   0 def)
%            Number of atoms       :   44 (  12 equ)
%            Maximal formula atoms :    6 (   2 avg)
%            Number of connectives :   51 (  29   ~;  20   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   3 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   9 con; 0-2 aty)
%            Number of variables   :   16 (   0 sgn   4   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_87,negated_conjecture,
    ( sdtpldt0(X1,X2) != sdtpldt0(xx,xy)
    | sdtpldt0(X3,X4) != sdtasdt0(xz,xx)
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X4,xJ)
    | ~ aElementOf0(X3,xI) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_87) ).

cnf(i_0_83,hypothesis,
    sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)) = sdtasdt0(xz,xx),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_83) ).

cnf(i_0_81,hypothesis,
    aElementOf0(sdtasdt0(xz,xk),xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_81) ).

cnf(i_0_80,hypothesis,
    aElementOf0(sdtasdt0(xz,xl),xJ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_80) ).

cnf(i_0_82,hypothesis,
    sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) = sdtpldt0(xx,xy),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_82) ).

cnf(i_0_79,hypothesis,
    aElementOf0(sdtpldt0(xk,xm),xI),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_79) ).

cnf(i_0_78,hypothesis,
    aElementOf0(sdtpldt0(xl,xn),xJ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-z13h3p00/lgb.p',i_0_78) ).

fof(c_0_95,plain,
    ( ~ epred1_0
  <=> ! [X3,X4] :
        ( ~ aElementOf0(X3,xI)
        | ~ aElementOf0(X4,xJ)
        | sdtpldt0(X3,X4) != sdtasdt0(xz,xx) ) ),
    introduced(definition) ).

fof(c_0_96,plain,
    ( ~ epred2_0
  <=> ! [X1,X2] :
        ( ~ aElementOf0(X1,xI)
        | ~ aElementOf0(X2,xJ)
        | sdtpldt0(X1,X2) != sdtpldt0(xx,xy) ) ),
    introduced(definition) ).

cnf(c_0_97,negated_conjecture,
    ( sdtpldt0(X1,X2) != sdtpldt0(xx,xy)
    | sdtpldt0(X3,X4) != sdtasdt0(xz,xx)
    | ~ aElementOf0(X2,xJ)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X4,xJ)
    | ~ aElementOf0(X3,xI) ),
    i_0_87 ).

cnf(c_0_98,negated_conjecture,
    ( epred1_0
    | sdtpldt0(X1,X2) != sdtasdt0(xz,xx)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xJ) ),
    inference(split_equiv,[status(thm)],[c_0_95]) ).

cnf(c_0_99,hypothesis,
    sdtpldt0(sdtasdt0(xz,xk),sdtasdt0(xz,xl)) = sdtasdt0(xz,xx),
    i_0_83 ).

cnf(c_0_100,hypothesis,
    aElementOf0(sdtasdt0(xz,xk),xI),
    i_0_81 ).

cnf(c_0_101,hypothesis,
    aElementOf0(sdtasdt0(xz,xl),xJ),
    i_0_80 ).

cnf(c_0_102,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_97,c_0_95]),c_0_96]) ).

cnf(c_0_103,hypothesis,
    epred1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_100]),c_0_101])]) ).

cnf(c_0_104,negated_conjecture,
    ~ epred2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_103])]) ).

cnf(c_0_105,negated_conjecture,
    ( sdtpldt0(X1,X2) != sdtpldt0(xx,xy)
    | ~ aElementOf0(X1,xI)
    | ~ aElementOf0(X2,xJ) ),
    inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_96]),c_0_104]) ).

cnf(c_0_106,hypothesis,
    sdtpldt0(sdtpldt0(xk,xm),sdtpldt0(xl,xn)) = sdtpldt0(xx,xy),
    i_0_82 ).

cnf(c_0_107,hypothesis,
    aElementOf0(sdtpldt0(xk,xm),xI),
    i_0_79 ).

cnf(c_0_108,hypothesis,
    aElementOf0(sdtpldt0(xl,xn),xJ),
    i_0_78 ).

cnf(c_0_109,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_106]),c_0_107]),c_0_108])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : RNG091+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Mon May 30 05:59:42 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 8.90/2.55  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.90/2.55  # No SInE strategy applied
% 8.90/2.55  # Trying AutoSched0 for 150 seconds
% 8.90/2.55  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4d
% 8.90/2.55  # and selection function SelectCQIPrecWNTNp.
% 8.90/2.55  #
% 8.90/2.55  # Preprocessing time       : 0.023 s
% 8.90/2.55  
% 8.90/2.55  # Proof found!
% 8.90/2.55  # SZS status Theorem
% 8.90/2.55  # SZS output start CNFRefutation
% See solution above
% 8.90/2.55  # Training examples: 0 positive, 0 negative
% 8.90/2.55  
% 8.90/2.55  # -------------------------------------------------
% 8.90/2.55  # User time                : 0.026 s
% 8.90/2.55  # System time              : 0.003 s
% 8.90/2.55  # Total time               : 0.030 s
% 8.90/2.55  # Maximum resident set size: 7124 pages
% 8.90/2.55  
%------------------------------------------------------------------------------