↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR082+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n020.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 12:16:38 PM UTC 2026

% Result   : Theorem 0.93s 1.45s
% Output   : CNFRefutation 0.93s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   40 (  15 unt;   0 def)
%            Number of atoms       :   86 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   85 (  39   ~;  33   |;   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    :   11 (  11 usr;  11 con; 0-0 aty)
%            Number of variables   :   40 (   5 sgn  16   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(kb_SUMO_27,axiom,
    ! [X6,X7,X8] :
      ( ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) )
     => ( ( s__instance(X8,X6)
          & s__subclass(X6,X7) )
       => s__instance(X8,X7) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_27) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X7,s__SetOrClass)
        & s__instance(X6,s__SetOrClass) ) ),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_26) ).

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

fof(kb_SUMO_830,axiom,
    s__subclass(s__SentientAgent,s__Agent),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_830) ).

fof(kb_SUMO_832,axiom,
    s__subclass(s__CognitiveAgent,s__SentientAgent),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_832) ).

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

fof(kb_SUMO_6509,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+1.ax',kb_SUMO_6509) ).

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

fof(kb_SUMO_6882,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+1.ax',kb_SUMO_6882) ).

fof(kb_SUMO_827,axiom,
    s__subclass(s__Agent,s__Object),
    file('/export/starexec/sandbox/benchmark/Axioms/CSR003+1.ax',kb_SUMO_827) ).

fof(c_0_10,plain,
    ! [X1238,X1239,X1240] :
      ( s__instance(X1240,X1239)
      | ~ s__instance(X1240,X1238)
      | ~ s__subclass(X1238,X1239)
      | ~ s__instance(X1238,s__SetOrClass)
      | ~ s__instance(X1239,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_11,plain,
    ! [X1236,X1237] :
      ( ( ~ s__subclass(X1236,X1237)
        | s__instance(X1237,s__SetOrClass) )
      & ( ~ s__subclass(X1236,X1237)
        | s__instance(X1236,s__SetOrClass) ) ),
    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_12,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass)
    | s__instance(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

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

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

fof(c_0_15,negated_conjecture,
    ~ ? [X1223,X1224] :
        ( s__capability(s__Perception,X1224,s__Jane8_1)
        & s__capability(s__Reasoning,X1223,s__Jane8_1) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).

cnf(c_0_16,plain,
    ( ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | s__instance(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).

cnf(c_0_17,plain,
    s__subclass(s__SentientAgent,s__Agent),
    inference(split_conjunct,[status(thm)],[kb_SUMO_830]) ).

cnf(c_0_18,plain,
    s__subclass(s__CognitiveAgent,s__SentientAgent),
    inference(split_conjunct,[status(thm)],[kb_SUMO_832]) ).

cnf(c_0_19,plain,
    s__subclass(s__Human,s__CognitiveAgent),
    inference(split_conjunct,[status(thm)],[kb_SUMO_7281]) ).

fof(c_0_20,negated_conjecture,
    ! [X1225,X1226] :
      ( ~ s__capability(s__Perception,X1226,s__Jane8_1)
      | ~ s__capability(s__Reasoning,X1225,s__Jane8_1) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).

fof(c_0_21,plain,
    ! [X1233] :
      ( s__capability(s__Reasoning,s__agent__m,X1233)
      | ~ s__instance(X1233,s__CognitiveAgent)
      | ~ s__instance(X1233,s__Object) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_6509])])]) ).

cnf(c_0_22,plain,
    ( ~ s__instance(X1,s__SentientAgent)
    | s__instance(X1,s__Agent) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_23,plain,
    ( ~ s__instance(X1,s__CognitiveAgent)
    | s__instance(X1,s__SentientAgent) ),
    inference(spm,[status(thm)],[c_0_16,c_0_18]) ).

cnf(c_0_24,plain,
    ( ~ s__instance(X1,s__Human)
    | s__instance(X1,s__CognitiveAgent) ),
    inference(spm,[status(thm)],[c_0_16,c_0_19]) ).

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

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

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

fof(c_0_28,plain,
    ! [X1229] :
      ( s__capability(s__Perception,s__experiencer__m,X1229)
      | ~ s__instance(X1229,s__SentientAgent)
      | ~ s__instance(X1229,s__Object) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_6882])])]) ).

