TSTP Solution File: ITP246_1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : ITP246_1 : TPTP v8.2.0. Released v8.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n011.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:20:20 EDT 2024

% Result   : Theorem 158.15s 22.37s
% Output   : CNFRefutation 158.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   34
% Syntax   : Number of formulae    :   51 (  19 unt;  28 typ;   0 def)
%            Number of atoms       :   31 (  14 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   20 (  12   ~;   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  :   13 (   7   >;   6   *;   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_603,type,
    one_one_nat: nat ).

tff(decl_783,type,
    suc: fun_nat_nat ).

tff(decl_848,type,
    bit0: fun_num_num ).

tff(decl_850,type,
    one: num ).

tff(decl_858,type,
    numeral_numeral_nat: fun_num_nat ).

tff(decl_914,type,
    ord_less_eq_nat: fun_nat_fun_nat_bool ).

tff(decl_1032,type,
    divide_divide_nat: fun_nat_fun_nat_nat ).

tff(decl_1163,type,
    vEBT_VEBT_high: fun_nat_fun_nat_nat ).

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

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

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

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

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

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

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

tff(decl_1430,type,
    deg: nat ).

tff(decl_1435,type,
    na: nat ).

tff(decl_1440,type,
    xa: nat ).

tff(decl_1441,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] :
      ( ( X36 = X37 )
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X36),X37))
      | ~ pp(aa_nat_bool(aa_nat_fun_nat_bool(ord_less_eq_nat,X37),X36)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_49_verit__la__disequality) ).

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(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_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_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(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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

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

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

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_5__092_060open_062deg_Adiv_A2_A_061_An_092_060close_062]) ).

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

tff(c_0_12,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_6]) ).

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

tcf(c_0_14,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_nat_nat(suc,one_one_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_nat_nat(suc,one_one_nat))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

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

tcf(c_0_16,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_nat_nat(suc,one_one_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_nat_nat(suc,one_one_nat))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_9]),c_0_9]) ).

tcf(c_0_17,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_12]) ).

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

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)],[c_0_14,c_0_15]),c_0_15]) ).

tcf(c_0_20,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)],[c_0_16,c_0_15]),c_0_15]) ).

