TSTP Solution File: CSR118+1 by E---3.1.00

View Problem - Process Solution

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

% Computer : n024.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:34:26 EDT 2024

% Result   : Theorem 5.41s 5.22s
% Output   : CNFRefutation 5.41s
% 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.LMclCTSVqh/E---3.1_14057.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.LMclCTSVqh/E---3.1_14057.p',kb_SUMO_26) ).

fof(abe_mammal,conjecture,
    s__instance(s__AbrahamLincoln,s__Mammal),
    file('/export/starexec/sandbox/tmp/tmp.LMclCTSVqh/E---3.1_14057.p',abe_mammal) ).

fof(kb_SUMOcache_6053,axiom,
    s__subclass(s__Human,s__Mammal),
    file('/export/starexec/sandbox/tmp/tmp.LMclCTSVqh/E---3.1_14057.p',kb_SUMOcache_6053) ).

fof(abe_human,axiom,
    s__instance(s__AbrahamLincoln,s__Human),
    file('/export/starexec/sandbox/tmp/tmp.LMclCTSVqh/E---3.1_14057.p',abe_human) ).

fof(c_0_5,plain,
    ! [X595,X596,X597] :
      ( ~ s__instance(X596,s__SetOrClass)
      | ~ s__instance(X595,s__SetOrClass)
      | ~ s__subclass(X595,X596)
      | ~ s__instance(X597,X595)
      | s__instance(X597,X596) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_6,plain,
    ! [X593,X594] :
      ( ( s__instance(X593,s__SetOrClass)
        | ~ s__subclass(X593,X594) )
      & ( s__instance(X594,s__SetOrClass)
        | ~ s__subclass(X593,X594) ) ),
    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_7,negated_conjecture,
    ~ s__instance(s__AbrahamLincoln,s__Mammal),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[abe_mammal])]) ).

