TSTP Solution File: SWB047+1 by E---3.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.2.0
% Problem  : SWB047+1 : TPTP v8.2.0. 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 : 300s
% WCLimit  : 300s
% DateTime : Mon Jun 24 16:07:06 EDT 2024

% Result   : Theorem 11.71s 1.98s
% Output   : CNFRefutation 11.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   36 (  11 unt;   0 def)
%            Number of atoms       :  127 (  12 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  142 (  51   ~;  60   |;  23   &)
%                                         (   5 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :   14 (  14 usr;   6 con; 0-2 aty)
%            Number of variables   :   61 (   1 sgn  38   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rdfs_cext_def,axiom,
    ! [X4,X5] :
      ( iext(uri_rdf_type,X4,X5)
    <=> icext(X5,X4) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',rdfs_cext_def) ).

fof(owl_inv,axiom,
    ! [X33,X34] :
      ( iext(uri_owl_inverseOf,X33,X34)
    <=> ( ip(X33)
        & ip(X34)
        & ! [X4,X7] :
            ( iext(X33,X4,X7)
          <=> iext(X34,X7,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',owl_inv) ).

fof(owl_prop_inverseof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_inverseOf,X4,X7)
     => ( ip(X4)
        & ip(X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',owl_prop_inverseof_ext) ).

fof(owl_char_functional,axiom,
    ! [X2] :
      ( icext(uri_owl_FunctionalProperty,X2)
    <=> ( ip(X2)
        & ! [X4,X27,X28] :
            ( ( iext(X2,X4,X27)
              & iext(X2,X4,X28) )
           => X27 = X28 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',owl_char_functional) ).

fof(premise_rdfbased_sem_char_inversefunc_term,axiom,
    ( iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1)
    & iext(uri_rdf_type,uri_ex_p1,uri_owl_FunctionalProperty) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',premise_rdfbased_sem_char_inversefunc_term) ).

fof(owl_char_inversefunctional,axiom,
    ! [X2] :
      ( icext(uri_owl_InverseFunctionalProperty,X2)
    <=> ( ip(X2)
        & ! [X37,X38,X7] :
            ( ( iext(X2,X37,X7)
              & iext(X2,X38,X7) )
           => X37 = X38 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',owl_char_inversefunctional) ).

fof(conclusion_rdfbased_sem_char_inversefunc_term,conjecture,
    iext(uri_rdf_type,uri_ex_p2,uri_owl_InverseFunctionalProperty),
    file('/export/starexec/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p',conclusion_rdfbased_sem_char_inversefunc_term) ).

fof(c_0_7,plain,
    ! [X48,X49] :
      ( ( ~ iext(uri_rdf_type,X48,X49)
        | icext(X49,X48) )
      & ( ~ icext(X49,X48)
        | iext(uri_rdf_type,X48,X49) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])])]) ).

fof(c_0_8,plain,
    ! [X1014,X1015,X1016,X1017,X1018,X1019,X1020,X1021] :
      ( ( ip(X1014)
        | ~ iext(uri_owl_inverseOf,X1014,X1015) )
      & ( ip(X1015)
        | ~ iext(uri_owl_inverseOf,X1014,X1015) )
      & ( ~ iext(X1014,X1016,X1017)
        | iext(X1015,X1017,X1016)
        | ~ iext(uri_owl_inverseOf,X1014,X1015) )
      & ( ~ iext(X1015,X1019,X1018)
        | iext(X1014,X1018,X1019)
        | ~ iext(uri_owl_inverseOf,X1014,X1015) )
      & ( ~ iext(X1020,esk159_2(X1020,X1021),esk160_2(X1020,X1021))
        | ~ iext(X1021,esk160_2(X1020,X1021),esk159_2(X1020,X1021))
        | ~ ip(X1020)
        | ~ ip(X1021)
        | iext(uri_owl_inverseOf,X1020,X1021) )
      & ( iext(X1020,esk159_2(X1020,X1021),esk160_2(X1020,X1021))
        | iext(X1021,esk160_2(X1020,X1021),esk159_2(X1020,X1021))
        | ~ ip(X1020)
        | ~ ip(X1021)
        | iext(uri_owl_inverseOf,X1020,X1021) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_inv])])])])])])]) ).

fof(c_0_9,plain,
    ! [X194,X195] :
      ( ( ip(X194)
        | ~ iext(uri_owl_inverseOf,X194,X195) )
      & ( ip(X195)
        | ~ iext(uri_owl_inverseOf,X194,X195) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_inverseof_ext])])])]) ).

