↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n028.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 19:02:12 EDT 2022

% Result   : Theorem 0.46s 29.63s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   35 (  12 unt;   0 def)
%            Number of atoms       :  114 (   0 equ)
%            Maximal formula atoms :   20 (   3 avg)
%            Number of connectives :  129 (  50   ~;  56   |;  17   &)
%                                         (   4 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   64 (  12 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(owl_prop_inverseof_ext,axiom,
    ! [X4,X7] :
      ( iext(uri_owl_inverseOf,X4,X7)
     => ( ip(X4)
        & ip(X7) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_prop_inverseof_ext) ).

fof(owl_eqdis_equivalentproperty,axiom,
    ! [X33,X34] :
      ( iext(uri_owl_equivalentProperty,X33,X34)
    <=> ( ip(X33)
        & ip(X34)
        & ! [X4,X7] :
            ( iext(X33,X4,X7)
          <=> iext(X34,X4,X7) ) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',owl_eqdis_equivalentproperty) ).

fof(premise_rdfbased_sem_inv_trans,axiom,
    ( iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2)
    & iext(uri_owl_inverseOf,uri_ex_p2,uri_ex_p1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',premise_rdfbased_sem_inv_trans) ).

fof(conclusion_rdfbased_sem_inv_trans,conjecture,
    iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',conclusion_rdfbased_sem_inv_trans) ).

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/sandbox/benchmark/Axioms/SWB001+0.ax',owl_inv) ).

fof(simple_iext_property,axiom,
    ! [X1,X2,X3] :
      ( iext(X2,X1,X3)
     => ip(X2) ),
    file('/export/starexec/sandbox/benchmark/Axioms/SWB001+0.ax',simple_iext_property) ).

fof(c_0_6,plain,
    ! [X8,X9] :
      ( ( ip(X8)
        | ~ iext(uri_owl_inverseOf,X8,X9) )
      & ( ip(X9)
        | ~ iext(uri_owl_inverseOf,X8,X9) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_prop_inverseof_ext])])]) ).

fof(c_0_7,plain,
    ! [X35,X36,X37,X38,X37,X38,X35,X36] :
      ( ( ip(X35)
        | ~ iext(uri_owl_equivalentProperty,X35,X36) )
      & ( ip(X36)
        | ~ iext(uri_owl_equivalentProperty,X35,X36) )
      & ( ~ iext(X35,X37,X38)
        | iext(X36,X37,X38)
        | ~ iext(uri_owl_equivalentProperty,X35,X36) )
      & ( ~ iext(X36,X37,X38)
        | iext(X35,X37,X38)
        | ~ iext(uri_owl_equivalentProperty,X35,X36) )
      & ( ~ iext(X35,esk117_2(X35,X36),esk118_2(X35,X36))
        | ~ iext(X36,esk117_2(X35,X36),esk118_2(X35,X36))
        | ~ ip(X35)
        | ~ ip(X36)
        | iext(uri_owl_equivalentProperty,X35,X36) )
      & ( iext(X35,esk117_2(X35,X36),esk118_2(X35,X36))
        | iext(X36,esk117_2(X35,X36),esk118_2(X35,X36))
        | ~ ip(X35)
        | ~ ip(X36)
        | iext(uri_owl_equivalentProperty,X35,X36) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_equivalentproperty])])])])])])]) ).

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

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

fof(c_0_10,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(assume_negation,[status(cth)],[conclusion_rdfbased_sem_inv_trans]) ).

