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

View Problem - Process Solution

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

% Computer : n020.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:27 EDT 2022

% Result   : Theorem 255.48s 34.21s
% Output   : CNFRefutation 255.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   35 (  21 unt;   8 nHn;  34 RR)
%            Number of literals    :   76 (  21 equ;  38 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   13 (  13 usr;  13 con; 0-0 aty)
%            Number of variables   :   41 (   0 sgn)

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

cnf(i_0_1067,plain,
    iext(uri_rdf_rest,esk192_0,uri_rdf_nil),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1067) ).

cnf(i_0_1068,plain,
    iext(uri_rdf_first,esk192_0,uri_ex_y),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1068) ).

cnf(i_0_1069,plain,
    iext(uri_rdf_rest,esk191_0,esk192_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1069) ).

cnf(i_0_1071,plain,
    iext(uri_owl_oneOf,uri_ex_e,esk191_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1071) ).

cnf(i_0_1070,plain,
    iext(uri_rdf_first,esk191_0,uri_ex_x),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1070) ).

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

cnf(i_0_1073,plain,
    iext(uri_rdf_type,uri_ex_z,uri_ex_e),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1073) ).

cnf(i_0_430,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_430) ).

cnf(i_0_1,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_z,uri_ex_y),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1) ).

cnf(i_0_377,plain,
    ( X1 != X2
    | ~ iext(uri_owl_differentFrom,X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_377) ).

cnf(i_0_1072,plain,
    iext(uri_owl_differentFrom,uri_ex_z,uri_ex_x),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3gpa8n7l/input.p',i_0_1072) ).

cnf(c_0_1106,plain,
    ( X1 = X2
    | X1 = X3
    | ~ icext(X4,X1)
    | ~ iext(uri_rdf_first,X5,X2)
    | ~ iext(uri_rdf_first,X6,X3)
    | ~ iext(uri_rdf_rest,X6,X5)
    | ~ iext(uri_owl_oneOf,X4,X6)
    | ~ iext(uri_rdf_rest,X5,uri_rdf_nil) ),
    i_0_362 ).

cnf(c_0_1107,plain,
    iext(uri_rdf_rest,esk192_0,uri_rdf_nil),
    i_0_1067 ).

cnf(c_0_1108,plain,
    ( X1 = X2
    | X1 = X3
    | ~ iext(uri_rdf_first,esk192_0,X3)
    | ~ iext(uri_rdf_rest,X4,esk192_0)
    | ~ iext(uri_owl_oneOf,X5,X4)
    | ~ iext(uri_rdf_first,X4,X2)
    | ~ icext(X5,X1) ),
    inference(spm,[status(thm)],[c_0_1106,c_0_1107]) ).

cnf(c_0_1109,plain,
    iext(uri_rdf_first,esk192_0,uri_ex_y),
    i_0_1068 ).

cnf(c_0_1110,plain,
    ( X1 = uri_ex_y
    | X1 = X2
    | ~ iext(uri_rdf_rest,X3,esk192_0)
    | ~ iext(uri_owl_oneOf,X4,X3)
    | ~ iext(uri_rdf_first,X3,X2)
    | ~ icext(X4,X1) ),
    inference(spm,[status(thm)],[c_0_1108,c_0_1109]) ).

cnf(c_0_1111,plain,
    iext(uri_rdf_rest,esk191_0,esk192_0),
    i_0_1069 ).

cnf(c_0_1112,plain,
    ( X1 = uri_ex_y
    | X1 = X2
    | ~ iext(uri_owl_oneOf,X3,esk191_0)
    | ~ iext(uri_rdf_first,esk191_0,X2)
    | ~ icext(X3,X1) ),
    inference(spm,[status(thm)],[c_0_1110,c_0_1111]) ).

cnf(c_0_1113,plain,
    iext(uri_owl_oneOf,uri_ex_e,esk191_0),
    i_0_1071 ).

cnf(c_0_1114,plain,
    ( X1 = uri_ex_y
    | X1 = X2
    | ~ iext(uri_rdf_first,esk191_0,X2)
    | ~ icext(uri_ex_e,X1) ),
    inference(spm,[status(thm)],[c_0_1112,c_0_1113]) ).

cnf(c_0_1115,plain,
    iext(uri_rdf_first,esk191_0,uri_ex_x),
    i_0_1070 ).

cnf(c_0_1116,plain,
    ( icext(X1,X2)
    | ~ iext(uri_rdf_type,X2,X1) ),
    i_0_1093 ).

cnf(c_0_1117,plain,
    iext(uri_rdf_type,uri_ex_z,uri_ex_e),
    i_0_1073 ).

cnf(c_0_1118,plain,
    ( X1 = uri_ex_x
    | X1 = uri_ex_y
    | ~ icext(uri_ex_e,X1) ),
    inference(spm,[status(thm)],[c_0_1114,c_0_1115]) ).

cnf(c_0_1119,plain,
    icext(uri_ex_e,uri_ex_z),
    inference(spm,[status(thm)],[c_0_1116,c_0_1117]) ).

cnf(c_0_1120,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    i_0_430 ).

cnf(c_0_1121,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_z,uri_ex_y),
    i_0_1 ).

cnf(c_0_1122,plain,
    ( uri_ex_y = uri_ex_z
    | uri_ex_x = uri_ex_z ),
    inference(spm,[status(thm)],[c_0_1118,c_0_1119]) ).

cnf(c_0_1123,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[c_0_1120]) ).

