↑ Up

Enigma---0.5.1.THM-CRf.s

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

% Computer : n027.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:28 EDT 2022

% Result   : Theorem 45.43s 7.36s
% Output   : CNFRefutation 45.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   33 (  11 unt;   3 nHn;  33 RR)
%            Number of literals    :   74 (   0 equ;  38 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :   53 (   8 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_675,plain,
    ( ip(X1)
    | ~ iext(uri_owl_inverseOf,X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_675) ).

cnf(i_0_1067,plain,
    iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_1067) ).

cnf(i_0_435,plain,
    ( iext(X1,X2,X3)
    | ~ iext(X4,X3,X2)
    | ~ iext(uri_owl_inverseOf,X4,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_435) ).

cnf(i_0_1068,plain,
    iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_1068) ).

cnf(i_0_419,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | iext(X2,esk42_2(X1,X2),esk43_2(X1,X2))
    | iext(X1,esk42_2(X1,X2),esk43_2(X1,X2))
    | ~ ip(X2)
    | ~ ip(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_419) ).

cnf(i_0_676,plain,
    ( ip(X1)
    | ~ iext(uri_owl_inverseOf,X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_676) ).

cnf(i_0_434,plain,
    ( iext(X1,X2,X3)
    | ~ iext(X4,X3,X2)
    | ~ iext(uri_owl_inverseOf,X1,X4) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_434) ).

cnf(i_0_420,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | ~ ip(X2)
    | ~ ip(X1)
    | ~ iext(X2,esk42_2(X1,X2),esk43_2(X1,X2))
    | ~ iext(X1,esk42_2(X1,X2),esk43_2(X1,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_420) ).

cnf(i_0_1155,plain,
    ( ip(X1)
    | ~ iext(X1,X2,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_1155) ).

cnf(i_0_1,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-q40iivjn/lgb.p',i_0_1) ).

cnf(c_0_1166,plain,
    ( ip(X1)
    | ~ iext(uri_owl_inverseOf,X2,X1) ),
    i_0_675 ).

cnf(c_0_1167,plain,
    iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1),
    i_0_1067 ).

cnf(c_0_1168,plain,
    ( iext(X1,X2,X3)
    | ~ iext(X4,X3,X2)
    | ~ iext(uri_owl_inverseOf,X4,X1) ),
    i_0_435 ).

cnf(c_0_1169,plain,
    iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2),
    i_0_1068 ).

cnf(c_0_1170,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | iext(X2,esk42_2(X1,X2),esk43_2(X1,X2))
    | iext(X1,esk42_2(X1,X2),esk43_2(X1,X2))
    | ~ ip(X2)
    | ~ ip(X1) ),
    i_0_419 ).

cnf(c_0_1171,plain,
    ip(uri_ex_p1),
    inference(spm,[status(thm)],[c_0_1166,c_0_1167]) ).

cnf(c_0_1172,plain,
    ( ip(X1)
    | ~ iext(uri_owl_inverseOf,X1,X2) ),
    i_0_676 ).

cnf(c_0_1173,plain,
    ( iext(uri_ex_p1,X1,X2)
    | ~ iext(uri_ex_p2,X2,X1) ),
    inference(spm,[status(thm)],[c_0_1168,c_0_1167]) ).

cnf(c_0_1174,plain,
    ( iext(uri_ex_p2,X1,X2)
    | ~ iext(uri_ex_p3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_1168,c_0_1169]) ).

cnf(c_0_1175,plain,
    ( iext(X1,X2,X3)
    | ~ iext(X4,X3,X2)
    | ~ iext(uri_owl_inverseOf,X1,X4) ),
    i_0_434 ).

cnf(c_0_1176,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | ~ ip(X2)
    | ~ ip(X1)
    | ~ iext(X2,esk42_2(X1,X2),esk43_2(X1,X2))
    | ~ iext(X1,esk42_2(X1,X2),esk43_2(X1,X2)) ),
    i_0_420 ).

cnf(c_0_1177,plain,
    ( ip(X1)
    | ~ iext(X1,X2,X3) ),
    i_0_1155 ).

cnf(c_0_1178,plain,
    ( iext(uri_ex_p1,esk42_2(X1,uri_ex_p1),esk43_2(X1,uri_ex_p1))
    | iext(X1,esk42_2(X1,uri_ex_p1),esk43_2(X1,uri_ex_p1))
    | iext(uri_owl_equivalentProperty,X1,uri_ex_p1)
    | ~ ip(X1) ),
    inference(spm,[status(thm)],[c_0_1170,c_0_1171]) ).

cnf(c_0_1179,plain,
    ip(uri_ex_p3),
    inference(spm,[status(thm)],[c_0_1172,c_0_1169]) ).

cnf(c_0_1180,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    i_0_1 ).

cnf(c_0_1181,plain,
    ( iext(uri_ex_p1,X1,X2)
    | ~ iext(uri_ex_p3,X1,X2) ),
    inference(spm,[status(thm)],[c_0_1173,c_0_1174]) ).

cnf(c_0_1182,plain,
    ( iext(uri_ex_p3,X1,X2)
    | ~ iext(uri_ex_p2,X2,X1) ),
    inference(spm,[status(thm)],[c_0_1175,c_0_1169]) ).

cnf(c_0_1183,plain,
    ( iext(uri_ex_p2,X1,X2)
    | ~ iext(uri_ex_p1,X2,X1) ),
    inference(spm,[status(thm)],[c_0_1175,c_0_1167]) ).

cnf(c_0_1184,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | ~ iext(X2,esk42_2(X1,X2),esk43_2(X1,X2))
    | ~ iext(X1,esk42_2(X1,X2),esk43_2(X1,X2)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_1176,c_0_1177]),c_0_1177]) ).

