↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR083+2 : 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 : n026.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.58s 6.52s
% Output   : CNFRefutation 1.58s
% 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_MILO,conjecture,
    ? [X1223] :
      ( X1223 = s__Human
      & s__subclass(X1223,s__CognitiveAgent)
      & s__subclass(X1223,s__Animal) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).

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

fof(kb_SUMO_15950,axiom,
    s__subclass(s__Human,s__Animal),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+4.ax',kb_SUMO_15950) ).

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

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

cnf(c_0_5,negated_conjecture,
    ( X1 != s__Human
    | ~ s__subclass(X1,s__CognitiveAgent)
    | ~ s__subclass(X1,s__Animal) ),
    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_7281]) ).

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

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.00/0.03  % Problem  : CSR083+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/5.38  % Computer : n026.cluster.edu
% 0.09/5.38  % Model    : x86_64 x86_64
% 0.09/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/5.38  % Memory   : 8046.5625MB
% 0.09/5.38  % OS       : Linux 6.8.0-71-generic
% 0.09/5.38  % CPULimit : 300
% 0.09/5.38  % WCLimit  : 300
% 0.09/5.38  % DateTime : Mon Sep 21 14:54:13 UTC 2026
% 0.09/5.38  % CPUTime  : 
% 0.09/5.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/5.42  Running first-order theorem proving
% 0.14/5.43  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.58/6.52  % Version: 3.5.1
% 1.58/6.52  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.58/6.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/6.52  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.58/6.52  % Starting new_bool_3 with 300s (1) cores
% 1.58/6.52  % Starting new_bool_1 with 300s (1) cores
% 1.58/6.52  % Starting sh5l with 300s (1) cores
% 1.58/6.52  % new_bool_1 with pid 2545051 completed with status 0
% 1.58/6.52  % Result found by new_bool_1
% 1.58/6.52  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.58/6.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/6.52  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.58/6.52  % Starting new_bool_3 with 300s (1) cores
% 1.58/6.52  % Starting new_bool_1 with 300s (1) cores
% 1.58/6.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.58/6.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.58/6.52  % Search class: FHHSF-FFMM00-SFFFFFNN
% 1.58/6.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.58/6.52  % Starting SubtermCWHack with 31s (1) cores
% 1.58/6.52  % SubtermCWHack with pid 2545053 completed with status 0
% 1.58/6.52  % Result found by SubtermCWHack
% 1.58/6.52  % Preprocessing class: FMLLSMSLSSSNFFN.
% 1.58/6.52  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.58/6.52  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.58/6.52  % Starting new_bool_3 with 300s (1) cores
% 1.58/6.52  % Starting new_bool_1 with 300s (1) cores
% 1.58/6.52  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.58/6.52  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.58/6.52  % Search class: FHHSF-FFMM00-SFFFFFNN
% 1.58/6.52  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 1.58/6.52  % Starting SubtermCWHack with 31s (1) cores
% 1.58/6.52  % Preprocessing time       : 0.005 s
% 1.58/6.52  
% 1.58/6.52  % Proof found!
% 1.58/6.52  % SZS status Theorem
% 1.58/6.52  % SZS output start CNFRefutation
% See solution above
% 1.58/6.52  % Parsed axioms                        : 37982
% 1.58/6.52  % Removed by relevancy pruning/SinE    : 37906
% 1.58/6.52  % Initial clauses                      : 79
% 1.58/6.52  % Removed in clause preprocessing      : 4
% 1.58/6.52  % Initial clauses in saturation        : 75
% 1.58/6.52  % Processed clauses                    : 88
% 1.58/6.52  % ...of these trivial                  : 9
% 1.58/6.52  % ...subsumed                          : 0
% 1.58/6.52  % ...remaining for further processing  : 79
% 1.58/6.52  % Other redundant clauses eliminated   : 1
% 1.58/6.52  % Clauses deleted for lack of memory   : 0
% 1.58/6.52  % Backward-subsumed                    : 0
% 1.58/6.52  % Backward-rewritten                   : 2
% 1.58/6.52  % Generated clauses                    : 136
% 1.58/6.52  % ...of the previous two non-redundant : 121
% 1.58/6.52  % ...aggressively subsumed             : 0
% 1.58/6.52  % Contextual simplify-reflections      : 0
% 1.58/6.52  % Paramodulations                      : 135
% 1.58/6.52  % Factorizations                       : 0
% 1.58/6.52  % NegExts                              : 0
% 1.58/6.52  % Equation resolutions                 : 1
% 1.58/6.52  % Disequality decompositions           : 0
% 1.58/6.52  % Total rewrite steps                  : 27
% 1.58/6.52  % ...of those cached                   : 17
% 1.58/6.52  % Propositional unsat checks           : 0
% 1.58/6.52  %    Propositional check models        : 0
% 1.58/6.52  %    Propositional check unsatisfiable : 0
% 1.58/6.52  %    Propositional clauses             : 0
% 1.58/6.52  %    Propositional clauses after purity: 0
% 1.58/6.52  %    Propositional unsat core size     : 0
% 1.58/6.52  %    Propositional preprocessing time  : 0.000
% 1.58/6.52  %    Propositional encoding time       : 0.000
% 1.58/6.52  %    Propositional solver time         : 0.000
% 1.58/6.52  %    Success case prop preproc time    : 0.000
% 1.58/6.52  %    Success case prop encoding time   : 0.000
% 1.58/6.52  %    Success case prop solver time     : 0.000
% 1.58/6.52  % Current number of processed clauses  : 76
% 1.58/6.52  %    Positive orientable unit clauses  : 73
% 1.58/6.52  %    Positive unorientable unit clauses: 0
% 1.58/6.52  %    Negative unit clauses             : 0
% 1.58/6.52  %    Non-unit-clauses                  : 3
% 1.58/6.52  % Current number of unprocessed clauses: 108
% 1.58/6.52  % ...number of literals in the above   : 121
% 1.58/6.52  % Current number of archived formulas  : 0
% 1.58/6.52  % Current number of archived clauses   : 2
% 1.58/6.52  % Clause-clause subsumption calls (NU) : 2
% 1.58/6.52  % Rec. Clause-clause subsumption calls : 2
% 1.58/6.52  % Non-unit clause-clause subsumptions  : 0
% 1.58/6.52  % Unit Clause-clause subsumption calls : 0
% 1.58/6.52  % Rewrite failures with RHS unbound    : 0
% 1.58/6.52  % BW rewrite match attempts            : 2
% 1.58/6.52  % BW rewrite match successes           : 2
% 1.58/6.52  % Condensation attempts                : 0
% 1.58/6.52  % Condensation successes               : 0
% 1.58/6.52  % Termbank termtop insertions          : 250602
% 1.58/6.52  % Search garbage collected termcells   : 125507
% 1.58/6.52  
% 1.58/6.52  % -------------------------------------------------
% 1.58/6.52  % User time                : 0.109 s
% 1.58/6.52  % System time              : 0.070 s
% 1.58/6.52  % Total time               : 0.179 s
% 1.58/6.52  % Maximum resident set size: 52068 pages
% 1.58/6.52  
% 1.58/6.52  % -------------------------------------------------
% 1.58/6.52  % User time                : 0.939 s
% 1.58/6.52  % System time              : 0.118 s
% 1.58/6.52  % Total time               : 1.057 s
% 1.58/6.52  % Maximum resident set size: 31488 pages
% 1.58/6.52  % E exiting
%------------------------------------------------------------------------------