↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : CSR025+1 : TPTP v8.1.0. Released v3.4.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 : Fri Jul 15 02:46:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9q22rj4/input.p',i_0_4) ).

cnf(i_0_54,negated_conjecture,
    ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-p9q22rj4/input.p',i_0_54) ).

cnf(c_0_57,plain,
    genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    i_0_4 ).

cnf(c_0_58,negated_conjecture,
    ~ genls(c_tptpcol_16_130933,c_tptpcol_15_130931),
    i_0_54 ).

cnf(c_0_59,plain,
    $false,
    inference(sr,[status(thm)],[c_0_57,c_0_58]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : CSR025+1 : TPTP v8.1.0. Released v3.4.0.
% 0.00/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.32  % Computer : n028.cluster.edu
% 0.12/0.32  % Model    : x86_64 x86_64
% 0.12/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32  % Memory   : 8042.1875MB
% 0.12/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32  % CPULimit : 300
% 0.12/0.32  % WCLimit  : 600
% 0.12/0.32  % DateTime : Sat Jun 11 01:43:51 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 6.87/2.33  # ENIGMATIC: Solved by autoschedule:
% 6.87/2.33  # No SInE strategy applied
% 6.87/2.33  # Trying AutoSched0 for 150 seconds
% 6.87/2.33  # AutoSched0-Mode selected heuristic G_E___006_C18_F1_PI_AE_Q4_CS_SP_S2S
% 6.87/2.33  # and selection function SelectNewComplexAHP.
% 6.87/2.33  #
% 6.87/2.33  # Preprocessing time       : 0.014 s
% 6.87/2.33  
% 6.87/2.33  # Proof found!
% 6.87/2.33  # SZS status Theorem
% 6.87/2.33  # SZS output start CNFRefutation
% See solution above
% 6.87/2.33  # Training examples: 0 positive, 0 negative
% 6.87/2.33  
% 6.87/2.33  # -------------------------------------------------
% 6.87/2.33  # User time                : 0.015 s
% 6.87/2.33  # System time              : 0.003 s
% 6.87/2.33  # Total time               : 0.019 s
% 6.87/2.33  # Maximum resident set size: 7124 pages
% 6.87/2.33  
%------------------------------------------------------------------------------