↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n014.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 1.24s 0.90s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   10
% Syntax   : Number of formulae    :   38 (  14 unt;   0 def)
%            Number of atoms       :   83 (   0 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   83 (  38   ~;  32   |;   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   :   39 (   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/sandbox2/benchmark/Axioms/CSR003+0.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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).

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

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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5315) ).

fof(kb_SUMOcache_6046,axiom,
    s__subclass(s__Human,s__Agent),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+3.ax',kb_SUMOcache_6046) ).

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/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_5688) ).

fof(kb_SUMO_723,axiom,
    s__subclass(s__Agent,s__Object),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_723) ).

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

fof(kb_SUMO_728,axiom,
    s__subclass(s__CognitiveAgent,s__SentientAgent),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_728) ).

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

fof(c_0_10,plain,
    ! [X680,X681,X682] :
      ( s__instance(X682,X681)
      | ~ s__instance(X682,X680)
      | ~ s__subclass(X680,X681)
      | ~ s__instance(X680,s__SetOrClass)
      | ~ s__instance(X681,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,
    ! [X678,X679] :
      ( ( ~ s__subclass(X678,X679)
        | s__instance(X679,s__SetOrClass) )
      & ( ~ s__subclass(X678,X679)
        | s__instance(X678,s__SetOrClass) ) ),
    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_12,negated_conjecture,
    ~ ? [X591,X592] :
        ( s__capability(s__Perception,X592,s__Jane8_1)
        & s__capability(s__Reasoning,X591,s__Jane8_1) ),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

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

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

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

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

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

cnf(c_0_19,plain,
    s__subclass(s__Human,s__Agent),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_6046]) ).

cnf(c_0_20,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_16]) ).

cnf(c_0_21,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_17]) ).

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

cnf(c_0_23,plain,
    s__subclass(s__Agent,s__Object),
    inference(split_conjunct,[status(thm)],[kb_SUMO_723]) ).

cnf(c_0_24,plain,
    ( ~ s__instance(X1,s__Human)
    | s__instance(X1,s__Agent) ),
    inference(spm,[status(thm)],[c_0_18,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__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_20,c_0_21]) ).

cnf(c_0_27,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_22]) ).

cnf(c_0_28,plain,
    ( ~ s__instance(X1,s__Agent)
    | s__instance(X1,s__Object) ),
    inference(spm,[status(thm)],[c_0_18,c_0_23]) ).

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

cnf(c_0_30,plain,
    s__subclass(s__CognitiveAgent,s__SentientAgent),
    inference(split_conjunct,[status(thm)],[kb_SUMO_728]) ).

cnf(c_0_31,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_26,c_0_27]) ).

cnf(c_0_32,plain,
    s__instance(s__Jane8_1,s__Object),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

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

cnf(c_0_35,negated_conjecture,
    ~ s__instance(s__Jane8_1,s__CognitiveAgent),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]),c_0_33]) ).

cnf(c_0_36,plain,
    ( ~ s__instance(X1,s__Human)
    | s__instance(X1,s__CognitiveAgent) ),
    inference(spm,[status(thm)],[c_0_18,c_0_34]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_25])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR082+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n014.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.36  % CPULimit : 300
