↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n014.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:49:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_2,negated_conjecture,
    f(f(esk1_0)) != f(g(esk2_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mqbcmnd/lgb.p',i_0_2) ).

cnf(i_0_1,plain,
    g(X1) = f(X2),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-8mqbcmnd/lgb.p',i_0_1) ).

cnf(c_0_5,negated_conjecture,
    f(f(esk1_0)) != f(g(esk2_0)),
    i_0_2 ).

cnf(c_0_6,plain,
    g(X1) = f(X2),
    i_0_1 ).

cnf(c_0_7,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_5,c_0_6]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : SYN080+1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 18:38:51 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.48/2.56  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.48/2.56  # No SInE strategy applied
% 8.48/2.56  # Trying AutoSched0 for 150 seconds
% 8.48/2.56  # AutoSched0-Mode selected heuristic G_____Y1145__C12_02_nc_F1_AE_CS_SP_S2S
% 8.48/2.56  # and selection function SelectNewComplexAHP.
% 8.48/2.56  #
% 8.48/2.56  # Preprocessing time       : 0.013 s
% 8.48/2.56  # Presaturation interreduction done
% 8.48/2.56  
% 8.48/2.56  # Proof found!
% 8.48/2.56  # SZS status Theorem
% 8.48/2.56  # SZS output start CNFRefutation
% See solution above
% 8.48/2.56  # Training examples: 0 positive, 0 negative
% 8.48/2.56  
% 8.48/2.56  # -------------------------------------------------
% 8.48/2.56  # User time                : 0.013 s
% 8.48/2.56  # System time              : 0.006 s
% 8.48/2.56  # Total time               : 0.020 s
% 8.48/2.56  # Maximum resident set size: 7124 pages
% 8.48/2.56  
%------------------------------------------------------------------------------