↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP238_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 : n015.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:50 PM UTC 2026

% Result   : Theorem 211.29s 34.27s
% Output   : CNFRefutation 211.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   24 (  17 unt;   0 typ;   0 def)
%            Number of atoms       :   31 (  22 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   25 (  18   ~;   4   |;   0   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :   10 (   9 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   2 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  12 con; 0-2 aty)
%            Number of variables   :   10 (   0 sgn  10   !;   0   ?;  10   :)

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

tff(decl_sort2,type,
    nat: $tType ).

tff(decl_sort3,type,
    fun_nat_nat: $tType ).

tff(decl_sort4,type,
    list_VEBT_VEBT: $tType ).

tff(decl_sort5,type,
    num: $tType ).

tff(decl_sort6,type,
    option_nat: $tType ).

tff(decl_sort7,type,
    vEBT_VEBT: $tType ).

tff(decl_sort8,type,
    fun_num_nat: $tType ).

tff(decl_sort9,type,
    fun_num_num: $tType ).

tff(decl_942,type,
    one_one_nat: nat ).

tff(decl_1114,type,
    nth_VEBT_VEBT: ( nat * list_VEBT_VEBT ) > vEBT_VEBT ).

tff(decl_1143,type,
    suc: fun_nat_nat ).

tff(decl_1210,type,
    bit0: fun_num_num ).

tff(decl_1212,type,
    one: num ).

tff(decl_1220,type,
    numeral_numeral_nat: fun_num_nat ).

tff(decl_1226,type,
    none_nat: option_nat ).

tff(decl_1229,type,
    some_nat: nat > option_nat ).

tff(decl_1452,type,
    divide_divide_nat: fun_nat_fun_nat_nat ).

tff(decl_1601,type,
    vEBT_VEBT_high: fun_nat_fun_nat_nat ).

tff(decl_1638,type,
    vEBT_vebt_mint: vEBT_VEBT > option_nat ).

tff(decl_1738,type,
    aa_nat_nat: ( nat * fun_nat_nat ) > nat ).

tff(decl_1762,type,
    aa_nat_fun_nat_nat: ( nat * fun_nat_fun_nat_nat ) > fun_nat_nat ).

tff(decl_1786,type,
    aa_num_nat: ( num * fun_num_nat ) > nat ).

tff(decl_1787,type,
    aa_num_num: ( num * fun_num_num ) > num ).

tff(decl_2085,type,
    deg: nat ).

tff(decl_2089,type,
    na: nat ).

tff(decl_2091,type,
    thesis: $o ).

tff(decl_2092,type,
    treeList: list_VEBT_VEBT ).

tff(decl_2093,type,
    xa: nat ).

tff(decl_2103,type,
    esk3_1: option_nat > nat ).

fof(conj_1,conjecture,
    thesis,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

tff(fact_0_False,axiom,
    vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_False) ).

tff(conj_0,hypothesis,
    ! [X21335: nat] :
      ( ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) = some_nat(X21335) )
     => thesis ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062,axiom,
    aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = na,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

tff(fact_1123_Suc__1,axiom,
    aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1123_Suc__1) ).

tff(fact_85_option_Oexhaust,axiom,
    ! [X121: option_nat] :
      ( ( X121 != none_nat )
     => ~ ! [X122: nat] : ( X121 != some_nat(X122) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_85_option_Oexhaust) ).

fof(c_0_6,negated_conjecture,
    ~ thesis,
    inference(assume_negation,[status(cth)],[conj_1]) ).

fof(c_0_7,negated_conjecture,
    ~ thesis,
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

tff(c_0_8,plain,
    vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
    inference(fof_simplification,[status(thm)],[fact_0_False]) ).

tff(c_0_9,hypothesis,
    ! [X21336: nat] :
      ( thesis
      | ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != some_nat(X21336) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_0])])]) ).

tcf(c_0_10,plain,
    aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))) = na,
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

tcf(c_0_11,plain,
    aa_nat_nat(suc,one_one_nat) = aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)),
    inference(split_conjunct,[status(thm)],[fact_1123_Suc__1]) ).

