↑ Up

E---3.5.1.THM-CRf.s

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

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

% Result   : Theorem 149.98s 24.05s
% Output   : CNFRefutation 149.98s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   18 (  15 unt;   0 typ;   0 def)
%            Number of atoms       :   23 (  12 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   13 (   8   ~;   3   |;   1   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of types       :   13 (  12 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   22 (  22 usr;  12 con; 0-2 aty)
%            Number of variables   :    6 (   0 sgn   6   !;   0   ?;   6   :)

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

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

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

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

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

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

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

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

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

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

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

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

tff(decl_816,type,
    one_one_nat: nat ).

tff(decl_1019,type,
    suc: fun_nat_nat ).

tff(decl_1087,type,
    bit0: fun_num_num ).

tff(decl_1089,type,
    one: num ).

tff(decl_1097,type,
    numeral_numeral_nat: fun_num_nat ).

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

tff(decl_1290,type,
    divide_divide_nat: fun_nat_fun_nat_nat ).

tff(decl_1433,type,
    vEBT_VEBT_high: fun_nat_fun_nat_nat ).

tff(decl_1451,type,
    vEBT_VEBT_set_vebt: vEBT_VEBT > set_nat ).

tff(decl_1469,type,
    vEBT_is_succ_in_set: set_nat > fun_nat_fun_nat_bool ).

tff(decl_1470,type,
    vEBT_vebt_succ: ( nat * vEBT_VEBT ) > option_nat ).

tff(decl_1534,type,
    aa_nat_bool: ( nat * fun_nat_bool ) > bool ).

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

tff(decl_1556,type,
    aa_nat_fun_nat_bool: ( nat * fun_nat_fun_nat_bool ) > fun_nat_bool ).

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

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

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

tff(decl_1790,type,
    pp: bool > $o ).

tff(decl_1791,type,
    deg: nat ).

tff(decl_1795,type,
    na: nat ).

tff(decl_1796,type,
    sc: nat ).

tff(decl_1797,type,
    summary: vEBT_VEBT ).

tff(decl_1799,type,
    xa: nat ).

tff(conj_0,conjecture,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),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))))),sc)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

tff(fact_4__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/sandbox/benchmark/theBenchmark.p',fact_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

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

tff(fact_0__C4_Ohyps_C_I3_J,axiom,
    ! [X1: nat,X2: nat] :
      ( ( vEBT_vebt_succ(summary,X1) = some_nat(X2) )
    <=> pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),X1),X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_0__C4_Ohyps_C_I3_J) ).

tff(fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062,axiom,
    vEBT_vebt_succ(summary,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(sc),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062) ).

tff(c_0_5,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),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))))),sc)),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_6,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),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))))),sc)),
    inference(fof_simplification,[status(thm)],[c_0_5]) ).

tff(c_0_7,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),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))))),sc)),
    inference(fof_nnf,[status(thm)],[c_0_6]) ).

tcf(c_0_8,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_4__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

tcf(c_0_9,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_2717_Suc__1]) ).

tcf(c_0_10,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),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))))),sc)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

tcf(c_0_11,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_8,c_0_9]) ).

tff(c_0_12,plain,
    ! [X20941: nat,X20942: nat] :
      ( ( ( vEBT_vebt_succ(summary,X20941) = some_nat(X20942) )
        | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),X20941),X20942)) )
      & ( pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),X20941),X20942))
        | ( vEBT_vebt_succ(summary,X20941) != some_nat(X20942) ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0__C4_Ohyps_C_I3_J])])]) ).

tcf(c_0_13,plain,
    vEBT_vebt_succ(summary,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(sc),
    inference(split_conjunct,[status(thm)],[fact_1__092_060open_062vebt__succ_Asummary_A_Ihigh_Ax_A_Ideg_Adiv_A2_J_J_A_061_ASome_Asc_092_060close_062]) ).

tcf(c_0_14,negated_conjecture,
    ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),sc)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_9]),c_0_11]) ).

