%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 01:51:00 PM UTC 2026
% Result : Theorem 0.04s 0.45s
% Output : CNFRefutation 0.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 17 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-3 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(conj_0,conjecture,
ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
fof(fact_97_zero__is__num__zero,axiom,
zero_zero(int) = number_number_of(int,pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_97_zero__is__num__zero) ).
fof(fact_22_number__of__is__id,axiom,
! [X14] : number_number_of(int,X14) = X14,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_22_number__of__is__id) ).
fof(fact_23_zmult__commute,axiom,
! [X15,X11] : times_times(int,X15,X11) = times_times(int,X11,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_23_zmult__commute) ).
fof(fact_96_zadd__commute,axiom,
! [X15,X11] : plus_plus(int,X15,X11) = plus_plus(int,X11,X15),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_96_zadd__commute) ).
fof(fact_3_t,axiom,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_t) ).
fof(fact_62_mult__Pls,axiom,
! [X11] : times_times(int,pls,X11) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_62_mult__Pls) ).
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,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),zero_zero(int))),
file('/export/starexec/sandbox2/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,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(assume_negation,[status(cth)],[conj_0]) ).
fof(c_0_9,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),zero_zero(int)),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_10,negated_conjecture,
~ ord_less(int,plus_plus(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_11,negated_conjecture,
~ ord_less(int,plus_plus(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_10]) ).
cnf(c_0_12,plain,
zero_zero(int) = number_number_of(int,pls),
inference(split_conjunct,[status(thm)],[fact_97_zero__is__num__zero]) ).
fof(c_0_13,plain,
! [X143] : number_number_of(int,X143) = X143,
inference(variable_rename,[status(thm)],[fact_22_number__of__is__id]) ).
fof(c_0_14,plain,
! [X144,X145] : times_times(int,X144,X145) = times_times(int,X145,X144),
inference(variable_rename,[status(thm)],[fact_23_zmult__commute]) ).
fof(c_0_15,plain,
! [X292,X293] : plus_plus(int,X292,X293) = plus_plus(int,X293,X292),
inference(variable_rename,[status(thm)],[fact_96_zadd__commute]) ).
cnf(c_0_16,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),number_number_of(int,pls)),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
number_number_of(int,X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)) = times_times(int,plus_plus(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_19,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_21,plain,
! [X223] : times_times(int,pls,X223) = pls,
inference(variable_rename,[status(thm)],[fact_62_mult__Pls]) ).
cnf(c_0_22,negated_conjecture,
~ ord_less(int,plus_plus(int,power_power(int,s,number_number_of(nat,bit0(bit1(pls)))),one_one(int)),pls),
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
ord_less(int,times_times(int,plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),t),times_times(int,plus_plus(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_24,plain,
times_times(int,t,plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls)))))) = plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_17]),c_0_19]),c_0_20]),c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
times_times(int,pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_26,negated_conjecture,
~ ord_less(int,plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))),pls),
inference(rw,[status(thm)],[c_0_22,c_0_20]) ).
cnf(c_0_27,plain,
$false,
inference(sr,[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)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_17]),c_0_19]),c_0_20]),c_0_19]),c_0_24]),c_0_17]),c_0_19]),c_0_20]),c_0_12]),c_0_17]),c_0_19]),c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM924+5 : TPTP v9.3.1. Released v5.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.36 % Computer : n013.cluster.edu
% 0.04/0.36 % Model : x86_64 x86_64
% 0.04/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.36 % Memory : 8046.5625MB
% 0.04/0.36 % OS : Linux 6.8.0-71-generic
% 0.04/0.36 % CPULimit : 300
% 0.04/0.36 % WCLimit : 300
% 0.04/0.36 % DateTime : Mon Sep 21 03:16:36 UTC 2026
% 0.04/0.37 % CPUTime :
% 0.04/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.40 Running first-order theorem proving
% 0.04/0.40 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
% 0.04/0.45 % Version: 3.5.1
% 0.04/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.04/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.04/0.45 % Starting sh5l with 300s (1) cores
% 0.04/0.45 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 4025356 completed with status 0
% 0.04/0.45 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.04/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.45 % No SInE strategy applied
% 0.04/0.45 % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.04/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.04/0.45 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 354s (1) cores
% 0.04/0.45 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.04/0.45 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 0.04/0.45 % C07_19_nc_SAT001_MinMin_p005000_rr with pid 4025364 completed with status 0
% 0.04/0.45 % Result found by C07_19_nc_SAT001_MinMin_p005000_rr
% 0.04/0.45 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.04/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.04/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.04/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.04/0.45 % No SInE strategy applied
% 0.04/0.45 % Search class: FGHSM-FSLM31-DFFFFFNN
% 0.04/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.04/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.04/0.45 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.04/0.45 % Starting C07_19_nc_SAT001_MinMin_p005000_rr with 354s (1) cores
% 0.04/0.45 % Preprocessing time : 0.004 s
% 0.04/0.45 % Presaturation interreduction done
% 0.04/0.45
% 0.04/0.45 % Proof found!
% 0.04/0.45 % SZS status Theorem
% 0.04/0.45 % SZS output start CNFRefutation
% See solution above
% 0.04/0.45 % Parsed axioms : 155
% 0.04/0.45 % Removed by relevancy pruning/SinE : 0
% 0.04/0.45 % Initial clauses : 215
% 0.04/0.45 % Removed in clause preprocessing : 6
% 0.04/0.45 % Initial clauses in saturation : 209
% 0.04/0.45 % Processed clauses : 201
% 0.04/0.45 % ...of these trivial : 8
% 0.04/0.45 % ...subsumed : 14
% 0.04/0.45 % ...remaining for further processing : 178
% 0.04/0.45 % Other redundant clauses eliminated : 1
% 0.04/0.45 % Clauses deleted for lack of memory : 0
% 0.04/0.45 % Backward-subsumed : 1
% 0.04/0.45 % Backward-rewritten : 5
% 0.04/0.45 % Generated clauses : 1
% 0.04/0.45 % ...of the previous two non-redundant : 5
% 0.04/0.45 % ...aggressively subsumed : 0
% 0.04/0.45 % Contextual simplify-reflections : 1
% 0.04/0.45 % Paramodulations : 0
% 0.04/0.45 % Factorizations : 0
% 0.04/0.45 % NegExts : 0
% 0.04/0.45 % Equation resolutions : 1
% 0.04/0.45 % Disequality decompositions : 0
% 0.04/0.45 % Total rewrite steps : 79
% 0.04/0.45 % ...of those cached : 59
% 0.04/0.45 % Propositional unsat checks : 0
% 0.04/0.45 % Propositional check models : 0
% 0.04/0.45 % Propositional check unsatisfiable : 0
% 0.04/0.45 % Propositional clauses : 0
% 0.04/0.45 % Propositional clauses after purity: 0
% 0.04/0.45 % Propositional unsat core size : 0
% 0.04/0.45 % Propositional preprocessing time : 0.000
% 0.04/0.45 % Propositional encoding time : 0.000
% 0.04/0.45 % Propositional solver time : 0.000
% 0.04/0.45 % Success case prop preproc time : 0.000
% 0.04/0.45 % Success case prop encoding time : 0.000
% 0.04/0.45 % Success case prop solver time : 0.000
% 0.04/0.45 % Current number of processed clauses : 171
% 0.04/0.45 % Positive orientable unit clauses : 49
% 0.04/0.45 % Positive unorientable unit clauses: 3
% 0.04/0.45 % Negative unit clauses : 3
% 0.04/0.45 % Non-unit-clauses : 116
% 0.04/0.45 % Current number of unprocessed clauses: 13
% 0.04/0.45 % ...number of literals in the above : 44
% 0.04/0.45 % Current number of archived formulas : 0
% 0.04/0.45 % Current number of archived clauses : 6
% 0.04/0.45 % Clause-clause subsumption calls (NU) : 2080
% 0.04/0.45 % Rec. Clause-clause subsumption calls : 1709
% 0.04/0.45 % Non-unit clause-clause subsumptions : 16
% 0.04/0.45 % Unit Clause-clause subsumption calls : 12
% 0.04/0.45 % Rewrite failures with RHS unbound : 0
% 0.04/0.45 % BW rewrite match attempts : 47
% 0.04/0.45 % BW rewrite match successes : 18
% 0.04/0.45 % Condensation attempts : 0
% 0.04/0.45 % Condensation successes : 0
% 0.04/0.45 % Termbank termtop insertions : 16506
% 0.04/0.45 % Search garbage collected termcells : 2070
% 0.04/0.45
% 0.04/0.45 % -------------------------------------------------
% 0.04/0.45 % User time : 0.020 s
% 0.04/0.45 % System time : 0.007 s
% 0.04/0.45 % Total time : 0.027 s
% 0.04/0.45 % Maximum resident set size: 4320 pages
% 0.04/0.45
% 0.04/0.45 % -------------------------------------------------
% 0.04/0.45 % User time : 0.068 s
% 0.04/0.45 % System time : 0.020 s
% 0.04/0.45 % Total time : 0.088 s
% 0.04/0.45 % Maximum resident set size: 4864 pages
% 0.04/0.45 % E exiting
%------------------------------------------------------------------------------