tcf(c_0_21,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)],[c_0_17,c_0_10]),c_0_10]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem    : ITP246_1 : TPTP v8.2.0. Released v8.0.0.
% 0.03/0.14  % Command    : run_E %s %d THM
% 0.13/0.35  % Computer : n011.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36  % CPULimit   : 300
% 0.13/0.36  % WCLimit    : 300
% 0.13/0.36  % DateTime   : Sat May 18 18:07:23 EDT 2024
% 0.13/0.36  % CPUTime    : 
% 0.20/0.49  Running first-order model finding
% 0.20/0.49  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 158.15/22.37  # Version: 3.1.0
% 158.15/22.37  # Preprocessing class: FMLLSMLLSSSNFFN.
% 158.15/22.37  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 158.15/22.37  # Starting new_bool_3 with 897s (3) cores
% 158.15/22.37  # Starting new_bool_1 with 897s (3) cores
% 158.15/22.37  # Starting sh5l with 299s (1) cores
% 158.15/22.37  # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 299s (1) cores
% 158.15/22.37  # new_bool_3 with pid 11402 completed with status 0
% 158.15/22.37  # Result found by new_bool_3
% 158.15/22.37  # Preprocessing class: FMLLSMLLSSSNFFN.
% 158.15/22.37  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 158.15/22.37  # Starting new_bool_3 with 897s (3) cores
% 158.15/22.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 158.15/22.37  # Search class: FGHSM-SMLM32-DFFFFFNN
% 158.15/22.37  # Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 158.15/22.37  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 158.15/22.37  # Starting new_bool_3 with 90s (1) cores
% 158.15/22.37  # Starting G-E--_207_C01_F1_SE_CS_SP_PI_S5PRR_S0Y with 68s (1) cores
% 158.15/22.37  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with pid 11406 completed with status 0
% 158.15/22.37  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y
% 158.15/22.37  # Preprocessing class: FMLLSMLLSSSNFFN.
% 158.15/22.37  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 158.15/22.37  # Starting new_bool_3 with 897s (3) cores
% 158.15/22.37  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 158.15/22.37  # Search class: FGHSM-SMLM32-DFFFFFNN
% 158.15/22.37  # Scheduled 13 strats onto 3 cores with 896 seconds (896 total)
% 158.15/22.37  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_RG_S0Y with 68s (1) cores
% 158.15/22.37  # Preprocessing time       : 0.413 s
% 158.15/22.37  # Presaturation interreduction done
% 158.15/22.37  
% 158.15/22.37  # Proof found!
% 158.15/22.37  # SZS status Theorem
% 158.15/22.37  # SZS output start CNFRefutation
% See solution above
% 158.15/22.37  # Parsed axioms                        : 12321
% 158.15/22.37  # Removed by relevancy pruning/SinE    : 8829
% 158.15/22.37  # Initial clauses                      : 9256
% 158.15/22.37  # Removed in clause preprocessing      : 1924
% 158.15/22.37  # Initial clauses in saturation        : 7332
% 158.15/22.37  # Processed clauses                    : 9017
% 158.15/22.37  # ...of these trivial                  : 323
% 158.15/22.37  # ...subsumed                          : 1686
% 158.15/22.37  # ...remaining for further processing  : 7008
% 158.15/22.37  # Other redundant clauses eliminated   : 2083
% 158.15/22.37  # Clauses deleted for lack of memory   : 0
% 158.15/22.37  # Backward-subsumed                    : 71
% 158.15/22.37  # Backward-rewritten                   : 80
% 158.15/22.37  # Generated clauses                    : 3737
% 158.15/22.37  # ...of the previous two non-redundant : 2795
% 158.15/22.37  # ...aggressively subsumed             : 0
% 158.15/22.37  # Contextual simplify-reflections      : 100
% 158.15/22.37  # Paramodulations                      : 2301
% 158.15/22.37  # Factorizations                       : 2
% 158.15/22.37  # NegExts                              : 0
% 158.15/22.37  # Equation resolutions                 : 2112
% 158.15/22.37  # Disequality decompositions           : 0
% 158.15/22.37  # Total rewrite steps                  : 7268
% 158.15/22.37  # ...of those cached                   : 6394
% 158.15/22.37  # Propositional unsat checks           : 2
% 158.15/22.37  #    Propositional check models        : 2
% 158.15/22.37  #    Propositional check unsatisfiable : 0
% 158.15/22.37  #    Propositional clauses             : 0
% 158.15/22.37  #    Propositional clauses after purity: 0
% 158.15/22.37  #    Propositional unsat core size     : 0
% 158.15/22.37  #    Propositional preprocessing time  : 0.000
% 158.15/22.37  #    Propositional encoding time       : 0.079
% 158.15/22.37  #    Propositional solver time         : 0.009
% 158.15/22.37  #    Success case prop preproc time    : 0.000
% 158.15/22.37  #    Success case prop encoding time   : 0.000
% 158.15/22.37  #    Success case prop solver time     : 0.000
% 158.15/22.37  # Current number of processed clauses  : 658
% 158.15/22.37  #    Positive orientable unit clauses  : 229
% 158.15/22.37  #    Positive unorientable unit clauses: 5
% 158.15/22.37  #    Negative unit clauses             : 150
% 158.15/22.37  #    Non-unit-clauses                  : 274
% 158.15/22.37  # Current number of unprocessed clauses: 5980
% 158.15/22.37  # ...number of literals in the above   : 21593
% 158.15/22.37  # Current number of archived formulas  : 0
% 158.15/22.37  # Current number of archived clauses   : 5028
% 158.15/22.37  # Clause-clause subsumption calls (NU) : 20003707
% 158.15/22.37  # Rec. Clause-clause subsumption calls : 628710
% 158.15/22.37  # Non-unit clause-clause subsumptions  : 1596
% 158.15/22.37  # Unit Clause-clause subsumption calls : 31455
% 158.15/22.37  # Rewrite failures with RHS unbound    : 0
% 158.15/22.37  # BW rewrite match attempts            : 7135
% 158.15/22.37  # BW rewrite match successes           : 356
% 158.15/22.37  # Condensation attempts                : 0
% 158.15/22.37  # Condensation successes               : 0
% 158.15/22.37  # Termbank termtop insertions          : 1597947
% 158.15/22.37  # Search garbage collected termcells   : 182725
% 158.15/22.37  
% 158.15/22.37  # -------------------------------------------------
% 158.15/22.37  # User time                : 20.016 s
% 158.15/22.37  # System time              : 0.173 s
% 158.15/22.37  # Total time               : 20.189 s
% 158.15/22.37  # Maximum resident set size: 48944 pages
% 158.15/22.37  
% 158.15/22.37  # -------------------------------------------------
% 158.15/22.37  # User time                : 58.774 s
% 158.15/22.37  # System time              : 0.494 s
% 158.15/22.37  # Total time               : 59.267 s
% 158.15/22.37  # Maximum resident set size: 27340 pages
% 158.15/22.37  % E---3.1 exiting
%------------------------------------------------------------------------------