↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 215.75s 34.29s
% Output   : CNFRefutation 215.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   22 (  18 unt;   0 typ;   0 def)
%            Number of atoms       :   30 (  15 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   21 (  13   ~;   8   |;   0   &)
%                                         (   0 <=>;   0  =>;   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;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;  12 con; 0-2 aty)
%            Number of variables   :    8 (   0 sgn   8   !;   0   ?;   8   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_sort1,type,
    fun_nat_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,
    nat: $tType ).

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

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

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

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

tff(decl_604,type,
    one_one_nat: nat ).

tff(decl_784,type,
    suc: fun_nat_nat ).

tff(decl_849,type,
    bit0: fun_num_num ).

tff(decl_851,type,
    one: num ).

tff(decl_859,type,
    numeral_numeral_nat: fun_num_nat ).

tff(decl_915,type,
    ord_less_eq_nat: fun_nat_fun_nat_bool ).

tff(decl_1033,type,
    divide_divide_nat: fun_nat_fun_nat_nat ).

tff(decl_1164,type,
    vEBT_VEBT_high: fun_nat_fun_nat_nat ).

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

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

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

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

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

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

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

tff(decl_1431,type,
    deg: nat ).

tff(decl_1436,type,
    na: nat ).

tff(decl_1441,type,
    xa: nat ).

tff(decl_1442,type,
    za: nat ).

tff(conj_0,conjecture,
    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)))) = aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

tff(fact_49_verit__la__disequality,axiom,
    ! [X36: nat,X37: nat] :
      ( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X37),X36))
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X36),X37))
      | ( X36 = X37 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_49_verit__la__disequality) ).

tff(fact_5__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_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062) ).

tff(fact_335_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_335_Suc__1) ).

tff(fact_0_bbbb,axiom,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))))),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)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_bbbb) ).

tff(fact_2_aaaa,axiom,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,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))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2_aaaa) ).

tff(c_0_6,negated_conjecture,
    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)))) != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
    inference(assume_negation,[status(cth)],[conj_0]) ).

tff(c_0_7,negated_conjecture,
    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)))) != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
    inference(fof_simplification,[status(thm)],[c_0_6]) ).

tff(c_0_8,plain,
    ! [X36: nat,X37: nat] :
      ( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X37),X36))
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X36),X37))
      | ( X36 = X37 ) ),
    inference(fof_simplification,[status(thm)],[fact_49_verit__la__disequality]) ).

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

tcf(c_0_10,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_335_Suc__1]) ).

tff(c_0_11,negated_conjecture,
    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)))) != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
    inference(fof_nnf,[status(thm)],[c_0_7]) ).

tff(c_0_12,plain,
    ! [X18927: nat,X18928: nat] :
      ( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X18928),X18927))
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X18927),X18928))
      | ( X18927 = X18928 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_8])]) ).

tcf(c_0_13,plain,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one))))),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)))))),
    inference(split_conjunct,[status(thm)],[fact_0_bbbb]) ).

tcf(c_0_14,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_9,c_0_10]) ).

tcf(c_0_15,plain,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,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))))),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))))),
    inference(split_conjunct,[status(thm)],[fact_2_aaaa]) ).

tcf(c_0_16,negated_conjecture,
    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)))) != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),aa_nat_nat(aa_nat_fun_nat_nat(divide_divide_nat,deg),aa_num_nat(numeral_numeral_nat,aa_num_num(bit0,one)))),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

tcf(c_0_17,plain,
    ! [X3: nat,X2: nat] :
      ( ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X3),X2))
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X2),X3))
      | ( X2 = X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

tcf(c_0_18,plain,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_10]),c_0_14]),c_0_10]),c_0_14]) ).

tcf(c_0_19,plain,
    pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na)),aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),na))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_10]),c_0_14]),c_0_10]),c_0_14]) ).

tcf(c_0_20,negated_conjecture,
    aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,za),na) != aa_nat_nat(aa_nat_fun_nat_nat(vEBT_VEBT_high,xa),na),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_10]),c_0_14]),c_0_10]),c_0_14]) ).

