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

View Problem - Process Solution

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

% Computer : n022.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 : Mon May 20 19:18:13 EDT 2024

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

% 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/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/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).

fof(kb_SUMOcache_6051,axiom,
    s__subclass(s__Human,s__SentientAgent),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+3.ax',kb_SUMOcache_6051) ).

fof(kb_SUMOcache_3334,axiom,
    s__subclass(s__SentientAgent,s__Object),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+3.ax',kb_SUMOcache_3334) ).

fof(local_1,axiom,
    s__instance(s__Jane8_1,s__Human),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_1) ).

fof(kb_SUMO_5315,axiom,
    ! [X91] :
      ( s__instance(X91,s__Object)
     => ( s__instance(X91,s__CognitiveAgent)
       => s__capability(s__Reasoning,s__agent__m,X91) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5315) ).

fof(kb_SUMO_6087,axiom,
    s__subclass(s__Human,s__CognitiveAgent),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_6087) ).

fof(prove_from_SUMO,conjecture,
    ? [X591,X592] :
      ( s__capability(s__Reasoning,X591,s__Jane8_1)
      & s__capability(s__Perception,X592,s__Jane8_1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(kb_SUMO_5688,axiom,
    ! [X91] :
      ( s__instance(X91,s__Object)
     => ( s__instance(X91,s__SentientAgent)
       => s__capability(s__Perception,s__experiencer__m,X91) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5688) ).

fof(c_0_9,plain,
    ! [X680,X681,X682] :
      ( ~ s__instance(X681,s__SetOrClass)
      | ~ s__instance(X680,s__SetOrClass)
      | ~ s__subclass(X680,X681)
      | ~ s__instance(X682,X680)
      | s__instance(X682,X681) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_10,plain,
    ! [X678,X679] :
      ( ( s__instance(X678,s__SetOrClass)
        | ~ s__subclass(X678,X679) )
      & ( s__instance(X679,s__SetOrClass)
        | ~ s__subclass(X678,X679) ) ),
    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_11,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_9]) ).

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

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

cnf(c_0_14,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_15,plain,
    s__subclass(s__Human,s__SentientAgent),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_6051]) ).

cnf(c_0_16,plain,
    s__subclass(s__SentientAgent,s__Object),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_3334]) ).

cnf(c_0_17,plain,
    ( s__instance(X1,s__SentientAgent)
    | ~ s__instance(X1,s__Human) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_18,plain,
    s__instance(s__Jane8_1,s__Human),
    inference(split_conjunct,[status(thm)],[local_1]) ).

fof(c_0_19,plain,
    ! [X628] :
      ( ~ s__instance(X628,s__Object)
      | ~ s__instance(X628,s__CognitiveAgent)
      | s__capability(s__Reasoning,s__agent__m,X628) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_5315])])]) ).

cnf(c_0_20,plain,
    ( s__instance(X1,s__Object)
    | ~ s__instance(X1,s__SentientAgent) ),
    inference(spm,[status(thm)],[c_0_14,c_0_16]) ).

cnf(c_0_21,plain,
    s__instance(s__Jane8_1,s__SentientAgent),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

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

fof(c_0_23,negated_conjecture,
    ~ ? [X591,X592] :
        ( s__capability(s__Reasoning,X591,s__Jane8_1)
        & s__capability(s__Perception,X592,s__Jane8_1) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

cnf(c_0_24,plain,
    ( s__capability(s__Reasoning,s__agent__m,X1)
    | ~ s__instance(X1,s__Object)
    | ~ s__instance(X1,s__CognitiveAgent) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_25,plain,
    s__instance(s__Jane8_1,s__Object),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_26,plain,
    ( s__instance(X1,s__CognitiveAgent)
    | ~ s__instance(X1,s__Human) ),
    inference(spm,[status(thm)],[c_0_14,c_0_22]) ).

fof(c_0_27,plain,
    ! [X624] :
      ( ~ s__instance(X624,s__Object)
      | ~ s__instance(X624,s__SentientAgent)
      | s__capability(s__Perception,s__experiencer__m,X624) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_5688])])]) ).

