↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP220^1 : 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 : n006.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:04:45 AM UTC 2026

% Result   : Theorem 181.80s 48.50s
% Output   : CNFRefutation 181.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   21 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   29 (  10 equ;   0 cnn)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :  203 (  12   ~;   4   |;   0   &; 183   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   6 avg)
%            Number of types       :    4 (   3 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   5 con; 0-2 aty)
%            Number of variables   :   13 (   0   ^;  13   !;   0   ?;  13   :)

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

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

thf(decl_sort3,type,
    vEBT_VEBT: $tType ).

thf(decl_331,type,
    one_one_nat: nat ).

thf(decl_489,type,
    suc: nat > nat ).

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

thf(decl_560,type,
    one: num ).

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

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

thf(decl_727,type,
    dvd_dvd_nat: nat > nat > $o ).

thf(decl_849,type,
    vEBT_VEBT_membermima: vEBT_VEBT > nat > $o ).

thf(decl_857,type,
    vEBT_vebt_buildup: nat > vEBT_VEBT ).

thf(decl_876,type,
    va: nat ).

thf(decl_877,type,
    y: nat ).

thf(conj_0,conjecture,
    ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ y ),
    file('/export/starexec/sandbox/tmp/tmp.C3EApaUeJ9/E---3.1_1255901.p',conj_0) ).

