↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n011.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 : Mon Jul 18 08:37:29 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4187,negated_conjecture,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_4187) ).

cnf(i_0_4181,hypothesis,
    ( xi = sz00
    | isCountable0(sdtlpdtrp0(xN,xi)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_4181) ).

cnf(i_0_4182,hypothesis,
    ( xi = sz00
    | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_4182) ).

cnf(i_0_4173,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_4173) ).

cnf(i_0_149,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_149) ).

cnf(i_0_148,hypothesis,
    isCountable0(xS),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-e2vzve01/lgb.p',i_0_148) ).

cnf(c_0_4194,negated_conjecture,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    i_0_4187 ).

cnf(c_0_4195,hypothesis,
    ( xi = sz00
    | isCountable0(sdtlpdtrp0(xN,xi)) ),
    i_0_4181 ).

cnf(c_0_4196,hypothesis,
    ( xi = sz00
    | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    i_0_4182 ).

cnf(c_0_4197,hypothesis,
    sdtlpdtrp0(xN,sz00) = xS,
    i_0_4173 ).

cnf(c_0_4198,negated_conjecture,
    sz00 = xi,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_4194,c_0_4195]),c_0_4196]) ).

cnf(c_0_4199,hypothesis,
    sdtlpdtrp0(xN,xi) = xS,
    inference(rw,[status(thm)],[c_0_4197,c_0_4198]) ).

cnf(c_0_4200,hypothesis,
    aSubsetOf0(xS,szNzAzT0),
    i_0_149 ).

cnf(c_0_4201,hypothesis,
    isCountable0(xS),
    i_0_148 ).

cnf(c_0_4202,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_4194,c_0_4199]),c_0_4200]),c_0_4199]),c_0_4201])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM571+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n011.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Wed Jul  6 06:08:54 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 10.10/3.60  # ENIGMATIC: Solved by autoschedule-lgb:
% 10.10/3.60  # No SInE strategy applied
% 10.10/3.60  # Trying AutoSched0 for 150 seconds
% 10.10/3.60  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 10.10/3.60  # and selection function SelectNewComplexAHP.
% 10.10/3.60  #
% 10.10/3.60  # Preprocessing time       : 0.013 s
% 10.10/3.60  # Presaturation interreduction done
% 10.10/3.60  
% 10.10/3.60  # Proof found!
% 10.10/3.60  # SZS status Theorem
% 10.10/3.60  # SZS output start CNFRefutation
% See solution above
% 10.10/3.60  # Training examples: 0 positive, 0 negative
% 10.10/3.60  
% 10.10/3.60  # -------------------------------------------------
% 10.10/3.60  # User time                : 0.022 s
% 10.10/3.60  # System time              : 0.004 s
% 10.10/3.60  # Total time               : 0.026 s
% 10.10/3.60  # Maximum resident set size: 7124 pages
% 10.10/3.60  
%------------------------------------------------------------------------------