↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n017.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 14 15:32:57 EDT 2022

% Result   : Theorem 7.12s 2.36s
% Output   : CNFRefutation 7.12s
% 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 (   4 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   1 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_526,negated_conjecture,
    op(e5,e5) != e5,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dsucgv3e/lgb.p',i_0_526) ).

cnf(i_0_519,negated_conjecture,
    op(e5,e5) = e5,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-dsucgv3e/lgb.p',i_0_519) ).

cnf(c_0_529,negated_conjecture,
    op(e5,e5) != e5,
    i_0_526 ).

cnf(c_0_530,negated_conjecture,
    op(e5,e5) = e5,
    i_0_519 ).

cnf(c_0_531,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_529,c_0_530])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : ALG198+1 : TPTP v8.1.0. Released v2.7.0.
% 0.04/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jun  8 18:03:05 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.12/2.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.12/2.36  # No SInE strategy applied
% 7.12/2.36  # Trying AutoSched0 for 150 seconds
% 7.12/2.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.12/2.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.12/2.36  #
% 7.12/2.36  # Preprocessing time       : 0.023 s
% 7.12/2.36  # Presaturation interreduction done
% 7.12/2.36  
% 7.12/2.36  # Proof found!
% 7.12/2.36  # SZS status Theorem
% 7.12/2.36  # SZS output start CNFRefutation
% See solution above
% 7.12/2.36  # Training examples: 0 positive, 0 negative
% 7.12/2.36  
% 7.12/2.36  # -------------------------------------------------
% 7.12/2.36  # User time                : 0.021 s
% 7.12/2.36  # System time              : 0.006 s
% 7.12/2.36  # Total time               : 0.027 s
% 7.12/2.36  # Maximum resident set size: 7120 pages
% 7.12/2.36  
%------------------------------------------------------------------------------