TSTP Solution File: CSR083+1 by E-SAT---3.1.00

View Problem - Process Solution

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

% Computer : n010.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:35:59 EDT 2024

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
    ? [X591] :
      ( s__subclass(X591,s__Animal)
      & s__subclass(X591,s__CognitiveAgent)
      & X591 = s__Human ),
    file('/export/starexec/sandbox/tmp/tmp.cI9hp5mZy1/E---3.1_7715.p',prove_from_SUMO) ).

fof(kb_SUMO_6087,axiom,
    s__subclass(s__Human,s__CognitiveAgent),
    file('/export/starexec/sandbox/tmp/tmp.cI9hp5mZy1/E---3.1_7715.p',kb_SUMO_6087) ).

fof(kb_SUMOcache_6048,axiom,
    s__subclass(s__Human,s__Animal),
    file('/export/starexec/sandbox/tmp/tmp.cI9hp5mZy1/E---3.1_7715.p',kb_SUMOcache_6048) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X591] :
        ( s__subclass(X591,s__Animal)
        & s__subclass(X591,s__CognitiveAgent)
        & X591 = s__Human ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

fof(c_0_4,negated_conjecture,
    ! [X592] :
      ( ~ s__subclass(X592,s__Animal)
      | ~ s__subclass(X592,s__CognitiveAgent)
      | X592 != s__Human ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ s__subclass(X1,s__Animal)
    | ~ s__subclass(X1,s__CognitiveAgent)
    | X1 != s__Human ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    s__subclass(s__Human,s__CognitiveAgent),
    inference(split_conjunct,[status(thm)],[kb_SUMO_6087]) ).

cnf(c_0_7,plain,
    s__subclass(s__Human,s__Animal),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_6048]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_5]),c_0_6]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : CSR083+1 : TPTP v8.1.2. Bugfixed v7.3.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.13/0.33  % Computer : n010.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit   : 300
