↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR103+6 : 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 : n015.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:53 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_ALL,conjecture,
    ! [X2341] : s__instance(X2341,s__Entity),
    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,
    ~ ! [X2341] : s__instance(X2341,s__Entity),
    inference(assume_negation,[status(cth)],[prove_from_ALL]) ).

fof(c_0_3,negated_conjecture,
    ~ s__instance(esk1_0,s__Entity),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

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

cnf(c_0_5,negated_conjecture,
    ~ s__instance(esk1_0,s__Entity),
    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)],[c_0_5,c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR103+6 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.46  % Computer : n015.cluster.edu
% 0.19/0.46  % Model    : x86_64 x86_64
% 0.19/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.46  % Memory   : 8046.5625MB
% 0.19/0.46  % OS       : Linux 6.8.0-71-generic
% 0.19/0.46  % CPULimit : 300
% 0.19/0.46  % WCLimit  : 300
% 0.19/0.46  % DateTime : Mon Sep 21 15:02:22 UTC 2026
% 0.19/0.46  % CPUTime  : 
% 0.19/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.53  Running first-order theorem proving
% 0.23/0.53  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
% 3.93/5.04  % Version: 3.5.1
% 3.93/5.04  % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.93/5.04  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 3.93/5.04  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 3.93/5.04  % Starting new_bool_3 with 297s (1) cores
% 3.93/5.04  % Starting new_bool_1 with 297s (1) cores
% 3.93/5.04  % Starting sh5l with 297s (1) cores
% 3.93/5.04  % new_bool_1 with pid 1734711 completed with status 0
% 3.93/5.04  % Result found by new_bool_1
% 3.93/5.04  % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.93/5.04  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 3.93/5.04  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 3.93/5.04  % Starting new_bool_3 with 297s (1) cores
% 3.93/5.04  % Starting new_bool_1 with 297s (1) cores
% 3.93/5.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.93/5.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.93/5.04  % Search class: FGHSF-FSLM33-SFFFFFNN
% 3.93/5.04  % Scheduled 11 strats onto 1 cores with 297 seconds (297 total)
% 3.93/5.04  % Starting SubtermCWHack with 27s (1) cores
% 3.93/5.04  % SubtermCWHack with pid 1734714 completed with status 0
% 3.93/5.04  % Result found by SubtermCWHack
% 3.93/5.04  % Preprocessing class: FMLLSMSLSSSNFFN.
% 3.93/5.04  % Scheduled 4 strats onto 8 cores with 297 seconds (2376 total)
% 3.93/5.04  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1485s (5) cores
% 3.93/5.04  % Starting new_bool_3 with 297s (1) cores
% 3.93/5.04  % Starting new_bool_1 with 297s (1) cores
% 3.93/5.04  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.93/5.04  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.93/5.04  % Search class: FGHSF-FSLM33-SFFFFFNN
% 3.93/5.04  % Scheduled 11 strats onto 1 cores with 297 seconds (297 total)
% 3.93/5.04  % Starting SubtermCWHack with 27s (1) cores
% 3.93/5.04  % Preprocessing time       : 0.118 s
% 3.93/5.04  
% 3.93/5.04  % Proof found!
% 3.93/5.04  % SZS status Theorem
% 3.93/5.04  % SZS output start CNFRefutation
% See solution above
% 3.93/5.04  % Parsed axioms                        : 55587
% 3.93/5.04  % Removed by relevancy pruning/SinE    : 55445
% 3.93/5.04  % Initial clauses                      : 176
% 3.93/5.04  % Removed in clause preprocessing      : 9
% 3.93/5.04  % Initial clauses in saturation        : 167
% 3.93/5.04  % Processed clauses                    : 45
% 3.93/5.04  % ...of these trivial                  : 0
% 3.93/5.04  % ...subsumed                          : 0
% 3.93/5.04  % ...remaining for further processing  : 44
% 3.93/5.04  % Other redundant clauses eliminated   : 0
% 3.93/5.04  % Clauses deleted for lack of memory   : 0
% 3.93/5.04  % Backward-subsumed                    : 0
% 3.93/5.04  % Backward-rewritten                   : 1
% 3.93/5.04  % Generated clauses                    : 0
% 3.93/5.04  % ...of the previous two non-redundant : 0
% 3.93/5.04  % ...aggressively subsumed             : 0
% 3.93/5.04  % Contextual simplify-reflections      : 0
% 3.93/5.04  % Paramodulations                      : 0
% 3.93/5.04  % Factorizations                       : 0
% 3.93/5.04  % NegExts                              : 0
% 3.93/5.04  % Equation resolutions                 : 0
% 3.93/5.04  % Disequality decompositions           : 0
% 3.93/5.04  % Total rewrite steps                  : 2
% 3.93/5.04  % ...of those cached                   : 0
% 3.93/5.04  % Propositional unsat checks           : 0
% 3.93/5.04  %    Propositional check models        : 0
% 3.93/5.04  %    Propositional check unsatisfiable : 0
% 3.93/5.04  %    Propositional clauses             : 0
% 3.93/5.04  %    Propositional clauses after purity: 0
% 3.93/5.04  %    Propositional unsat core size     : 0
% 3.93/5.04  %    Propositional preprocessing time  : 0.000
% 3.93/5.04  %    Propositional encoding time       : 0.000
% 3.93/5.04  %    Propositional solver time         : 0.000
% 3.93/5.04  %    Success case prop preproc time    : 0.000
% 3.93/5.04  %    Success case prop encoding time   : 0.000
% 3.93/5.04  %    Success case prop solver time     : 0.000
% 3.93/5.04  % Current number of processed clauses  : 43
% 3.93/5.04  %    Positive orientable unit clauses  : 43
% 3.93/5.04  %    Positive unorientable unit clauses: 0
% 3.93/5.04  %    Negative unit clauses             : 0
% 3.93/5.04  %    Non-unit-clauses                  : 0
% 3.93/5.04  % Current number of unprocessed clauses: 122
% 3.93/5.04  % ...number of literals in the above   : 575
% 3.93/5.04  % Current number of archived formulas  : 0
% 3.93/5.04  % Current number of archived clauses   : 1
% 3.93/5.04  % Clause-clause subsumption calls (NU) : 0
% 3.93/5.04  % Rec. Clause-clause subsumption calls : 0
% 3.93/5.04  % Non-unit clause-clause subsumptions  : 0
% 3.93/5.04  % Unit Clause-clause subsumption calls : 0
% 3.93/5.04  % Rewrite failures with RHS unbound    : 0
% 3.93/5.04  % BW rewrite match attempts            : 1
% 3.93/5.04  % BW rewrite match successes           : 1
% 3.93/5.04  % Condensation attempts                : 0
% 3.93/5.04  % Condensation successes               : 0
% 3.93/5.04  % Termbank termtop insertions          : 663214
% 3.93/5.04  % Search garbage collected termcells   : 292941
% 3.93/5.04  
% 3.93/5.04  % -------------------------------------------------
% 3.93/5.04  % User time                : 0.390 s
% 3.93/5.04  % System time              : 0.300 s
% 3.93/5.04  % Total time               : 0.689 s
% 3.93/5.04  % Maximum resident set size: 136964 pages
% 3.93/5.04  
% 3.93/5.04  % -------------------------------------------------
% 3.93/5.04  % User time                : 3.904 s
% 3.93/5.04  % System time              : 0.477 s
% 3.93/5.04  % Total time               : 4.381 s
% 3.93/5.04  % Maximum resident set size: 64000 pages
% 3.93/5.04  % E exiting
%------------------------------------------------------------------------------