fof(c_0_11,plain,
    ! [X35,X36,X37,X38,X37,X38,X35,X36] :
      ( ( ip(X35)
        | ~ iext(uri_owl_inverseOf,X35,X36) )
      & ( ip(X36)
        | ~ iext(uri_owl_inverseOf,X35,X36) )
      & ( ~ iext(X35,X37,X38)
        | iext(X36,X38,X37)
        | ~ iext(uri_owl_inverseOf,X35,X36) )
      & ( ~ iext(X36,X38,X37)
        | iext(X35,X37,X38)
        | ~ iext(uri_owl_inverseOf,X35,X36) )
      & ( ~ iext(X35,esk159_2(X35,X36),esk160_2(X35,X36))
        | ~ iext(X36,esk160_2(X35,X36),esk159_2(X35,X36))
        | ~ ip(X35)
        | ~ ip(X36)
        | iext(uri_owl_inverseOf,X35,X36) )
      & ( iext(X35,esk159_2(X35,X36),esk160_2(X35,X36))
        | iext(X36,esk160_2(X35,X36),esk159_2(X35,X36))
        | ~ ip(X35)
        | ~ ip(X36)
        | iext(uri_owl_inverseOf,X35,X36) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_inv])])])])])])]) ).

cnf(c_0_12,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | iext(X2,esk117_2(X1,X2),esk118_2(X1,X2))
    | iext(X1,esk117_2(X1,X2),esk118_2(X1,X2))
    | ~ ip(X2)
    | ~ ip(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ip(uri_ex_p1),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_15,plain,
    iext(uri_owl_inverseOf,uri_ex_p3,uri_ex_p2),
    inference(split_conjunct,[status(thm)],[premise_rdfbased_sem_inv_trans]) ).

fof(c_0_16,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(fof_simplification,[status(thm)],[c_0_10]) ).

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

cnf(c_0_18,plain,
    ( iext(uri_ex_p1,esk117_2(X1,uri_ex_p1),esk118_2(X1,uri_ex_p1))
    | iext(X1,esk117_2(X1,uri_ex_p1),esk118_2(X1,uri_ex_p1))
    | iext(uri_owl_equivalentProperty,X1,uri_ex_p1)
    | ~ ip(X1) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_19,plain,
    ip(uri_ex_p3),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_20,negated_conjecture,
    ~ iext(uri_owl_equivalentProperty,uri_ex_p3,uri_ex_p1),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

fof(c_0_22,plain,
    ! [X4,X5,X6] :
      ( ~ iext(X5,X4,X6)
      | ip(X5) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[simple_iext_property])])])]) ).

cnf(c_0_23,plain,
    ( iext(uri_ex_p2,X1,X2)
    | ~ iext(uri_ex_p1,X2,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_9]) ).

