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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM549+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n027.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:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_3) ).

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

cnf(i_0_122,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ aElementOf0(X1,xQ) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_122) ).

cnf(i_0_7,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_7) ).

cnf(i_0_121,hypothesis,
    aSet0(xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_121) ).

cnf(i_0_68,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_68) ).

cnf(i_0_119,hypothesis,
    sbrdtbr0(xQ) = xk,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_119) ).

cnf(i_0_112,hypothesis,
    sz00 != xk,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-u0fbgzdv/input.p',i_0_112) ).

cnf(c_0_131,plain,
    ( aElement0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X2) ),
    i_0_3 ).

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

cnf(c_0_133,negated_conjecture,
    ( ~ aElement0(X1)
    | ~ aElementOf0(X1,xQ) ),
    i_0_122 ).

cnf(c_0_134,plain,
    ( X1 = slcrc0
    | aElement0(esk1_1(X1))
    | ~ aSet0(X1) ),
    inference(spm,[status(thm)],[c_0_131,c_0_132]) ).

cnf(c_0_135,plain,
    ( aSet0(X1)
    | X1 != slcrc0 ),
    i_0_7 ).

cnf(c_0_136,negated_conjecture,
    ( X1 = slcrc0
    | ~ aElementOf0(esk1_1(X1),xQ)
    | ~ aSet0(X1) ),
    inference(spm,[status(thm)],[c_0_133,c_0_134]) ).

cnf(c_0_137,hypothesis,
    aSet0(xQ),
    i_0_121 ).

cnf(c_0_138,plain,
    ( sbrdtbr0(X1) = sz00
    | X1 != slcrc0
    | ~ aSet0(X1) ),
    i_0_68 ).

cnf(c_0_139,plain,
    aSet0(slcrc0),
    inference(er,[status(thm)],[c_0_135]) ).

cnf(c_0_140,hypothesis,
    sbrdtbr0(xQ) = xk,
    i_0_119 ).

cnf(c_0_141,plain,
    xQ = slcrc0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_136,c_0_132]),c_0_137])]) ).

cnf(c_0_142,plain,
    sbrdtbr0(slcrc0) = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_138]),c_0_139])]) ).

cnf(c_0_143,hypothesis,
    sz00 != xk,
    i_0_112 ).

cnf(c_0_144,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_140,c_0_141]),c_0_142]),c_0_143]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM549+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n027.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.20/0.33  % CPULimit : 300
% 0.20/0.33  % WCLimit  : 600
% 0.20/0.33  % DateTime : Wed Jul  6 21:06:30 EDT 2022
% 0.20/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.71/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.71/2.35  # No SInE strategy applied
% 7.71/2.35  # Trying AutoSched0 for 150 seconds
% 7.71/2.35  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.71/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.71/2.35  #
% 7.71/2.35  # Preprocessing time       : 0.027 s
% 7.71/2.35  
% 7.71/2.35  # Proof found!
% 7.71/2.35  # SZS status Theorem
% 7.71/2.35  # SZS output start CNFRefutation
% See solution above
% 7.71/2.35  # Training examples: 0 positive, 0 negative
% 7.71/2.35  
% 7.71/2.35  # -------------------------------------------------
% 7.71/2.35  # User time                : 0.031 s
% 7.71/2.35  # System time              : 0.007 s
% 7.71/2.35  # Total time               : 0.037 s
% 7.71/2.35  # Maximum resident set size: 7124 pages
% 7.71/2.35  
%------------------------------------------------------------------------------