TSTP Solution File: SWB024+1 by E---3.1

View Problem - Process Solution

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

% Computer : n026.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:36:54 EDT 2023

% Result   : Theorem 6.95s 1.46s
% Output   : CNFRefutation 6.95s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   34 (  12 unt;   0 def)
%            Number of atoms       :  108 (   0 equ)
%            Maximal formula atoms :   15 (   3 avg)
%            Number of connectives :  114 (  40   ~;  38   |;  29   &)
%                                         (   3 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :   18 (  18 usr;  13 con; 0-3 aty)
%            Number of variables   :   51 (   0 sgn;  28   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(rdfs_subclassof_main,axiom,
    ! [X5,X6] :
      ( iext(uri_rdfs_subClassOf,X5,X6)
     => ( ic(X5)
        & ic(X6)
        & ! [X4] :
            ( icext(X5,X4)
           => icext(X6,X4) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iFk7MFyKeS/E---3.1_16844.p',rdfs_subclassof_main) ).

fof(testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties,axiom,
    ? [X43] :
      ( iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty)
      & iext(uri_rdfs_subClassOf,uri_ex_Person,X43)
      & iext(uri_rdf_type,X43,uri_owl_Restriction)
      & iext(uri_owl_onProperty,X43,uri_ex_hasAncestor)
      & iext(uri_owl_minCardinality,X43,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
      & iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
      & iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
      & iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) ),
    file('/export/starexec/sandbox2/tmp/tmp.iFk7MFyKeS/E---3.1_16844.p',testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).

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

fof(owl_restrict_mincard_001,axiom,
    ! [X11,X2] :
      ( ( iext(uri_owl_minCardinality,X11,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
        & iext(uri_owl_onProperty,X11,X2) )
     => ! [X4] :
          ( icext(X11,X4)
        <=> ? [X7] : iext(X2,X4,X7) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iFk7MFyKeS/E---3.1_16844.p',owl_restrict_mincard_001) ).

fof(owl_char_transitive,axiom,
    ! [X2] :
      ( icext(uri_owl_TransitiveProperty,X2)
    <=> ( ip(X2)
        & ! [X4,X7,X11] :
            ( ( iext(X2,X4,X7)
              & iext(X2,X7,X11) )
           => iext(X2,X4,X11) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.iFk7MFyKeS/E---3.1_16844.p',owl_char_transitive) ).

fof(testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties,conjecture,
    ? [X42] :
      ( iext(uri_ex_hasAncestor,uri_ex_bob,X42)
      & iext(uri_ex_hasAncestor,uri_ex_alice,X42) ),
    file('/export/starexec/sandbox2/tmp/tmp.iFk7MFyKeS/E---3.1_16844.p',testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties) ).

fof(c_0_6,plain,
    ! [X66,X67,X68] :
      ( ( ic(X66)
        | ~ iext(uri_rdfs_subClassOf,X66,X67) )
      & ( ic(X67)
        | ~ iext(uri_rdfs_subClassOf,X66,X67) )
      & ( ~ icext(X66,X68)
        | icext(X67,X68)
        | ~ iext(uri_rdfs_subClassOf,X66,X67) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_subclassof_main])])])]) ).

fof(c_0_7,plain,
    ( iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty)
    & iext(uri_rdfs_subClassOf,uri_ex_Person,esk192_0)
    & iext(uri_rdf_type,esk192_0,uri_owl_Restriction)
    & iext(uri_owl_onProperty,esk192_0,uri_ex_hasAncestor)
    & iext(uri_owl_minCardinality,esk192_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
    & iext(uri_rdf_type,uri_ex_alice,uri_ex_Person)
    & iext(uri_rdf_type,uri_ex_bob,uri_ex_Person)
    & iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[testcase_premise_fullish_024_Cardinality_Restrictions_on_Complex_Properties])]) ).

fof(c_0_8,plain,
    ! [X50,X51] :
      ( ( ~ iext(uri_rdf_type,X50,X51)
        | icext(X51,X50) )
      & ( ~ icext(X51,X50)
        | iext(uri_rdf_type,X50,X51) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdfs_cext_def])]) ).

fof(c_0_9,plain,
    ! [X660,X661,X662,X664,X665] :
      ( ( ~ icext(X660,X662)
        | iext(X661,X662,esk86_3(X660,X661,X662))
        | ~ iext(uri_owl_minCardinality,X660,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
        | ~ iext(uri_owl_onProperty,X660,X661) )
      & ( ~ iext(X661,X664,X665)
        | icext(X660,X664)
        | ~ iext(uri_owl_minCardinality,X660,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
        | ~ iext(uri_owl_onProperty,X660,X661) ) ),
    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_restrict_mincard_001])])])])])]) ).

