↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR108+7 : 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 : n008.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:57 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ? [X2351] :
      ( s__instance(s__Entity44_10,X2351)
      & s__instance(s__Entity44_9,X2351)
      & s__instance(s__Entity44_2,X2351)
      & s__instance(s__Entity44_1,X2351) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_ALL) ).

fof(kb_SUMO_27371,axiom,
    ! [X857] : s__instance(X857,s__Entity),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+2.ax',kb_SUMO_27371) ).

fof(c_0_2,negated_conjecture,
    ~ ? [X2351] :
        ( s__instance(s__Entity44_10,X2351)
        & s__instance(s__Entity44_9,X2351)
        & s__instance(s__Entity44_2,X2351)
        & s__instance(s__Entity44_1,X2351) ),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_3,negated_conjecture,
    ! [X2352] :
      ( ~ s__instance(s__Entity44_10,X2352)
      | ~ s__instance(s__Entity44_9,X2352)
      | ~ s__instance(s__Entity44_2,X2352)
      | ~ s__instance(s__Entity44_1,X2352) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])]) ).

fof(c_0_4,plain,
    ! [X2353] : s__instance(X2353,s__Entity),
    inference(variable_rename,[status(thm)],[kb_SUMO_27371]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ s__instance(s__Entity44_10,X1)
    | ~ s__instance(s__Entity44_9,X1)
    | ~ s__instance(s__Entity44_2,X1)
    | ~ s__instance(s__Entity44_1,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    s__instance(X1,s__Entity),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR108+7 : 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/0.36  % Computer : n008.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Mon Sep 21 15:02:40 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 0.09/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.40  Running first-order theorem proving
% 0.14/0.40  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
% 2.27/2.88  % Version: 3.5.1
% 2.27/2.88  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.27/2.88  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 2.27/2.88  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 2.27/2.88  % Starting new_bool_3 with 298s (1) cores
% 2.27/2.88  % Starting new_bool_1 with 298s (1) cores
% 2.27/2.88  % Starting sh5l with 298s (1) cores
% 2.27/2.88  % new_bool_3 with pid 1253955 completed with status 0
% 2.27/2.88  % Result found by new_bool_3
% 2.27/2.88  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.27/2.88  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 2.27/2.88  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 2.27/2.88  % Starting new_bool_3 with 298s (1) cores
% 2.27/2.88  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.27/2.88  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.27/2.88  % Search class: FHHSF-FFMM00-SFFFFFNN
% 2.27/2.88  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 2.27/2.88  % Starting SubtermCWHack with 30s (1) cores
% 2.27/2.88  % SubtermCWHack with pid 1253958 completed with status 0
% 2.27/2.88  % Result found by SubtermCWHack
% 2.27/2.88  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.27/2.88  % Scheduled 4 strats onto 8 cores with 298 seconds (2384 total)
% 2.27/2.88  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1490s (5) cores
% 2.27/2.88  % Starting new_bool_3 with 298s (1) cores
% 2.27/2.88  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.27/2.88  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.27/2.88  % Search class: FHHSF-FFMM00-SFFFFFNN
% 2.27/2.88  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 2.27/2.88  % Starting SubtermCWHack with 30s (1) cores
% 2.27/2.88  % Preprocessing time       : 0.025 s
% 2.27/2.88  
% 2.27/2.88  % Proof found!
% 2.27/2.88  % SZS status Theorem
% 2.27/2.88  % SZS output start CNFRefutation
% See solution above
% 2.27/2.88  % Parsed axioms                        : 55611
% 2.27/2.88  % Removed by relevancy pruning/SinE    : 55562
% 2.27/2.88  % Initial clauses                      : 56
% 2.27/2.88  % Removed in clause preprocessing      : 4
% 2.27/2.88  % Initial clauses in saturation        : 52
% 2.27/2.88  % Processed clauses                    : 78
% 2.27/2.88  % ...of these trivial                  : 11
% 2.27/2.88  % ...subsumed                          : 0
% 2.27/2.88  % ...remaining for further processing  : 67
% 2.27/2.88  % Other redundant clauses eliminated   : 0
% 2.27/2.88  % Clauses deleted for lack of memory   : 0
% 2.27/2.88  % Backward-subsumed                    : 0
% 2.27/2.88  % Backward-rewritten                   : 11
% 2.27/2.88  % Generated clauses                    : 41
% 2.27/2.88  % ...of the previous two non-redundant : 33
% 2.27/2.88  % ...aggressively subsumed             : 0
% 2.27/2.88  % Contextual simplify-reflections      : 2
% 2.27/2.88  % Paramodulations                      : 41
% 2.27/2.88  % Factorizations                       : 0
% 2.27/2.88  % NegExts                              : 0
% 2.27/2.88  % Equation resolutions                 : 0
% 2.27/2.88  % Disequality decompositions           : 0
% 2.27/2.88  % Total rewrite steps                  : 29
% 2.27/2.88  % ...of those cached                   : 11
% 2.27/2.88  % Propositional unsat checks           : 0
% 2.27/2.88  %    Propositional check models        : 0
% 2.27/2.88  %    Propositional check unsatisfiable : 0
% 2.27/2.88  %    Propositional clauses             : 0
% 2.27/2.88  %    Propositional clauses after purity: 0
% 2.27/2.88  %    Propositional unsat core size     : 0
% 2.27/2.88  %    Propositional preprocessing time  : 0.000
% 2.27/2.88  %    Propositional encoding time       : 0.000
% 2.27/2.88  %    Propositional solver time         : 0.000
% 2.27/2.88  %    Success case prop preproc time    : 0.000
% 2.27/2.88  %    Success case prop encoding time   : 0.000
% 2.27/2.88  %    Success case prop solver time     : 0.000
% 2.27/2.88  % Current number of processed clauses  : 56
% 2.27/2.88  %    Positive orientable unit clauses  : 49
% 2.27/2.88  %    Positive unorientable unit clauses: 0
% 2.27/2.88  %    Negative unit clauses             : 0
% 2.27/2.88  %    Non-unit-clauses                  : 7
% 2.27/2.88  % Current number of unprocessed clauses: 7
% 2.27/2.88  % ...number of literals in the above   : 24
% 2.27/2.88  % Current number of archived formulas  : 0
% 2.27/2.88  % Current number of archived clauses   : 11
% 2.27/2.88  % Clause-clause subsumption calls (NU) : 10
% 2.27/2.88  % Rec. Clause-clause subsumption calls : 9
% 2.27/2.88  % Non-unit clause-clause subsumptions  : 2
% 2.27/2.88  % Unit Clause-clause subsumption calls : 4
% 2.27/2.88  % Rewrite failures with RHS unbound    : 0
% 2.27/2.88  % BW rewrite match attempts            : 11
% 2.27/2.88  % BW rewrite match successes           : 11
% 2.27/2.88  % Condensation attempts                : 0
% 2.27/2.88  % Condensation successes               : 0
% 2.27/2.88  % Termbank termtop insertions          : 650575
% 2.27/2.88  % Search garbage collected termcells   : 291079
% 2.27/2.88  
% 2.27/2.88  % -------------------------------------------------
% 2.27/2.88  % User time                : 0.184 s
% 2.27/2.88  % System time              : 0.099 s
% 2.27/2.88  % Total time               : 0.284 s
% 2.27/2.88  % Maximum resident set size: 137276 pages
% 2.27/2.88  
% 2.27/2.88  % -------------------------------------------------
% 2.27/2.88  % User time                : 2.207 s
% 2.27/2.88  % System time              : 0.217 s
% 2.27/2.88  % Total time               : 2.424 s
% 2.27/2.88  % Maximum resident set size: 63744 pages
% 2.27/2.88  % E exiting
%------------------------------------------------------------------------------