cnf(c_0_29,plain,
    s__subclass(s__Agent,s__Object),
    inference(split_conjunct,[status(thm)],[kb_SUMO_827]) ).

cnf(c_0_30,plain,
    ( ~ s__instance(X1,s__CognitiveAgent)
    | s__instance(X1,s__Agent) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_31,plain,
    s__instance(s__Jane8_1,s__CognitiveAgent),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_32,negated_conjecture,
    ( ~ s__instance(s__Jane8_1,s__CognitiveAgent)
    | ~ s__instance(s__Jane8_1,s__Object)
    | ~ s__capability(s__Perception,X1,s__Jane8_1) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

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

cnf(c_0_34,plain,
    ( ~ s__instance(X1,s__Agent)
    | s__instance(X1,s__Object) ),
    inference(spm,[status(thm)],[c_0_16,c_0_29]) ).

cnf(c_0_35,plain,
    s__instance(s__Jane8_1,s__Agent),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ s__instance(s__Jane8_1,s__SentientAgent)
    | ~ s__instance(s__Jane8_1,s__CognitiveAgent)
    | ~ s__instance(s__Jane8_1,s__Object) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_37,plain,
    s__instance(s__Jane8_1,s__Object),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    ~ s__instance(s__Jane8_1,s__SentientAgent),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_31])]),c_0_37])]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_23]),c_0_31])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : CSR082+5 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.43  % Computer : n020.cluster.edu
