↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 2.51s 2.33s
% Output   : CNFRefutation 2.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   11 (  11 unt;   0 def)
%            Number of atoms       :   11 (   2 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    2 (   1 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   :    0 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(prove_from_SUMO_MILO,conjecture,
    s__instance(s__Animal29_1,s__Amphibian),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_from_SUMO_MILO) ).

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

fof(local_3,axiom,
    s__Frog29_1 = s__Animal29_1,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',local_3) ).

fof(c_0_3,negated_conjecture,
    ~ s__instance(s__Animal29_1,s__Amphibian),
    inference(assume_negation,[status(cth)],[prove_from_SUMO_MILO]) ).

fof(c_0_4,negated_conjecture,
    ~ s__instance(s__Animal29_1,s__Amphibian),
    inference(fof_simplification,[status(thm)],[c_0_3]) ).

fof(c_0_5,negated_conjecture,
    ~ s__instance(s__Animal29_1,s__Amphibian),
    inference(fof_nnf,[status(thm)],[c_0_4]) ).

cnf(c_0_6,plain,
    s__instance(s__Frog29_1,s__Amphibian),
    inference(split_conjunct,[status(thm)],[local_1]) ).

cnf(c_0_7,plain,
    s__Frog29_1 = s__Animal29_1,
    inference(split_conjunct,[status(thm)],[local_3]) ).

cnf(c_0_8,negated_conjecture,
    ~ s__instance(s__Animal29_1,s__Amphibian),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    s__instance(s__Animal29_1,s__Amphibian),
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : CSR098+2 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.47  % Computer : n008.cluster.edu
% 0.19/0.47  % Model    : x86_64 x86_64
% 0.19/0.47  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.47  % Memory   : 8046.5625MB
% 0.19/0.47  % OS       : Linux 6.8.0-71-generic
% 0.19/0.47  % CPULimit : 300
% 0.19/0.47  % WCLimit  : 300
% 0.19/0.47  % DateTime : Mon Sep 21 14:58:39 UTC 2026
% 0.19/0.47  % CPUTime  : 
% 0.19/0.47  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/0.56  Running first-order theorem proving
% 0.23/0.56  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
% 2.51/2.33  % Version: 3.5.1
% 2.51/2.33  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/2.33  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.51/2.33  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.51/2.33  % Starting new_bool_3 with 299s (1) cores
% 2.51/2.33  % Starting new_bool_1 with 299s (1) cores
% 2.51/2.33  % Starting sh5l with 299s (1) cores
% 2.51/2.33  % new_bool_1 with pid 1248194 completed with status 0
% 2.51/2.33  % Result found by new_bool_1
% 2.51/2.33  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/2.33  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.51/2.33  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.51/2.33  % Starting new_bool_3 with 299s (1) cores
% 2.51/2.33  % Starting new_bool_1 with 299s (1) cores
% 2.51/2.33  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.51/2.33  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.51/2.33  % Search class: FGHSS-FSLM31-MFFFFFNN
% 2.51/2.33  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 2.51/2.33  % Scheduled 8 strats onto 1 cores with 299 seconds (299 total)
% 2.51/2.33  % Starting SubtermCWHack with 27s (1) cores
% 2.51/2.33  % SubtermCWHack with pid 1248196 completed with status 0
% 2.51/2.33  % Result found by SubtermCWHack
% 2.51/2.33  % Preprocessing class: FMLLSMSLSSSNFFN.
% 2.51/2.33  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 2.51/2.33  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1495s (5) cores
% 2.51/2.33  % Starting new_bool_3 with 299s (1) cores
% 2.51/2.33  % Starting new_bool_1 with 299s (1) cores
% 2.51/2.33  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 2.51/2.33  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 2.51/2.33  % Search class: FGHSS-FSLM31-MFFFFFNN
% 2.51/2.33  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 2.51/2.33  % Scheduled 8 strats onto 1 cores with 299 seconds (299 total)
% 2.51/2.33  % Starting SubtermCWHack with 27s (1) cores
% 2.51/2.33  % Preprocessing time       : 0.023 s
% 2.51/2.33  
% 2.51/2.33  % Proof found!
% 2.51/2.33  % SZS status Theorem
% 2.51/2.33  % SZS output start CNFRefutation
% See solution above
% 2.51/2.33  % Parsed axioms                        : 37985
% 2.51/2.33  % Removed by relevancy pruning/SinE    : 37482
% 2.51/2.33  % Initial clauses                      : 525
% 2.51/2.33  % Removed in clause preprocessing      : 20
% 2.51/2.33  % Initial clauses in saturation        : 505
% 2.51/2.33  % Processed clauses                    : 435
% 2.51/2.33  % ...of these trivial                  : 0
% 2.51/2.33  % ...subsumed                          : 0
% 2.51/2.33  % ...remaining for further processing  : 434
% 2.51/2.33  % Other redundant clauses eliminated   : 0
% 2.51/2.33  % Clauses deleted for lack of memory   : 0
% 2.51/2.33  % Backward-subsumed                    : 0
% 2.51/2.33  % Backward-rewritten                   : 2
% 2.51/2.33  % Generated clauses                    : 0
% 2.51/2.33  % ...of the previous two non-redundant : 0
% 2.51/2.33  % ...aggressively subsumed             : 0
% 2.51/2.33  % Contextual simplify-reflections      : 0
% 2.51/2.33  % Paramodulations                      : 0
% 2.51/2.33  % Factorizations                       : 0
% 2.51/2.33  % NegExts                              : 0
% 2.51/2.33  % Equation resolutions                 : 0
% 2.51/2.33  % Disequality decompositions           : 0
% 2.51/2.33  % Total rewrite steps                  : 4
% 2.51/2.33  % ...of those cached                   : 0
% 2.51/2.33  % Propositional unsat checks           : 0
% 2.51/2.33  %    Propositional check models        : 0
% 2.51/2.33  %    Propositional check unsatisfiable : 0
% 2.51/2.33  %    Propositional clauses             : 0
% 2.51/2.33  %    Propositional clauses after purity: 0
% 2.51/2.33  %    Propositional unsat core size     : 0
% 2.51/2.33  %    Propositional preprocessing time  : 0.000
% 2.51/2.33  %    Propositional encoding time       : 0.000
% 2.51/2.33  %    Propositional solver time         : 0.000
% 2.51/2.33  %    Success case prop preproc time    : 0.000
% 2.51/2.33  %    Success case prop encoding time   : 0.000
% 2.51/2.33  %    Success case prop solver time     : 0.000
% 2.51/2.33  % Current number of processed clauses  : 432
% 2.51/2.33  %    Positive orientable unit clauses  : 432
% 2.51/2.33  %    Positive unorientable unit clauses: 0
% 2.51/2.33  %    Negative unit clauses             : 0
% 2.51/2.33  %    Non-unit-clauses                  : 0
% 2.51/2.33  % Current number of unprocessed clauses: 70
% 2.51/2.33  % ...number of literals in the above   : 259
% 2.51/2.33  % Current number of archived formulas  : 0
% 2.51/2.33  % Current number of archived clauses   : 2
% 2.51/2.33  % Clause-clause subsumption calls (NU) : 0
% 2.51/2.33  % Rec. Clause-clause subsumption calls : 0
% 2.51/2.33  % Non-unit clause-clause subsumptions  : 0
% 2.51/2.33  % Unit Clause-clause subsumption calls : 0
% 2.51/2.33  % Rewrite failures with RHS unbound    : 0
% 2.51/2.33  % BW rewrite match attempts            : 2
% 2.51/2.33  % BW rewrite match successes           : 2
% 2.51/2.33  % Condensation attempts                : 0
% 2.51/2.33  % Condensation successes               : 0
% 2.51/2.33  % Termbank termtop insertions          : 263495
% 2.51/2.33  % Search garbage collected termcells   : 126108
% 2.51/2.33  
% 2.51/2.33  % -------------------------------------------------
% 2.51/2.33  % User time                : 0.144 s
% 2.51/2.33  % System time              : 0.094 s
% 2.51/2.33  % Total time               : 0.238 s
% 2.51/2.33  % Maximum resident set size: 52068 pages
% 2.51/2.33  
% 2.51/2.33  % -------------------------------------------------
% 2.51/2.33  % User time                : 1.516 s
% 2.51/2.33  % System time              : 0.167 s
% 2.51/2.33  % Total time               : 1.683 s
% 2.51/2.33  % Maximum resident set size: 31488 pages
% 2.51/2.33  % E exiting
%------------------------------------------------------------------------------