TSTP Solution File: SWB008+2 by E---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1
% Problem  : SWB008+2 : TPTP v8.1.2. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n013.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 : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:35:56 EDT 2023

% Result   : Theorem 0.22s 0.53s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   22 (   9 unt;   0 def)
%            Number of atoms       :   62 (  12 equ)
%            Maximal formula atoms :   15 (   2 avg)
%            Number of connectives :   65 (  25   ~;  25   |;  11   &)
%                                         (   3 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-1 aty)
%            Number of variables   :   34 (   0 sgn;  17   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_char_inversefunctional,axiom,
    ! [X4] :
      ( icext(uri_owl_InverseFunctionalProperty,X4)
    <=> ( ip(X4)
        & ! [X5,X6,X3] :
            ( ( iext(X4,X5,X3)
              & iext(X4,X6,X3) )
           => X5 = X6 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p',owl_char_inversefunctional) ).

fof(rdfs_cext_def,axiom,
    ! [X1,X2] :
      ( iext(uri_rdf_type,X1,X2)
    <=> icext(X2,X1) ),
    file('/export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p',rdfs_cext_def) ).

fof(testcase_premise_fullish_008_Inverse_Functional_Data_Properties,axiom,
    ( iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_DatatypeProperty)
    & iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty)
    & iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz))
    & iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)) ),
    file('/export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p',testcase_premise_fullish_008_Inverse_Functional_Data_Properties) ).

fof(owl_eqdis_sameas,axiom,
    ! [X1,X3] :
      ( iext(uri_owl_sameAs,X1,X3)
    <=> X1 = X3 ),
    file('/export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p',owl_eqdis_sameas) ).

fof(testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties,conjecture,
    iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
    file('/export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p',testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties) ).

fof(c_0_5,plain,
    ! [X11,X12,X13,X14,X15] :
      ( ( ip(X11)
        | ~ icext(uri_owl_InverseFunctionalProperty,X11) )
      & ( ~ iext(X11,X12,X14)
        | ~ iext(X11,X13,X14)
        | X12 = X13
        | ~ icext(uri_owl_InverseFunctionalProperty,X11) )
      & ( iext(X15,esk1_1(X15),esk3_1(X15))
        | ~ ip(X15)
        | icext(uri_owl_InverseFunctionalProperty,X15) )
      & ( iext(X15,esk2_1(X15),esk3_1(X15))
        | ~ ip(X15)
        | icext(uri_owl_InverseFunctionalProperty,X15) )
      & ( esk1_1(X15) != esk2_1(X15)
        | ~ ip(X15)
        | icext(uri_owl_InverseFunctionalProperty,X15) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_char_inversefunctional])])])])])]) ).

