↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n032.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:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_221,negated_conjecture,
    op(e3,op(e3,e3)) = e3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9kz5jqkt/input.p',i_0_221) ).

cnf(i_0_212,plain,
    op(e3,e3) = e2,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9kz5jqkt/input.p',i_0_212) ).

cnf(i_0_211,plain,
    op(e3,op(e3,e3)) = e4,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9kz5jqkt/input.p',i_0_211) ).

cnf(i_0_201,plain,
    e4 != e3,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-9kz5jqkt/input.p',i_0_201) ).

cnf(c_0_226,negated_conjecture,
    op(e3,op(e3,e3)) = e3,
    i_0_221 ).

cnf(c_0_227,plain,
    op(e3,e3) = e2,
    i_0_212 ).

cnf(c_0_228,plain,
    op(e3,op(e3,e3)) = e4,
    i_0_211 ).

cnf(c_0_229,negated_conjecture,
    op(e3,e2) = e3,
    inference(rw,[status(thm)],[c_0_226,c_0_227]) ).

cnf(c_0_230,plain,
    e4 != e3,
    i_0_201 ).

cnf(c_0_231,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_228,c_0_227]),c_0_229]),c_0_230]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09  % Problem  : ALG173+1 : TPTP v8.1.0. Released v2.7.0.
% 0.05/0.10  % Command  : enigmatic-eprover.py %s %d 1
% 0.10/0.29  % Computer : n032.cluster.edu
% 0.10/0.29  % Model    : x86_64 x86_64
% 0.10/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29  % Memory   : 8042.1875MB
% 0.10/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29  % CPULimit : 300
% 0.10/0.29  % WCLimit  : 600
% 0.10/0.29  % DateTime : Wed Jun  8 06:45:23 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.14/0.36  # ENIGMATIC: Selected complete mode:
% 6.23/2.02  # ENIGMATIC: Solved by autoschedule:
% 6.23/2.02  # No SInE strategy applied
% 6.23/2.02  # Trying AutoSched0 for 150 seconds
% 6.23/2.02  # AutoSched0-Mode selected heuristic H_____102_C18_F1_PI_AE_Q4_CS_SP_S1S
% 6.23/2.02  # and selection function SelectComplexAHP.
% 6.23/2.02  #
% 6.23/2.02  # Preprocessing time       : 0.014 s
% 6.23/2.02  
% 6.23/2.02  # Proof found!
% 6.23/2.02  # SZS status Theorem
% 6.23/2.02  # SZS output start CNFRefutation
% See solution above
% 6.23/2.02  # Training examples: 0 positive, 0 negative
% 6.23/2.02  
% 6.23/2.02  # -------------------------------------------------
% 6.23/2.02  # User time                : 0.017 s
% 6.23/2.02  # System time              : 0.003 s
% 6.23/2.02  # Total time               : 0.019 s
% 6.23/2.02  # Maximum resident set size: 7124 pages
% 6.23/2.02  
%------------------------------------------------------------------------------