thf(fact_4_div2__Suc__Suc,axiom,
    ! [X3: nat] :
      ( ( divide_divide_nat @ ( suc @ ( suc @ X3 ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
      = ( suc @ ( divide_divide_nat @ X3 @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C3EApaUeJ9/E---3.1_1255901.p',fact_4_div2__Suc__Suc) ).

thf(fact_1__C3_OIH_C_I1_J,axiom,
    ! [X1: nat,X2: nat] :
      ( ( dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ) )
     => ( ( X1
          = ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
       => ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ X1 ) @ X2 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C3EApaUeJ9/E---3.1_1255901.p',fact_1__C3_OIH_C_I1_J) ).

thf(fact_525_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.C3EApaUeJ9/E---3.1_1255901.p',fact_525_Suc__1) ).

thf(fact_0_True,axiom,
    dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ),
    file('/export/starexec/sandbox/tmp/tmp.C3EApaUeJ9/E---3.1_1255901.p',fact_0_True) ).

thf(c_0_5,negated_conjecture,
    ~ ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ y ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_6,negated_conjecture,
    vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ y,
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

thf(c_0_7,plain,
    ! [X24448: nat] :
      ( ( divide_divide_nat @ ( suc @ ( suc @ X24448 ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
      = ( suc @ ( divide_divide_nat @ X24448 @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(variable_rename,[status(thm)],[fact_4_div2__Suc__Suc]) ).

thf(c_0_8,plain,
    ! [X1: nat,X2: nat] :
      ( ( dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ) )
     => ( ( X1
          = ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
       => ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ X1 ) @ X2 ) ) ),
    inference(fof_simplification,[status(thm)],[fact_1__C3_OIH_C_I1_J]) ).

thf(c_0_9,negated_conjecture,
    vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) @ y,
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

thf(c_0_10,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_525_Suc__1]) ).

thf(c_0_11,plain,
    ! [X1: nat] :
      ( ( divide_divide_nat @ ( suc @ ( suc @ X1 ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) )
      = ( suc @ ( divide_divide_nat @ X1 @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_12,plain,
    ! [X25098: nat,X25099: nat] :
      ( ~ ( dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ) )
      | ( X25098
       != ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
      | ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ X25098 ) @ X25099 ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).

thf(c_0_13,plain,
    dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ),
    inference(split_conjunct,[status(thm)],[fact_0_True]) ).

thf(c_0_14,negated_conjecture,
    vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( suc @ one_one_nat ) ) ) @ y,
    inference(rw,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_15,plain,
    ! [X1: nat] :
      ( ( divide_divide_nat @ ( suc @ ( suc @ X1 ) ) @ ( suc @ one_one_nat ) )
      = ( suc @ ( divide_divide_nat @ X1 @ ( suc @ one_one_nat ) ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).

thf(c_0_16,plain,
    ! [X1: nat,X2: nat] :
      ( ~ ( dvd_dvd_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ ( suc @ ( suc @ va ) ) )
      | ( X1
       != ( divide_divide_nat @ ( suc @ ( suc @ va ) ) @ ( numeral_numeral_nat @ ( bit0 @ one ) ) ) )
      | ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ X1 ) @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

thf(c_0_17,plain,
    dvd_dvd_nat @ ( suc @ one_one_nat ) @ ( suc @ ( suc @ va ) ),
    inference(rw,[status(thm)],[c_0_13,c_0_10]) ).

thf(c_0_18,negated_conjecture,
    vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( suc @ ( divide_divide_nat @ va @ ( suc @ one_one_nat ) ) ) ) @ y,
    inference(rw,[status(thm)],[c_0_14,c_0_15]) ).

thf(c_0_19,plain,
    ! [X1: nat] :
      ~ ( vEBT_VEBT_membermima @ ( vEBT_vebt_buildup @ ( suc @ ( divide_divide_nat @ va @ ( suc @ one_one_nat ) ) ) ) @ X1 ),
    inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10]),c_0_15]),c_0_10]),c_0_17])])]) ).

thf(c_0_20,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_18,c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP220^1 : TPTP v9.3.1. Bugfixed v9.2.1.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n006.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 20:19:09 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.23  Running higher-order theorem proving
% 2.09/2.15  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.C3EApaUeJ9/E---3.1_1255901.p
% 181.80/48.50  % Version: 3.5.1-ho
% 181.80/48.50  % partial match(1): HMLMSMSMSSLCHFA
% 181.80/48.50  % Preprocessing class: HMLMSMLMSSLCHFA.
% 181.80/48.50  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 181.80/48.50  % Starting new_ho_10 with 1495s (5) cores
% 181.80/48.50  % Starting sh5l with 299s (1) cores
% 181.80/48.50  % Starting new_bool_1 with 299s (1) cores
% 181.80/48.50  % Starting new_bool_2 with 299s (1) cores
% 181.80/48.50  % new_bool_2 with pid 1255920 completed with status 0
% 181.80/48.50  % Result found by new_bool_2
% 181.80/48.50  % partial match(1): HMLMSMSMSSLCHFA
% 181.80/48.50  % Preprocessing class: HMLMSMLMSSLCHFA.
% 181.80/48.50  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 181.80/48.50  % Starting new_ho_10 with 1495s (5) cores
% 181.80/48.50  % Starting sh5l with 299s (1) cores
% 181.80/48.50  % Starting new_bool_1 with 299s (1) cores
% 181.80/48.50  % Starting new_bool_2 with 299s (1) cores
% 181.80/48.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 181.80/48.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 181.80/48.50  % Search class: HGHSM-SMLM32-DHFFFSBN
% 181.80/48.50  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 181.80/48.50  % Starting SubtermCWHack with 30s (1) cores
% 181.80/48.50  % SubtermCWHack with pid 1255928 completed with status 8
% 181.80/48.50  % Starting new_ho_10 with 179s (1) cores
% 181.80/48.50  % new_ho_10 with pid 1255968 completed with status 0
% 181.80/48.50  % Result found by new_ho_10
% 181.80/48.50  % partial match(1): HMLMSMSMSSLCHFA
% 181.80/48.50  % Preprocessing class: HMLMSMLMSSLCHFA.
% 181.80/48.50  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 181.80/48.50  % Starting new_ho_10 with 1495s (5) cores
% 181.80/48.50  % Starting sh5l with 299s (1) cores
% 181.80/48.50  % Starting new_bool_1 with 299s (1) cores
% 181.80/48.50  % Starting new_bool_2 with 299s (1) cores
% 181.80/48.50  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 181.80/48.50  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 181.80/48.50  % Search class: HGHSM-SMLM32-DHFFFSBN
% 181.80/48.50  % Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 181.80/48.50  % Starting SubtermCWHack with 30s (1) cores
% 181.80/48.50  % SubtermCWHack with pid 1255928 completed with status 8
% 181.80/48.50  % Starting new_ho_10 with 179s (1) cores
% 181.80/48.50  % Preprocessing time       : 0.322 s
% 181.80/48.50  % Presaturation interreduction done
% 181.80/48.50  
% 181.80/48.50  % Proof found!
% 181.80/48.50  % SZS status Theorem
% 181.80/48.50  % SZS output start CNFRefutation
% See solution above
% 181.80/48.50  % Parsed axioms                        : 11103
% 181.80/48.50  % Removed by relevancy pruning/SinE    : 7651
% 181.80/48.50  % Initial clauses                      : 8200
% 181.80/48.50  % Removed in clause preprocessing      : 1515
% 181.80/48.50  % Initial clauses in saturation        : 6685
% 181.80/48.50  % Processed clauses                    : 12633
% 181.80/48.50  % ...of these trivial                  : 416
% 181.80/48.50  % ...subsumed                          : 2868
% 181.80/48.50  % ...remaining for further processing  : 9349
% 181.80/48.50  % Other redundant clauses eliminated   : 2070
% 181.80/48.50  % Clauses deleted for lack of memory   : 0
% 181.80/48.50  % Backward-subsumed                    : 77
% 181.80/48.50  % Backward-rewritten                   : 119
% 181.80/48.50  % Generated clauses                    : 99889
% 181.80/48.50  % ...of the previous two non-redundant : 84213
% 181.80/48.50  % ...aggressively subsumed             : 0
% 181.80/48.50  % Contextual simplify-reflections      : 67
% 181.80/48.50  % Paramodulations                      : 97849
% 181.80/48.50  % Factorizations                       : 15
% 181.80/48.50  % NegExts                              : 0
% 181.80/48.50  % Equation resolutions                 : 2131
% 181.80/48.50  % Disequality decompositions           : 0
% 181.80/48.50  % Total rewrite steps                  : 47299
% 181.80/48.50  % ...of those cached                   : 40700
% 181.80/48.50  % Propositional unsat checks           : 0
% 181.80/48.50  %    Propositional check models        : 0
% 181.80/48.50  %    Propositional check unsatisfiable : 0
% 181.80/48.50  %    Propositional clauses             : 0
% 181.80/48.50  %    Propositional clauses after purity: 0
% 181.80/48.50  %    Propositional unsat core size     : 0
% 181.80/48.50  %    Propositional preprocessing time  : 0.000
% 181.80/48.50  %    Propositional encoding time       : 0.000
% 181.80/48.50  %    Propositional solver time         : 0.000
% 181.80/48.50  %    Success case prop preproc time    : 0.000
% 181.80/48.50  %    Success case prop encoding time   : 0.000
% 181.80/48.50  %    Success case prop solver time     : 0.000
% 181.80/48.50  % Current number of processed clauses  : 3373
% 181.80/48.50  %    Positive orientable unit clauses  : 876
% 181.80/48.50  %    Positive unorientable unit clauses: 41
% 181.80/48.50  %    Negative unit clauses             : 270
% 181.80/48.50  %    Non-unit-clauses                  : 2186
% 181.80/48.50  % Current number of unprocessed clauses: 82950
% 181.80/48.50  % ...number of literals in the above   : 224294
% 181.80/48.50  % Current number of archived formulas  : 0
% 181.80/48.50  % Current number of archived clauses   : 5067
% 181.80/48.50  % Clause-clause subsumption calls (NU) : 13569755
% 181.80/48.50  % Rec. Clause-clause subsumption calls : 1527071
% 181.80/48.50  % Non-unit clause-clause subsumptions  : 1337
% 181.80/48.50  % Unit Clause-clause subsumption calls : 113385
% 181.80/48.50  % Rewrite failures with RHS unbound    : 0
% 181.80/48.50  % BW rewrite match attempts            : 1639
% 181.80/48.50  % BW rewrite match successes           : 576
% 181.80/48.50  % Condensation attempts                : 12633
% 181.80/48.50  % Condensation successes               : 12
% 181.80/48.50  % Termbank termtop insertions          : 3507368
% 181.80/48.50  % Search garbage collected termcells   : 158626
% 181.80/48.50  
% 181.80/48.50  % -------------------------------------------------
% 181.80/48.50  % User time                : 43.791 s
% 181.80/48.50  % System time              : 0.672 s
% 181.80/48.50  % Total time               : 44.463 s
% 181.80/48.50  % Maximum resident set size: 43808 pages
% 181.80/48.50  
% 181.80/48.50  % -------------------------------------------------
% 181.80/48.50  % User time                : 45.027 s
% 181.80/48.50  % System time              : 0.710 s
% 181.80/48.50  % Total time               : 45.737 s
% 181.80/48.50  % Maximum resident set size: 26624 pages
% 181.80/48.50  % E exiting
%------------------------------------------------------------------------------