TSTP Solution File: NUM924+3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : NUM924+3 : TPTP v8.2.0. Released v5.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n032.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 : Tue May 21 01:17:48 EDT 2024

% Result   : Theorem 0.83s 0.58s
% Output   : CNFRefutation 0.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   28 (  28 unt;   0 def)
%            Number of atoms       :   28 (  18 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    5 (   5   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :   13 (   3 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   18 (  18 usr;   7 con; 0-2 aty)
%            Number of variables   :   19 (   1 sgn  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J,axiom,
    ! [X96] : hAPP_int_int(times_times_int(X96),X96) = hAPP_nat_int(power_power_int(X96),number_number_of_nat(bit0(bit1(pls)))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J) ).

fof(conj_0,conjecture,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(fact_172_Pls__def,axiom,
    pls = zero_zero_int,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_172_Pls__def) ).

fof(fact_134_zadd__commute,axiom,
    ! [X14,X12] : hAPP_int_int(plus_plus_int(X14),X12) = hAPP_int_int(plus_plus_int(X12),X14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_134_zadd__commute) ).

fof(fact_35_zmult__commute,axiom,
    ! [X14,X12] : hAPP_int_int(times_times_int(X14),X12) = hAPP_int_int(times_times_int(X12),X14),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_35_zmult__commute) ).

fof(fact_3_t,axiom,
    hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_3_t) ).

fof(fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J,axiom,
    ! [X159] : hAPP_int_int(times_times_int(X159),zero_zero_int) = zero_zero_int,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J) ).

fof(fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096,axiom,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),zero_zero_int))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096) ).

fof(c_0_8,plain,
    ! [X827] : hAPP_int_int(times_times_int(X827),X827) = hAPP_nat_int(power_power_int(X827),number_number_of_nat(bit0(bit1(pls)))),
    inference(variable_rename,[status(thm)],[fact_285_comm__semiring__1__class_Onormalizing__semiring__rules_I29_J]) ).

fof(c_0_9,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).

cnf(c_0_10,plain,
    hAPP_int_int(times_times_int(X1),X1) = hAPP_nat_int(power_power_int(X1),number_number_of_nat(bit0(bit1(pls)))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    pls = zero_zero_int,
    inference(split_conjunct,[status(thm)],[fact_172_Pls__def]) ).

fof(c_0_12,plain,
    ! [X924,X925] : hAPP_int_int(plus_plus_int(X924),X925) = hAPP_int_int(plus_plus_int(X925),X924),
    inference(variable_rename,[status(thm)],[fact_134_zadd__commute]) ).

fof(c_0_13,plain,
    ! [X1076,X1077] : hAPP_int_int(times_times_int(X1076),X1077) = hAPP_int_int(times_times_int(X1077),X1076),
    inference(variable_rename,[status(thm)],[fact_35_zmult__commute]) ).

fof(c_0_14,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(fof_nnf,[status(thm)],[c_0_9]) ).

cnf(c_0_15,plain,
    hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int) = hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t),
    inference(split_conjunct,[status(thm)],[fact_3_t]) ).

cnf(c_0_16,plain,
    hAPP_int_int(times_times_int(X1),X1) = hAPP_nat_int(power_power_int(X1),number_number_of_nat(bit0(bit1(zero_zero_int)))),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,plain,
    hAPP_int_int(plus_plus_int(X1),X2) = hAPP_int_int(plus_plus_int(X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_18,plain,
    hAPP_int_int(times_times_int(X1),X2) = hAPP_int_int(times_times_int(X2),X1),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

fof(c_0_19,plain,
    ! [X598] : hAPP_int_int(times_times_int(X598),zero_zero_int) = zero_zero_int,
    inference(variable_rename,[status(thm)],[fact_367_comm__semiring__1__class_Onormalizing__semiring__rules_I10_J]) ).

cnf(c_0_20,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(pls))))),one_one_int)),zero_zero_int)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_21,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),t)),hAPP_int_int(times_times_int(hAPP_int_int(plus_plus_int(hAPP_int_int(times_times_int(number_number_of_int(bit0(bit0(bit1(pls))))),m)),one_one_int)),zero_zero_int))),
    inference(split_conjunct,[status(thm)],[fact_2__096_I4_A_K_Am_A_L_A1_J_A_K_At_A_060_A_I4_A_K_Am_A_L_A1_J_A_K_A0_096]) ).

