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

View Problem - Process Solution

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

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

% Result   : Theorem 7.76s 2.43s
% Output   : CNFRefutation 7.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (  17 unt;   0 nHn;  36 RR)
%            Number of literals    :   97 (   0 equ;  66 neg)
%            Maximal clause size   :    7 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;  12 con; 0-0 aty)
%            Number of variables   :   67 (  10 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_11,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,X4,X1)
    | ~ iext(uri_rdf_first,X5,X6)
    | ~ iext(uri_rdf_rest,X5,X4)
    | ~ iext(uri_owl_intersectionOf,X3,X5)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_11) ).

cnf(i_0_18,plain,
    iext(uri_rdf_rest,esk5_0,uri_rdf_nil),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_18) ).

cnf(i_0_12,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,X4,X5)
    | ~ iext(uri_rdf_first,X6,X1)
    | ~ iext(uri_rdf_rest,X6,X4)
    | ~ iext(uri_owl_intersectionOf,X3,X6)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_12) ).

cnf(i_0_19,plain,
    iext(uri_rdf_first,esk5_0,esk3_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_19) ).

cnf(i_0_20,plain,
    iext(uri_rdf_rest,esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_20) ).

cnf(i_0_21,plain,
    iext(uri_rdf_first,esk4_0,uri_ex_A),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_21) ).

cnf(i_0_4,plain,
    ( ~ icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_owl_complementOf,X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_4) ).

cnf(i_0_17,plain,
    iext(uri_owl_complementOf,esk3_0,uri_ex_A),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_17) ).

cnf(i_0_22,plain,
    iext(uri_owl_intersectionOf,esk2_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_22) ).

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

cnf(i_0_23,plain,
    iext(uri_rdf_type,uri_ex_w,esk2_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-x8b62v7t/input.p',i_0_23) ).

cnf(c_0_35,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,X4,X1)
    | ~ iext(uri_rdf_first,X5,X6)
    | ~ iext(uri_rdf_rest,X5,X4)
    | ~ iext(uri_owl_intersectionOf,X3,X5)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    i_0_11 ).

cnf(c_0_36,plain,
    iext(uri_rdf_rest,esk5_0,uri_rdf_nil),
    i_0_18 ).

cnf(c_0_37,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,X4,X5)
    | ~ iext(uri_rdf_first,X6,X1)
    | ~ iext(uri_rdf_rest,X6,X4)
    | ~ iext(uri_owl_intersectionOf,X3,X6)
    | ~ iext(uri_rdf_rest,X4,uri_rdf_nil) ),
    i_0_12 ).

cnf(c_0_38,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,esk5_0,X1)
    | ~ iext(uri_rdf_rest,X4,esk5_0)
    | ~ iext(uri_rdf_first,X4,X5)
    | ~ iext(uri_owl_intersectionOf,X3,X4) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,plain,
    iext(uri_rdf_first,esk5_0,esk3_0),
    i_0_19 ).

cnf(c_0_40,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,esk5_0,X4)
    | ~ iext(uri_rdf_rest,X5,esk5_0)
    | ~ iext(uri_rdf_first,X5,X1)
    | ~ iext(uri_owl_intersectionOf,X3,X5) ),
    inference(spm,[status(thm)],[c_0_37,c_0_36]) ).

cnf(c_0_41,plain,
    ( icext(esk3_0,X1)
    | ~ icext(X2,X1)
    | ~ iext(uri_rdf_rest,X3,esk5_0)
    | ~ iext(uri_rdf_first,X3,X4)
    | ~ iext(uri_owl_intersectionOf,X2,X3) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_42,plain,
    iext(uri_rdf_rest,esk4_0,esk5_0),
    i_0_20 ).

cnf(c_0_43,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_rest,X4,esk5_0)
    | ~ iext(uri_rdf_first,X4,X1)
    | ~ iext(uri_owl_intersectionOf,X3,X4) ),
    inference(spm,[status(thm)],[c_0_40,c_0_39]) ).

cnf(c_0_44,plain,
    ( icext(esk3_0,X1)
    | ~ icext(X2,X1)
    | ~ iext(uri_rdf_first,esk4_0,X3)
    | ~ iext(uri_owl_intersectionOf,X2,esk4_0) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    iext(uri_rdf_first,esk4_0,uri_ex_A),
    i_0_21 ).

cnf(c_0_46,plain,
    ( icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_rdf_first,esk4_0,X1)
    | ~ iext(uri_owl_intersectionOf,X3,esk4_0) ),
    inference(spm,[status(thm)],[c_0_43,c_0_42]) ).

cnf(c_0_47,plain,
    ( ~ icext(X1,X2)
    | ~ icext(X3,X2)
    | ~ iext(uri_owl_complementOf,X3,X1) ),
    i_0_4 ).

cnf(c_0_48,plain,
    iext(uri_owl_complementOf,esk3_0,uri_ex_A),
    i_0_17 ).

cnf(c_0_49,plain,
    ( icext(esk3_0,X1)
    | ~ icext(X2,X1)
    | ~ iext(uri_owl_intersectionOf,X2,esk4_0) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_50,plain,
    iext(uri_owl_intersectionOf,esk2_0,esk4_0),
    i_0_22 ).

cnf(c_0_51,plain,
    ( icext(uri_ex_A,X1)
    | ~ icext(X2,X1)
    | ~ iext(uri_owl_intersectionOf,X2,esk4_0) ),
    inference(spm,[status(thm)],[c_0_46,c_0_45]) ).

cnf(c_0_52,plain,
    ( ~ icext(esk3_0,X1)
    | ~ icext(uri_ex_A,X1) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,plain,
    ( icext(esk3_0,X1)
    | ~ icext(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,plain,
    ( icext(uri_ex_A,X1)
    | ~ icext(esk2_0,X1) ),
    inference(spm,[status(thm)],[c_0_51,c_0_50]) ).

cnf(c_0_55,plain,
    ~ icext(esk2_0,X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).

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

cnf(c_0_57,plain,
    iext(uri_rdf_type,uri_ex_w,esk2_0),
    i_0_23 ).

cnf(c_0_58,plain,
    ~ iext(uri_rdf_type,X1,esk2_0),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

cnf(c_0_59,plain,
    $false,
    inference(sr,[status(thm)],[c_0_57,c_0_58]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SWB029+2 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.35  % Computer : n023.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Wed Jun  1 05:32:58 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.21/0.46  # ENIGMATIC: Selected complete mode:
% 7.76/2.43  # ENIGMATIC: Solved by autoschedule:
% 7.76/2.43  # No SInE strategy applied
% 7.76/2.43  # Trying AutoSched0 for 150 seconds
% 7.76/2.43  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S059I
% 7.76/2.43  # and selection function SelectComplexExceptUniqMaxPosHorn.
% 7.76/2.43  #
% 7.76/2.43  # Preprocessing time       : 0.023 s
% 7.76/2.43  # Presaturation interreduction done
% 7.76/2.43  
% 7.76/2.43  # Proof found!
% 7.76/2.43  # SZS status Theorem
% 7.76/2.43  # SZS output start CNFRefutation
% See solution above
% 7.76/2.43  # Training examples: 0 positive, 0 negative
% 7.76/2.43  
% 7.76/2.43  # -------------------------------------------------
% 7.76/2.43  # User time                : 0.028 s
% 7.76/2.43  # System time              : 0.006 s
% 7.76/2.43  # Total time               : 0.034 s
% 7.76/2.43  # Maximum resident set size: 7120 pages
% 7.76/2.43  
%------------------------------------------------------------------------------