↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n005.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:26 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,negated_conjecture,
    ( b(X1)
    | ~ a(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cs7jef4o/input.p',i_0_3) ).

cnf(i_0_1,negated_conjecture,
    ~ b(X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cs7jef4o/input.p',i_0_1) ).

cnf(i_0_2,negated_conjecture,
    a(esk1_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cs7jef4o/input.p',i_0_2) ).

cnf(c_0_7,negated_conjecture,
    ( b(X1)
    | ~ a(X1) ),
    i_0_3 ).

cnf(c_0_8,negated_conjecture,
    ~ b(X1),
    i_0_1 ).

cnf(c_0_9,negated_conjecture,
    a(esk1_0),
    i_0_2 ).

cnf(c_0_10,negated_conjecture,
    ~ a(X1),
    inference(sr,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN955+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n005.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 03:11:53 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.42/2.34  # ENIGMATIC: Solved by autoschedule:
% 7.42/2.34  # No SInE strategy applied
% 7.42/2.34  # Trying AutoSched0 for 150 seconds
% 7.42/2.34  # AutoSched0-Mode selected heuristic G_E___200_C45_F1_SE_CS_SP_PI_CO_S0V
% 7.42/2.34  # and selection function PSelectComplexExceptRRHorn.
% 7.42/2.34  #
% 7.42/2.34  # Preprocessing time       : 0.013 s
% 7.42/2.34  
% 7.42/2.34  # Proof found!
% 7.42/2.34  # SZS status Theorem
% 7.42/2.34  # SZS output start CNFRefutation
% See solution above
% 7.42/2.34  # Training examples: 0 positive, 0 negative
% 7.42/2.34  
% 7.42/2.34  # -------------------------------------------------
% 7.42/2.34  # User time                : 0.014 s
% 7.42/2.34  # System time              : 0.003 s
% 7.42/2.34  # Total time               : 0.017 s
% 7.42/2.34  # Maximum resident set size: 7116 pages
% 7.42/2.34  
%------------------------------------------------------------------------------