% 0.18/0.43  % Model    : x86_64 x86_64
% 0.18/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43  % Memory   : 8046.5625MB
% 0.18/0.43  % OS       : Linux 6.8.0-71-generic
% 0.18/0.43  % CPULimit : 300
% 0.18/0.43  % WCLimit  : 300
% 0.18/0.43  % DateTime : Mon Sep 21 14:52:02 UTC 2026
% 0.18/0.43  % CPUTime  : 
% 0.18/0.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.18/0.49  Running first-order theorem proving
% 0.18/0.49  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/benchmark/theBenchmark.p
% 0.93/1.45  % Version: 3.5.1
% 0.93/1.45  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.93/1.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/1.45  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.93/1.45  % Starting new_bool_3 with 300s (1) cores
% 0.93/1.45  % Starting new_bool_1 with 300s (1) cores
% 0.93/1.45  % Starting sh5l with 300s (1) cores
% 0.93/1.45  % new_bool_3 with pid 3196303 completed with status 0
% 0.93/1.45  % Result found by new_bool_3
% 0.93/1.45  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.93/1.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/1.45  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.93/1.45  % Starting new_bool_3 with 300s (1) cores
% 0.93/1.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.93/1.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.93/1.45  % Search class: FHHSF-FSLM31-MFFFFFNN
% 0.93/1.45  % partial match(1): FGHSF-FSLM31-MFFFFFNN
% 0.93/1.45  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.93/1.45  % Starting SubtermCWHack with 28s (1) cores
% 0.93/1.45  % SubtermCWHack with pid 3196307 completed with status 0
% 0.93/1.45  % Result found by SubtermCWHack
% 0.93/1.45  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.93/1.45  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.93/1.45  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.93/1.45  % Starting new_bool_3 with 300s (1) cores
% 0.93/1.45  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.93/1.45  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.93/1.45  % Search class: FHHSF-FSLM31-MFFFFFNN
% 0.93/1.45  % partial match(1): FGHSF-FSLM31-MFFFFFNN
% 0.93/1.45  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.93/1.45  % Starting SubtermCWHack with 28s (1) cores
% 0.93/1.45  % Preprocessing time       : 0.017 s
% 0.93/1.45  
% 0.93/1.45  % Proof found!
% 0.93/1.45  % SZS status Theorem
% 0.93/1.45  % SZS output start CNFRefutation
% See solution above
% 0.93/1.45  % Parsed axioms                        : 16750
% 0.93/1.45  % Removed by relevancy pruning/SinE    : 16588
% 0.93/1.45  % Initial clauses                      : 193
% 0.93/1.45  % Removed in clause preprocessing      : 4
% 0.93/1.45  % Initial clauses in saturation        : 189
% 0.93/1.45  % Processed clauses                    : 283
% 0.93/1.45  % ...of these trivial                  : 22
% 0.93/1.45  % ...subsumed                          : 2
% 0.93/1.45  % ...remaining for further processing  : 259
% 0.93/1.45  % Other redundant clauses eliminated   : 1
% 0.93/1.45  % Clauses deleted for lack of memory   : 0
% 0.93/1.45  % Backward-subsumed                    : 0
% 0.93/1.45  % Backward-rewritten                   : 2
% 0.93/1.45  % Generated clauses                    : 180
% 0.93/1.45  % ...of the previous two non-redundant : 168
% 0.93/1.45  % ...aggressively subsumed             : 0
% 0.93/1.45  % Contextual simplify-reflections      : 12
% 0.93/1.45  % Paramodulations                      : 179
% 0.93/1.45  % Factorizations                       : 0
% 0.93/1.45  % NegExts                              : 0
% 0.93/1.45  % Equation resolutions                 : 1
% 0.93/1.45  % Disequality decompositions           : 0
% 0.93/1.45  % Total rewrite steps                  : 28
% 0.93/1.45  % ...of those cached                   : 9
% 0.93/1.45  % Propositional unsat checks           : 0
% 0.93/1.45  %    Propositional check models        : 0
% 0.93/1.45  %    Propositional check unsatisfiable : 0
% 0.93/1.45  %    Propositional clauses             : 0
% 0.93/1.45  %    Propositional clauses after purity: 0
% 0.93/1.45  %    Propositional unsat core size     : 0
% 0.93/1.45  %    Propositional preprocessing time  : 0.000
% 0.93/1.45  %    Propositional encoding time       : 0.000
% 0.93/1.45  %    Propositional solver time         : 0.000
% 0.93/1.45  %    Success case prop preproc time    : 0.000
% 0.93/1.45  %    Success case prop encoding time   : 0.000
% 0.93/1.45  %    Success case prop solver time     : 0.000
% 0.93/1.45  % Current number of processed clauses  : 256
% 0.93/1.45  %    Positive orientable unit clauses  : 104
% 0.93/1.45  %    Positive unorientable unit clauses: 0
% 0.93/1.45  %    Negative unit clauses             : 1
% 0.93/1.45  %    Non-unit-clauses                  : 151
% 0.93/1.45  % Current number of unprocessed clauses: 73
% 0.93/1.45  % ...number of literals in the above   : 375
% 0.93/1.45  % Current number of archived formulas  : 0
% 0.93/1.45  % Current number of archived clauses   : 2
% 0.93/1.45  % Clause-clause subsumption calls (NU) : 1822
% 0.93/1.45  % Rec. Clause-clause subsumption calls : 1084
% 0.93/1.45  % Non-unit clause-clause subsumptions  : 14
% 0.93/1.45  % Unit Clause-clause subsumption calls : 75
% 0.93/1.45  % Rewrite failures with RHS unbound    : 0
% 0.93/1.45  % BW rewrite match attempts            : 1
% 0.93/1.45  % BW rewrite match successes           : 1
% 0.93/1.45  % Condensation attempts                : 0
% 0.93/1.45  % Condensation successes               : 0
% 0.93/1.45  % Termbank termtop insertions          : 181038
% 0.93/1.45  % Search garbage collected termcells   : 89008
% 0.93/1.45  
% 0.93/1.45  % -------------------------------------------------
% 0.93/1.45  % User time                : 0.143 s
% 0.93/1.45  % System time              : 0.095 s
% 0.93/1.45  % Total time               : 0.238 s
% 0.93/1.45  % Maximum resident set size: 42648 pages
% 0.93/1.45  
% 0.93/1.45  % -------------------------------------------------
% 0.93/1.45  % User time                : 0.786 s
% 0.93/1.45  % System time              : 0.152 s
% 0.93/1.45  % Total time               : 0.937 s
% 0.93/1.45  % Maximum resident set size: 22016 pages
% 0.93/1.45  % E exiting
%------------------------------------------------------------------------------