TSTP Solution File: NUM547+1 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM547+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 08:37:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_118,negated_conjecture,
    ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_118) ).

cnf(i_0_5,plain,
    ( X1 = slcrc0
    | aElementOf0(esk1_1(X1),X1)
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_5) ).

cnf(i_0_115,hypothesis,
    slbdtsldtrb0(xS,xk) != slcrc0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_115) ).

cnf(i_0_107,plain,
    ( aSet0(X1)
    | X1 != slbdtsldtrb0(X2,X3)
    | ~ aSet0(X2)
    | ~ aElementOf0(X3,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_107) ).

cnf(i_0_15,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_15) ).

cnf(i_0_116,hypothesis,
    aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_116) ).

cnf(i_0_111,hypothesis,
    aElementOf0(xk,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_111) ).

cnf(i_0_113,hypothesis,
    aSet0(xT),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-15s8hpsc/lgb.p',i_0_113) ).

cnf(c_0_127,negated_conjecture,
    ~ aElementOf0(X1,slbdtsldtrb0(xS,xk)),
    i_0_118 ).

cnf(c_0_128,plain,
    ( X1 = slcrc0
    | aElementOf0(esk1_1(X1),X1)
    | ~ aSet0(X1) ),
    i_0_5 ).

cnf(c_0_129,hypothesis,
    slbdtsldtrb0(xS,xk) != slcrc0,
    i_0_115 ).

cnf(c_0_130,plain,
    ( aSet0(X1)
    | X1 != slbdtsldtrb0(X2,X3)
    | ~ aSet0(X2)
    | ~ aElementOf0(X3,szNzAzT0) ),
    i_0_107 ).

cnf(c_0_131,plain,
    ( aSet0(X1)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X1,X2) ),
    i_0_15 ).

cnf(c_0_132,hypothesis,
    aSubsetOf0(slbdtsldtrb0(xS,xk),slbdtsldtrb0(xT,xk)),
    i_0_116 ).

cnf(c_0_133,negated_conjecture,
    ~ aSet0(slbdtsldtrb0(xS,xk)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_128]),c_0_129]) ).

cnf(c_0_134,plain,
    ( aSet0(slbdtsldtrb0(X1,X2))
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(er,[status(thm)],[c_0_130]) ).

cnf(c_0_135,hypothesis,
    aElementOf0(xk,szNzAzT0),
    i_0_111 ).

cnf(c_0_136,hypothesis,
    ~ aSet0(slbdtsldtrb0(xT,xk)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_131,c_0_132]),c_0_133]) ).

cnf(c_0_137,hypothesis,
    ( aSet0(slbdtsldtrb0(X1,xk))
    | ~ aSet0(X1) ),
    inference(spm,[status(thm)],[c_0_134,c_0_135]) ).

cnf(c_0_138,hypothesis,
    aSet0(xT),
    i_0_113 ).

cnf(c_0_139,hypothesis,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_137]),c_0_138])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM547+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n028.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % 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 : Thu Jul  7 19:58:55 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.91/2.43  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.91/2.43  # No SInE strategy applied
% 7.91/2.43  # Trying AutoSched0 for 150 seconds
% 7.91/2.43  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 7.91/2.43  # and selection function SelectNewComplexAHP.
% 7.91/2.43  #
% 7.91/2.43  # Preprocessing time       : 0.024 s
% 7.91/2.43  # Presaturation interreduction done
% 7.91/2.43  
% 7.91/2.43  # Proof found!
% 7.91/2.43  # SZS status Theorem
% 7.91/2.43  # SZS output start CNFRefutation
% See solution above
% 7.91/2.43  # Training examples: 0 positive, 0 negative
% 7.91/2.43  
% 7.91/2.43  # -------------------------------------------------
% 7.91/2.43  # User time                : 0.030 s
% 7.91/2.43  # System time              : 0.007 s
% 7.91/2.43  # Total time               : 0.037 s
% 7.91/2.43  # Maximum resident set size: 7128 pages
% 7.91/2.43  
%------------------------------------------------------------------------------