TSTP Solution File: CSR100+5 by E---3.1.00

View Problem - Process Solution

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

% Computer : n014.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:33 EDT 2024

% Result   : Theorem 6.43s 6.73s
% Output   : CNFRefutation 6.43s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  12 unt;   0 def)
%            Number of atoms       :   45 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   43 (  20   ~;  16   |;   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    :    5 (   5 usr;   5 con; 0-0 aty)
%            Number of variables   :   22 (   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.5PRqRtzRsM/E---3.1_22585.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.5PRqRtzRsM/E---3.1_22585.p',kb_SUMO_26) ).

fof(prove_from_SUMO_MILO,conjecture,
    s__instance(s__Animal31,s__Class31_1),
    file('/export/starexec/sandbox/tmp/tmp.5PRqRtzRsM/E---3.1_22585.p',prove_from_SUMO_MILO) ).

fof(local_9,axiom,
    s__subclass(s__Class31_3,s__Class31_1),
    file('/export/starexec/sandbox/tmp/tmp.5PRqRtzRsM/E---3.1_22585.p',local_9) ).

fof(local_8,axiom,
    s__subclass(s__Class31_2,s__Class31_3),
    file('/export/starexec/sandbox/tmp/tmp.5PRqRtzRsM/E---3.1_22585.p',local_8) ).

fof(local_10,axiom,
    s__instance(s__Animal31,s__Class31_2),
    file('/export/starexec/sandbox/tmp/tmp.5PRqRtzRsM/E---3.1_22585.p',local_10) ).

fof(c_0_6,plain,
    ! [X1226,X1227,X1228] :
      ( ~ s__instance(X1227,s__SetOrClass)
      | ~ s__instance(X1226,s__SetOrClass)
      | ~ s__subclass(X1226,X1227)
      | ~ s__instance(X1228,X1226)
      | s__instance(X1228,X1227) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_7,plain,
    ! [X1224,X1225] :
      ( ( s__instance(X1224,s__SetOrClass)
        | ~ s__subclass(X1224,X1225) )
      & ( s__instance(X1225,s__SetOrClass)
        | ~ s__subclass(X1224,X1225) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).

fof(c_0_8,negated_conjecture,
    ~ s__instance(s__Animal31,s__Class31_1),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO])]) ).

cnf(c_0_9,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_6]) ).

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

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

