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

View Problem - Process Solution

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

% Computer : n006.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:27 EDT 2022

% Result   : Theorem 0.97s 2.16s
% Output   : CNFRefutation 0.97s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  10 unt;   0 def)
%            Number of atoms       :   58 (   0 equ)
%            Maximal formula atoms :   10 (   2 avg)
%            Number of connectives :   64 (  28   ~;  24   |;   7   &)
%                                         (   1 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-1 aty)
%            Number of variables   :   30 (   2 sgn  14   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    ? [X591] : s__links(X591,X591,s__Arc13_1),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_from_SUMO) ).

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

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(kb_SUMO_3603,axiom,
    ! [X185] :
      ( s__instance(X185,s__GraphArc)
     => ( s__instance(X185,s__GraphLoop)
      <=> ? [X186] :
            ( s__instance(X186,s__GraphNode)
            & s__links(X186,X186,X185) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3603) ).

fof(local_1,axiom,
    s__instance(s__Arc13_1,s__GraphLoop),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',local_1) ).

fof(kb_SUMO_3600,axiom,
    s__subclass(s__GraphLoop,s__GraphArc),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3600) ).

fof(c_0_6,negated_conjecture,
    ~ ? [X591] : s__links(X591,X591,s__Arc13_1),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(c_0_7,plain,
    ! [X9,X10,X11] :
      ( ~ s__instance(X10,s__SetOrClass)
      | ~ s__instance(X9,s__SetOrClass)
      | ~ s__subclass(X9,X10)
      | ~ s__instance(X11,X9)
      | s__instance(X11,X10) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])])]) ).

fof(c_0_8,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_9,negated_conjecture,
    ! [X592] : ~ s__links(X592,X592,s__Arc13_1),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])]) ).

fof(c_0_10,plain,
    ! [X187,X189] :
      ( ( s__instance(esk11_1(X187),s__GraphNode)
        | ~ s__instance(X187,s__GraphLoop)
        | ~ s__instance(X187,s__GraphArc) )
      & ( s__links(esk11_1(X187),esk11_1(X187),X187)
        | ~ s__instance(X187,s__GraphLoop)
        | ~ s__instance(X187,s__GraphArc) )
      & ( ~ s__instance(X189,s__GraphNode)
        | ~ s__links(X189,X189,X187)
        | s__instance(X187,s__GraphLoop)
        | ~ s__instance(X187,s__GraphArc) ) ),
    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)],[kb_SUMO_3603])])])])])])]) ).

cnf(c_0_11,plain,
    ( s__instance(X1,X2)
    | ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X3,s__SetOrClass)
    | ~ s__instance(X2,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

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

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

cnf(c_0_14,negated_conjecture,
    ~ s__links(X1,X1,s__Arc13_1),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    ( s__links(esk11_1(X1),esk11_1(X1),X1)
    | ~ s__instance(X1,s__GraphArc)
    | ~ s__instance(X1,s__GraphLoop) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    s__instance(s__Arc13_1,s__GraphLoop),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_17,plain,
    ( s__instance(X1,X2)
    | ~ s__subclass(X3,X2)
    | ~ s__instance(X1,X3) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_18,plain,
    s__subclass(s__GraphLoop,s__GraphArc),
    inference(split_conjunct,[status(thm)],[kb_SUMO_3600]) ).

cnf(c_0_19,negated_conjecture,
    ~ s__instance(s__Arc13_1,s__GraphArc),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_20,plain,
    ( s__instance(X1,s__GraphArc)
    | ~ s__instance(X1,s__GraphLoop) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : CSR086+4 : TPTP v8.1.0. Bugfixed v7.3.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n006.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 : Sat Jun 11 03:47:42 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.97/2.16  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.97/2.16  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.97/2.16  # Preprocessing time       : 0.171 s
% 0.97/2.16  
% 0.97/2.16  # Proof found!
% 0.97/2.16  # SZS status Theorem
% 0.97/2.16  # SZS output start CNFRefutation
% See solution above
% 0.97/2.16  # Proof object total steps             : 22
% 0.97/2.16  # Proof object clause steps            : 11
% 0.97/2.16  # Proof object formula steps           : 11
% 0.97/2.16  # Proof object conjectures             : 6
% 0.97/2.16  # Proof object clause conjectures      : 3
% 0.97/2.16  # Proof object formula conjectures     : 3
% 0.97/2.16  # Proof object initial clauses used    : 7
% 0.97/2.16  # Proof object initial formulas used   : 6
% 0.97/2.16  # Proof object generating inferences   : 3
% 0.97/2.16  # Proof object simplifying inferences  : 6
% 0.97/2.16  # Training examples: 0 positive, 0 negative
% 0.97/2.16  # Parsed axioms                        : 7219
% 0.97/2.16  # Removed by relevancy pruning/SinE    : 7118
% 0.97/2.16  # Initial clauses                      : 131
% 0.97/2.16  # Removed in clause preprocessing      : 8
% 0.97/2.16  # Initial clauses in saturation        : 123
% 0.97/2.16  # Processed clauses                    : 206
% 0.97/2.16  # ...of these trivial                  : 22
% 0.97/2.16  # ...subsumed                          : 1
% 0.97/2.16  # ...remaining for further processing  : 183
% 0.97/2.16  # Other redundant clauses eliminated   : 1
% 0.97/2.16  # Clauses deleted for lack of memory   : 0
% 0.97/2.16  # Backward-subsumed                    : 0
% 0.97/2.16  # Backward-rewritten                   : 0
% 0.97/2.16  # Generated clauses                    : 204
% 0.97/2.16  # ...of the previous two non-trivial   : 190
% 0.97/2.16  # Contextual simplify-reflections      : 14
% 0.97/2.16  # Paramodulations                      : 203
% 0.97/2.16  # Factorizations                       : 0
% 0.97/2.16  # Equation resolutions                 : 1
% 0.97/2.16  # Current number of processed clauses  : 182
% 0.97/2.16  #    Positive orientable unit clauses  : 67
% 0.97/2.16  #    Positive unorientable unit clauses: 0
% 0.97/2.16  #    Negative unit clauses             : 2
% 0.97/2.16  #    Non-unit-clauses                  : 113
% 0.97/2.16  # Current number of unprocessed clauses: 107
% 0.97/2.16  # ...number of literals in the above   : 345
% 0.97/2.16  # Current number of archived formulas  : 0
% 0.97/2.16  # Current number of archived clauses   : 0
% 0.97/2.16  # Clause-clause subsumption calls (NU) : 2257
% 0.97/2.16  # Rec. Clause-clause subsumption calls : 736
% 0.97/2.16  # Non-unit clause-clause subsumptions  : 15
% 0.97/2.16  # Unit Clause-clause subsumption calls : 349
% 0.97/2.16  # Rewrite failures with RHS unbound    : 0
% 0.97/2.16  # BW rewrite match attempts            : 2
% 0.97/2.16  # BW rewrite match successes           : 0
% 0.97/2.16  # Condensation attempts                : 0
% 0.97/2.16  # Condensation successes               : 0
% 0.97/2.16  # Termbank termtop insertions          : 88089
% 0.97/2.16  
% 0.97/2.16  # -------------------------------------------------
% 0.97/2.16  # User time                : 0.165 s
% 0.97/2.16  # System time              : 0.012 s
% 0.97/2.16  # Total time               : 0.177 s
% 0.97/2.16  # Maximum resident set size: 18848 pages
%------------------------------------------------------------------------------