↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : ITP246^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n005.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 : Wed Sep 30 08:06:02 AM UTC 2026

% Result   : Theorem 69.35s 27.81s
% Output   : CNFRefutation 69.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   19 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   27 (  12 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  177 (  13   ~;   8   |;   0   &; 156   @)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Number of types       :    3 (   2 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   12 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :    8 (   0   ^;   8   !;   0   ?;   8   :)

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

thf(decl_sort2,type,
    num: $tType ).

thf(decl_528,type,
    bit0: num > num ).

thf(decl_530,type,
    one: num ).

thf(decl_538,type,
    numeral_numeral_nat: num > nat ).

thf(decl_594,type,
    ord_less_eq_nat: nat > nat > $o ).

thf(decl_712,type,
    divide_divide_nat: nat > nat > nat ).

thf(decl_843,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_904,type,
    deg: nat ).

thf(decl_909,type,
    na: nat ).

thf(decl_914,type,
    xa: nat ).

thf(decl_915,type,
    za: nat ).

thf(conj_0,conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
    = ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p',conj_0) ).

thf(fact_49_verit__la__disequality,axiom,
    ! [X36: nat,X37: nat] :
      ( ( X36 = X37 )
      | ~ ( ord_less_eq_nat @ X36 @ X37 )
      | ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
    file('/export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p',fact_49_verit__la__disequality) ).

thf(fact_0_bbbb,axiom,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p',fact_0_bbbb) ).

thf(fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    file('/export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p',fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

thf(fact_2_aaaa,axiom,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p',fact_2_aaaa) ).

thf(c_0_5,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_6,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

thf(c_0_7,plain,
    ! [X36: nat,X37: nat] :
      ( ( X36 = X37 )
      | ~ ( ord_less_eq_nat @ X36 @ X37 )
      | ~ ( ord_less_eq_nat @ X37 @ X36 ) ),
    inference(fof_simplification,[status(thm)],[fact_49_verit__la__disequality]) ).

thf(c_0_8,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

thf(c_0_9,plain,
    ! [X28209: nat,X28210: nat] :
      ( ( X28209 = X28210 )
      | ~ ( ord_less_eq_nat @ X28209 @ X28210 )
      | ~ ( ord_less_eq_nat @ X28210 @ X28209 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_7])]) ).

thf(c_0_10,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_0_bbbb]) ).

thf(c_0_11,plain,
    ( ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
    = na ),
    inference(split_conjunct,[status(thm)],[fact_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

thf(c_0_12,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_2_aaaa]) ).

thf(c_0_13,negated_conjecture,
    ( ( vEBT_VEBT_high @ xa @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
   != ( vEBT_VEBT_high @ za @ ( divide_divide_nat @ deg @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

thf(c_0_14,plain,
    ! [X3: nat,X2: nat] :
      ( ( X2 = X3 )
      | ~ ( ord_less_eq_nat @ X2 @ X3 )
      | ~ ( ord_less_eq_nat @ X3 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ za @ na ) @ ( vEBT_VEBT_high @ xa @ na ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]) ).

thf(c_0_16,plain,
    ord_less_eq_nat @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_VEBT_high @ za @ na ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_11]),c_0_11]) ).

thf(c_0_17,negated_conjecture,
    ( ( vEBT_VEBT_high @ za @ na )
   != ( vEBT_VEBT_high @ xa @ na ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]) ).

thf(c_0_18,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP246^3 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.19  % Computer : n005.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 20:32:01 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 4.97/5.07  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.NNinraLMrs/E---3.1_2164905.p
% 69.35/27.81  % Version: 3.5.1-ho
% 69.35/27.81  % partial match(1): HMLMSMSMSSLCHFA
% 69.35/27.81  % Preprocessing class: HMLMSMLMSSLCHFA.
% 69.35/27.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 69.35/27.81  % Starting new_ho_10 with 1495s (5) cores
% 69.35/27.81  % Starting sh5l with 299s (1) cores
% 69.35/27.81  % Starting new_bool_1 with 299s (1) cores
% 69.35/27.81  % Starting new_bool_2 with 299s (1) cores
% 69.35/27.81  % new_bool_1 with pid 2165106 completed with status 0
% 69.35/27.81  % Result found by new_bool_1
% 69.35/27.81  % partial match(1): HMLMSMSMSSLCHFA
% 69.35/27.81  % Preprocessing class: HMLMSMLMSSLCHFA.
% 69.35/27.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 69.35/27.81  % Starting new_ho_10 with 1495s (5) cores
% 69.35/27.81  % Starting sh5l with 299s (1) cores
% 69.35/27.81  % Starting new_bool_1 with 299s (1) cores
% 69.35/27.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 69.35/27.81  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 69.35/27.81  % Search class: HGHSM-SMLM32-DHFFFSBN
% 69.35/27.81  % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 69.35/27.81  % Starting SubtermCWHack with 30s (1) cores
% 69.35/27.81  % SubtermCWHack with pid 2165115 completed with status 0
% 69.35/27.81  % Result found by SubtermCWHack
% 69.35/27.81  % partial match(1): HMLMSMSMSSLCHFA
% 69.35/27.81  % Preprocessing class: HMLMSMLMSSLCHFA.
% 69.35/27.81  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 69.35/27.81  % Starting new_ho_10 with 1495s (5) cores
% 69.35/27.81  % Starting sh5l with 299s (1) cores
% 69.35/27.81  % Starting new_bool_1 with 299s (1) cores
% 69.35/27.81  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 69.35/27.81  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 69.35/27.81  % Search class: HGHSM-SMLM32-DHFFFSBN
% 69.35/27.81  % Scheduled 5 strats onto 1 cores with 297 seconds (297 total)
% 69.35/27.81  % Starting SubtermCWHack with 30s (1) cores
% 69.35/27.81  % Preprocessing time       : 0.213 s
% 69.35/27.81  
% 69.35/27.81  % Proof found!
% 69.35/27.81  % SZS status Theorem
% 69.35/27.81  % SZS output start CNFRefutation
% See solution above
% 69.35/27.81  % Parsed axioms                        : 11234
% 69.35/27.81  % Removed by relevancy pruning/SinE    : 7424
% 69.35/27.81  % Initial clauses                      : 10298
% 69.35/27.81  % Removed in clause preprocessing      : 2316
% 69.35/27.81  % Initial clauses in saturation        : 7982
% 69.35/27.81  % Processed clauses                    : 53559
% 69.35/27.81  % ...of these trivial                  : 13338
% 69.35/27.81  % ...subsumed                          : 26000
% 69.35/27.81  % ...remaining for further processing  : 14221
% 69.35/27.81  % Other redundant clauses eliminated   : 2111
% 69.35/27.81  % Clauses deleted for lack of memory   : 0
% 69.35/27.81  % Backward-subsumed                    : 284
% 69.35/27.81  % Backward-rewritten                   : 507
% 69.35/27.81  % Generated clauses                    : 353834
% 69.35/27.81  % ...of the previous two non-redundant : 296351
% 69.35/27.81  % ...aggressively subsumed             : 0
% 69.35/27.81  % Contextual simplify-reflections      : 56
% 69.35/27.81  % Paramodulations                      : 351554
% 69.35/27.81  % Factorizations                       : 32
% 69.35/27.81  % NegExts                              : 0
% 69.35/27.81  % Equation resolutions                 : 2203
% 69.35/27.81  % Disequality decompositions           : 0
% 69.35/27.81  % Total rewrite steps                  : 131744
% 69.35/27.81  % ...of those cached                   : 111890
% 69.35/27.81  % Propositional unsat checks           : 0
% 69.35/27.81  %    Propositional check models        : 0
% 69.35/27.81  %    Propositional check unsatisfiable : 0
% 69.35/27.81  %    Propositional clauses             : 0
% 69.35/27.81  %    Propositional clauses after purity: 0
% 69.35/27.81  %    Propositional unsat core size     : 0
% 69.35/27.81  %    Propositional preprocessing time  : 0.000
% 69.35/27.81  %    Propositional encoding time       : 0.000
% 69.35/27.81  %    Propositional solver time         : 0.000
% 69.35/27.81  %    Success case prop preproc time    : 0.000
% 69.35/27.81  %    Success case prop encoding time   : 0.000
% 69.35/27.81  %    Success case prop solver time     : 0.000
% 69.35/27.81  % Current number of processed clauses  : 12779
% 69.35/27.81  %    Positive orientable unit clauses  : 5275
% 69.35/27.81  %    Positive unorientable unit clauses: 45
% 69.35/27.81  %    Negative unit clauses             : 4234
% 69.35/27.81  %    Non-unit-clauses                  : 3225
% 69.35/27.81  % Current number of unprocessed clauses: 249730
% 69.35/27.81  % ...number of literals in the above   : 677022
% 69.35/27.81  % Current number of archived formulas  : 0
% 69.35/27.81  % Current number of archived clauses   : 795
% 69.35/27.81  % Clause-clause subsumption calls (NU) : 2583634
% 69.35/27.81  % Rec. Clause-clause subsumption calls : 1267505
% 69.35/27.81  % Non-unit clause-clause subsumptions  : 4051
% 69.35/27.81  % Unit Clause-clause subsumption calls : 5688094
% 69.35/27.81  % Rewrite failures with RHS unbound    : 0
% 69.35/27.81  % BW rewrite match attempts            : 22157
% 69.35/27.81  % BW rewrite match successes           : 680
% 69.35/27.81  % Condensation attempts                : 0
% 69.35/27.81  % Condensation successes               : 0
% 69.35/27.81  % Termbank termtop insertions          : 5037412
% 69.35/27.81  % Search garbage collected termcells   : 206070
% 69.35/27.81  
% 69.35/27.81  % -------------------------------------------------
% 69.35/27.81  % User time                : 20.335 s
% 69.35/27.81  % System time              : 0.471 s
% 69.35/27.81  % Total time               : 20.806 s
% 69.35/27.81  % Maximum resident set size: 47552 pages
% 69.35/27.81  
% 69.35/27.81  % -------------------------------------------------
% 69.35/27.81  % User time                : 21.729 s
% 69.35/27.81  % System time              : 0.532 s
% 69.35/27.81  % Total time               : 22.261 s
% 69.35/27.81  % Maximum resident set size: 28160 pages
% 69.35/27.81  % E exiting
%------------------------------------------------------------------------------