TSTP Solution File: CSR094+2 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : CSR094+2 : TPTP v8.1.2. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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  : 300s
% DateTime : Sat May  4 07:32:28 EDT 2024

% Result   : Theorem 19.54s 19.03s
% Output   : CNFRefutation 19.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   40 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   40 (  18   ~;  15   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   4 con; 0-0 aty)
%            Number of variables   :   21 (   2 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p',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/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    s__instance(s__Rover24_1,s__CorpuscularObject),
    file('/export/starexec/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p',prove_from_SUMO_MILO) ).

fof(kb_SUMO_17710,axiom,
    s__subclass(s__Canine,s__CorpuscularObject),
    file('/export/starexec/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p',kb_SUMO_17710) ).

fof(local_1,axiom,
    s__instance(s__Rover24_1,s__Canine),
    file('/export/starexec/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p',local_1) ).

fof(c_0_5,plain,
    ! [X1231,X1232,X1233] :
      ( ~ s__instance(X1232,s__SetOrClass)
      | ~ s__instance(X1231,s__SetOrClass)
      | ~ s__subclass(X1231,X1232)
      | ~ s__instance(X1233,X1231)
      | s__instance(X1233,X1232) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

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

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

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

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__instance(s__Rover24_1,s__CorpuscularObject),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO])]) ).

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

cnf(c_0_12,plain,
    s__subclass(s__Canine,s__CorpuscularObject),
    inference(split_conjunct,[status(thm)],[kb_SUMO_17710]) ).

