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

View Problem - Process Solution

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

% Computer : n005.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:50 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_105,plain,
    ( sbrdtbr0(X1) = X2
    | X3 != slbdtsldtrb0(X4,X2)
    | ~ aSet0(X4)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X2,szNzAzT0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_105) ).

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

cnf(i_0_147,hypothesis,
    aElementOf0(xK,szNzAzT0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_147) ).

cnf(i_0_201,hypothesis,
    aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_201) ).

cnf(i_0_202,negated_conjecture,
    xQ = slcrc0,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_202) ).

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

cnf(i_0_196,hypothesis,
    aSet0(xO),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_196) ).

cnf(i_0_158,hypothesis,
    sz00 != xK,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-r1qgpkdm/lgb.p',i_0_158) ).

cnf(c_0_211,plain,
    ( sbrdtbr0(X1) = X2
    | X3 != slbdtsldtrb0(X4,X2)
    | ~ aSet0(X4)
    | ~ aElementOf0(X1,X3)
    | ~ aElementOf0(X2,szNzAzT0) ),
    i_0_105 ).

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

cnf(c_0_213,plain,
    ( sbrdtbr0(X1) = X2
    | ~ aSet0(X3)
    | ~ aElementOf0(X1,slbdtsldtrb0(X3,X2))
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(er,[status(thm)],[c_0_211]) ).

cnf(c_0_214,hypothesis,
    aElementOf0(xK,szNzAzT0),
    i_0_147 ).

cnf(c_0_215,hypothesis,
    aElementOf0(xQ,slbdtsldtrb0(xO,xK)),
    i_0_201 ).

cnf(c_0_216,negated_conjecture,
    xQ = slcrc0,
    i_0_202 ).

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

cnf(c_0_218,plain,
    aSet0(slcrc0),
    inference(er,[status(thm)],[c_0_212]) ).

cnf(c_0_219,hypothesis,
    ( sbrdtbr0(X1) = xK
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,slbdtsldtrb0(X2,xK)) ),
    inference(spm,[status(thm)],[c_0_213,c_0_214]) ).

cnf(c_0_220,hypothesis,
    aElementOf0(slcrc0,slbdtsldtrb0(xO,xK)),
    inference(rw,[status(thm)],[c_0_215,c_0_216]) ).

cnf(c_0_221,plain,
    sbrdtbr0(slcrc0) = sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_217]),c_0_218])]) ).

cnf(c_0_222,hypothesis,
    aSet0(xO),
    i_0_196 ).

cnf(c_0_223,hypothesis,
    sz00 != xK,
    i_0_158 ).

cnf(c_0_224,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_219,c_0_220]),c_0_221]),c_0_222])]),c_0_223]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM605+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.33  % Computer : n005.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jul  5 09:13:09 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 8.33/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.33/2.32  # No SInE strategy applied
% 8.33/2.32  # Trying AutoSched0 for 150 seconds
% 8.33/2.32  # AutoSched0-Mode selected heuristic G_E___207_C18_F1_SE_CS_SP_PI_PS_S2S
% 8.33/2.32  # and selection function SelectNewComplexAHP.
% 8.33/2.32  #
% 8.33/2.32  # Preprocessing time       : 0.024 s
% 8.33/2.32  # Presaturation interreduction done
% 8.33/2.32  
% 8.33/2.32  # Proof found!
% 8.33/2.32  # SZS status Theorem
% 8.33/2.32  # SZS output start CNFRefutation
% See solution above
% 8.33/2.32  # Training examples: 0 positive, 0 negative
% 8.33/2.32  
% 8.33/2.32  # -------------------------------------------------
% 8.33/2.32  # User time                : 0.045 s
% 8.33/2.32  # System time              : 0.006 s
% 8.33/2.32  # Total time               : 0.051 s
% 8.33/2.32  # Maximum resident set size: 7128 pages
% 8.33/2.32  
%------------------------------------------------------------------------------