cnf(c_0_24,plain,
    ( iext(uri_ex_p3,esk117_2(uri_ex_p3,uri_ex_p1),esk118_2(uri_ex_p3,uri_ex_p1))
    | iext(uri_ex_p1,esk117_2(uri_ex_p3,uri_ex_p1),esk118_2(uri_ex_p3,uri_ex_p1)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_25,plain,
    ( iext(uri_ex_p2,X1,X2)
    | ~ iext(uri_ex_p3,X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_15]) ).

cnf(c_0_26,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | ~ ip(X2)
    | ~ ip(X1)
    | ~ iext(X2,esk117_2(X1,X2),esk118_2(X1,X2))
    | ~ iext(X1,esk117_2(X1,X2),esk118_2(X1,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,plain,
    ( ip(X1)
    | ~ iext(X1,X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_28,plain,
    ( iext(uri_ex_p1,X1,X2)
    | ~ iext(uri_ex_p2,X2,X1) ),
    inference(spm,[status(thm)],[c_0_21,c_0_9]) ).

cnf(c_0_29,plain,
    iext(uri_ex_p2,esk118_2(uri_ex_p3,uri_ex_p1),esk117_2(uri_ex_p3,uri_ex_p1)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25]) ).

cnf(c_0_30,plain,
    ( iext(uri_ex_p3,X1,X2)
    | ~ iext(uri_ex_p2,X2,X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_15]) ).

cnf(c_0_31,plain,
    ( iext(uri_owl_equivalentProperty,X1,X2)
    | ~ iext(X2,esk117_2(X1,X2),esk118_2(X1,X2))
    | ~ iext(X1,esk117_2(X1,X2),esk118_2(X1,X2)) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_26,c_0_27]),c_0_27]) ).

cnf(c_0_32,plain,
    iext(uri_ex_p1,esk117_2(uri_ex_p3,uri_ex_p1),esk118_2(uri_ex_p3,uri_ex_p1)),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,plain,
    iext(uri_ex_p3,esk117_2(uri_ex_p3,uri_ex_p1),esk118_2(uri_ex_p3,uri_ex_p1)),
    inference(spm,[status(thm)],[c_0_30,c_0_29]) ).

cnf(c_0_34,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SWB067+1 : TPTP v8.1.0. Released v5.2.0.
% 0.08/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n028.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun  1 08:23:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.41/23.47  eprover: CPU time limit exceeded, terminating
% 0.41/23.47  eprover: CPU time limit exceeded, terminating
% 0.43/23.78  eprover: CPU time limit exceeded, terminating
% 0.43/23.93  eprover: CPU time limit exceeded, terminating
% 0.46/29.63  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.46/29.63  
% 0.46/29.63  # Failure: Resource limit exceeded (time)
% 0.46/29.63  # OLD status Res
% 0.46/29.63  # Preprocessing time       : 0.117 s
% 0.46/29.63  # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.46/29.63  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.46/29.63  # Preprocessing time       : 0.014 s
% 0.46/29.63  
% 0.46/29.63  # Failure: Out of unprocessed clauses!
% 0.46/29.63  # OLD status GaveUp
% 0.46/29.63  # Parsed axioms                        : 560
% 0.46/29.63  # Removed by relevancy pruning/SinE    : 555
% 0.46/29.63  # Initial clauses                      : 11
% 0.46/29.63  # Removed in clause preprocessing      : 0
% 0.46/29.63  # Initial clauses in saturation        : 11
% 0.46/29.63  # Processed clauses                    : 14
% 0.46/29.63  # ...of these trivial                  : 0
% 0.46/29.63  # ...subsumed                          : 2
% 0.46/29.63  # ...remaining for further processing  : 12
% 0.46/29.63  # Other redundant clauses eliminated   : 0
% 0.46/29.63  # Clauses deleted for lack of memory   : 0
% 0.46/29.63  # Backward-subsumed                    : 0
% 0.46/29.63  # Backward-rewritten                   : 1
% 0.46/29.63  # Generated clauses                    : 13
% 0.46/29.63  # ...of the previous two non-trivial   : 7
% 0.46/29.63  # Contextual simplify-reflections      : 3
% 0.46/29.63  # Paramodulations                      : 13
% 0.46/29.63  # Factorizations                       : 0
% 0.46/29.63  # Equation resolutions                 : 0
% 0.46/29.63  # Current number of processed clauses  : 11
% 0.46/29.63  #    Positive orientable unit clauses  : 2
% 0.46/29.63  #    Positive unorientable unit clauses: 0
% 0.46/29.63  #    Negative unit clauses             : 1
% 0.46/29.63  #    Non-unit-clauses                  : 8
% 0.46/29.63  # Current number of unprocessed clauses: 0
% 0.46/29.63  # ...number of literals in the above   : 0
% 0.46/29.63  # Current number of archived formulas  : 0
% 0.46/29.63  # Current number of archived clauses   : 1
% 0.46/29.63  # Clause-clause subsumption calls (NU) : 42
% 0.46/29.63  # Rec. Clause-clause subsumption calls : 26
% 0.46/29.63  # Non-unit clause-clause subsumptions  : 5
% 0.46/29.63  # Unit Clause-clause subsumption calls : 2
% 0.46/29.63  # Rewrite failures with RHS unbound    : 0
% 0.46/29.63  # BW rewrite match attempts            : 1
% 0.46/29.63  # BW rewrite match successes           : 1
% 0.46/29.63  # Condensation attempts                : 0
% 0.46/29.63  # Condensation successes               : 0
% 0.46/29.63  # Termbank termtop insertions          : 7767
% 0.46/29.63  
% 0.46/29.63  # -------------------------------------------------
% 0.46/29.63  # User time                : 0.014 s
% 0.46/29.63  # System time              : 0.001 s
% 0.46/29.63  # Total time               : 0.015 s
% 0.46/29.63  # Maximum resident set size: 3728 pages
% 0.46/29.63  # Running protocol protocol_eprover_a172c605141d0894bf6fdc293a5220c6c2a32117 for 23 seconds:
% 0.46/29.63  # Preprocessing time       : 0.043 s
% 0.46/29.63  
% 0.46/29.63  # Proof found!
% 0.46/29.63  # SZS status Theorem
% 0.46/29.63  # SZS output start CNFRefutation
% See solution above
% 0.46/29.63  # Proof object total steps             : 35
% 0.46/29.63  # Proof object clause steps            : 23
% 0.46/29.63  # Proof object formula steps           : 12
% 0.46/29.63  # Proof object conjectures             : 4
% 0.46/29.63  # Proof object clause conjectures      : 1
% 0.46/29.63  # Proof object formula conjectures     : 3
% 0.46/29.63  # Proof object initial clauses used    : 10
% 0.46/29.63  # Proof object initial formulas used   : 6
% 0.46/29.63  # Proof object generating inferences   : 12
% 0.46/29.63  # Proof object simplifying inferences  : 7
% 0.46/29.63  # Training examples: 0 positive, 0 negative
% 0.46/29.63  # Parsed axioms                        : 560
% 0.46/29.63  # Removed by relevancy pruning/SinE    : 0
% 0.46/29.63  # Initial clauses                      : 1269
% 0.46/29.63  # Removed in clause preprocessing      : 111
% 0.46/29.63  # Initial clauses in saturation        : 1158
% 0.46/29.63  # Processed clauses                    : 14227
% 0.46/29.63  # ...of these trivial                  : 413
% 0.46/29.63  # ...subsumed                          : 2485
% 0.46/29.63  # ...remaining for further processing  : 11328
% 0.46/29.63  # Other redundant clauses eliminated   : 36
% 0.46/29.63  # Clauses deleted for lack of memory   : 229803
% 0.46/29.63  # Backward-subsumed                    : 31
% 0.46/29.63  # Backward-rewritten                   : 46
% 0.46/29.63  # Generated clauses                    : 372093
% 0.46/29.63  # ...of the previous two non-trivial   : 334977
% 0.46/29.63  # Contextual simplify-reflections      : 445
% 0.46/29.63  # Paramodulations                      : 369561
% 0.46/29.63  # Factorizations                       : 2496
% 0.46/29.63  # Equation resolutions                 : 36
% 0.46/29.63  # Current number of processed clauses  : 11235
% 0.46/29.63  #    Positive orientable unit clauses  : 2394
% 0.46/29.63  #    Positive unorientable unit clauses: 0
% 0.46/29.63  #    Negative unit clauses             : 5
% 0.46/29.63  #    Non-unit-clauses                  : 8836
% 0.46/29.63  # Current number of unprocessed clauses: 90932
% 0.46/29.63  # ...number of literals in the above   : 258672
% 0.46/29.63  # Current number of archived formulas  : 0
% 0.46/29.63  # Current number of archived clauses   : 78
% 0.46/29.63  # Clause-clause subsumption calls (NU) : 9658010
% 0.46/29.63  # Rec. Clause-clause subsumption calls : 7201957
% 0.46/29.63  # Non-unit clause-clause subsumptions  : 2598
% 0.46/29.63  # Unit Clause-clause subsumption calls : 1246458
% 0.46/29.63  # Rewrite failures with RHS unbound    : 0
% 0.46/29.63  # BW rewrite match attempts            : 16382
% 0.46/29.63  # BW rewrite match successes           : 21
% 0.46/29.63  # Condensation attempts                : 0
% 0.46/29.63  # Condensation successes               : 0
% 0.46/29.63  # Termbank termtop insertions          : 5937297
% 0.46/29.63  
% 0.46/29.63  # -------------------------------------------------
% 0.46/29.63  # User time                : 5.327 s
% 0.46/29.63  # System time              : 0.094 s
% 0.46/29.63  # Total time               : 5.421 s
% 0.46/29.63  # Maximum resident set size: 151296 pages
%------------------------------------------------------------------------------