% 0.12/0.36  % WCLimit  : 300
% 0.12/0.36  % DateTime : Mon Sep 21 14:50:34 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 1.24/0.90  % Version: 3.5.1
% 1.24/0.90  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.24/0.90  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.90  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.24/0.90  % Starting new_bool_3 with 300s (1) cores
% 1.24/0.90  % Starting new_bool_1 with 300s (1) cores
% 1.24/0.90  % Starting sh5l with 300s (1) cores
% 1.24/0.90  % new_bool_3 with pid 137435 completed with status 0
% 1.24/0.90  % Result found by new_bool_3
% 1.24/0.90  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.24/0.90  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.90  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.24/0.90  % Starting new_bool_3 with 300s (1) cores
% 1.24/0.90  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.24/0.90  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.90  % Search class: FGHSS-FSLM31-MFFFFFNN
% 1.24/0.90  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.24/0.90  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.90  % Starting SubtermCWHack with 28s (1) cores
% 1.24/0.90  % SubtermCWHack with pid 137440 completed with status 0
% 1.24/0.90  % Result found by SubtermCWHack
% 1.24/0.90  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.24/0.90  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.24/0.90  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.24/0.90  % Starting new_bool_3 with 300s (1) cores
% 1.24/0.90  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.24/0.90  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.24/0.90  % Search class: FGHSS-FSLM31-MFFFFFNN
% 1.24/0.90  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 1.24/0.90  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 1.24/0.90  % Starting SubtermCWHack with 28s (1) cores
% 1.24/0.90  % Preprocessing time       : 0.017 s
% 1.24/0.90  
% 1.24/0.90  % Proof found!
% 1.24/0.90  % SZS status Theorem
% 1.24/0.90  % SZS output start CNFRefutation
% See solution above
% 1.24/0.90  % Parsed axioms                        : 14789
% 1.24/0.90  % Removed by relevancy pruning/SinE    : 14096
% 1.24/0.90  % Initial clauses                      : 766
% 1.24/0.90  % Removed in clause preprocessing      : 8
% 1.24/0.90  % Initial clauses in saturation        : 758
% 1.24/0.90  % Processed clauses                    : 1750
% 1.24/0.90  % ...of these trivial                  : 429
% 1.24/0.90  % ...subsumed                          : 101
% 1.24/0.90  % ...remaining for further processing  : 1220
% 1.24/0.90  % Other redundant clauses eliminated   : 1
% 1.24/0.90  % Clauses deleted for lack of memory   : 0
% 1.24/0.90  % Backward-subsumed                    : 0
% 1.24/0.90  % Backward-rewritten                   : 20
% 1.24/0.90  % Generated clauses                    : 1975
% 1.24/0.90  % ...of the previous two non-redundant : 1531
% 1.24/0.90  % ...aggressively subsumed             : 0
% 1.24/0.90  % Contextual simplify-reflections      : 27
% 1.24/0.90  % Paramodulations                      : 1974
% 1.24/0.90  % Factorizations                       : 0
% 1.24/0.90  % NegExts                              : 0
% 1.24/0.90  % Equation resolutions                 : 1
% 1.24/0.90  % Disequality decompositions           : 0
% 1.24/0.90  % Total rewrite steps                  : 956
% 1.24/0.90  % ...of those cached                   : 779
% 1.24/0.90  % Propositional unsat checks           : 0
% 1.24/0.90  %    Propositional check models        : 0
% 1.24/0.90  %    Propositional check unsatisfiable : 0
% 1.24/0.90  %    Propositional clauses             : 0
% 1.24/0.90  %    Propositional clauses after purity: 0
% 1.24/0.90  %    Propositional unsat core size     : 0
% 1.24/0.90  %    Propositional preprocessing time  : 0.000
% 1.24/0.90  %    Propositional encoding time       : 0.000
% 1.24/0.90  %    Propositional solver time         : 0.000
% 1.24/0.90  %    Success case prop preproc time    : 0.000
% 1.24/0.90  %    Success case prop encoding time   : 0.000
% 1.24/0.90  %    Success case prop solver time     : 0.000
% 1.24/0.90  % Current number of processed clauses  : 1199
% 1.24/0.90  %    Positive orientable unit clauses  : 545
% 1.24/0.90  %    Positive unorientable unit clauses: 0
% 1.24/0.90  %    Negative unit clauses             : 1
% 1.24/0.90  %    Non-unit-clauses                  : 653
% 1.24/0.90  % Current number of unprocessed clauses: 539
% 1.24/0.90  % ...number of literals in the above   : 1683
% 1.24/0.90  % Current number of archived formulas  : 0
% 1.24/0.90  % Current number of archived clauses   : 20
% 1.24/0.90  % Clause-clause subsumption calls (NU) : 55820
% 1.24/0.90  % Rec. Clause-clause subsumption calls : 37956
% 1.24/0.90  % Non-unit clause-clause subsumptions  : 128
% 1.24/0.90  % Unit Clause-clause subsumption calls : 1066
% 1.24/0.90  % Rewrite failures with RHS unbound    : 0
% 1.24/0.90  % BW rewrite match attempts            : 20
% 1.24/0.90  % BW rewrite match successes           : 19
% 1.24/0.90  % Condensation attempts                : 0
% 1.24/0.90  % Condensation successes               : 0
% 1.24/0.90  % Termbank termtop insertions          : 164227
% 1.24/0.90  % Search garbage collected termcells   : 56079
% 1.24/0.90  
% 1.24/0.90  % -------------------------------------------------
% 1.24/0.90  % User time                : 0.140 s
% 1.24/0.90  % System time              : 0.050 s
% 1.24/0.90  % Total time               : 0.190 s
% 1.24/0.90  % Maximum resident set size: 22368 pages
% 1.24/0.90  
% 1.24/0.90  % -------------------------------------------------
% 1.24/0.90  % User time                : 0.398 s
% 1.24/0.90  % System time              : 0.073 s
% 1.24/0.90  % Total time               : 0.471 s
% 1.24/0.90  % Maximum resident set size: 15616 pages
% 1.24/0.90  % E exiting
%------------------------------------------------------------------------------