fof(c_0_6,plain,
    ! [X7,X8] :
      ( ( ~ iext(uri_rdf_type,X7,X8)
        | icext(X8,X7) )
      & ( ~ icext(X8,X7)
        | iext(uri_rdf_type,X7,X8) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).

cnf(c_0_7,plain,
    ( X2 = X4
    | ~ iext(X1,X2,X3)
    | ~ iext(X1,X4,X3)
    | ~ icext(uri_owl_InverseFunctionalProperty,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( icext(X2,X1)
    | ~ iext(uri_rdf_type,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_9,plain,
    ( X1 = X2
    | ~ iext(uri_rdf_type,X3,uri_owl_InverseFunctionalProperty)
    | ~ iext(X3,X2,X4)
    | ~ iext(X3,X1,X4) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,plain,
    iext(uri_rdf_type,uri_foaf_mbox_sha1sum,uri_owl_InverseFunctionalProperty),
    inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ iext(uri_foaf_mbox_sha1sum,X2,X3)
    | ~ iext(uri_foaf_mbox_sha1sum,X1,X3) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

cnf(c_0_12,plain,
    iext(uri_foaf_mbox_sha1sum,uri_ex_robert,literal_plain(dat_str_xyz)),
    inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).

fof(c_0_13,plain,
    ! [X9,X10] :
      ( ( ~ iext(uri_owl_sameAs,X9,X10)
        | X9 = X10 )
      & ( X9 != X10
        | iext(uri_owl_sameAs,X9,X10) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])]) ).

fof(c_0_14,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_008_Inverse_Functional_Data_Properties])]) ).

cnf(c_0_15,plain,
    ( X1 = uri_ex_robert
    | ~ iext(uri_foaf_mbox_sha1sum,X1,literal_plain(dat_str_xyz)) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    iext(uri_foaf_mbox_sha1sum,uri_ex_bob,literal_plain(dat_str_xyz)),
    inference(split_conjunct,[status(thm)],[testcase_premise_fullish_008_Inverse_Functional_Data_Properties]) ).

cnf(c_0_17,plain,
    ( iext(uri_owl_sameAs,X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_ex_bob,uri_ex_robert),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    uri_ex_robert = uri_ex_bob,
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.14  % Problem    : SWB008+2 : TPTP v8.1.2. Released v5.2.0.
% 0.14/0.15  % Command    : run_E %s %d THM
% 0.15/0.36  % Computer : n013.cluster.edu
% 0.15/0.36  % Model    : x86_64 x86_64
% 0.15/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36  % Memory   : 8042.1875MB
% 0.15/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36  % CPULimit   : 2400
% 0.15/0.36  % WCLimit    : 300
% 0.15/0.36  % DateTime   : Mon Oct  2 20:15:14 EDT 2023
% 0.15/0.37  % CPUTime    : 
% 0.22/0.52  Running first-order theorem proving
% 0.22/0.52  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.2ZfXpzk2rE/E---3.1_16469.p
% 0.22/0.53  # Version: 3.1pre001
% 0.22/0.53  # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53  # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53  # Starting new_bool_3 with 300s (1) cores
% 0.22/0.53  # Starting new_bool_1 with 300s (1) cores
% 0.22/0.53  # Starting sh5l with 300s (1) cores
% 0.22/0.53  # G----_0031_C18_F1_SE_CS_SP_S0Y with pid 16547 completed with status 0
% 0.22/0.53  # Result found by G----_0031_C18_F1_SE_CS_SP_S0Y
% 0.22/0.53  # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53  # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53  # No SInE strategy applied
% 0.22/0.53  # Search class: FGUSF-FFSS11-SFFFFFNN
% 0.22/0.53  # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.22/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53  # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 151s (1) cores
% 0.22/0.53  # Starting new_bool_3 with 136s (1) cores
% 0.22/0.53  # Starting new_bool_1 with 136s (1) cores
% 0.22/0.53  # Starting sh5l with 136s (1) cores
% 0.22/0.53  # SAT001_MinMin_p005000_rr_RG with pid 16554 completed with status 0
% 0.22/0.53  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.22/0.53  # Preprocessing class: FSSSSMSMSSSNFFN.
% 0.22/0.53  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.53  # Starting G----_0031_C18_F1_SE_CS_SP_S0Y with 1500s (5) cores
% 0.22/0.53  # No SInE strategy applied
% 0.22/0.53  # Search class: FGUSF-FFSS11-SFFFFFNN
% 0.22/0.53  # partial match(1): FGHSF-FFSS11-SFFFFFNN
% 0.22/0.53  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.53  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.22/0.53  # Preprocessing time       : 0.001 s
% 0.22/0.53  # Presaturation interreduction done
% 0.22/0.53  
% 0.22/0.53  # Proof found!
% 0.22/0.53  # SZS status Theorem
% 0.22/0.53  # SZS output start CNFRefutation
% See solution above
% 0.22/0.53  # Parsed axioms                        : 5
% 0.22/0.53  # Removed by relevancy pruning/SinE    : 0
% 0.22/0.53  # Initial clauses                      : 14
% 0.22/0.53  # Removed in clause preprocessing      : 0
% 0.22/0.53  # Initial clauses in saturation        : 14
% 0.22/0.53  # Processed clauses                    : 34
% 0.22/0.53  # ...of these trivial                  : 0
% 0.22/0.53  # ...subsumed                          : 0
% 0.22/0.53  # ...remaining for further processing  : 34
% 0.22/0.53  # Other redundant clauses eliminated   : 1
% 0.22/0.53  # Clauses deleted for lack of memory   : 0
% 0.22/0.53  # Backward-subsumed                    : 0
% 0.22/0.53  # Backward-rewritten                   : 3
% 0.22/0.53  # Generated clauses                    : 13
% 0.22/0.53  # ...of the previous two non-redundant : 12
% 0.22/0.53  # ...aggressively subsumed             : 0
% 0.22/0.53  # Contextual simplify-reflections      : 0
% 0.22/0.53  # Paramodulations                      : 12
% 0.22/0.53  # Factorizations                       : 0
% 0.22/0.53  # NegExts                              : 0
% 0.22/0.53  # Equation resolutions                 : 1
% 0.22/0.53  # Total rewrite steps                  : 4
% 0.22/0.53  # Propositional unsat checks           : 0
% 0.22/0.53  #    Propositional check models        : 0
% 0.22/0.53  #    Propositional check unsatisfiable : 0
% 0.22/0.53  #    Propositional clauses             : 0
% 0.22/0.53  #    Propositional clauses after purity: 0
% 0.22/0.53  #    Propositional unsat core size     : 0
% 0.22/0.53  #    Propositional preprocessing time  : 0.000
% 0.22/0.53  #    Propositional encoding time       : 0.000
% 0.22/0.53  #    Propositional solver time         : 0.000
% 0.22/0.53  #    Success case prop preproc time    : 0.000
% 0.22/0.53  #    Success case prop encoding time   : 0.000
% 0.22/0.53  #    Success case prop solver time     : 0.000
% 0.22/0.53  # Current number of processed clauses  : 16
% 0.22/0.53  #    Positive orientable unit clauses  : 5
% 0.22/0.53  #    Positive unorientable unit clauses: 0
% 0.22/0.53  #    Negative unit clauses             : 0
% 0.22/0.53  #    Non-unit-clauses                  : 11
% 0.22/0.53  # Current number of unprocessed clauses: 5
% 0.22/0.53  # ...number of literals in the above   : 16
% 0.22/0.53  # Current number of archived formulas  : 0
% 0.22/0.53  # Current number of archived clauses   : 17
% 0.22/0.53  # Clause-clause subsumption calls (NU) : 27
% 0.22/0.53  # Rec. Clause-clause subsumption calls : 22
% 0.22/0.53  # Non-unit clause-clause subsumptions  : 0
% 0.22/0.53  # Unit Clause-clause subsumption calls : 11
% 0.22/0.53  # Rewrite failures with RHS unbound    : 0
% 0.22/0.53  # BW rewrite match attempts            : 6
% 0.22/0.53  # BW rewrite match successes           : 1
% 0.22/0.53  # Condensation attempts                : 0
% 0.22/0.53  # Condensation successes               : 0
% 0.22/0.53  # Termbank termtop insertions          : 886
% 0.22/0.53  
% 0.22/0.53  # -------------------------------------------------
% 0.22/0.53  # User time                : 0.003 s
% 0.22/0.53  # System time              : 0.003 s
% 0.22/0.53  # Total time               : 0.006 s
% 0.22/0.53  # Maximum resident set size: 1756 pages
% 0.22/0.53  
% 0.22/0.53  # -------------------------------------------------
% 0.22/0.53  # User time                : 0.011 s
% 0.22/0.53  # System time              : 0.008 s
% 0.22/0.53  # Total time               : 0.019 s
% 0.22/0.53  # Maximum resident set size: 1676 pages
% 0.22/0.53  % E---3.1 exiting
% 0.22/0.53  % E---3.1 exiting
%------------------------------------------------------------------------------