↑ Up

Enigma---0.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SWB100+1 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n029.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:31 EDT 2022

% Result   : Theorem 7.82s 2.51s
% Output   : CNFRefutation 7.82s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   21 (   7 unt;   0 nHn;  21 RR)
%            Number of literals    :   49 (   0 equ;  33 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-4 aty)
%            Number of variables   :   34 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_1,negated_conjecture,
    ( ~ iext(uri_rdf_type,X1,uri_ex_c)
    | ~ iext(uri_ex_p,uri_ex_w,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1) ).

cnf(i_0_1066,plain,
    ( iext(X1,X2,esk190_4(X3,X1,X4,X2))
    | ~ icext(X3,X2)
    | ~ iext(uri_owl_onProperty,X3,X1)
    | ~ iext(uri_owl_someValuesFrom,X3,X4) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1066) ).

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

cnf(i_0_1065,plain,
    ( icext(X1,esk190_4(X2,X3,X1,X4))
    | ~ icext(X2,X4)
    | ~ iext(uri_owl_onProperty,X2,X3)
    | ~ iext(uri_owl_someValuesFrom,X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1065) ).

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

cnf(i_0_1069,plain,
    iext(uri_owl_someValuesFrom,uri_ex_z,uri_ex_c),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1069) ).

cnf(i_0_1068,plain,
    iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1068) ).

cnf(i_0_1067,plain,
    iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-igvbxiz1/lgb.p',i_0_1067) ).

cnf(c_0_1098,negated_conjecture,
    ( ~ iext(uri_rdf_type,X1,uri_ex_c)
    | ~ iext(uri_ex_p,uri_ex_w,X1) ),
    i_0_1 ).

cnf(c_0_1099,plain,
    ( iext(X1,X2,esk190_4(X3,X1,X4,X2))
    | ~ icext(X3,X2)
    | ~ iext(uri_owl_onProperty,X3,X1)
    | ~ iext(uri_owl_someValuesFrom,X3,X4) ),
    i_0_1066 ).

cnf(c_0_1100,plain,
    ( iext(uri_rdf_type,X1,X2)
    | ~ icext(X2,X1) ),
    i_0_1088 ).

cnf(c_0_1101,plain,
    ( icext(X1,esk190_4(X2,X3,X1,X4))
    | ~ icext(X2,X4)
    | ~ iext(uri_owl_onProperty,X2,X3)
    | ~ iext(uri_owl_someValuesFrom,X2,X1) ),
    i_0_1065 ).

cnf(c_0_1102,negated_conjecture,
    ( ~ icext(X1,uri_ex_w)
    | ~ iext(uri_rdf_type,esk190_4(X1,uri_ex_p,X2,uri_ex_w),uri_ex_c)
    | ~ iext(uri_owl_onProperty,X1,uri_ex_p)
    | ~ iext(uri_owl_someValuesFrom,X1,X2) ),
    inference(spm,[status(thm)],[c_0_1098,c_0_1099]) ).

cnf(c_0_1103,plain,
    ( iext(uri_rdf_type,esk190_4(X1,X2,X3,X4),X3)
    | ~ icext(X1,X4)
    | ~ iext(uri_owl_onProperty,X1,X2)
    | ~ iext(uri_owl_someValuesFrom,X1,X3) ),
    inference(spm,[status(thm)],[c_0_1100,c_0_1101]) ).

cnf(c_0_1104,negated_conjecture,
    ( ~ icext(X1,uri_ex_w)
    | ~ iext(uri_owl_onProperty,X1,uri_ex_p)
    | ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c) ),
    inference(spm,[status(thm)],[c_0_1102,c_0_1103]) ).

cnf(c_0_1105,plain,
    ( icext(X1,X2)
    | ~ iext(uri_rdf_type,X2,X1) ),
    i_0_1089 ).

cnf(c_0_1106,plain,
    ( ~ iext(uri_owl_onProperty,X1,uri_ex_p)
    | ~ iext(uri_owl_someValuesFrom,X1,uri_ex_c)
    | ~ iext(uri_rdf_type,uri_ex_w,X1) ),
    inference(spm,[status(thm)],[c_0_1104,c_0_1105]) ).

cnf(c_0_1107,plain,
    iext(uri_owl_someValuesFrom,uri_ex_z,uri_ex_c),
    i_0_1069 ).

cnf(c_0_1108,plain,
    iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
    i_0_1068 ).

cnf(c_0_1109,plain,
    iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    i_0_1067 ).

cnf(c_0_1110,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1106,c_0_1107]),c_0_1108]),c_0_1109])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SWB100+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 : n029.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 09:05:47 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.44  # ENIGMATIC: Selected SinE mode:
% 0.18/0.47  # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.18/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.18/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 7.82/2.51  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.51  # No SInE strategy applied
% 7.82/2.51  # Trying AutoSched0 for 150 seconds
% 7.82/2.51  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.82/2.51  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.82/2.51  #
% 7.82/2.51  # Preprocessing time       : 0.026 s
% 7.82/2.51  
% 7.82/2.51  # Proof found!
% 7.82/2.51  # SZS status Theorem
% 7.82/2.51  # SZS output start CNFRefutation
% See solution above
% 7.82/2.51  # Training examples: 0 positive, 0 negative
% 7.82/2.51  
% 7.82/2.51  # -------------------------------------------------
% 7.82/2.51  # User time                : 0.034 s
% 7.82/2.51  # System time              : 0.007 s
% 7.82/2.51  # Total time               : 0.041 s
% 7.82/2.51  # Maximum resident set size: 7124 pages
% 7.82/2.51  
%------------------------------------------------------------------------------