% 0.13/0.33  % WCLimit    : 300
% 0.13/0.33  % DateTime   : Fri May  3 14:32:23 EDT 2024
% 0.13/0.33  % CPUTime    : 
% 1.82/2.03  Running first-order model finding
% 1.82/2.03  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.cI9hp5mZy1/E---3.1_7715.p
% 2.00/2.24  # Version: 3.1.0
% 2.00/2.24  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.00/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/2.24  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.00/2.24  # Starting new_bool_3 with 300s (1) cores
% 2.00/2.24  # Starting new_bool_1 with 300s (1) cores
% 2.00/2.24  # Starting sh5l with 300s (1) cores
% 2.00/2.24  # new_bool_3 with pid 7907 completed with status 0
% 2.00/2.24  # Result found by new_bool_3
% 2.00/2.24  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.00/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/2.24  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.00/2.24  # Starting new_bool_3 with 300s (1) cores
% 2.00/2.24  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.00/2.24  # Search class: FHHSF-FFMM32-SFFFFFNN
% 2.00/2.24  # partial match(1): FGHSF-FFMM32-SFFFFFNN
% 2.00/2.24  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.00/2.24  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 2.00/2.24  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with pid 7911 completed with status 0
% 2.00/2.24  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA
% 2.00/2.24  # Preprocessing class: FMLLSMSLSSSNFFN.
% 2.00/2.24  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.00/2.24  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 2.00/2.24  # Starting new_bool_3 with 300s (1) cores
% 2.00/2.24  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.00/2.24  # Search class: FHHSF-FFMM32-SFFFFFNN
% 2.00/2.24  # partial match(1): FGHSF-FFMM32-SFFFFFNN
% 2.00/2.24  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 2.00/2.24  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SA with 163s (1) cores
% 2.00/2.24  # Preprocessing time       : 0.005 s
% 2.00/2.24  # Presaturation interreduction done
% 2.00/2.24  
% 2.00/2.24  # Proof found!
% 2.00/2.24  # SZS status Theorem
% 2.00/2.24  # SZS output start CNFRefutation
% See solution above
% 2.00/2.24  # Parsed axioms                        : 14788
% 2.00/2.24  # Removed by relevancy pruning/SinE    : 14669
% 2.00/2.24  # Initial clauses                      : 122
% 2.00/2.24  # Removed in clause preprocessing      : 4
% 2.00/2.24  # Initial clauses in saturation        : 118
% 2.00/2.24  # Processed clauses                    : 58
% 2.00/2.24  # ...of these trivial                  : 0
% 2.00/2.24  # ...subsumed                          : 0
% 2.00/2.24  # ...remaining for further processing  : 58
% 2.00/2.24  # Other redundant clauses eliminated   : 1
% 2.00/2.24  # Clauses deleted for lack of memory   : 0
% 2.00/2.24  # Backward-subsumed                    : 0
% 2.00/2.24  # Backward-rewritten                   : 0
% 2.00/2.24  # Generated clauses                    : 1
% 2.00/2.24  # ...of the previous two non-redundant : 0
% 2.00/2.24  # ...aggressively subsumed             : 0
% 2.00/2.24  # Contextual simplify-reflections      : 0
% 2.00/2.24  # Paramodulations                      : 0
% 2.00/2.24  # Factorizations                       : 0
% 2.00/2.24  # NegExts                              : 0
% 2.00/2.24  # Equation resolutions                 : 1
% 2.00/2.24  # Disequality decompositions           : 0
% 2.00/2.24  # Total rewrite steps                  : 2
% 2.00/2.24  # ...of those cached                   : 0
% 2.00/2.24  # Propositional unsat checks           : 0
% 2.00/2.24  #    Propositional check models        : 0
% 2.00/2.24  #    Propositional check unsatisfiable : 0
% 2.00/2.24  #    Propositional clauses             : 0
% 2.00/2.24  #    Propositional clauses after purity: 0
% 2.00/2.24  #    Propositional unsat core size     : 0
% 2.00/2.24  #    Propositional preprocessing time  : 0.000
% 2.00/2.24  #    Propositional encoding time       : 0.000
% 2.00/2.24  #    Propositional solver time         : 0.000
% 2.00/2.24  #    Success case prop preproc time    : 0.000
% 2.00/2.24  #    Success case prop encoding time   : 0.000
% 2.00/2.24  #    Success case prop solver time     : 0.000
% 2.00/2.24  # Current number of processed clauses  : 57
% 2.00/2.24  #    Positive orientable unit clauses  : 57
% 2.00/2.24  #    Positive unorientable unit clauses: 0
% 2.00/2.24  #    Negative unit clauses             : 0
% 2.00/2.24  #    Non-unit-clauses                  : 0
% 2.00/2.24  # Current number of unprocessed clauses: 60
% 2.00/2.24  # ...number of literals in the above   : 78
% 2.00/2.24  # Current number of archived formulas  : 0
% 2.00/2.24  # Current number of archived clauses   : 0
% 2.00/2.24  # Clause-clause subsumption calls (NU) : 0
% 2.00/2.24  # Rec. Clause-clause subsumption calls : 0
% 2.00/2.24  # Non-unit clause-clause subsumptions  : 0
% 2.00/2.24  # Unit Clause-clause subsumption calls : 0
% 2.00/2.24  # Rewrite failures with RHS unbound    : 0
% 2.00/2.24  # BW rewrite match attempts            : 0
% 2.00/2.24  # BW rewrite match successes           : 0
% 2.00/2.24  # Condensation attempts                : 0
% 2.00/2.24  # Condensation successes               : 0
% 2.00/2.24  # Termbank termtop insertions          : 109300
% 2.00/2.24  # Search garbage collected termcells   : 52787
% 2.00/2.24  
% 2.00/2.24  # -------------------------------------------------
% 2.00/2.24  # User time                : 0.045 s
% 2.00/2.24  # System time              : 0.024 s
% 2.00/2.24  # Total time               : 0.069 s
% 2.00/2.24  # Maximum resident set size: 20268 pages
% 2.00/2.24  
% 2.00/2.24  # -------------------------------------------------
% 2.00/2.24  # User time                : 0.168 s
% 2.00/2.24  # System time              : 0.033 s
% 2.00/2.24  # Total time               : 0.202 s
% 2.00/2.24  # Maximum resident set size: 12668 pages
% 2.00/2.24  % E---3.1 exiting
%------------------------------------------------------------------------------