↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP227_1 : TPTP v9.3.1. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n004.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:54:44 PM UTC 2026

% Result   : Theorem 1.76s 2.53s
% Output   : CNFRefutation 1.76s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   10 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :   17 (  16 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   20 (  13   ~;   3   |;   4   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    4 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    2 (   0 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   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    nat: $tType ).

tff(decl_1665,type,
    ma: nat ).

tff(decl_1666,type,
    mi: nat ).

tff(decl_1670,type,
    xa: nat ).

tff(conj_0,conjecture,
    ( ( xa != ma )
    & ( xa != mi ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_0_False,axiom,
    ~ ( ( xa = ma )
      | ( xa = mi ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_False) ).

tff(c_0_2,negated_conjecture,
    ~ ( ( xa != ma )
      & ( xa != mi ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_3,negated_conjecture,
    ~ ( ( xa != ma )
      & ( xa != mi ) ),
    inference(fof_simplification,[status(thm)],[c_0_2]) ).

tff(c_0_4,negated_conjecture,
    ( ( xa = ma )
    | ( xa = mi ) ),
    inference(fof_nnf,[status(thm)],[c_0_3]) ).

tff(c_0_5,plain,
    ( ( xa != ma )
    & ( xa != mi ) ),
    inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_False])]) ).

tcf(c_0_6,negated_conjecture,
    ( ( xa = ma )
    | ( xa = mi ) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

tcf(c_0_7,plain,
    xa != ma,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

tcf(c_0_8,plain,
    xa != mi,
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_6,c_0_7]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP227_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 22:12:05 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43  Running first-order theorem proving
% 0.11/0.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.76/2.53  % Version: 3.5.1
% 1.76/2.53  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.76/2.53  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.76/2.53  % Starting new_bool_3 with 897s (3) cores
% 1.76/2.53  % Starting new_bool_1 with 897s (3) cores
% 1.76/2.53  % Starting sh5l with 299s (1) cores
% 1.76/2.53  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 1.76/2.53  % new_bool_1 with pid 1592980 completed with status 0
% 1.76/2.53  % Result found by new_bool_1
% 1.76/2.53  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.76/2.53  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.76/2.53  % Starting new_bool_3 with 897s (3) cores
% 1.76/2.53  % Starting new_bool_1 with 897s (3) cores
% 1.76/2.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.76/2.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.76/2.53  % Search class: FGHSM-SMLM32-DFFFFFNN
% 1.76/2.53  % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 1.76/2.53  % Starting SubtermCWHack with 81s (1) cores
% 1.76/2.53  % Starting new_bool_1 with 90s (1) cores
% 1.76/2.53  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 1.76/2.53  % SubtermCWHack with pid 1592983 completed with status 0
% 1.76/2.53  % Result found by SubtermCWHack
% 1.76/2.53  % Preprocessing class: FMLLSMLLSSSNFFN.
% 1.76/2.53  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 1.76/2.53  % Starting new_bool_3 with 897s (3) cores
% 1.76/2.53  % Starting new_bool_1 with 897s (3) cores
% 1.76/2.53  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.76/2.53  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.76/2.53  % Search class: FGHSM-SMLM32-DFFFFFNN
% 1.76/2.53  % Scheduled 13 strats onto 3 cores with 897 seconds (897 total)
% 1.76/2.53  % Starting SubtermCWHack with 81s (1) cores
% 1.76/2.53  % Preprocessing time       : 0.098 s
% 1.76/2.53  
% 1.76/2.53  % Proof found!
% 1.76/2.53  % SZS status Theorem
% 1.76/2.53  % SZS output start CNFRefutation
% See solution above
% 1.76/2.53  % Parsed axioms                        : 12823
% 1.76/2.53  % Removed by relevancy pruning/SinE    : 11064
% 1.76/2.53  % Initial clauses                      : 4197
% 1.76/2.53  % Removed in clause preprocessing      : 161
% 1.76/2.53  % Initial clauses in saturation        : 4036
% 1.76/2.53  % Processed clauses                    : 11
% 1.76/2.53  % ...of these trivial                  : 0
% 1.76/2.53  % ...subsumed                          : 0
% 1.76/2.53  % ...remaining for further processing  : 10
% 1.76/2.53  % Other redundant clauses eliminated   : 0
% 1.76/2.53  % Clauses deleted for lack of memory   : 0
% 1.76/2.53  % Backward-subsumed                    : 0
% 1.76/2.53  % Backward-rewritten                   : 0
% 1.76/2.53  % Generated clauses                    : 0
% 1.76/2.53  % ...of the previous two non-redundant : 0
% 1.76/2.53  % ...aggressively subsumed             : 0
% 1.76/2.53  % Contextual simplify-reflections      : 0
% 1.76/2.53  % Paramodulations                      : 0
% 1.76/2.53  % Factorizations                       : 0
% 1.76/2.53  % NegExts                              : 0
% 1.76/2.53  % Equation resolutions                 : 0
% 1.76/2.53  % Disequality decompositions           : 0
% 1.76/2.53  % Total rewrite steps                  : 0
% 1.76/2.53  % ...of those cached                   : 0
% 1.76/2.53  % Propositional unsat checks           : 0
% 1.76/2.53  %    Propositional check models        : 0
% 1.76/2.53  %    Propositional check unsatisfiable : 0
% 1.76/2.53  %    Propositional clauses             : 0
% 1.76/2.53  %    Propositional clauses after purity: 0
% 1.76/2.53  %    Propositional unsat core size     : 0
% 1.76/2.53  %    Propositional preprocessing time  : 0.000
% 1.76/2.53  %    Propositional encoding time       : 0.000
% 1.76/2.53  %    Propositional solver time         : 0.000
% 1.76/2.53  %    Success case prop preproc time    : 0.000
% 1.76/2.53  %    Success case prop encoding time   : 0.000
% 1.76/2.53  %    Success case prop solver time     : 0.000
% 1.76/2.53  % Current number of processed clauses  : 10
% 1.76/2.53  %    Positive orientable unit clauses  : 7
% 1.76/2.53  %    Positive unorientable unit clauses: 0
% 1.76/2.53  %    Negative unit clauses             : 3
% 1.76/2.53  %    Non-unit-clauses                  : 0
% 1.76/2.53  % Current number of unprocessed clauses: 4025
% 1.76/2.53  % ...number of literals in the above   : 17985
% 1.76/2.53  % Current number of archived formulas  : 0
% 1.76/2.53  % Current number of archived clauses   : 0
% 1.76/2.53  % Clause-clause subsumption calls (NU) : 0
% 1.76/2.53  % Rec. Clause-clause subsumption calls : 0
% 1.76/2.53  % Non-unit clause-clause subsumptions  : 0
% 1.76/2.53  % Unit Clause-clause subsumption calls : 1
% 1.76/2.53  % Rewrite failures with RHS unbound    : 0
% 1.76/2.53  % BW rewrite match attempts            : 0
% 1.76/2.53  % BW rewrite match successes           : 0
% 1.76/2.53  % Condensation attempts                : 0
% 1.76/2.53  % Condensation successes               : 0
% 1.76/2.53  % Termbank termtop insertions          : 635546
% 1.76/2.53  % Search garbage collected termcells   : 160852
% 1.76/2.53  
% 1.76/2.53  % -------------------------------------------------
% 1.76/2.53  % User time                : 0.436 s
% 1.76/2.53  % System time              : 0.065 s
% 1.76/2.53  % Total time               : 0.501 s
% 1.76/2.53  % Maximum resident set size: 36272 pages
% 1.76/2.53  
% 1.76/2.53  % -------------------------------------------------
% 1.76/2.53  % User time                : 2.131 s
% 1.76/2.53  % System time              : 0.180 s
% 1.76/2.53  % Total time               : 2.311 s
% 1.76/2.53  % Maximum resident set size: 29696 pages
% 1.76/2.53  % E exiting
%------------------------------------------------------------------------------