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

View Problem - Process Solution

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

% Computer : n022.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:37:23 EDT 2023

% Result   : Theorem 8.10s 1.66s
% Output   : CNFRefutation 8.10s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   17 (   8 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    8 (   2 avg)
%            Number of connectives :   40 (  17   ~;  15   |;   5   &)
%                                         (   2 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-2 aty)
%            Number of variables   :   21 (   1 sgn;  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_restrict_hasself,axiom,
    ! [X11,X2,X31] :
      ( ( iext(uri_owl_hasSelf,X11,X31)
        & iext(uri_owl_onProperty,X11,X2) )
     => ! [X4] :
          ( icext(X11,X4)
        <=> iext(X2,X4,X4) ) ),
    file('/export/starexec/sandbox/tmp/tmp.Fl295xYDZ9/E---3.1_5988.p',owl_restrict_hasself) ).

fof(premise_rdfbased_sem_restrict_hasself_inst_subj,axiom,
    ( iext(uri_owl_hasSelf,uri_ex_z,literal_typed(dat_str_true,uri_xsd_boolean))
    & iext(uri_owl_onProperty,uri_ex_z,uri_ex_p)
    & iext(uri_ex_p,uri_ex_w,uri_ex_w) ),
    file('/export/starexec/sandbox/tmp/tmp.Fl295xYDZ9/E---3.1_5988.p',premise_rdfbased_sem_restrict_hasself_inst_subj) ).

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

fof(conclusion_rdfbased_sem_restrict_hasself_inst_subj,conjecture,
    iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    file('/export/starexec/sandbox/tmp/tmp.Fl295xYDZ9/E---3.1_5988.p',conclusion_rdfbased_sem_restrict_hasself_inst_subj) ).

fof(c_0_4,plain,
    ! [X531,X532,X533,X534] :
      ( ( ~ icext(X531,X534)
        | iext(X532,X534,X534)
        | ~ iext(uri_owl_hasSelf,X531,X533)
        | ~ iext(uri_owl_onProperty,X531,X532) )
      & ( ~ iext(X532,X534,X534)
        | icext(X531,X534)
        | ~ iext(uri_owl_hasSelf,X531,X533)
        | ~ iext(uri_owl_onProperty,X531,X532) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_restrict_hasself])])])]) ).