fof(c_0_28,negated_conjecture,
    ! [X593,X594] :
      ( ~ s__capability(s__Reasoning,X593,s__Jane8_1)
      | ~ s__capability(s__Perception,X594,s__Jane8_1) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).

cnf(c_0_29,plain,
    ( s__capability(s__Reasoning,s__agent__m,s__Jane8_1)
    | ~ s__instance(s__Jane8_1,s__CognitiveAgent) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_30,plain,
    s__instance(s__Jane8_1,s__CognitiveAgent),
    inference(spm,[status(thm)],[c_0_26,c_0_18]) ).

cnf(c_0_31,plain,
    ( s__capability(s__Perception,s__experiencer__m,X1)
    | ~ s__instance(X1,s__Object)
    | ~ s__instance(X1,s__SentientAgent) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ s__capability(s__Reasoning,X1,s__Jane8_1)
    | ~ s__capability(s__Perception,X2,s__Jane8_1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_33,plain,
    s__capability(s__Reasoning,s__agent__m,s__Jane8_1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).

cnf(c_0_34,plain,
    s__capability(s__Perception,s__experiencer__m,s__Jane8_1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_25]),c_0_21])]) ).

cnf(c_0_35,negated_conjecture,
    ~ s__capability(s__Perception,X1,s__Jane8_1),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,plain,
    $false,
    inference(sr,[status(thm)],[c_0_34,c_0_35]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem    : CSR082+1 : TPTP v8.2.0. Bugfixed v7.3.0.
% 0.07/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n022.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    : 300
% 0.13/0.34  % DateTime   : Sun May 19 01:10:53 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.19/0.47  Running first-order model finding
% 0.19/0.47  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/benchmark/theBenchmark.p
% 0.52/0.89  # Version: 3.1.0
% 0.52/0.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.52/0.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.52/0.89  # Starting new_bool_3 with 300s (1) cores
% 0.52/0.89  # Starting new_bool_1 with 300s (1) cores
% 0.52/0.89  # Starting sh5l with 300s (1) cores
% 0.52/0.89  # new_bool_3 with pid 3346 completed with status 0
% 0.52/0.89  # Result found by new_bool_3
% 0.52/0.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.52/0.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.52/0.89  # Starting new_bool_3 with 300s (1) cores
% 0.52/0.89  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.52/0.89  # Search class: FGHSS-FSLM31-MFFFFFNN
% 0.52/0.89  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.52/0.89  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.89  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.52/0.89  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with pid 3351 completed with status 0
% 0.52/0.89  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d
% 0.52/0.89  # Preprocessing class: FMLLSMSLSSSNFFN.
% 0.52/0.89  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.52/0.89  # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.52/0.89  # Starting new_bool_3 with 300s (1) cores
% 0.52/0.89  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.52/0.89  # Search class: FGHSS-FSLM31-MFFFFFNN
% 0.52/0.89  # partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.52/0.89  # Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.52/0.89  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 135s (1) cores
% 0.52/0.89  # Preprocessing time       : 0.011 s
% 0.52/0.89  # Presaturation interreduction done
% 0.52/0.89  
% 0.52/0.89  # Proof found!
% 0.52/0.89  # SZS status Theorem
% 0.52/0.89  # SZS output start CNFRefutation
% See solution above
% 0.52/0.89  # Parsed axioms                        : 14789
% 0.52/0.89  # Removed by relevancy pruning/SinE    : 14096
% 0.52/0.89  # Initial clauses                      : 766
% 0.52/0.89  # Removed in clause preprocessing      : 8
% 0.52/0.89  # Initial clauses in saturation        : 758
% 0.52/0.89  # Processed clauses                    : 2631
% 0.52/0.89  # ...of these trivial                  : 455
% 0.52/0.89  # ...subsumed                          : 10
% 0.52/0.89  # ...remaining for further processing  : 2166
% 0.52/0.89  # Other redundant clauses eliminated   : 13
% 0.52/0.89  # Clauses deleted for lack of memory   : 0
% 0.52/0.89  # Backward-subsumed                    : 1
% 0.52/0.89  # Backward-rewritten                   : 5
% 0.52/0.89  # Generated clauses                    : 4007
% 0.52/0.89  # ...of the previous two non-redundant : 3151
% 0.52/0.89  # ...aggressively subsumed             : 0
% 0.52/0.89  # Contextual simplify-reflections      : 65
% 0.52/0.89  # Paramodulations                      : 3993
% 0.52/0.89  # Factorizations                       : 0
% 0.52/0.89  # NegExts                              : 0
% 0.52/0.89  # Equation resolutions                 : 13
% 0.52/0.89  # Disequality decompositions           : 0
% 0.52/0.89  # Total rewrite steps                  : 2343
% 0.52/0.89  # ...of those cached                   : 1947
% 0.52/0.89  # Propositional unsat checks           : 0
% 0.52/0.89  #    Propositional check models        : 0
% 0.52/0.89  #    Propositional check unsatisfiable : 0
% 0.52/0.89  #    Propositional clauses             : 0
% 0.52/0.89  #    Propositional clauses after purity: 0
% 0.52/0.89  #    Propositional unsat core size     : 0
% 0.52/0.89  #    Propositional preprocessing time  : 0.000
% 0.52/0.89  #    Propositional encoding time       : 0.000
% 0.52/0.89  #    Propositional solver time         : 0.000
% 0.52/0.89  #    Success case prop preproc time    : 0.000
% 0.52/0.89  #    Success case prop encoding time   : 0.000
% 0.52/0.89  #    Success case prop solver time     : 0.000
% 0.52/0.89  # Current number of processed clauses  : 1422
% 0.52/0.89  #    Positive orientable unit clauses  : 726
% 0.52/0.89  #    Positive unorientable unit clauses: 0
% 0.52/0.89  #    Negative unit clauses             : 1
% 0.52/0.89  #    Non-unit-clauses                  : 695
% 0.52/0.89  # Current number of unprocessed clauses: 2002
% 0.52/0.89  # ...number of literals in the above   : 2877
% 0.52/0.89  # Current number of archived formulas  : 0
% 0.52/0.89  # Current number of archived clauses   : 731
% 0.52/0.89  # Clause-clause subsumption calls (NU) : 102544
% 0.52/0.89  # Rec. Clause-clause subsumption calls : 32595
% 0.52/0.89  # Non-unit clause-clause subsumptions  : 75
% 0.52/0.89  # Unit Clause-clause subsumption calls : 11446
% 0.52/0.89  # Rewrite failures with RHS unbound    : 0
% 0.52/0.89  # BW rewrite match attempts            : 8
% 0.52/0.89  # BW rewrite match successes           : 5
% 0.52/0.89  # Condensation attempts                : 0
% 0.52/0.89  # Condensation successes               : 0
% 0.52/0.89  # Termbank termtop insertions          : 191290
% 0.52/0.89  # Search garbage collected termcells   : 56079
% 0.52/0.89  
% 0.52/0.89  # -------------------------------------------------
% 0.52/0.89  # User time                : 0.170 s
% 0.52/0.89  # System time              : 0.032 s
% 0.52/0.89  # Total time               : 0.202 s
% 0.52/0.89  # Maximum resident set size: 20284 pages
% 0.52/0.89  
% 0.52/0.89  # -------------------------------------------------
% 0.52/0.89  # User time                : 0.362 s
% 0.52/0.89  # System time              : 0.046 s
% 0.52/0.89  # Total time               : 0.408 s
% 0.52/0.89  # Maximum resident set size: 12436 pages
% 0.52/0.89  % E---3.1 exiting
%------------------------------------------------------------------------------