cnf(c_0_10,plain,
    ( icext(X3,X2)
    | ~ icext(X1,X2)
    | ~ iext(uri_rdfs_subClassOf,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    iext(uri_rdfs_subClassOf,uri_ex_Person,esk192_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

cnf(c_0_13,plain,
    iext(uri_rdf_type,uri_ex_bob,uri_ex_Person),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_14,plain,
    ! [X1062,X1063,X1064,X1065,X1066] :
      ( ( ip(X1062)
        | ~ icext(uri_owl_TransitiveProperty,X1062) )
      & ( ~ iext(X1062,X1063,X1064)
        | ~ iext(X1062,X1064,X1065)
        | iext(X1062,X1063,X1065)
        | ~ icext(uri_owl_TransitiveProperty,X1062) )
      & ( iext(X1066,esk173_1(X1066),esk174_1(X1066))
        | ~ ip(X1066)
        | icext(uri_owl_TransitiveProperty,X1066) )
      & ( iext(X1066,esk174_1(X1066),esk175_1(X1066))
        | ~ ip(X1066)
        | icext(uri_owl_TransitiveProperty,X1066) )
      & ( ~ iext(X1066,esk173_1(X1066),esk175_1(X1066))
        | ~ ip(X1066)
        | icext(uri_owl_TransitiveProperty,X1066) ) ),
    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_transitive])])])])])]) ).