fof(c_0_10,plain,
    ! [X1030,X1031,X1032,X1033,X1034] :
      ( ( ip(X1030)
        | ~ icext(uri_owl_FunctionalProperty,X1030) )
      & ( ~ iext(X1030,X1031,X1032)
        | ~ iext(X1030,X1031,X1033)
        | X1032 = X1033
        | ~ icext(uri_owl_FunctionalProperty,X1030) )
      & ( iext(X1034,esk163_1(X1034),esk164_1(X1034))
        | ~ ip(X1034)
        | icext(uri_owl_FunctionalProperty,X1034) )
      & ( iext(X1034,esk163_1(X1034),esk165_1(X1034))
        | ~ ip(X1034)
        | icext(uri_owl_FunctionalProperty,X1034) )
      & ( esk164_1(X1034) != esk165_1(X1034)
        | ~ ip(X1034)
        | icext(uri_owl_FunctionalProperty,X1034) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_functional])])])])])])]) ).

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

cnf(c_0_12,plain,
    iext(uri_rdf_type,uri_ex_p1,uri_owl_FunctionalProperty),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_char_inversefunc_term]) ).

cnf(c_0_13,plain,
    ( iext(X4,X3,X2)
    | ~ iext(X1,X2,X3)
    | ~ iext(uri_owl_inverseOf,X1,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_14,plain,
    iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_char_inversefunc_term]) ).

fof(c_0_15,plain,
    ! [X1038,X1039,X1040,X1041,X1042] :
      ( ( ip(X1038)
        | ~ icext(uri_owl_InverseFunctionalProperty,X1038) )
      & ( ~ iext(X1038,X1039,X1041)
        | ~ iext(X1038,X1040,X1041)
        | X1039 = X1040
        | ~ icext(uri_owl_InverseFunctionalProperty,X1038) )
      & ( iext(X1042,esk166_1(X1042),esk168_1(X1042))
        | ~ ip(X1042)
        | icext(uri_owl_InverseFunctionalProperty,X1042) )
      & ( iext(X1042,esk167_1(X1042),esk168_1(X1042))
        | ~ ip(X1042)
        | icext(uri_owl_InverseFunctionalProperty,X1042) )
      & ( esk166_1(X1042) != esk167_1(X1042)
        | ~ ip(X1042)
        | icext(uri_owl_InverseFunctionalProperty,X1042) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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])])])])])])]) ).