fof(c_0_12,negated_conjecture,
    ~ s__instance(s__Animal31,s__Class31_1),
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

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

cnf(c_0_14,plain,
    s__subclass(s__Class31_3,s__Class31_1),
    inference(split_conjunct,[status(thm)],[local_9]) ).

cnf(c_0_15,negated_conjecture,
    ~ s__instance(s__Animal31,s__Class31_1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,plain,
    ( s__instance(X1,s__Class31_1)
    | ~ s__instance(X1,s__Class31_3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_17,plain,
    s__subclass(s__Class31_2,s__Class31_3),
    inference(split_conjunct,[status(thm)],[local_8]) ).

cnf(c_0_18,negated_conjecture,
    ~ s__instance(s__Animal31,s__Class31_3),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_19,plain,
    ( s__instance(X1,s__Class31_3)
    | ~ s__instance(X1,s__Class31_2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_17]) ).

cnf(c_0_20,plain,
    s__instance(s__Animal31,s__Class31_2),
    inference(split_conjunct,[status(thm)],[local_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 2.92/2.94  % Problem    : CSR100+5 : TPTP v8.1.2. Bugfixed v7.3.0.
% 2.92/2.95  % Command    : run_E %s %d THM
% 2.96/3.16  % Computer : n014.cluster.edu
% 2.96/3.16  % Model    : x86_64 x86_64
% 2.96/3.16  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 2.96/3.16  % Memory   : 8042.1875MB
% 2.96/3.16  % OS       : Linux 3.10.0-693.el7.x86_64
% 2.96/3.16  % CPULimit   : 300
% 2.96/3.16  % WCLimit    : 300
% 2.96/3.16  % DateTime   : Fri May  3 14:30:55 EDT 2024
% 2.96/3.16  % CPUTime    : 
% 6.22/6.40  Running first-order theorem proving
% 6.22/6.40  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.5PRqRtzRsM/E---3.1_22585.p
% 6.43/6.72  # Version: 3.1.0
% 6.43/6.72  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.43/6.72  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.43/6.72  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.43/6.72  # Starting new_bool_3 with 300s (1) cores
% 6.43/6.72  # Starting new_bool_1 with 300s (1) cores
% 6.43/6.72  # Starting sh5l with 300s (1) cores
% 6.43/6.72  # new_bool_1 with pid 22665 completed with status 0
% 6.43/6.72  # Result found by new_bool_1
% 6.43/6.72  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.43/6.72  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.43/6.72  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.43/6.72  # Starting new_bool_3 with 300s (1) cores
% 6.43/6.72  # Starting new_bool_1 with 300s (1) cores
% 6.43/6.72  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.43/6.72  # Search class: FHUSF-FFMM32-SFFFFFNN
% 6.43/6.72  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.43/6.72  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 6.43/6.72  # G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 22668 completed with status 0
% 6.43/6.72  # Result found by G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 6.43/6.73  # Preprocessing class: FMLLSMSLSSSNFFN.
% 6.43/6.73  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.43/6.73  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 6.43/6.73  # Starting new_bool_3 with 300s (1) cores
% 6.43/6.73  # Starting new_bool_1 with 300s (1) cores
% 6.43/6.73  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 6.43/6.73  # Search class: FHUSF-FFMM32-SFFFFFNN
% 6.43/6.73  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 6.43/6.73  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 6.43/6.73  # Preprocessing time       : 0.010 s
% 6.43/6.73  # Presaturation interreduction done
% 6.43/6.73  
% 6.43/6.73  # Proof found!
% 6.43/6.73  # SZS status Theorem
% 6.43/6.73  # SZS output start CNFRefutation
% See solution above
% 6.43/6.73  # Parsed axioms                        : 16759
% 6.43/6.73  # Removed by relevancy pruning/SinE    : 16724
% 6.43/6.73  # Initial clauses                      : 39
% 6.43/6.73  # Removed in clause preprocessing      : 4
% 6.43/6.73  # Initial clauses in saturation        : 35
% 6.43/6.73  # Processed clauses                    : 91
% 6.43/6.73  # ...of these trivial                  : 13
% 6.43/6.73  # ...subsumed                          : 0
% 6.43/6.73  # ...remaining for further processing  : 78
% 6.43/6.73  # Other redundant clauses eliminated   : 0
% 6.43/6.73  # Clauses deleted for lack of memory   : 0
% 6.43/6.73  # Backward-subsumed                    : 0
% 6.43/6.73  # Backward-rewritten                   : 1
% 6.43/6.73  # Generated clauses                    : 60
% 6.43/6.73  # ...of the previous two non-redundant : 38
% 6.43/6.73  # ...aggressively subsumed             : 0
% 6.43/6.73  # Contextual simplify-reflections      : 8
% 6.43/6.73  # Paramodulations                      : 60
% 6.43/6.73  # Factorizations                       : 0
% 6.43/6.73  # NegExts                              : 0
% 6.43/6.73  # Equation resolutions                 : 0
% 6.43/6.73  # Disequality decompositions           : 0
% 6.43/6.73  # Total rewrite steps                  : 31
% 6.43/6.73  # ...of those cached                   : 17
% 6.43/6.73  # Propositional unsat checks           : 0
% 6.43/6.73  #    Propositional check models        : 0
% 6.43/6.73  #    Propositional check unsatisfiable : 0
% 6.43/6.73  #    Propositional clauses             : 0
% 6.43/6.73  #    Propositional clauses after purity: 0
% 6.43/6.73  #    Propositional unsat core size     : 0
% 6.43/6.73  #    Propositional preprocessing time  : 0.000
% 6.43/6.73  #    Propositional encoding time       : 0.000
% 6.43/6.73  #    Propositional solver time         : 0.000
% 6.43/6.73  #    Success case prop preproc time    : 0.000
% 6.43/6.73  #    Success case prop encoding time   : 0.000
% 6.43/6.73  #    Success case prop solver time     : 0.000
% 6.43/6.73  # Current number of processed clauses  : 53
% 6.43/6.73  #    Positive orientable unit clauses  : 27
% 6.43/6.73  #    Positive unorientable unit clauses: 0
% 6.43/6.73  #    Negative unit clauses             : 2
% 6.43/6.73  #    Non-unit-clauses                  : 24
% 6.43/6.73  # Current number of unprocessed clauses: 6
% 6.43/6.73  # ...number of literals in the above   : 15
% 6.43/6.73  # Current number of archived formulas  : 0
% 6.43/6.73  # Current number of archived clauses   : 25
% 6.43/6.73  # Clause-clause subsumption calls (NU) : 27
% 6.43/6.73  # Rec. Clause-clause subsumption calls : 21
% 6.43/6.73  # Non-unit clause-clause subsumptions  : 8
% 6.43/6.73  # Unit Clause-clause subsumption calls : 2
% 6.43/6.73  # Rewrite failures with RHS unbound    : 0
% 6.43/6.73  # BW rewrite match attempts            : 1
% 6.43/6.73  # BW rewrite match successes           : 1
% 6.43/6.73  # Condensation attempts                : 0
% 6.43/6.73  # Condensation successes               : 0
% 6.43/6.73  # Termbank termtop insertions          : 165485
% 6.43/6.73  # Search garbage collected termcells   : 87474
% 6.43/6.73  
% 6.43/6.73  # -------------------------------------------------
% 6.43/6.73  # User time                : 0.081 s
% 6.43/6.73  # System time              : 0.040 s
% 6.43/6.73  # Total time               : 0.121 s
% 6.43/6.73  # Maximum resident set size: 39972 pages
% 6.43/6.73  
% 6.43/6.73  # -------------------------------------------------
% 6.43/6.73  # User time                : 0.251 s
% 6.43/6.73  # System time              : 0.057 s
% 6.43/6.73  # Total time               : 0.309 s
% 6.43/6.73  # Maximum resident set size: 18656 pages
% 6.43/6.73  % E---3.1 exiting
% 6.43/6.73  % E exiting
%------------------------------------------------------------------------------