cnf(c_0_21,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : ITP246_1 : TPTP v9.3.1. Released v8.0.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.46  % Computer : n009.cluster.edu
% 0.18/0.46  % Model    : x86_64 x86_64
% 0.18/0.46  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.46  % Memory   : 8046.5625MB
% 0.18/0.46  % OS       : Linux 6.8.0-71-generic
% 0.18/0.46  % CPULimit : 300
% 0.18/0.46  % WCLimit  : 300
% 0.18/0.46  % DateTime : Sun Sep 20 22:17:27 UTC 2026
% 0.18/0.46  % CPUTime  : 
% 0.18/0.46  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.53  Running first-order theorem proving
% 0.21/0.53  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
% 215.75/34.29  % Version: 3.5.1
% 215.75/34.29  % Preprocessing class: FMLLSMLLSSSNFFN.
% 215.75/34.29  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 215.75/34.29  % Starting new_bool_3 with 897s (3) cores
% 215.75/34.29  % Starting new_bool_1 with 897s (3) cores
% 215.75/34.29  % Starting sh5l with 299s (1) cores
% 215.75/34.29  % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 215.75/34.29  % new_bool_3 with pid 168385 completed with status 0
% 215.75/34.29  % Result found by new_bool_3
% 215.75/34.29  % Preprocessing class: FMLLSMLLSSSNFFN.
% 215.75/34.29  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 215.75/34.29  % Starting new_bool_3 with 897s (3) cores
% 215.75/34.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 215.75/34.29  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 215.75/34.29  % Search class: FGHSM-SMLM32-DFFFFFNN
% 215.75/34.29  % Scheduled 13 strats onto 3 cores with 895 seconds (895 total)
% 215.75/34.29  % Starting SubtermCWHack with 81s (1) cores
% 215.75/34.29  % Starting new_bool_3 with 90s (1) cores
% 215.75/34.29  % Starting G-E--_008_C45_F1_PI_SE_Q4_CS_SP_S4SI with 68s (1) cores
% 215.75/34.29  % SubtermCWHack with pid 168389 completed with status 0
% 215.75/34.29  % Result found by SubtermCWHack
% 215.75/34.29  % Preprocessing class: FMLLSMLLSSSNFFN.
% 215.75/34.29  % Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 215.75/34.29  % Starting new_bool_3 with 897s (3) cores
% 215.75/34.29  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 215.75/34.29  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 215.75/34.29  % Search class: FGHSM-SMLM32-DFFFFFNN
% 215.75/34.29  % Scheduled 13 strats onto 3 cores with 895 seconds (895 total)
% 215.75/34.29  % Starting SubtermCWHack with 81s (1) cores
% 215.75/34.29  % Preprocessing time       : 0.239 s
% 215.75/34.29  
% 215.75/34.29  % Proof found!
% 215.75/34.29  % SZS status Theorem
% 215.75/34.29  % SZS output start CNFRefutation
% See solution above
% 215.75/34.29  % Parsed axioms                        : 12321
% 215.75/34.29  % Removed by relevancy pruning/SinE    : 8829
% 215.75/34.29  % Initial clauses                      : 9256
% 215.75/34.29  % Removed in clause preprocessing      : 1924
% 215.75/34.29  % Initial clauses in saturation        : 7332
% 215.75/34.29  % Processed clauses                    : 53955
% 215.75/34.29  % ...of these trivial                  : 3571
% 215.75/34.29  % ...subsumed                          : 34604
% 215.75/34.29  % ...remaining for further processing  : 15780
% 215.75/34.29  % Other redundant clauses eliminated   : 2847
% 215.75/34.29  % Clauses deleted for lack of memory   : 0
% 215.75/34.29  % Backward-subsumed                    : 676
% 215.75/34.29  % Backward-rewritten                   : 315
% 215.75/34.29  % Generated clauses                    : 329971
% 215.75/34.29  % ...of the previous two non-redundant : 277472
% 215.75/34.29  % ...aggressively subsumed             : 0
% 215.75/34.29  % Contextual simplify-reflections      : 44
% 215.75/34.29  % Paramodulations                      : 326882
% 215.75/34.29  % Factorizations                       : 30
% 215.75/34.29  % NegExts                              : 0
% 215.75/34.29  % Equation resolutions                 : 2931
% 215.75/34.29  % Disequality decompositions           : 0
% 215.75/34.29  % Total rewrite steps                  : 131339
% 215.75/34.29  % ...of those cached                   : 112561
% 215.75/34.29  % Propositional unsat checks           : 0
% 215.75/34.29  %    Propositional check models        : 0
% 215.75/34.29  %    Propositional check unsatisfiable : 0
% 215.75/34.29  %    Propositional clauses             : 0
% 215.75/34.29  %    Propositional clauses after purity: 0
% 215.75/34.29  %    Propositional unsat core size     : 0
% 215.75/34.29  %    Propositional preprocessing time  : 0.000
% 215.75/34.29  %    Propositional encoding time       : 0.000
% 215.75/34.29  %    Propositional solver time         : 0.000
% 215.75/34.29  %    Success case prop preproc time    : 0.000
% 215.75/34.29  %    Success case prop encoding time   : 0.000
% 215.75/34.29  %    Success case prop solver time     : 0.000
% 215.75/34.29  % Current number of processed clauses  : 13907
% 215.75/34.29  %    Positive orientable unit clauses  : 3871
% 215.75/34.29  %    Positive unorientable unit clauses: 44
% 215.75/34.29  %    Negative unit clauses             : 5521
% 215.75/34.29  %    Non-unit-clauses                  : 4471
% 215.75/34.29  % Current number of unprocessed clauses: 229587
% 215.75/34.29  % ...number of literals in the above   : 644397
% 215.75/34.29  % Current number of archived formulas  : 0
% 215.75/34.29  % Current number of archived clauses   : 1175
% 215.75/34.29  % Clause-clause subsumption calls (NU) : 2492665
% 215.75/34.29  % Rec. Clause-clause subsumption calls : 1499114
% 215.75/34.29  % Non-unit clause-clause subsumptions  : 6732
% 215.75/34.29  % Unit Clause-clause subsumption calls : 5691636
% 215.75/34.29  % Rewrite failures with RHS unbound    : 0
% 215.75/34.29  % BW rewrite match attempts            : 165892
% 215.75/34.29  % BW rewrite match successes           : 422
% 215.75/34.29  % Condensation attempts                : 0
% 215.75/34.29  % Condensation successes               : 0
% 215.75/34.29  % Termbank termtop insertions          : 7510722
% 215.75/34.29  % Search garbage collected termcells   : 182723
% 215.75/34.29  
% 215.75/34.29  % -------------------------------------------------
% 215.75/34.29  % User time                : 31.369 s
% 215.75/34.29  % System time              : 0.488 s
% 215.75/34.29  % Total time               : 31.857 s
% 215.75/34.29  % Maximum resident set size: 50824 pages
% 215.75/34.29  
% 215.75/34.29  % -------------------------------------------------
% 215.75/34.29  % User time                : 92.061 s
% 215.75/34.29  % System time              : 1.137 s
% 215.75/34.29  % Total time               : 93.198 s
% 215.75/34.29  % Maximum resident set size: 30208 pages
% 215.75/34.29  % E exiting
%------------------------------------------------------------------------------