fof(c_0_12,negated_conjecture,
    ~ thesis,
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

tff(c_0_13,plain,
    ! [X121: option_nat] :
      ( ( X121 != none_nat )
     => ~ ! [X122: nat] : ( X121 != some_nat(X122) ) ),
    inference(fof_simplification,[status(thm)],[fact_85_option_Oexhaust]) ).

tff(c_0_14,plain,
    vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
    inference(fof_nnf,[status(thm)],[c_0_8]) ).

tcf(c_0_15,hypothesis,
    ! [X3: nat] :
      ( ( vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != some_nat(X3) )
      | thesis ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

tcf(c_0_16,plain,
    aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_nat_nat(suc,one_one_nat)) = na,
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    ~ thesis,
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tff(c_0_18,plain,
    ! [X21347: option_nat] :
      ( ( X21347 = some_nat(esk3_1(X21347)) )
      | ( X21347 = none_nat ) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).

tcf(c_0_19,plain,
    vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))) != none_nat,
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

tcf(c_0_20,hypothesis,
    ! [X3: nat] : vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))) != some_nat(X3),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_16]),c_0_17]) ).

tcf(c_0_21,plain,
    ! [X21: option_nat] :
      ( ( X21 = some_nat(esk3_1(X21)) )
      | ( X21 = none_nat ) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

tcf(c_0_22,plain,
    vEBT_vebt_mint(nth_VEBT_VEBT(treeList,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))) != none_nat,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_11]),c_0_16]) ).