fof(c_0_13,negated_conjecture,
    ~ s__instance(s__Rover24_1,s__CorpuscularObject),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( s__instance(X1,s__CorpuscularObject)
    | ~ s__instance(X1,s__Canine) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    s__instance(s__Rover24_1,s__Canine),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_16,negated_conjecture,
    ~ s__instance(s__Rover24_1,s__CorpuscularObject),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_17,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 9.07/9.16  % Problem    : CSR094+2 : TPTP v8.1.2. Bugfixed v7.3.0.
% 9.07/9.18  % Command    : run_E %s %d THM
% 9.17/9.39  % Computer : n015.cluster.edu
% 9.17/9.39  % Model    : x86_64 x86_64
% 9.17/9.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 9.17/9.39  % Memory   : 8042.1875MB
% 9.17/9.39  % OS       : Linux 3.10.0-693.el7.x86_64
% 9.17/9.39  % CPULimit   : 300
% 9.17/9.39  % WCLimit    : 300
% 9.17/9.39  % DateTime   : Fri May  3 15:14:17 EDT 2024
% 9.17/9.39  % CPUTime    : 
% 18.05/18.26  Running first-order theorem proving
% 18.05/18.26  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.jWRsuvsZ1j/E---3.1_6074.p
% 19.54/19.03  # Version: 3.1.0
% 19.54/19.03  # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.54/19.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.54/19.03  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.54/19.03  # Starting new_bool_3 with 300s (1) cores
% 19.54/19.03  # Starting new_bool_1 with 300s (1) cores
% 19.54/19.03  # Starting sh5l with 300s (1) cores
% 19.54/19.03  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 6778 completed with status 0
% 19.54/19.03  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 19.54/19.03  # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.54/19.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.54/19.03  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.54/19.03  # SinE strategy is gf200_h_gu_R03_F100_L20000
% 19.54/19.03  # Search class: FGHSS-FFMM21-MFFFFFNN
% 19.54/19.03  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 19.54/19.03  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 19.54/19.03  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 19.54/19.03  # Starting new_bool_3 with 136s (1) cores
% 19.54/19.03  # Starting new_bool_1 with 136s (1) cores
% 19.54/19.03  # Starting sh5l with 136s (1) cores
% 19.54/19.03  # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 6785 completed with status 0
% 19.54/19.03  # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 19.54/19.03  # Preprocessing class: FMLLSMSLSSSNFFN.
% 19.54/19.03  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.54/19.03  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 19.54/19.03  # SinE strategy is gf200_h_gu_R03_F100_L20000
% 19.54/19.03  # Search class: FGHSS-FFMM21-MFFFFFNN
% 19.54/19.03  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 19.54/19.03  # Starting G-E--_208_C12_00_F1_SE_CS_PI_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 19.54/19.03  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 19.54/19.03  # Preprocessing time       : 0.006 s
% 19.54/19.03  # Presaturation interreduction done
% 19.54/19.03  
% 19.54/19.03  # Proof found!
% 19.54/19.03  # SZS status Theorem
% 19.54/19.03  # SZS output start CNFRefutation
% See solution above
% 19.54/19.03  # Parsed axioms                        : 37983
% 19.54/19.03  # Removed by relevancy pruning/SinE    : 37737
% 19.54/19.03  # Initial clauses                      : 255
% 19.54/19.03  # Removed in clause preprocessing      : 4
% 19.54/19.03  # Initial clauses in saturation        : 251
% 19.54/19.03  # Processed clauses                    : 1138
% 19.54/19.03  # ...of these trivial                  : 375
% 19.54/19.03  # ...subsumed                          : 3
% 19.54/19.03  # ...remaining for further processing  : 760
% 19.54/19.03  # Other redundant clauses eliminated   : 1
% 19.54/19.03  # Clauses deleted for lack of memory   : 0
% 19.54/19.03  # Backward-subsumed                    : 0
% 19.54/19.03  # Backward-rewritten                   : 7
% 19.54/19.03  # Generated clauses                    : 1115
% 19.54/19.03  # ...of the previous two non-redundant : 1081
% 19.54/19.03  # ...aggressively subsumed             : 0
% 19.54/19.03  # Contextual simplify-reflections      : 15
% 19.54/19.03  # Paramodulations                      : 1114
% 19.54/19.03  # Factorizations                       : 0
% 19.54/19.03  # NegExts                              : 0
% 19.54/19.03  # Equation resolutions                 : 1
% 19.54/19.03  # Disequality decompositions           : 0
% 19.54/19.03  # Total rewrite steps                  : 420
% 19.54/19.03  # ...of those cached                   : 380
% 19.54/19.03  # Propositional unsat checks           : 0
% 19.54/19.03  #    Propositional check models        : 0
% 19.54/19.03  #    Propositional check unsatisfiable : 0
% 19.54/19.03  #    Propositional clauses             : 0
% 19.54/19.03  #    Propositional clauses after purity: 0
% 19.54/19.03  #    Propositional unsat core size     : 0
% 19.54/19.03  #    Propositional preprocessing time  : 0.000
% 19.54/19.03  #    Propositional encoding time       : 0.000
% 19.54/19.03  #    Propositional solver time         : 0.000
% 19.54/19.03  #    Success case prop preproc time    : 0.000
% 19.54/19.03  #    Success case prop encoding time   : 0.000
% 19.54/19.03  #    Success case prop solver time     : 0.000
% 19.54/19.03  # Current number of processed clauses  : 506
% 19.54/19.03  #    Positive orientable unit clauses  : 257
% 19.54/19.03  #    Positive unorientable unit clauses: 0
% 19.54/19.03  #    Negative unit clauses             : 2
% 19.54/19.03  #    Non-unit-clauses                  : 247
% 19.54/19.03  # Current number of unprocessed clauses: 438
% 19.54/19.03  # ...number of literals in the above   : 857
% 19.54/19.03  # Current number of archived formulas  : 0
% 19.54/19.03  # Current number of archived clauses   : 253
% 19.54/19.03  # Clause-clause subsumption calls (NU) : 4824
% 19.54/19.03  # Rec. Clause-clause subsumption calls : 4683
% 19.54/19.03  # Non-unit clause-clause subsumptions  : 18
% 19.54/19.03  # Unit Clause-clause subsumption calls : 161
% 19.54/19.03  # Rewrite failures with RHS unbound    : 0
% 19.54/19.03  # BW rewrite match attempts            : 7
% 19.54/19.03  # BW rewrite match successes           : 7
% 19.54/19.03  # Condensation attempts                : 0
% 19.54/19.03  # Condensation successes               : 0
% 19.54/19.03  # Termbank termtop insertions          : 262979
% 19.54/19.03  # Search garbage collected termcells   : 125501
% 19.54/19.03  
% 19.54/19.03  # -------------------------------------------------
% 19.54/19.03  # User time                : 0.163 s
% 19.54/19.03  # System time              : 0.063 s
% 19.54/19.03  # Total time               : 0.226 s
% 19.54/19.03  # Maximum resident set size: 49936 pages
% 19.54/19.03  
% 19.54/19.03  # -------------------------------------------------
% 19.54/19.03  # User time                : 0.827 s
% 19.54/19.03  # System time              : 0.129 s
% 19.54/19.03  # Total time               : 0.956 s
% 19.54/19.03  # Maximum resident set size: 28408 pages
% 19.54/19.03  % E---3.1 exiting
% 19.54/19.03  % E exiting
%------------------------------------------------------------------------------