cnf(c_0_15,plain,
    iext(uri_rdf_type,uri_ex_hasAncestor,uri_owl_TransitiveProperty),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_16,plain,
    ( iext(X3,X2,esk86_3(X1,X3,X2))
    | ~ icext(X1,X2)
    | ~ iext(uri_owl_minCardinality,X1,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger))
    | ~ iext(uri_owl_onProperty,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,plain,
    iext(uri_owl_onProperty,esk192_0,uri_ex_hasAncestor),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_18,plain,
    iext(uri_owl_minCardinality,esk192_0,literal_typed(dat_str_1,uri_xsd_nonNegativeInteger)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,plain,
    ( icext(esk192_0,X1)
    | ~ icext(uri_ex_Person,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_20,plain,
    icext(uri_ex_Person,uri_ex_bob),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_21,negated_conjecture,
    ~ ? [X42] :
        ( iext(uri_ex_hasAncestor,uri_ex_bob,X42)
        & iext(uri_ex_hasAncestor,uri_ex_alice,X42) ),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_024_Cardinality_Restrictions_on_Complex_Properties]) ).

cnf(c_0_22,plain,
    ( iext(X1,X2,X4)
    | ~ iext(X1,X2,X3)
    | ~ iext(X1,X3,X4)
    | ~ icext(uri_owl_TransitiveProperty,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_23,plain,
    icext(uri_owl_TransitiveProperty,uri_ex_hasAncestor),
    inference(spm,[status(thm)],[c_0_12,c_0_15]) ).

cnf(c_0_24,plain,
    ( iext(uri_ex_hasAncestor,X1,esk86_3(esk192_0,uri_ex_hasAncestor,X1))
    | ~ icext(esk192_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).

cnf(c_0_25,plain,
    icext(esk192_0,uri_ex_bob),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_26,negated_conjecture,
    ! [X1250] :
      ( ~ iext(uri_ex_hasAncestor,uri_ex_bob,X1250)
      | ~ iext(uri_ex_hasAncestor,uri_ex_alice,X1250) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])]) ).

cnf(c_0_27,plain,
    ( iext(uri_ex_hasAncestor,X1,X2)
    | ~ iext(uri_ex_hasAncestor,X3,X2)
    | ~ iext(uri_ex_hasAncestor,X1,X3) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,plain,
    iext(uri_ex_hasAncestor,uri_ex_bob,esk86_3(esk192_0,uri_ex_hasAncestor,uri_ex_bob)),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ iext(uri_ex_hasAncestor,uri_ex_bob,X1)
    | ~ iext(uri_ex_hasAncestor,uri_ex_alice,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_30,plain,
    ( iext(uri_ex_hasAncestor,X1,esk86_3(esk192_0,uri_ex_hasAncestor,uri_ex_bob))
    | ~ iext(uri_ex_hasAncestor,X1,uri_ex_bob) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    iext(uri_ex_hasAncestor,uri_ex_alice,uri_ex_bob),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_32,negated_conjecture,
    ~ iext(uri_ex_hasAncestor,uri_ex_alice,esk86_3(esk192_0,uri_ex_hasAncestor,uri_ex_bob)),
    inference(spm,[status(thm)],[c_0_29,c_0_28]) ).

cnf(c_0_33,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.16  % Problem    : SWB024+1 : TPTP v8.1.2. Released v5.2.0.
% 0.10/0.17  % Command    : run_E %s %d THM
% 0.24/0.38  % Computer : n026.cluster.edu
% 0.24/0.38  % Model    : x86_64 x86_64
% 0.24/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.38  % Memory   : 8042.1875MB
% 0.24/0.38  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.24/0.38  % CPULimit   : 2400
% 0.24/0.38  % WCLimit    : 300
% 0.24/0.38  % DateTime   : Mon Oct  2 20:44:59 EDT 2023
% 0.24/0.39  % CPUTime    : 
% 0.24/0.56  Running first-order theorem proving
% 0.24/0.56  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.iFk7MFyKeS/E---3.1_16844.p
% 6.95/1.46  # Version: 3.1pre001
% 6.95/1.46  # Preprocessing class: FSLMSMSLSSSNFFN.
% 6.95/1.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.95/1.46  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 6.95/1.46  # Starting new_bool_3 with 600s (2) cores
% 6.95/1.46  # Starting new_bool_1 with 600s (2) cores
% 6.95/1.46  # Starting sh5l with 300s (1) cores
% 6.95/1.46  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 16930 completed with status 0
% 6.95/1.46  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 6.95/1.46  # Preprocessing class: FSLMSMSLSSSNFFN.
% 6.95/1.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.95/1.46  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 6.95/1.46  # No SInE strategy applied
% 6.95/1.46  # Search class: FGHSM-SMLM33-SFFFFFNN
% 6.95/1.46  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 6.95/1.46  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 6.95/1.46  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 6.95/1.46  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 6.95/1.46  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 6.95/1.46  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 16944 completed with status 0
% 6.95/1.46  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 6.95/1.46  # Preprocessing class: FSLMSMSLSSSNFFN.
% 6.95/1.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.95/1.46  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 6.95/1.46  # No SInE strategy applied
% 6.95/1.46  # Search class: FGHSM-SMLM33-SFFFFFNN
% 6.95/1.46  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 6.95/1.46  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 6.95/1.46  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 6.95/1.46  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 6.95/1.46  # Preprocessing time       : 0.011 s
% 6.95/1.46  
% 6.95/1.46  # Proof found!
% 6.95/1.46  # SZS status Theorem
% 6.95/1.46  # SZS output start CNFRefutation
% See solution above
% 6.95/1.46  # Parsed axioms                        : 560
% 6.95/1.46  # Removed by relevancy pruning/SinE    : 0
% 6.95/1.46  # Initial clauses                      : 1275
% 6.95/1.46  # Removed in clause preprocessing      : 111
% 6.95/1.46  # Initial clauses in saturation        : 1164
% 6.95/1.46  # Processed clauses                    : 9639
% 6.95/1.46  # ...of these trivial                  : 1497
% 6.95/1.46  # ...subsumed                          : 3166
% 6.95/1.46  # ...remaining for further processing  : 4976
% 6.95/1.46  # Other redundant clauses eliminated   : 16
% 6.95/1.46  # Clauses deleted for lack of memory   : 0
% 6.95/1.46  # Backward-subsumed                    : 36
% 6.95/1.46  # Backward-rewritten                   : 0
% 6.95/1.46  # Generated clauses                    : 26248
% 6.95/1.46  # ...of the previous two non-redundant : 20066
% 6.95/1.46  # ...aggressively subsumed             : 0
% 6.95/1.46  # Contextual simplify-reflections      : 26
% 6.95/1.46  # Paramodulations                      : 26230
% 6.95/1.46  # Factorizations                       : 2
% 6.95/1.46  # NegExts                              : 0
% 6.95/1.46  # Equation resolutions                 : 16
% 6.95/1.46  # Total rewrite steps                  : 19911
% 6.95/1.46  # Propositional unsat checks           : 0
% 6.95/1.46  #    Propositional check models        : 0
% 6.95/1.46  #    Propositional check unsatisfiable : 0
% 6.95/1.46  #    Propositional clauses             : 0
% 6.95/1.46  #    Propositional clauses after purity: 0
% 6.95/1.46  #    Propositional unsat core size     : 0
% 6.95/1.46  #    Propositional preprocessing time  : 0.000
% 6.95/1.46  #    Propositional encoding time       : 0.000
% 6.95/1.46  #    Propositional solver time         : 0.000
% 6.95/1.46  #    Success case prop preproc time    : 0.000
% 6.95/1.46  #    Success case prop encoding time   : 0.000
% 6.95/1.46  #    Success case prop solver time     : 0.000
% 6.95/1.46  # Current number of processed clauses  : 4924
% 6.95/1.46  #    Positive orientable unit clauses  : 2276
% 6.95/1.46  #    Positive unorientable unit clauses: 0
% 6.95/1.46  #    Negative unit clauses             : 8
% 6.95/1.46  #    Non-unit-clauses                  : 2640
% 6.95/1.46  # Current number of unprocessed clauses: 11591
% 6.95/1.46  # ...number of literals in the above   : 57187
% 6.95/1.46  # Current number of archived formulas  : 0
% 6.95/1.46  # Current number of archived clauses   : 37
% 6.95/1.46  # Clause-clause subsumption calls (NU) : 1421510
% 6.95/1.46  # Rec. Clause-clause subsumption calls : 697580
% 6.95/1.46  # Non-unit clause-clause subsumptions  : 3207
% 6.95/1.46  # Unit Clause-clause subsumption calls : 380991
% 6.95/1.46  # Rewrite failures with RHS unbound    : 0
% 6.95/1.46  # BW rewrite match attempts            : 1504
% 6.95/1.46  # BW rewrite match successes           : 0
% 6.95/1.46  # Condensation attempts                : 0
% 6.95/1.46  # Condensation successes               : 0
% 6.95/1.46  # Termbank termtop insertions          : 452842
% 6.95/1.46  
% 6.95/1.46  # -------------------------------------------------
% 6.95/1.46  # User time                : 0.784 s
% 6.95/1.46  # System time              : 0.029 s
% 6.95/1.46  # Total time               : 0.813 s
% 6.95/1.46  # Maximum resident set size: 5748 pages
% 6.95/1.46  
% 6.95/1.46  # -------------------------------------------------
% 6.95/1.46  # User time                : 2.252 s
% 6.95/1.46  # System time              : 0.073 s
% 6.95/1.46  # Total time               : 2.324 s
% 6.95/1.46  # Maximum resident set size: 2236 pages
% 6.95/1.46  % E---3.1 exiting
% 6.95/1.46  % E---3.1 exiting
%------------------------------------------------------------------------------