cnf(c_0_23,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21])]),c_0_22]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : ITP238_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  % Computer : n015.cluster.edu
% 0.10/0.39  % Model    : x86_64 x86_64
% 0.10/0.39  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.39  % Memory   : 8046.5625MB
% 0.10/0.39  % OS       : Linux 6.8.0-71-generic
% 0.10/0.39  % CPULimit : 300
% 0.10/0.39  % WCLimit  : 300
% 0.10/0.39  % DateTime : Sun Sep 20 22:18:21 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.44  Running first-order theorem proving
% 0.10/0.44  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
% 211.29/34.27  % Version: 3.5.1
% 211.29/34.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 211.29/34.27  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 211.29/34.27  % Starting new_bool_3 with 897s (3) cores
% 211.29/34.27  % Starting new_bool_1 with 897s (3) cores
% 211.29/34.27  % Starting sh5l with 299s (1) cores
% 211.29/34.27  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 211.29/34.27  % new_bool_1 with pid 4049735 completed with status 0
% 211.29/34.27  % Result found by new_bool_1
% 211.29/34.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 211.29/34.27  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 211.29/34.27  % Starting new_bool_3 with 897s (3) cores
% 211.29/34.27  % Starting new_bool_1 with 897s (3) cores
% 211.29/34.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 211.29/34.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 211.29/34.27  % Search class: FGHSM-SMLM32-DFFFFFNN
% 211.29/34.27  % Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 211.29/34.27  % Starting SubtermCWHack with 81s (1) cores
% 211.29/34.27  % Starting new_bool_1 with 90s (1) cores
% 211.29/34.27  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 211.29/34.27  % SubtermCWHack with pid 4049738 completed with status 0
% 211.29/34.27  % Result found by SubtermCWHack
% 211.29/34.27  % Preprocessing class: FMLLSMLLSSSNFFN.
% 211.29/34.27  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 211.29/34.27  % Starting new_bool_3 with 897s (3) cores
% 211.29/34.27  % Starting new_bool_1 with 897s (3) cores
% 211.29/34.27  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 211.29/34.27  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 211.29/34.27  % Search class: FGHSM-SMLM32-DFFFFFNN
% 211.29/34.27  % Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 211.29/34.27  % Starting SubtermCWHack with 81s (1) cores
% 211.29/34.27  % Preprocessing time       : 0.253 s
% 211.29/34.27  
% 211.29/34.27  % Proof found!
% 211.29/34.27  % SZS status Theorem
% 211.29/34.27  % SZS output start CNFRefutation
% See solution above
% 211.29/34.27  % Parsed axioms                        : 13554
% 211.29/34.27  % Removed by relevancy pruning/SinE    : 9568
% 211.29/34.27  % Initial clauses                      : 11690
% 211.29/34.27  % Removed in clause preprocessing      : 2036
% 211.29/34.27  % Initial clauses in saturation        : 9654
% 211.29/34.27  % Processed clauses                    : 59906
% 211.29/34.27  % ...of these trivial                  : 2168
% 211.29/34.27  % ...subsumed                          : 43549
% 211.29/34.27  % ...remaining for further processing  : 14189
% 211.29/34.27  % Other redundant clauses eliminated   : 3270
% 211.29/34.27  % Clauses deleted for lack of memory   : 0
% 211.29/34.27  % Backward-subsumed                    : 614
% 211.29/34.27  % Backward-rewritten                   : 2161
% 211.29/34.27  % Generated clauses                    : 635975
% 211.29/34.27  % ...of the previous two non-redundant : 534312
% 211.29/34.27  % ...aggressively subsumed             : 0
% 211.29/34.27  % Contextual simplify-reflections      : 40
% 211.29/34.27  % Paramodulations                      : 632459
% 211.29/34.27  % Factorizations                       : 191
% 211.29/34.27  % NegExts                              : 0
% 211.29/34.27  % Equation resolutions                 : 3375
% 211.29/34.27  % Disequality decompositions           : 0
% 211.29/34.27  % Total rewrite steps                  : 301686
% 211.29/34.27  % ...of those cached                   : 279509
% 211.29/34.27  % Propositional unsat checks           : 0
% 211.29/34.27  %    Propositional check models        : 0
% 211.29/34.27  %    Propositional check unsatisfiable : 0
% 211.29/34.27  %    Propositional clauses             : 0
% 211.29/34.27  %    Propositional clauses after purity: 0
% 211.29/34.27  %    Propositional unsat core size     : 0
% 211.29/34.27  %    Propositional preprocessing time  : 0.000
% 211.29/34.27  %    Propositional encoding time       : 0.000
% 211.29/34.27  %    Propositional solver time         : 0.000
% 211.29/34.27  %    Success case prop preproc time    : 0.000
% 211.29/34.27  %    Success case prop encoding time   : 0.000
% 211.29/34.27  %    Success case prop solver time     : 0.000
% 211.29/34.27  % Current number of processed clauses  : 10584
% 211.29/34.27  %    Positive orientable unit clauses  : 3442
% 211.29/34.27  %    Positive unorientable unit clauses: 51
% 211.29/34.27  %    Negative unit clauses             : 2377
% 211.29/34.27  %    Non-unit-clauses                  : 4714
% 211.29/34.27  % Current number of unprocessed clauses: 470717
% 211.29/34.27  % ...number of literals in the above   : 1581532
% 211.29/34.27  % Current number of archived formulas  : 0
% 211.29/34.27  % Current number of archived clauses   : 2781
% 211.29/34.27  % Clause-clause subsumption calls (NU) : 5300479
% 211.29/34.27  % Rec. Clause-clause subsumption calls : 2989890
% 211.29/34.27  % Non-unit clause-clause subsumptions  : 19163
% 211.29/34.27  % Unit Clause-clause subsumption calls : 6207142
% 211.29/34.27  % Rewrite failures with RHS unbound    : 0
% 211.29/34.27  % BW rewrite match attempts            : 50596
% 211.29/34.27  % BW rewrite match successes           : 2209
% 211.29/34.27  % Condensation attempts                : 0
% 211.29/34.27  % Condensation successes               : 0
% 211.29/34.27  % Termbank termtop insertions          : 11641675
% 211.29/34.27  % Search garbage collected termcells   : 217403
% 211.29/34.27  
% 211.29/34.27  % -------------------------------------------------
% 211.29/34.27  % User time                : 30.036 s
% 211.29/34.27  % System time              : 0.633 s
% 211.29/34.27  % Total time               : 30.669 s
% 211.29/34.27  % Maximum resident set size: 61240 pages
% 211.29/34.27  
% 211.29/34.27  % -------------------------------------------------
% 211.29/34.27  % User time                : 89.420 s
% 211.29/34.27  % System time              : 1.196 s
% 211.29/34.27  % Total time               : 90.615 s
% 211.29/34.27  % Maximum resident set size: 34560 pages
% 211.29/34.27  % E exiting
%------------------------------------------------------------------------------