cnf(c_0_5,plain,
    ( icext(X3,X2)
    | ~ iext(X1,X2,X2)
    | ~ iext(uri_owl_hasSelf,X3,X4)
    | ~ iext(uri_owl_onProperty,X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    iext(uri_owl_hasSelf,uri_ex_z,literal_typed(dat_str_true,uri_xsd_boolean)),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

cnf(c_0_7,plain,
    ( icext(uri_ex_z,X1)
    | ~ iext(uri_owl_onProperty,uri_ex_z,X2)
    | ~ iext(X2,X1,X1) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

cnf(c_0_8,plain,
    iext(uri_owl_onProperty,uri_ex_z,uri_ex_p),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

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

cnf(c_0_10,plain,
    ( icext(uri_ex_z,X1)
    | ~ iext(uri_ex_p,X1,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_11,plain,
    iext(uri_ex_p,uri_ex_w,uri_ex_w),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_restrict_hasself_inst_subj]) ).

fof(c_0_12,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_restrict_hasself_inst_subj])]) ).

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

cnf(c_0_14,plain,
    icext(uri_ex_z,uri_ex_w),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,negated_conjecture,
    ~ iext(uri_rdf_type,uri_ex_w,uri_ex_z),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.14/0.19  % Problem    : SWB087+1 : TPTP v8.1.2. Released v5.2.0.
% 0.14/0.20  % Command    : run_E %s %d THM
% 0.20/0.42  % Computer : n022.cluster.edu
% 0.20/0.42  % Model    : x86_64 x86_64
% 0.20/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.42  % Memory   : 8042.1875MB
% 0.20/0.42  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.20/0.42  % CPULimit   : 2400
% 0.20/0.42  % WCLimit    : 300
% 0.20/0.42  % DateTime   : Mon Oct  2 20:25:54 EDT 2023
% 0.20/0.42  % CPUTime    : 
% 0.39/0.62  Running first-order theorem proving
% 0.39/0.62  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.Fl295xYDZ9/E---3.1_5988.p
% 8.10/1.66  # Version: 3.1pre001
% 8.10/1.66  # Preprocessing class: FSLMSMSLSSSNFFN.
% 8.10/1.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.66  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 8.10/1.66  # Starting new_bool_3 with 600s (2) cores
% 8.10/1.66  # Starting new_bool_1 with 600s (2) cores
% 8.10/1.66  # Starting sh5l with 300s (1) cores
% 8.10/1.66  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 6066 completed with status 0
% 8.10/1.66  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 8.10/1.66  # Preprocessing class: FSLMSMSLSSSNFFN.
% 8.10/1.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.66  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 8.10/1.66  # No SInE strategy applied
% 8.10/1.66  # Search class: FGHSM-SMLM33-SFFFFFNN
% 8.10/1.66  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 8.10/1.66  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 8.10/1.66  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 8.10/1.66  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 8.10/1.66  # Starting SAT001_CA_MinMin_p005000_rr with 82s (1) cores
% 8.10/1.66  # G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with pid 6080 completed with status 0
% 8.10/1.66  # Result found by G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI
% 8.10/1.66  # Preprocessing class: FSLMSMSLSSSNFFN.
% 8.10/1.66  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 8.10/1.66  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 900s (3) cores
% 8.10/1.66  # No SInE strategy applied
% 8.10/1.66  # Search class: FGHSM-SMLM33-SFFFFFNN
% 8.10/1.66  # partial match(1): FGHSM-SMLM33-DFFFFFNN
% 8.10/1.66  # Scheduled 6 strats onto 3 cores with 900 seconds (900 total)
% 8.10/1.66  # Starting SAT001_MinMin_p005000_rr with 487s (1) cores
% 8.10/1.66  # Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 91s (1) cores
% 8.10/1.66  # Preprocessing time       : 0.025 s
% 8.10/1.66  
% 8.10/1.66  # Proof found!
% 8.10/1.66  # SZS status Theorem
% 8.10/1.66  # SZS output start CNFRefutation
% See solution above
% 8.10/1.66  # Parsed axioms                        : 560
% 8.10/1.66  # Removed by relevancy pruning/SinE    : 0
% 8.10/1.66  # Initial clauses                      : 1270
% 8.10/1.66  # Removed in clause preprocessing      : 111
% 8.10/1.66  # Initial clauses in saturation        : 1159
% 8.10/1.66  # Processed clauses                    : 9282
% 8.10/1.66  # ...of these trivial                  : 1521
% 8.10/1.66  # ...subsumed                          : 3038
% 8.10/1.66  # ...remaining for further processing  : 4723
% 8.10/1.66  # Other redundant clauses eliminated   : 16
% 8.10/1.66  # Clauses deleted for lack of memory   : 0
% 8.10/1.66  # Backward-subsumed                    : 28
% 8.10/1.66  # Backward-rewritten                   : 0
% 8.10/1.66  # Generated clauses                    : 25062
% 8.10/1.66  # ...of the previous two non-redundant : 19128
% 8.10/1.66  # ...aggressively subsumed             : 0
% 8.10/1.66  # Contextual simplify-reflections      : 24
% 8.10/1.66  # Paramodulations                      : 25044
% 8.10/1.66  # Factorizations                       : 2
% 8.10/1.66  # NegExts                              : 0
% 8.10/1.66  # Equation resolutions                 : 16
% 8.10/1.66  # Total rewrite steps                  : 19226
% 8.10/1.66  # Propositional unsat checks           : 0
% 8.10/1.66  #    Propositional check models        : 0
% 8.10/1.66  #    Propositional check unsatisfiable : 0
% 8.10/1.66  #    Propositional clauses             : 0
% 8.10/1.66  #    Propositional clauses after purity: 0
% 8.10/1.66  #    Propositional unsat core size     : 0
% 8.10/1.66  #    Propositional preprocessing time  : 0.000
% 8.10/1.66  #    Propositional encoding time       : 0.000
% 8.10/1.66  #    Propositional solver time         : 0.000
% 8.10/1.66  #    Success case prop preproc time    : 0.000
% 8.10/1.66  #    Success case prop encoding time   : 0.000
% 8.10/1.66  #    Success case prop solver time     : 0.000
% 8.10/1.66  # Current number of processed clauses  : 4679
% 8.10/1.66  #    Positive orientable unit clauses  : 2237
% 8.10/1.66  #    Positive unorientable unit clauses: 0
% 8.10/1.66  #    Negative unit clauses             : 8
% 8.10/1.66  #    Non-unit-clauses                  : 2434
% 8.10/1.66  # Current number of unprocessed clauses: 11001
% 8.10/1.66  # ...number of literals in the above   : 55190
% 8.10/1.66  # Current number of archived formulas  : 0
% 8.10/1.66  # Current number of archived clauses   : 29
% 8.10/1.66  # Clause-clause subsumption calls (NU) : 1324558
% 8.10/1.66  # Rec. Clause-clause subsumption calls : 631991
% 8.10/1.66  # Non-unit clause-clause subsumptions  : 3079
% 8.10/1.66  # Unit Clause-clause subsumption calls : 358179
% 8.10/1.66  # Rewrite failures with RHS unbound    : 0
% 8.10/1.66  # BW rewrite match attempts            : 1483
% 8.10/1.66  # BW rewrite match successes           : 0
% 8.10/1.66  # Condensation attempts                : 0
% 8.10/1.66  # Condensation successes               : 0
% 8.10/1.66  # Termbank termtop insertions          : 438310
% 8.10/1.66  
% 8.10/1.66  # -------------------------------------------------
% 8.10/1.66  # User time                : 0.977 s
% 8.10/1.66  # System time              : 0.032 s
% 8.10/1.66  # Total time               : 1.009 s
% 8.10/1.66  # Maximum resident set size: 5744 pages
% 8.10/1.66  
% 8.10/1.66  # -------------------------------------------------
% 8.10/1.66  # User time                : 2.818 s
% 8.10/1.66  # System time              : 0.084 s
% 8.10/1.66  # Total time               : 2.902 s
% 8.10/1.66  # Maximum resident set size: 2232 pages
% 8.10/1.66  % E---3.1 exiting
% 8.10/1.67  % E---3.1 exiting
%------------------------------------------------------------------------------