cnf(c_0_1185,plain,
    iext(uri_ex_p1,esk42_2(uri_ex_p3,uri_ex_p1),esk43_2(uri_ex_p3,uri_ex_p1)),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1178,c_0_1179]),c_0_1180]),c_0_1181]) ).

cnf(c_0_1186,plain,
    ( iext(uri_ex_p3,X1,X2)
    | ~ iext(uri_ex_p1,X1,X2) ),
    inference(spm,[status(thm)],[c_0_1182,c_0_1183]) ).

cnf(c_0_1187,plain,
    ~ iext(uri_ex_p3,esk42_2(uri_ex_p3,uri_ex_p1),esk43_2(uri_ex_p3,uri_ex_p1)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1184,c_0_1185]),c_0_1180]) ).

cnf(c_0_1188,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_1186,c_0_1185]),c_0_1187]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWB067+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n027.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 08:30:05 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected SinE mode:
% 0.19/0.47  # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.47  # Filter: axfilter_auto   0 goes into file theBenchmark_axfilter_auto   0.p
% 0.19/0.47  # Filter: axfilter_auto   1 goes into file theBenchmark_axfilter_auto   1.p
% 0.19/0.47  # Filter: axfilter_auto   2 goes into file theBenchmark_axfilter_auto   2.p
% 45.43/7.36  # ENIGMATIC: Solved by autoschedule-lgb:
% 45.43/7.36  # No SInE strategy applied
% 45.43/7.36  # Trying AutoSched0 for 150 seconds
% 45.43/7.36  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 45.43/7.36  # and selection function SelectComplexExceptUniqMaxHorn.
% 45.43/7.36  #
% 45.43/7.36  # Preprocessing time       : 0.032 s
% 45.43/7.36  # Presaturation interreduction done
% 45.43/7.36  
% 45.43/7.36  # Proof found!
% 45.43/7.36  # SZS status Theorem
% 45.43/7.36  # SZS output start CNFRefutation
% See solution above
% 45.43/7.36  # Training examples: 0 positive, 0 negative
% 45.43/7.36  
% 45.43/7.36  # -------------------------------------------------
% 45.43/7.36  # User time                : 4.130 s
% 45.43/7.36  # System time              : 0.121 s
% 45.43/7.36  # Total time               : 4.251 s
% 45.43/7.36  # Maximum resident set size: 7124 pages
% 45.43/7.36  
%------------------------------------------------------------------------------