cnf(c_0_8,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_9,plain,
    ( s__instance(X1,s__SetOrClass)
    | ~ s__subclass(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

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

fof(c_0_11,negated_conjecture,
    ~ s__instance(s__AbrahamLincoln,s__Mammal),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

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

cnf(c_0_13,plain,
    s__subclass(s__Human,s__Mammal),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_6053]) ).

cnf(c_0_14,negated_conjecture,
    ~ s__instance(s__AbrahamLincoln,s__Mammal),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,plain,
    ( s__instance(X1,s__Mammal)
    | ~ s__instance(X1,s__Human) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,plain,
    s__instance(s__AbrahamLincoln,s__Human),
    inference(split_conjunct,[status(thm)],[abe_human]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 1.81/1.88  % Problem    : CSR118+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 1.81/1.89  % Command    : run_E %s %d THM
% 1.88/2.10  % Computer : n024.cluster.edu
% 1.88/2.10  % Model    : x86_64 x86_64
% 1.88/2.10  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 1.88/2.10  % Memory   : 8042.1875MB
% 1.88/2.10  % OS       : Linux 3.10.0-693.el7.x86_64
% 1.88/2.10  % CPULimit   : 300
% 1.88/2.10  % WCLimit    : 300
% 1.88/2.10  % DateTime   : Fri May  3 14:40:54 EDT 2024
% 1.88/2.11  % CPUTime    : 
% 4.60/4.83  Running first-order theorem proving
% 4.60/4.83  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.LMclCTSVqh/E---3.1_14057.p
% 5.41/5.22  # Version: 3.1.0
% 5.41/5.22  # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.41/5.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.41/5.22  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.41/5.22  # Starting new_bool_3 with 300s (1) cores
% 5.41/5.22  # Starting new_bool_1 with 300s (1) cores
% 5.41/5.22  # Starting sh5l with 300s (1) cores
% 5.41/5.22  # new_bool_1 with pid 14137 completed with status 0
% 5.41/5.22  # Result found by new_bool_1
% 5.41/5.22  # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.41/5.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.41/5.22  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.41/5.22  # Starting new_bool_3 with 300s (1) cores
% 5.41/5.22  # Starting new_bool_1 with 300s (1) cores
% 5.41/5.22  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.41/5.22  # Search class: FHUSF-FFMM32-SFFFFFNN
% 5.41/5.22  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.41/5.22  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 5.41/5.22  # G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 14139 completed with status 0
% 5.41/5.22  # Result found by G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 5.41/5.22  # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.41/5.22  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.41/5.22  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.41/5.22  # Starting new_bool_3 with 300s (1) cores
% 5.41/5.22  # Starting new_bool_1 with 300s (1) cores
% 5.41/5.22  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 5.41/5.22  # Search class: FHUSF-FFMM32-SFFFFFNN
% 5.41/5.22  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 5.41/5.22  # Starting G-E--_208_C18CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 150s (1) cores
% 5.41/5.22  # Preprocessing time       : 0.006 s
% 5.41/5.22  # Presaturation interreduction done
% 5.41/5.22  
% 5.41/5.22  # Proof found!
% 5.41/5.22  # SZS status Theorem
% 5.41/5.22  # SZS output start CNFRefutation
% See solution above
% 5.41/5.22  # Parsed axioms                        : 14789
% 5.41/5.22  # Removed by relevancy pruning/SinE    : 14580
% 5.41/5.22  # Initial clauses                      : 212
% 5.41/5.22  # Removed in clause preprocessing      : 4
% 5.41/5.22  # Initial clauses in saturation        : 208
% 5.41/5.22  # Processed clauses                    : 992
% 5.41/5.22  # ...of these trivial                  : 347
% 5.41/5.22  # ...subsumed                          : 0
% 5.41/5.22  # ...remaining for further processing  : 645
% 5.41/5.22  # Other redundant clauses eliminated   : 0
% 5.41/5.22  # Clauses deleted for lack of memory   : 0
% 5.41/5.22  # Backward-subsumed                    : 0
% 5.41/5.22  # Backward-rewritten                   : 2
% 5.41/5.22  # Generated clauses                    : 1005
% 5.41/5.22  # ...of the previous two non-redundant : 930
% 5.41/5.22  # ...aggressively subsumed             : 0
% 5.41/5.22  # Contextual simplify-reflections      : 7
% 5.41/5.22  # Paramodulations                      : 1005
% 5.41/5.22  # Factorizations                       : 0
% 5.41/5.22  # NegExts                              : 0
% 5.41/5.22  # Equation resolutions                 : 0
% 5.41/5.22  # Disequality decompositions           : 0
% 5.41/5.22  # Total rewrite steps                  : 398
% 5.41/5.22  # ...of those cached                   : 372
% 5.41/5.22  # Propositional unsat checks           : 0
% 5.41/5.22  #    Propositional check models        : 0
% 5.41/5.22  #    Propositional check unsatisfiable : 0
% 5.41/5.22  #    Propositional clauses             : 0
% 5.41/5.22  #    Propositional clauses after purity: 0
% 5.41/5.22  #    Propositional unsat core size     : 0
% 5.41/5.22  #    Propositional preprocessing time  : 0.000
% 5.41/5.22  #    Propositional encoding time       : 0.000
% 5.41/5.22  #    Propositional solver time         : 0.000
% 5.41/5.22  #    Success case prop preproc time    : 0.000
% 5.41/5.22  #    Success case prop encoding time   : 0.000
% 5.41/5.22  #    Success case prop solver time     : 0.000
% 5.41/5.22  # Current number of processed clauses  : 437
% 5.41/5.22  #    Positive orientable unit clauses  : 234
% 5.41/5.22  #    Positive unorientable unit clauses: 0
% 5.41/5.22  #    Negative unit clauses             : 5
% 5.41/5.22  #    Non-unit-clauses                  : 198
% 5.41/5.22  # Current number of unprocessed clauses: 352
% 5.41/5.22  # ...number of literals in the above   : 694
% 5.41/5.22  # Current number of archived formulas  : 0
% 5.41/5.22  # Current number of archived clauses   : 208
% 5.41/5.22  # Clause-clause subsumption calls (NU) : 2487
% 5.41/5.22  # Rec. Clause-clause subsumption calls : 2481
% 5.41/5.22  # Non-unit clause-clause subsumptions  : 7
% 5.41/5.22  # Unit Clause-clause subsumption calls : 31
% 5.41/5.22  # Rewrite failures with RHS unbound    : 0
% 5.41/5.22  # BW rewrite match attempts            : 2
% 5.41/5.22  # BW rewrite match successes           : 2
% 5.41/5.22  # Condensation attempts                : 0
% 5.41/5.22  # Condensation successes               : 0
% 5.41/5.22  # Termbank termtop insertions          : 117875
% 5.41/5.22  # Search garbage collected termcells   : 52587
% 5.41/5.22  
% 5.41/5.22  # -------------------------------------------------
% 5.41/5.22  # User time                : 0.080 s
% 5.41/5.22  # System time              : 0.038 s
% 5.41/5.22  # Total time               : 0.118 s
% 5.41/5.22  # Maximum resident set size: 20232 pages
% 5.41/5.22  
% 5.41/5.22  # -------------------------------------------------
% 5.41/5.22  # User time                : 0.326 s
% 5.41/5.22  # System time              : 0.052 s
% 5.41/5.22  # Total time               : 0.378 s
% 5.41/5.22  # Maximum resident set size: 12660 pages
% 5.41/5.22  % E---3.1 exiting
% 5.41/5.22  % E exiting
%------------------------------------------------------------------------------