↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SYN926+1 : TPTP v8.1.0. Released v3.1.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 : Thu Jul 21 04:58:06 EDT 2022

% Result   : Theorem 7.58s 2.27s
% Output   : CNFRefutation 7.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   14 (   8 unt;   0 def)
%            Number of atoms       :   20 (   0 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   19 (  13   ~;   4   |;   0   &)
%                                         (   2 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   3 prp; 0-1 aty)
%            Number of functors    :    1 (   1 usr;   1 con; 0-0 aty)
%            Number of variables   :    8 (   6 sgn   2   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vkgz6rgx/lgb.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    q(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vkgz6rgx/lgb.p',i_0_2) ).

cnf(i_0_3,negated_conjecture,
    p(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-vkgz6rgx/lgb.p',i_0_3) ).

fof(c_0_7,plain,
    ( ~ epred1_0
  <=> ! [X2] : ~ q(X2) ),
    introduced(definition) ).

fof(c_0_8,plain,
    ( ~ epred2_0
  <=> ! [X1] : ~ p(X1) ),
    introduced(definition) ).

cnf(c_0_9,negated_conjecture,
    ( ~ p(X1)
    | ~ q(X2) ),
    i_0_1 ).

cnf(c_0_10,negated_conjecture,
    ( epred1_0
    | ~ q(X1) ),
    inference(split_equiv,[status(thm)],[c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    q(esk1_0),
    i_0_2 ).

cnf(c_0_12,negated_conjecture,
    ( ~ epred2_0
    | ~ epred1_0 ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_9,c_0_7]),c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    epred1_0,
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    ~ epred2_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_15,negated_conjecture,
    p(esk1_0),
    i_0_3 ).

cnf(c_0_16,negated_conjecture,
    ~ p(X1),
    inference(sr,[status(thm)],[inference(split_equiv,[status(thm)],[c_0_8]),c_0_14]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_15,c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SYN926+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/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 : Tue Jul 12 00:02:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.58/2.27  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.58/2.27  # No SInE strategy applied
% 7.58/2.27  # Trying AutoSched0 for 150 seconds
% 7.58/2.27  # AutoSched0-Mode selected heuristic G_N___023_B07_F1_SP_PI_Q7_CS_SE_S0Y
% 7.58/2.27  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.58/2.27  #
% 7.58/2.27  # Preprocessing time       : 0.022 s
% 7.58/2.27  
% 7.58/2.27  # Proof found!
% 7.58/2.27  # SZS status Theorem
% 7.58/2.27  # SZS output start CNFRefutation
% See solution above
% 7.58/2.27  # Training examples: 0 positive, 0 negative
% 7.58/2.27  
% 7.58/2.27  # -------------------------------------------------
% 7.58/2.27  # User time                : 0.022 s
% 7.58/2.27  # System time              : 0.006 s
% 7.58/2.27  # Total time               : 0.029 s
% 7.58/2.27  # Maximum resident set size: 7124 pages
% 7.58/2.27  
%------------------------------------------------------------------------------