↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n019.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.29s 1.47s
% Output   : CNFRefutation 0.29s
% 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,
    ! [X4,X7] :
      ( iext(uri_owl_sameAs,X4,X7)
    <=> X4 = X7 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWB001+0.ax',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,
    ! [X8,X9,X8,X9] :
      ( ( ~ iext(uri_owl_sameAs,X8,X9)
        | X8 = X9 )
      & ( X8 != X9
        | iext(uri_owl_sameAs,X8,X9) ) ),
    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.13  % Problem  : SWB015+1 : TPTP v8.1.0. Released v5.2.0.
% 0.07/0.14  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n019.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jun  1 04:47:55 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.29/1.47  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.29/1.47  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.29/1.47  # Preprocessing time       : 0.028 s
% 0.29/1.47  
% 0.29/1.47  # Proof found!
% 0.29/1.47  # SZS status Theorem
% 0.29/1.47  # SZS output start CNFRefutation
% See solution above
% 0.29/1.47  # Proof object total steps             : 9
% 0.29/1.47  # Proof object clause steps            : 4
% 0.29/1.47  # Proof object formula steps           : 5
% 0.29/1.47  # Proof object conjectures             : 5
% 0.29/1.47  # Proof object clause conjectures      : 2
% 0.29/1.47  # Proof object formula conjectures     : 3
% 0.29/1.47  # Proof object initial clauses used    : 2
% 0.29/1.47  # Proof object initial formulas used   : 2
% 0.29/1.47  # Proof object generating inferences   : 0
% 0.29/1.47  # Proof object simplifying inferences  : 3
% 0.29/1.47  # Training examples: 0 positive, 0 negative
% 0.29/1.47  # Parsed axioms                        : 559
% 0.29/1.47  # Removed by relevancy pruning/SinE    : 543
% 0.29/1.47  # Initial clauses                      : 19
% 0.29/1.47  # Removed in clause preprocessing      : 11
% 0.29/1.47  # Initial clauses in saturation        : 8
% 0.29/1.47  # Processed clauses                    : 9
% 0.29/1.47  # ...of these trivial                  : 0
% 0.29/1.47  # ...subsumed                          : 0
% 0.29/1.47  # ...remaining for further processing  : 9
% 0.29/1.47  # Other redundant clauses eliminated   : 1
% 0.29/1.47  # Clauses deleted for lack of memory   : 0
% 0.29/1.47  # Backward-subsumed                    : 0
% 0.29/1.47  # Backward-rewritten                   : 1
% 0.29/1.47  # Generated clauses                    : 2
% 0.29/1.47  # ...of the previous two non-trivial   : 1
% 0.29/1.47  # Contextual simplify-reflections      : 0
% 0.29/1.47  # Paramodulations                      : 1
% 0.29/1.47  # Factorizations                       : 0
% 0.29/1.47  # Equation resolutions                 : 1
% 0.29/1.47  # Current number of processed clauses  : 7
% 0.29/1.47  #    Positive orientable unit clauses  : 3
% 0.29/1.47  #    Positive unorientable unit clauses: 0
% 0.29/1.47  #    Negative unit clauses             : 0
% 0.29/1.47  #    Non-unit-clauses                  : 4
% 0.29/1.47  # Current number of unprocessed clauses: 0
% 0.29/1.47  # ...number of literals in the above   : 0
% 0.29/1.47  # Current number of archived formulas  : 0
% 0.29/1.47  # Current number of archived clauses   : 2
% 0.29/1.47  # Clause-clause subsumption calls (NU) : 0
% 0.29/1.47  # Rec. Clause-clause subsumption calls : 0
% 0.29/1.47  # Non-unit clause-clause subsumptions  : 0
% 0.29/1.47  # Unit Clause-clause subsumption calls : 0
% 0.29/1.47  # Rewrite failures with RHS unbound    : 0
% 0.29/1.47  # BW rewrite match attempts            : 2
% 0.29/1.47  # BW rewrite match successes           : 1
% 0.29/1.47  # Condensation attempts                : 0
% 0.29/1.47  # Condensation successes               : 0
% 0.29/1.47  # Termbank termtop insertions          : 7602
% 0.29/1.47  
% 0.29/1.47  # -------------------------------------------------
% 0.29/1.47  # User time                : 0.024 s
% 0.29/1.47  # System time              : 0.005 s
% 0.29/1.47  # Total time               : 0.029 s
% 0.29/1.47  # Maximum resident set size: 3632 pages
%------------------------------------------------------------------------------