cnf(c_0_22,plain,
    hAPP_int_int(times_times_int(t),hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(m),number_number_of_int(bit0(bit0(bit1(zero_zero_int))))))) = hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_11]),c_0_16]),c_0_17]),c_0_11]),c_0_18]),c_0_17]),c_0_18]) ).

cnf(c_0_23,plain,
    hAPP_int_int(times_times_int(X1),zero_zero_int) = zero_zero_int,
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(hAPP_nat_int(power_power_int(s),number_number_of_nat(bit0(bit1(zero_zero_int))))),one_one_int)),zero_zero_int)),
    inference(rw,[status(thm)],[c_0_20,c_0_11]) ).

cnf(c_0_25,plain,
    hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s))),zero_zero_int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_11]),c_0_18]),c_0_17]),c_0_18]),c_0_22]),c_0_11]),c_0_18]),c_0_17]),c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,hAPP_int_int(plus_plus_int(one_one_int),hAPP_int_int(times_times_int(s),s))),zero_zero_int)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_17]),c_0_16]) ).

cnf(c_0_27,plain,
    $false,
    inference(sr,[status(thm)],[c_0_25,c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : NUM924+3 : TPTP v8.2.0. Released v5.3.0.
% 0.00/0.11  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon May 20 04:45:22 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.14/0.39  Running first-order theorem proving
% 0.14/0.39  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
% 0.83/0.58  # Version: 3.1.0
% 0.83/0.58  # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.83/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.58  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.83/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.83/0.58  # Starting new_bool_1 with 600s (2) cores
% 0.83/0.58  # Starting sh5l with 300s (1) cores
% 0.83/0.58  # new_bool_1 with pid 15214 completed with status 0
% 0.83/0.58  # Result found by new_bool_1
% 0.83/0.58  # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.83/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.58  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.83/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.83/0.58  # Starting new_bool_1 with 600s (2) cores
% 0.83/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.83/0.58  # Search class: FGHSM-SSLM31-DFFFFFNN
% 0.83/0.58  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.83/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 325s (1) cores
% 0.83/0.58  # Starting new_bool_1 with 61s (1) cores
% 0.83/0.58  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 15216 completed with status 0
% 0.83/0.58  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.83/0.58  # Preprocessing class: FMLSSMSMSSSNFFN.
% 0.83/0.58  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.83/0.58  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 900s (3) cores
% 0.83/0.58  # Starting new_bool_3 with 600s (2) cores
% 0.83/0.58  # Starting new_bool_1 with 600s (2) cores
% 0.83/0.58  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.83/0.58  # Search class: FGHSM-SSLM31-DFFFFFNN
% 0.83/0.58  # Scheduled 6 strats onto 2 cores with 600 seconds (600 total)
% 0.83/0.58  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 325s (1) cores
% 0.83/0.58  # Preprocessing time       : 0.013 s
% 0.83/0.58  # Presaturation interreduction done
% 0.83/0.58  
% 0.83/0.58  # Proof found!
% 0.83/0.58  # SZS status Theorem
% 0.83/0.58  # SZS output start CNFRefutation
% See solution above
% 0.83/0.58  # Parsed axioms                        : 1230
% 0.83/0.58  # Removed by relevancy pruning/SinE    : 300
% 0.83/0.58  # Initial clauses                      : 1405
% 0.83/0.58  # Removed in clause preprocessing      : 83
% 0.83/0.58  # Initial clauses in saturation        : 1322
% 0.83/0.58  # Processed clauses                    : 1446
% 0.83/0.58  # ...of these trivial                  : 95
% 0.83/0.58  # ...subsumed                          : 244
% 0.83/0.58  # ...remaining for further processing  : 1106
% 0.83/0.58  # Other redundant clauses eliminated   : 106
% 0.83/0.58  # Clauses deleted for lack of memory   : 0
% 0.83/0.58  # Backward-subsumed                    : 10
% 0.83/0.58  # Backward-rewritten                   : 19
% 0.83/0.58  # Generated clauses                    : 104
% 0.83/0.58  # ...of the previous two non-redundant : 70
% 0.83/0.58  # ...aggressively subsumed             : 0
% 0.83/0.58  # Contextual simplify-reflections      : 4
% 0.83/0.58  # Paramodulations                      : 12
% 0.83/0.58  # Factorizations                       : 0
% 0.83/0.58  # NegExts                              : 0
% 0.83/0.58  # Equation resolutions                 : 106
% 0.83/0.58  # Disequality decompositions           : 0
% 0.83/0.58  # Total rewrite steps                  : 883
% 0.83/0.58  # ...of those cached                   : 690
% 0.83/0.58  # Propositional unsat checks           : 0
% 0.83/0.58  #    Propositional check models        : 0
% 0.83/0.58  #    Propositional check unsatisfiable : 0
% 0.83/0.58  #    Propositional clauses             : 0
% 0.83/0.58  #    Propositional clauses after purity: 0
% 0.83/0.58  #    Propositional unsat core size     : 0
% 0.83/0.58  #    Propositional preprocessing time  : 0.000
% 0.83/0.58  #    Propositional encoding time       : 0.000
% 0.83/0.58  #    Propositional solver time         : 0.000
% 0.83/0.58  #    Success case prop preproc time    : 0.000
% 0.83/0.58  #    Success case prop encoding time   : 0.000
% 0.83/0.58  #    Success case prop solver time     : 0.000
% 0.83/0.58  # Current number of processed clauses  : 59
% 0.83/0.58  #    Positive orientable unit clauses  : 32
% 0.83/0.58  #    Positive unorientable unit clauses: 0
% 0.83/0.58  #    Negative unit clauses             : 21
% 0.83/0.58  #    Non-unit-clauses                  : 6
% 0.83/0.58  # Current number of unprocessed clauses: 872
% 0.83/0.58  # ...number of literals in the above   : 2261
% 0.83/0.58  # Current number of archived formulas  : 0
% 0.83/0.58  # Current number of archived clauses   : 955
% 0.83/0.58  # Clause-clause subsumption calls (NU) : 75382
% 0.83/0.58  # Rec. Clause-clause subsumption calls : 34329
% 0.83/0.58  # Non-unit clause-clause subsumptions  : 198
% 0.83/0.58  # Unit Clause-clause subsumption calls : 698
% 0.83/0.58  # Rewrite failures with RHS unbound    : 0
% 0.83/0.58  # BW rewrite match attempts            : 742
% 0.83/0.58  # BW rewrite match successes           : 77
% 0.83/0.58  # Condensation attempts                : 0
% 0.83/0.58  # Condensation successes               : 0
% 0.83/0.58  # Termbank termtop insertions          : 149265
% 0.83/0.58  # Search garbage collected termcells   : 18319
% 0.83/0.58  
% 0.83/0.58  # -------------------------------------------------
% 0.83/0.58  # User time                : 0.135 s
% 0.83/0.58  # System time              : 0.015 s
% 0.83/0.58  # Total time               : 0.150 s
% 0.83/0.58  # Maximum resident set size: 7664 pages
% 0.83/0.58  
% 0.83/0.58  # -------------------------------------------------
% 0.83/0.58  # User time                : 0.264 s
% 0.83/0.58  # System time              : 0.020 s
% 0.83/0.58  # Total time               : 0.284 s
% 0.83/0.58  # Maximum resident set size: 3772 pages
% 0.83/0.58  % E---3.1 exiting
% 1.15/0.58  % E exiting
%------------------------------------------------------------------------------