TSTP Solution File: SWB015+2 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWB015+2 : TPTP v8.1.0. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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 : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 19:01:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(testcase_conclusion_fullish_015_Reflective_Tautologies_I,conjecture,
    iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',testcase_conclusion_fullish_015_Reflective_Tautologies_I) ).

fof(owl_eqdis_sameas,axiom,
    ! [X1,X2] :
      ( iext(uri_owl_sameAs,X1,X2)
    <=> X1 = X2 ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',owl_eqdis_sameas) ).

fof(c_0_2,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    inference(assume_negation,[status(cth)],[testcase_conclusion_fullish_015_Reflective_Tautologies_I]) ).

fof(c_0_3,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ iext(uri_owl_sameAs,X3,X4)
        | X3 = X4 )
      & ( X3 != X4
        | iext(uri_owl_sameAs,X3,X4) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[owl_eqdis_sameas])])])]) ).

fof(c_0_4,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

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

cnf(c_0_6,negated_conjecture,
    ~ iext(uri_owl_sameAs,uri_owl_sameAs,uri_owl_sameAs),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,plain,
    iext(uri_owl_sameAs,X1,X1),
    inference(er,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SWB015+2 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n022.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 00:28:52 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.013 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 9
% 0.22/1.41  # Proof object clause steps            : 4
% 0.22/1.41  # Proof object formula steps           : 5
% 0.22/1.41  # Proof object conjectures             : 5
% 0.22/1.41  # Proof object clause conjectures      : 2
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 2
% 0.22/1.41  # Proof object initial formulas used   : 2
% 0.22/1.41  # Proof object generating inferences   : 0
% 0.22/1.41  # Proof object simplifying inferences  : 3
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 2
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.22/1.41  # Initial clauses                      : 3
% 0.22/1.41  # Removed in clause preprocessing      : 0
% 0.22/1.41  # Initial clauses in saturation        : 3
% 0.22/1.41  # Processed clauses                    : 4
% 0.22/1.41  # ...of these trivial                  : 0
% 0.22/1.41  # ...subsumed                          : 0
% 0.22/1.41  # ...remaining for further processing  : 4
% 0.22/1.41  # Other redundant clauses eliminated   : 1
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 0
% 0.22/1.41  # Backward-rewritten                   : 1
% 0.22/1.41  # Generated clauses                    : 1
% 0.22/1.41  # ...of the previous two non-trivial   : 1
% 0.22/1.41  # Contextual simplify-reflections      : 0
% 0.22/1.41  # Paramodulations                      : 0
% 0.22/1.41  # Factorizations                       : 0
% 0.22/1.41  # Equation resolutions                 : 1
% 0.22/1.41  # Current number of processed clauses  : 2
% 0.22/1.41  #    Positive orientable unit clauses  : 1
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 0
% 0.22/1.41  #    Non-unit-clauses                  : 1
% 0.22/1.41  # Current number of unprocessed clauses: 0
% 0.22/1.41  # ...number of literals in the above   : 0
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 1
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 0
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 0
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 0
% 0.22/1.41  # Unit Clause-clause subsumption calls : 0
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 2
% 0.22/1.41  # BW rewrite match successes           : 1
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 115
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.012 s
% 0.22/1.41  # System time              : 0.001 s
% 0.22/1.41  # Total time               : 0.013 s
% 0.22/1.41  # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------