cnf(c_0_1124,plain,
    ( X1 != X2
    | ~ iext(uri_owl_differentFrom,X1,X2) ),
    i_0_377 ).

cnf(c_0_1125,plain,
    iext(uri_owl_differentFrom,uri_ex_z,uri_ex_x),
    i_0_1072 ).

cnf(c_0_1126,negated_conjecture,
    uri_ex_x = uri_ex_z,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1121,c_0_1122]),c_0_1123])]) ).

cnf(c_0_1127,plain,
    ~ iext(uri_owl_differentFrom,X1,X1),
    inference(er,[status(thm)],[c_0_1124]) ).

cnf(c_0_1128,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_1125,c_0_1126]),c_0_1127]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWB056+1 : TPTP v8.1.0. Released v5.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n020.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:19:10 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.46  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.46  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.46  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.46  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 252.60/33.70  eprover: CPU time limit exceeded, terminating
% 255.48/34.21  # ENIGMATIC: Solved by Enigma+tptp-cade20-model03-h2e15+lgb-t150-d30-l4800-e0.15+coop-paramils157:
% 255.48/34.21  # SinE strategy is GSinE(CountFormulas,hypos,5.0,,3,500,1.0)
% 255.48/34.21  # ENIGMA: LightGBM model '/export/starexec/sandbox2/solver/bin/data/Enigma/tptp-cade20-model03-h2e15/lgb-t150-d30-l4800-e0.15/model.lgb' loaded. (hash_base: 32768; conj_feats: 17; version: 991; iters: 150)
% 255.48/34.21  # Preprocessing time       : 0.803 s
% 255.48/34.21  
% 255.48/34.21  # Proof found!
% 255.48/34.21  # SZS status Theorem
% 255.48/34.21  # SZS output start CNFRefutation
% See solution above
% 255.48/34.21  # Training examples: 0 positive, 0 negative
% 255.48/34.21  
% 255.48/34.21  # -------------------------------------------------
% 255.48/34.21  # User time                : 0.850 s
% 255.48/34.21  # System time              : 0.095 s
% 255.48/34.21  # Total time               : 0.945 s
% 255.48/34.21  # ...preprocessing         : 0.803 s
% 255.48/34.21  # ...main loop             : 0.142 s
% 255.48/34.21  # Maximum resident set size: 156624 pages
% 255.48/34.21  
%------------------------------------------------------------------------------