cnf(c_0_16,plain,
    ( ip(X1)
    | ~ iext(uri_owl_inverseOf,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,plain,
    ( X3 = X4
    | ~ iext(X1,X2,X3)
    | ~ iext(X1,X2,X4)
    | ~ icext(uri_owl_FunctionalProperty,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    icext(uri_owl_FunctionalProperty,uri_ex_p1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_19,plain,
    ( iext(uri_ex_p1,X1,X2)
    | ~ iext(uri_ex_p2,X2,X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_20,plain,
    ( iext(X1,esk167_1(X1),esk168_1(X1))
    | icext(uri_owl_InverseFunctionalProperty,X1)
    | ~ ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_21,plain,
    ip(uri_ex_p2),
    inference(spm,[status(thm)],[c_0_16,c_0_14]) ).

cnf(c_0_22,plain,
    ( X1 = X2
    | ~ iext(uri_ex_p1,X3,X2)
    | ~ iext(uri_ex_p1,X3,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_23,plain,
    ( icext(uri_owl_InverseFunctionalProperty,uri_ex_p2)
    | iext(uri_ex_p1,esk168_1(uri_ex_p2),esk167_1(uri_ex_p2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]) ).

cnf(c_0_24,plain,
    ( iext(X1,esk166_1(X1),esk168_1(X1))
    | icext(uri_owl_InverseFunctionalProperty,X1)
    | ~ ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_25,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p2,uri_owl_InverseFunctionalProperty),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_char_inversefunc_term])]) ).

cnf(c_0_26,plain,
    ( X1 = esk167_1(uri_ex_p2)
    | icext(uri_owl_InverseFunctionalProperty,uri_ex_p2)
    | ~ iext(uri_ex_p1,esk168_1(uri_ex_p2),X1) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_27,plain,
    ( icext(uri_owl_InverseFunctionalProperty,uri_ex_p2)
    | iext(uri_ex_p1,esk168_1(uri_ex_p2),esk166_1(uri_ex_p2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_24]),c_0_21])]) ).

fof(c_0_28,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p2,uri_owl_InverseFunctionalProperty),
    inference(fof_nnf,[status(thm)],[c_0_25]) ).

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

cnf(c_0_30,plain,
    ( esk167_1(uri_ex_p2) = esk166_1(uri_ex_p2)
    | icext(uri_owl_InverseFunctionalProperty,uri_ex_p2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_p2,uri_owl_InverseFunctionalProperty),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_32,plain,
    ( icext(uri_owl_InverseFunctionalProperty,X1)
    | esk166_1(X1) != esk167_1(X1)
    | ~ ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_33,plain,
    esk167_1(uri_ex_p2) = esk166_1(uri_ex_p2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).

cnf(c_0_34,plain,
    icext(uri_owl_InverseFunctionalProperty,uri_ex_p2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_21])]) ).

cnf(c_0_35,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_34]),c_0_31]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SWB047+1 : TPTP v8.2.0. Released v5.2.0.
% 0.03/0.12  % Command    : run_E %s %d THM
% 0.12/0.35  % Computer : n013.cluster.edu
% 0.12/0.35  % Model    : x86_64 x86_64
% 0.12/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.35  % Memory   : 8042.1875MB
% 0.12/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.35  % CPULimit   : 300
% 0.12/0.35  % WCLimit    : 300
% 0.12/0.35  % DateTime   : Tue Jun 18 17:36:24 EDT 2024
% 0.12/0.35  % CPUTime    : 
% 0.20/0.51  Running first-order theorem proving
% 0.20/0.51  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.qNk7hJ0cPq/E---3.1_9040.p
% 11.71/1.98  # Version: 3.2.0
% 11.71/1.98  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.71/1.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/1.98  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.71/1.98  # Starting new_bool_3 with 600s (2) cores
% 11.71/1.98  # Starting new_bool_1 with 600s (2) cores
% 11.71/1.98  # Starting sh5l with 300s (1) cores
% 11.71/1.98  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 9119 completed with status 0
% 11.71/1.98  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.71/1.98  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.71/1.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/1.98  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.71/1.98  # No SInE strategy applied
% 11.71/1.98  # Search class: FGHSM-SMLM33-SFFFFFNN
% 11.71/1.98  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.71/1.98  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 11.71/1.98  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 11.71/1.98  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.71/1.98  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 11.71/1.98  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 9133 completed with status 0
% 11.71/1.98  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 11.71/1.98  # Preprocessing class: FSLMSMSLSSSNFFN.
% 11.71/1.98  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.71/1.98  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 11.71/1.98  # No SInE strategy applied
% 11.71/1.98  # Search class: FGHSM-SMLM33-SFFFFFNN
% 11.71/1.98  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 11.71/1.98  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 11.71/1.98  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 11.71/1.98  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 11.71/1.98  # Preprocessing time       : 0.016 s
% 11.71/1.98  
% 11.71/1.98  # Proof found!
% 11.71/1.98  # SZS status Theorem
% 11.71/1.98  # SZS output start CNFRefutation
% See solution above
% 11.71/1.98  # Parsed axioms                        : 560
% 11.71/1.98  # Removed by relevancy pruning/SinE    : 0
% 11.71/1.98  # Initial clauses                      : 1269
% 11.71/1.98  # Removed in clause preprocessing      : 111
% 11.71/1.98  # Initial clauses in saturation        : 1158
% 11.71/1.98  # Processed clauses                    : 11223
% 11.71/1.98  # ...of these trivial                  : 1543
% 11.71/1.98  # ...subsumed                          : 4172
% 11.71/1.98  # ...remaining for further processing  : 5508
% 11.71/1.98  # Other redundant clauses eliminated   : 16
% 11.71/1.98  # Clauses deleted for lack of memory   : 0
% 11.71/1.98  # Backward-subsumed                    : 35
% 11.71/1.98  # Backward-rewritten                   : 12
% 11.71/1.98  # Generated clauses                    : 28901
% 11.71/1.98  # ...of the previous two non-redundant : 22285
% 11.71/1.98  # ...aggressively subsumed             : 0
% 11.71/1.98  # Contextual simplify-reflections      : 29
% 11.71/1.98  # Paramodulations                      : 28883
% 11.71/1.98  # Factorizations                       : 2
% 11.71/1.98  # NegExts                              : 0
% 11.71/1.98  # Equation resolutions                 : 16
% 11.71/1.98  # Disequality decompositions           : 0
% 11.71/1.98  # Total rewrite steps                  : 20925
% 11.71/1.98  # ...of those cached                   : 19565
% 11.71/1.98  # Propositional unsat checks           : 0
% 11.71/1.98  #    Propositional check models        : 0
% 11.71/1.98  #    Propositional check unsatisfiable : 0
% 11.71/1.98  #    Propositional clauses             : 0
% 11.71/1.98  #    Propositional clauses after purity: 0
% 11.71/1.98  #    Propositional unsat core size     : 0
% 11.71/1.98  #    Propositional preprocessing time  : 0.000
% 11.71/1.98  #    Propositional encoding time       : 0.000
% 11.71/1.98  #    Propositional solver time         : 0.000
% 11.71/1.98  #    Success case prop preproc time    : 0.000
% 11.71/1.98  #    Success case prop encoding time   : 0.000
% 11.71/1.98  #    Success case prop solver time     : 0.000
% 11.71/1.98  # Current number of processed clauses  : 5445
% 11.71/1.98  #    Positive orientable unit clauses  : 2222
% 11.71/1.98  #    Positive unorientable unit clauses: 0
% 11.71/1.98  #    Negative unit clauses             : 8
% 11.71/1.98  #    Non-unit-clauses                  : 3215
% 11.71/1.98  # Current number of unprocessed clauses: 12219
% 11.71/1.98  # ...number of literals in the above   : 59383
% 11.71/1.98  # Current number of archived formulas  : 0
% 11.71/1.98  # Current number of archived clauses   : 48
% 11.71/1.98  # Clause-clause subsumption calls (NU) : 1634807
% 11.71/1.98  # Rec. Clause-clause subsumption calls : 835853
% 11.71/1.98  # Non-unit clause-clause subsumptions  : 4217
% 11.71/1.98  # Unit Clause-clause subsumption calls : 823033
% 11.71/1.98  # Rewrite failures with RHS unbound    : 0
% 11.71/1.98  # BW rewrite match attempts            : 1494
% 11.71/1.98  # BW rewrite match successes           : 2
% 11.71/1.98  # Condensation attempts                : 0
% 11.71/1.98  # Condensation successes               : 0
% 11.71/1.98  # Termbank termtop insertions          : 486204
% 11.71/1.98  # Search garbage collected termcells   : 19088
% 11.71/1.98  
% 11.71/1.98  # -------------------------------------------------
% 11.71/1.98  # User time                : 1.353 s
% 11.71/1.98  # System time              : 0.032 s
% 11.71/1.98  # Total time               : 1.385 s
% 11.71/1.98  # Maximum resident set size: 5768 pages
% 11.71/1.98  
% 11.71/1.98  # -------------------------------------------------
% 11.71/1.98  # User time                : 4.022 s
% 11.71/1.98  # System time              : 0.138 s
% 11.71/1.98  # Total time               : 4.159 s
% 11.71/1.98  # Maximum resident set size: 2228 pages
% 11.71/1.98  % E---3.1 exiting
% 11.71/1.98  % E exiting
%------------------------------------------------------------------------------