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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : NUM533+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:03 EDT 2022

% Result   : Theorem 7.73s 2.35s
% Output   : CNFRefutation 7.73s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   23 (  11 unt;   3 nHn;  23 RR)
%            Number of literals    :   58 (   0 equ;  35 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   28 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk2_2(X2,X1),X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_12) ).

cnf(i_0_14,plain,
    ( aElementOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aSubsetOf0(X3,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_14) ).

cnf(i_0_13,plain,
    ( aSubsetOf0(X1,X2)
    | aElementOf0(esk2_2(X2,X1),X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_13) ).

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

cnf(i_0_22,negated_conjecture,
    ~ aSubsetOf0(xA,xC),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_22) ).

cnf(i_0_19,hypothesis,
    aSet0(xC),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_19) ).

cnf(i_0_21,hypothesis,
    aSet0(xA),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_21) ).

cnf(i_0_23,negated_conjecture,
    aSubsetOf0(xB,xC),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_23) ).

cnf(i_0_24,negated_conjecture,
    aSubsetOf0(xA,xB),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-123qmx29/lgb.p',i_0_24) ).

cnf(c_0_34,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X1)
    | ~ aSet0(X2)
    | ~ aElementOf0(esk2_2(X2,X1),X2) ),
    i_0_12 ).

cnf(c_0_35,plain,
    ( aElementOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aElementOf0(X1,X3)
    | ~ aSubsetOf0(X3,X2) ),
    i_0_14 ).

cnf(c_0_36,plain,
    ( aSubsetOf0(X1,X2)
    | aElementOf0(esk2_2(X2,X1),X1)
    | ~ aSet0(X1)
    | ~ aSet0(X2) ),
    i_0_13 ).

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

cnf(c_0_38,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(esk2_2(X2,X1),X3)
    | ~ aSubsetOf0(X3,X2) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    ( aElementOf0(esk2_2(X1,X2),X3)
    | aSubsetOf0(X2,X1)
    | ~ aSet0(X3)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X2,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_40,negated_conjecture,
    ~ aSubsetOf0(xA,xC),
    i_0_22 ).

cnf(c_0_41,plain,
    ( aSubsetOf0(X1,X2)
    | ~ aSet0(X2)
    | ~ aSet0(X1)
    | ~ aSubsetOf0(X3,X2)
    | ~ aSubsetOf0(X1,X3) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_37]) ).

cnf(c_0_42,hypothesis,
    aSet0(xC),
    i_0_19 ).

cnf(c_0_43,hypothesis,
    aSet0(xA),
    i_0_21 ).

cnf(c_0_44,negated_conjecture,
    ( ~ aSubsetOf0(X1,xC)
    | ~ aSubsetOf0(xA,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_43])]) ).

cnf(c_0_45,negated_conjecture,
    aSubsetOf0(xB,xC),
    i_0_23 ).

cnf(c_0_46,negated_conjecture,
    aSubsetOf0(xA,xB),
    i_0_24 ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM533+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n005.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.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Wed Jul  6 15:24:39 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.73/2.35  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.73/2.35  # No SInE strategy applied
% 7.73/2.35  # Trying AutoSched0 for 150 seconds
% 7.73/2.35  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S01BI
% 7.73/2.35  # and selection function PSelectMinOptimalNoXTypePred.
% 7.73/2.35  #
% 7.73/2.35  # Preprocessing time       : 0.023 s
% 7.73/2.35  # Presaturation interreduction done
% 7.73/2.35  
% 7.73/2.35  # Proof found!
% 7.73/2.35  # SZS status Theorem
% 7.73/2.35  # SZS output start CNFRefutation
% See solution above
% 7.73/2.35  # Training examples: 0 positive, 0 negative
% 7.73/2.35  
% 7.73/2.35  # -------------------------------------------------
% 7.73/2.35  # User time                : 0.027 s
% 7.73/2.35  # System time              : 0.006 s
% 7.73/2.35  # Total time               : 0.033 s
% 7.73/2.35  # Maximum resident set size: 7128 pages
% 7.73/2.35  
%------------------------------------------------------------------------------