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

% Computer : n012.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:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_19,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X3)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X3,X2)
    | ~ aSubsetOf0(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-echcv12_/lgb.p',i_0_19) ).

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

cnf(i_0_203,hypothesis,
    aSubsetOf0(xQ,xO),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-echcv12_/lgb.p',i_0_203) ).

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

cnf(i_0_211,hypothesis,
    aSubsetOf0(xP,xQ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-echcv12_/lgb.p',i_0_211) ).

cnf(i_0_212,negated_conjecture,
    ~ aSubsetOf0(xP,xO),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-echcv12_/lgb.p',i_0_212) ).

cnf(c_0_219,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X3)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X3,X2)
    | ~ aSubsetOf0(X1,X3) ),
    i_0_19 ).

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

cnf(c_0_221,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aSubsetOf0(X3,X2)
    | ~ aSubsetOf0(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_219,c_0_220]),c_0_220]) ).

cnf(c_0_222,hypothesis,
    aSubsetOf0(xQ,xO),
    i_0_203 ).

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

cnf(c_0_224,hypothesis,
    ( aSubsetOf0(X1,xO)
    | ~ aSubsetOf0(X1,xQ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_221,c_0_222]),c_0_223])]) ).

cnf(c_0_225,hypothesis,
    aSubsetOf0(xP,xQ),
    i_0_211 ).

cnf(c_0_226,negated_conjecture,
    ~ aSubsetOf0(xP,xO),
    i_0_212 ).

cnf(c_0_227,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_224,c_0_225]),c_0_226]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM610+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n012.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Wed Jul  6 16:53:32 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 4.65/2.31  # ENIGMATIC: Solved by autoschedule-lgb:
% 4.65/2.31  # No SInE strategy applied
% 4.65/2.31  # Trying AutoSched0 for 150 seconds
% 4.65/2.31  # AutoSched0-Mode selected heuristic G_E___207_C01_F1_SE_CS_SP_PI_S0Y
% 4.65/2.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 4.65/2.31  #
% 4.65/2.31  # Preprocessing time       : 0.013 s
% 4.65/2.31  
% 4.65/2.31  # Proof found!
% 4.65/2.31  # SZS status Theorem
% 4.65/2.31  # SZS output start CNFRefutation
% See solution above
% 4.65/2.31  # Training examples: 0 positive, 0 negative
% 4.65/2.31  
% 4.65/2.31  # -------------------------------------------------
% 4.65/2.31  # User time                : 0.015 s
% 4.65/2.31  # System time              : 0.007 s
% 4.65/2.31  # Total time               : 0.022 s
% 4.65/2.31  # Maximum resident set size: 7128 pages
% 4.65/2.31  
%------------------------------------------------------------------------------