TSTP Solution File: CSR099+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : CSR099+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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 : 300s
% WCLimit  : 600s
% DateTime : Fri Jul 15 03:02:42 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_1220,axiom,
    ! [X4,X5] :
      ( ( s__instance(X5,s__SetOrClass)
        & s__instance(X4,s__SetOrClass) )
     => ( ( s__subclass(X4,X5)
          & s__subclass(X5,X4) )
       => X4 = X5 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_1220) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).

fof(prove_from_SUMO,conjecture,
    s__Class30_1 = s__Reptile,
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_SUMO) ).

fof(local_2,axiom,
    s__subclass(s__Class30_1,s__Reptile),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_2) ).

fof(local_3,axiom,
    s__subclass(s__Reptile,s__Class30_1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_3) ).

fof(c_0_5,plain,
    ! [X6,X7] :
      ( ~ s__instance(X7,s__SetOrClass)
      | ~ s__instance(X6,s__SetOrClass)
      | ~ s__subclass(X6,X7)
      | ~ s__subclass(X7,X6)
      | X6 = X7 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_1220])]) ).

fof(c_0_6,plain,
    ! [X8,X9] :
      ( ( s__instance(X8,s__SetOrClass)
        | ~ s__subclass(X8,X9) )
      & ( s__instance(X9,s__SetOrClass)
        | ~ s__subclass(X8,X9) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])]) ).

fof(c_0_7,negated_conjecture,
    s__Class30_1 != s__Reptile,
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

cnf(c_0_8,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2)
    | ~ s__instance(X1,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,negated_conjecture,
    s__Class30_1 != s__Reptile,
    inference(fof_simplification,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( X1 = X2
    | ~ s__subclass(X2,X1)
    | ~ s__subclass(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

cnf(c_0_12,plain,
    s__subclass(s__Class30_1,s__Reptile),
    inference(split_conjunct,[status(thm)],[local_2]) ).

cnf(c_0_13,plain,
    s__subclass(s__Reptile,s__Class30_1),
    inference(split_conjunct,[status(thm)],[local_3]) ).

cnf(c_0_14,negated_conjecture,
    s__Class30_1 != s__Reptile,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13])]),c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : CSR099+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.12/0.34  % Computer : n026.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jun 11 16:02:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.99/2.18  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.99/2.18  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.99/2.18  # Preprocessing time       : 0.099 s
% 0.99/2.18  
% 0.99/2.18  # Proof found!
% 0.99/2.18  # SZS status Theorem
% 0.99/2.18  # SZS output start CNFRefutation
% See solution above
% 0.99/2.18  # Proof object total steps             : 16
% 0.99/2.18  # Proof object clause steps            : 7
% 0.99/2.18  # Proof object formula steps           : 9
% 0.99/2.18  # Proof object conjectures             : 4
% 0.99/2.18  # Proof object clause conjectures      : 1
% 0.99/2.18  # Proof object formula conjectures     : 3
% 0.99/2.18  # Proof object initial clauses used    : 5
% 0.99/2.18  # Proof object initial formulas used   : 5
% 0.99/2.18  # Proof object generating inferences   : 1
% 0.99/2.18  # Proof object simplifying inferences  : 5
% 0.99/2.18  # Training examples: 0 positive, 0 negative
% 0.99/2.18  # Parsed axioms                        : 7221
% 0.99/2.18  # Removed by relevancy pruning/SinE    : 7144
% 0.99/2.18  # Initial clauses                      : 88
% 0.99/2.18  # Removed in clause preprocessing      : 4
% 0.99/2.18  # Initial clauses in saturation        : 84
% 0.99/2.18  # Processed clauses                    : 63
% 0.99/2.18  # ...of these trivial                  : 5
% 0.99/2.18  # ...subsumed                          : 0
% 0.99/2.18  # ...remaining for further processing  : 58
% 0.99/2.18  # Other redundant clauses eliminated   : 1
% 0.99/2.18  # Clauses deleted for lack of memory   : 0
% 0.99/2.18  # Backward-subsumed                    : 0
% 0.99/2.18  # Backward-rewritten                   : 1
% 0.99/2.18  # Generated clauses                    : 79
% 0.99/2.18  # ...of the previous two non-trivial   : 51
% 0.99/2.18  # Contextual simplify-reflections      : 5
% 0.99/2.18  # Paramodulations                      : 78
% 0.99/2.18  # Factorizations                       : 0
% 0.99/2.18  # Equation resolutions                 : 1
% 0.99/2.18  # Current number of processed clauses  : 56
% 0.99/2.18  #    Positive orientable unit clauses  : 29
% 0.99/2.18  #    Positive unorientable unit clauses: 0
% 0.99/2.18  #    Negative unit clauses             : 1
% 0.99/2.18  #    Non-unit-clauses                  : 26
% 0.99/2.18  # Current number of unprocessed clauses: 72
% 0.99/2.18  # ...number of literals in the above   : 149
% 0.99/2.18  # Current number of archived formulas  : 0
% 0.99/2.18  # Current number of archived clauses   : 1
% 0.99/2.18  # Clause-clause subsumption calls (NU) : 76
% 0.99/2.18  # Rec. Clause-clause subsumption calls : 71
% 0.99/2.18  # Non-unit clause-clause subsumptions  : 5
% 0.99/2.18  # Unit Clause-clause subsumption calls : 1
% 0.99/2.18  # Rewrite failures with RHS unbound    : 0
% 0.99/2.18  # BW rewrite match attempts            : 1
% 0.99/2.18  # BW rewrite match successes           : 1
% 0.99/2.18  # Condensation attempts                : 0
% 0.99/2.18  # Condensation successes               : 0
% 0.99/2.18  # Termbank termtop insertions          : 81746
% 0.99/2.18  
% 0.99/2.18  # -------------------------------------------------
% 0.99/2.18  # User time                : 0.092 s
% 0.99/2.18  # System time              : 0.009 s
% 0.99/2.18  # Total time               : 0.101 s
% 0.99/2.18  # Maximum resident set size: 18576 pages
%------------------------------------------------------------------------------