TSTP Solution File: SWB023+2 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n018.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 : Tue Jul 19 18:58:58 EDT 2022

% Result   : Theorem 7.09s 2.26s
% Output   : CNFRefutation 7.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   34 (  17 unt;   0 nHn;  33 RR)
%            Number of literals    :   67 (  15 equ;  36 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :   40 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
    ( X1 = X2
    | ~ icext(uri_owl_FunctionalProperty,X3)
    | ~ iext(X3,X4,X2)
    | ~ iext(X3,X4,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_11) ).

cnf(i_0_2,plain,
    ( icext(X1,X2)
    | ~ iext(uri_rdf_type,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_2) ).

cnf(i_0_6,plain,
    ( X1 = X2
    | ~ icext(X3,X1)
    | ~ iext(uri_rdf_first,X4,X2)
    | ~ iext(uri_owl_oneOf,X3,X4)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_6) ).

cnf(i_0_16,plain,
    iext(uri_rdf_rest,esk6_0,uri_rdf_nil),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_16) ).

cnf(i_0_22,plain,
    iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_22) ).

cnf(i_0_19,plain,
    iext(uri_owl_oneOf,esk5_0,esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_19) ).

cnf(i_0_18,plain,
    iext(uri_rdf_first,esk6_0,uri_ex_u),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_18) ).

cnf(i_0_17,plain,
    iext(uri_rdf_first,esk6_0,uri_ex_v),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_17) ).

cnf(i_0_15,negated_conjecture,
    ( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
    | ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_15) ).

cnf(i_0_21,plain,
    iext(uri_rdf_type,uri_ex_w,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_21) ).

cnf(i_0_13,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-92btnnjh/lgb.p',i_0_13) ).

cnf(c_0_34,plain,
    ( X1 = X2
    | ~ icext(uri_owl_FunctionalProperty,X3)
    | ~ iext(X3,X4,X2)
    | ~ iext(X3,X4,X1) ),
    i_0_11 ).

cnf(c_0_35,plain,
    ( icext(X1,X2)
    | ~ iext(uri_rdf_type,X2,X1) ),
    i_0_2 ).

cnf(c_0_36,plain,
    ( X1 = X2
    | ~ icext(X3,X1)
    | ~ iext(uri_rdf_first,X4,X2)
    | ~ iext(uri_owl_oneOf,X3,X4)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    i_0_6 ).

cnf(c_0_37,plain,
    iext(uri_rdf_rest,esk6_0,uri_rdf_nil),
    i_0_16 ).

cnf(c_0_38,plain,
    ( X1 = X2
    | ~ iext(uri_rdf_type,X3,uri_owl_FunctionalProperty)
    | ~ iext(X3,X4,X2)
    | ~ iext(X3,X4,X1) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    iext(uri_rdf_type,uri_rdf_first,uri_owl_FunctionalProperty),
    i_0_22 ).

cnf(c_0_40,plain,
    ( X1 = X2
    | ~ icext(X3,X1)
    | ~ iext(uri_owl_oneOf,X3,esk6_0)
    | ~ iext(uri_rdf_first,esk6_0,X2) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_41,plain,
    iext(uri_owl_oneOf,esk5_0,esk6_0),
    i_0_19 ).

cnf(c_0_42,plain,
    ( X1 = X2
    | ~ iext(uri_rdf_first,X3,X2)
    | ~ iext(uri_rdf_first,X3,X1) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_43,plain,
    iext(uri_rdf_first,esk6_0,uri_ex_u),
    i_0_18 ).

cnf(c_0_44,plain,
    ( X1 = X2
    | ~ icext(esk5_0,X1)
    | ~ iext(uri_rdf_first,esk6_0,X2) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_45,plain,
    ( X1 = uri_ex_u
    | ~ iext(uri_rdf_first,esk6_0,X1) ),
    inference(spm,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_46,plain,
    iext(uri_rdf_first,esk6_0,uri_ex_v),
    i_0_17 ).

cnf(c_0_47,plain,
    ( X1 = uri_ex_u
    | ~ icext(esk5_0,X1) ),
    inference(spm,[status(thm)],[c_0_44,c_0_43]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u)
    | ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_v) ),
    i_0_15 ).

cnf(c_0_49,plain,
    uri_ex_v = uri_ex_u,
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_50,plain,
    ( X1 = uri_ex_u
    | ~ iext(uri_rdf_type,X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_35]) ).

cnf(c_0_51,plain,
    iext(uri_rdf_type,uri_ex_w,esk5_0),
    i_0_21 ).

cnf(c_0_52,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    i_0_13 ).

cnf(c_0_53,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_w,uri_ex_u),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_54,plain,
    uri_ex_u = uri_ex_w,
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_55,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[c_0_52]) ).

cnf(c_0_56,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_55])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SWB023+2 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n018.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 Jun  1 03:29:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected complete mode:
% 7.09/2.26  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.09/2.26  # No SInE strategy applied
% 7.09/2.26  # Trying AutoSched0 for 150 seconds
% 7.09/2.26  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.09/2.26  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.09/2.26  #
% 7.09/2.26  # Preprocessing time       : 0.012 s
% 7.09/2.26  # Presaturation interreduction done
% 7.09/2.26  
% 7.09/2.26  # Proof found!
% 7.09/2.26  # SZS status Theorem
% 7.09/2.26  # SZS output start CNFRefutation
% See solution above
% 7.09/2.26  # Training examples: 0 positive, 0 negative
% 7.09/2.26  
% 7.09/2.26  # -------------------------------------------------
% 7.09/2.26  # User time                : 0.016 s
% 7.09/2.26  # System time              : 0.002 s
% 7.09/2.26  # Total time               : 0.018 s
% 7.09/2.26  # Maximum resident set size: 7120 pages
% 7.09/2.26  
%------------------------------------------------------------------------------