tcf(c_0_15,plain,
    ! [X1: nat,X2: nat] :
      ( ( vEBT_vebt_succ(summary,X1) != some_nat(X2) )
      | pp(aa_nat_bool(aa_nat_fun_nat_bool(vEBT_is_succ_in_set(vEBT_VEBT_set_vebt(summary)),X1),X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_16,plain,
    vEBT_vebt_succ(summary,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)) = some_nat(sc),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_9]),c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP243_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.39  % Computer : n020.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:17:17 UTC 2026
% 0.10/0.39  % CPUTime  : 
% 0.10/0.39  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.45  Running first-order theorem proving
% 0.10/0.45  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 149.98/24.05  % Version: 3.5.1
% 149.98/24.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 149.98/24.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 149.98/24.05  % Starting new_bool_3 with 900s (3) cores
% 149.98/24.05  % Starting new_bool_1 with 900s (3) cores
% 149.98/24.05  % Starting sh5l with 300s (1) cores
% 149.98/24.05  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 300s (1) cores
% 149.98/24.05  % new_bool_3 with pid 1335026 completed with status 0
% 149.98/24.05  % Result found by new_bool_3
% 149.98/24.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 149.98/24.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 149.98/24.05  % Starting new_bool_3 with 900s (3) cores
% 149.98/24.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 149.98/24.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 149.98/24.05  % Search class: FGHSM-SMLM32-DFFFFFNN
% 149.98/24.05  % Scheduled 13 strats onto 3 cores with 898 seconds (898 total)
% 149.98/24.05  % Starting SubtermCWHack with 81s (1) cores
% 149.98/24.05  % Starting new_bool_3 with 90s (1) cores
% 149.98/24.05  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 149.98/24.05  % SubtermCWHack with pid 1335033 completed with status 0
% 149.98/24.05  % Result found by SubtermCWHack
% 149.98/24.05  % Preprocessing class: FMLLSMLLSSSNFFN.
% 149.98/24.05  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 149.98/24.05  % Starting new_bool_3 with 900s (3) cores
% 149.98/24.05  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 149.98/24.05  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 149.98/24.05  % Search class: FGHSM-SMLM32-DFFFFFNN
% 149.98/24.05  % Scheduled 13 strats onto 3 cores with 898 seconds (898 total)
% 149.98/24.05  % Starting SubtermCWHack with 81s (1) cores
% 149.98/24.05  % Preprocessing time       : 0.216 s
% 149.98/24.05  
% 149.98/24.05  % Proof found!
% 149.98/24.05  % SZS status Theorem
% 149.98/24.05  % SZS output start CNFRefutation
% See solution above
% 149.98/24.05  % Parsed axioms                        : 12997
% 149.98/24.05  % Removed by relevancy pruning/SinE    : 8854
% 149.98/24.05  % Initial clauses                      : 11087
% 149.98/24.05  % Removed in clause preprocessing      : 2029
% 149.98/24.05  % Initial clauses in saturation        : 9058
% 149.98/24.05  % Processed clauses                    : 63063
% 149.98/24.05  % ...of these trivial                  : 3117
% 149.98/24.05  % ...subsumed                          : 42109
% 149.98/24.05  % ...remaining for further processing  : 17837
% 149.98/24.05  % Other redundant clauses eliminated   : 3183
% 149.98/24.05  % Clauses deleted for lack of memory   : 0
% 149.98/24.05  % Backward-subsumed                    : 256
% 149.98/24.05  % Backward-rewritten                   : 208
% 149.98/24.05  % Generated clauses                    : 409378
% 149.98/24.05  % ...of the previous two non-redundant : 357461
% 149.98/24.05  % ...aggressively subsumed             : 0
% 149.98/24.05  % Contextual simplify-reflections      : 58
% 149.98/24.05  % Paramodulations                      : 406098
% 149.98/24.05  % Factorizations                       : 51
% 149.98/24.05  % NegExts                              : 0
% 149.98/24.05  % Equation resolutions                 : 3285
% 149.98/24.05  % Disequality decompositions           : 0
% 149.98/24.05  % Total rewrite steps                  : 134210
% 149.98/24.05  % ...of those cached                   : 112550
% 149.98/24.05  % Propositional unsat checks           : 0
% 149.98/24.05  %    Propositional check models        : 0
% 149.98/24.05  %    Propositional check unsatisfiable : 0
% 149.98/24.05  %    Propositional clauses             : 0
% 149.98/24.05  %    Propositional clauses after purity: 0
% 149.98/24.05  %    Propositional unsat core size     : 0
% 149.98/24.05  %    Propositional preprocessing time  : 0.000
% 149.98/24.05  %    Propositional encoding time       : 0.000
% 149.98/24.05  %    Propositional solver time         : 0.000
% 149.98/24.05  %    Success case prop preproc time    : 0.000
% 149.98/24.05  %    Success case prop encoding time   : 0.000
% 149.98/24.05  %    Success case prop solver time     : 0.000
% 149.98/24.05  % Current number of processed clauses  : 16447
% 149.98/24.05  %    Positive orientable unit clauses  : 3625
% 149.98/24.05  %    Positive unorientable unit clauses: 58
% 149.98/24.05  %    Negative unit clauses             : 6319
% 149.98/24.05  %    Non-unit-clauses                  : 6445
% 149.98/24.05  % Current number of unprocessed clauses: 302288
% 149.98/24.05  % ...number of literals in the above   : 846672
% 149.98/24.05  % Current number of archived formulas  : 0
% 149.98/24.05  % Current number of archived clauses   : 464
% 149.98/24.05  % Clause-clause subsumption calls (NU) : 13698417
% 149.98/24.05  % Rec. Clause-clause subsumption calls : 7687329
% 149.98/24.05  % Non-unit clause-clause subsumptions  : 8127
% 149.98/24.05  % Unit Clause-clause subsumption calls : 6250168
% 149.98/24.05  % Rewrite failures with RHS unbound    : 0
% 149.98/24.05  % BW rewrite match attempts            : 137846
% 149.98/24.05  % BW rewrite match successes           : 382
% 149.98/24.05  % Condensation attempts                : 0
% 149.98/24.05  % Condensation successes               : 0
% 149.98/24.05  % Termbank termtop insertions          : 9293048
% 149.98/24.05  % Search garbage collected termcells   : 212375
% 149.98/24.05  
% 149.98/24.05  % -------------------------------------------------
% 149.98/24.05  % User time                : 21.763 s
% 149.98/24.05  % System time              : 0.402 s
% 149.98/24.05  % Total time               : 22.165 s
% 149.98/24.05  % Maximum resident set size: 58656 pages
% 149.98/24.05  
% 149.98/24.05  % -------------------------------------------------
% 149.98/24.05  % User time                : 62.990 s
% 149.98/24.05  % System time              : 0.805 s
% 149.98/24.05  % Total time               : 63.795 s
% 149.98/24.05  % Maximum resident set size: 33280 pages
% 149.98/24.05  % E exiting
%------------------------------------------------------------------------------