↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR098+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 : n001.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 0.13s 0.94s
% Output   : CNFRefutation 0.13s
% 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,conjecture,
    s__instance(s__Animal29_1,s__Amphibian),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).

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

fof(local_3,axiom,
    s__Frog29_1 = s__Animal29_1,
    file('/export/starexec/sandbox2/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]) ).

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.03  % Problem  : CSR098+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.08/0.53  % Computer : n001.cluster.edu
% 0.08/0.53  % Model    : x86_64 x86_64
% 0.08/0.53  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.53  % Memory   : 8046.5625MB
% 0.08/0.53  % OS       : Linux 6.8.0-71-generic
% 0.08/0.53  % CPULimit : 300
% 0.08/0.53  % WCLimit  : 300
% 0.08/0.53  % DateTime : Mon Sep 21 15:03:30 UTC 2026
% 0.08/0.53  % CPUTime  : 
% 0.08/0.53  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.57  Running first-order theorem proving
% 0.13/0.57  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
% 0.13/0.94  % Version: 3.5.1
% 0.13/0.94  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.13/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.94  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.13/0.94  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.94  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.94  % Starting sh5l with 300s (1) cores
% 0.13/0.94  % new_bool_1 with pid 3408967 completed with status 0
% 0.13/0.94  % Result found by new_bool_1
% 0.13/0.94  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.13/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.94  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.13/0.94  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.94  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.94  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.94  % Search class: FGHSS-FSLM31-MFFFFFNN
% 0.13/0.94  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.13/0.94  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.94  % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.94  % SubtermCWHack with pid 3408969 completed with status 0
% 0.13/0.94  % Result found by SubtermCWHack
% 0.13/0.94  % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.13/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.94  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.13/0.94  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.94  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.94  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.94  % Search class: FGHSS-FSLM31-MFFFFFNN
% 0.13/0.94  % partial match(1): FGHSM-FSLM31-MFFFFFNN
% 0.13/0.94  % Scheduled 8 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.94  % Starting SubtermCWHack with 28s (1) cores
% 0.13/0.94  % Preprocessing time       : 0.010 s
% 0.13/0.94  
% 0.13/0.94  % Proof found!
% 0.13/0.94  % SZS status Theorem
% 0.13/0.94  % SZS output start CNFRefutation
% See solution above
% 0.13/0.94  % Parsed axioms                        : 14791
% 0.13/0.94  % Removed by relevancy pruning/SinE    : 14379
% 0.13/0.94  % Initial clauses                      : 439
% 0.13/0.94  % Removed in clause preprocessing      : 20
% 0.13/0.94  % Initial clauses in saturation        : 419
% 0.13/0.94  % Processed clauses                    : 345
% 0.13/0.94  % ...of these trivial                  : 0
% 0.13/0.94  % ...subsumed                          : 0
% 0.13/0.94  % ...remaining for further processing  : 344
% 0.13/0.94  % Other redundant clauses eliminated   : 0
% 0.13/0.94  % Clauses deleted for lack of memory   : 0
% 0.13/0.94  % Backward-subsumed                    : 0
% 0.13/0.94  % Backward-rewritten                   : 2
% 0.13/0.94  % Generated clauses                    : 0
% 0.13/0.94  % ...of the previous two non-redundant : 0
% 0.13/0.94  % ...aggressively subsumed             : 0
% 0.13/0.94  % Contextual simplify-reflections      : 0
% 0.13/0.94  % Paramodulations                      : 0
% 0.13/0.94  % Factorizations                       : 0
% 0.13/0.94  % NegExts                              : 0
% 0.13/0.94  % Equation resolutions                 : 0
% 0.13/0.94  % Disequality decompositions           : 0
% 0.13/0.94  % Total rewrite steps                  : 4
% 0.13/0.94  % ...of those cached                   : 0
% 0.13/0.94  % Propositional unsat checks           : 0
% 0.13/0.94  %    Propositional check models        : 0
% 0.13/0.94  %    Propositional check unsatisfiable : 0
% 0.13/0.94  %    Propositional clauses             : 0
% 0.13/0.94  %    Propositional clauses after purity: 0
% 0.13/0.94  %    Propositional unsat core size     : 0
% 0.13/0.94  %    Propositional preprocessing time  : 0.000
% 0.13/0.94  %    Propositional encoding time       : 0.000
% 0.13/0.94  %    Propositional solver time         : 0.000
% 0.13/0.94  %    Success case prop preproc time    : 0.000
% 0.13/0.94  %    Success case prop encoding time   : 0.000
% 0.13/0.94  %    Success case prop solver time     : 0.000
% 0.13/0.94  % Current number of processed clauses  : 342
% 0.13/0.94  %    Positive orientable unit clauses  : 342
% 0.13/0.94  %    Positive unorientable unit clauses: 0
% 0.13/0.94  %    Negative unit clauses             : 0
% 0.13/0.94  %    Non-unit-clauses                  : 0
% 0.13/0.94  % Current number of unprocessed clauses: 74
% 0.13/0.94  % ...number of literals in the above   : 287
% 0.13/0.94  % Current number of archived formulas  : 0
% 0.13/0.94  % Current number of archived clauses   : 2
% 0.13/0.94  % Clause-clause subsumption calls (NU) : 0
% 0.13/0.94  % Rec. Clause-clause subsumption calls : 0
% 0.13/0.94  % Non-unit clause-clause subsumptions  : 0
% 0.13/0.94  % Unit Clause-clause subsumption calls : 0
% 0.13/0.94  % Rewrite failures with RHS unbound    : 0
% 0.13/0.94  % BW rewrite match attempts            : 2
% 0.13/0.94  % BW rewrite match successes           : 2
% 0.13/0.94  % Condensation attempts                : 0
% 0.13/0.94  % Condensation successes               : 0
% 0.13/0.94  % Termbank termtop insertions          : 121273
% 0.13/0.94  % Search garbage collected termcells   : 53690
% 0.13/0.94  
% 0.13/0.94  % -------------------------------------------------
% 0.13/0.94  % User time                : 0.042 s
% 0.13/0.94  % System time              : 0.035 s
% 0.13/0.94  % Total time               : 0.078 s
% 0.13/0.94  % Maximum resident set size: 22112 pages
% 0.13/0.94  
% 0.13/0.94  % -------------------------------------------------
% 0.13/0.94  % User time                : 0.299 s
% 0.13/0.94  % System time              : 0.054 s
% 0.13/0.94  % Total time               : 0.352 s
% 0.13/0.94  % Maximum resident set size: 15616 pages
% 0.13/0.94  % E exiting
%------------------------------------------------------------------------------