%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : NUM924+1 : TPTP v9.2.1. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n015.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 5 04:58:51 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 28 ( 28 unt; 0 def)
% Number of atoms : 28 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 2 avg)
% Maximal term depth : 8 ( 3 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 1 sgn 12 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(fact_24_number__of__is__id,axiom,
! [X11] : number_number_of_int(X11) = X11,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).
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_105_zero__is__num__zero,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_105_zero__is__num__zero) ).
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_25_zmult__commute,axiom,
! [X12,X10] : times_times_int(X12,X10) = times_times_int(X10,X12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_25_zmult__commute) ).
fof(fact_104_zadd__commute,axiom,
! [X12,X10] : plus_plus_int(X12,X10) = plus_plus_int(X10,X12),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_104_zadd__commute) ).
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(fact_66_mult__Pls,axiom,
! [X10] : times_times_int(pls,X10) = pls,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_66_mult__Pls) ).
fof(c_0_8,plain,
! [X223] : number_number_of_int(X223) = X223,
inference(variable_rename,[status(thm)],[fact_24_number__of__is__id]) ).
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)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
cnf(c_0_10,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[fact_105_zero__is__num__zero]) ).
cnf(c_0_11,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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]) ).
fof(c_0_13,plain,
! [X224,X225] : times_times_int(X224,X225) = times_times_int(X225,X224),
inference(variable_rename,[status(thm)],[fact_25_zmult__commute]) ).
fof(c_0_14,plain,
! [X368,X369] : plus_plus_int(X368,X369) = plus_plus_int(X369,X368),
inference(variable_rename,[status(thm)],[fact_104_zadd__commute]) ).
cnf(c_0_15,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_9]) ).
cnf(c_0_16,plain,
pls = zero_zero_int,
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,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_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(bit0(bit0(bit1(pls))),m),one_one_int),t),
inference(rw,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_19,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_21,plain,
! [X295] : times_times_int(pls,X295) = pls,
inference(variable_rename,[status(thm)],[fact_66_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_15,c_0_16]) ).
cnf(c_0_23,plain,
ord_less_int(times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t),times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),zero_zero_int)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_11]),c_0_11]) ).
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)],[c_0_18,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)],[c_0_23,c_0_19]),c_0_20]),c_0_19]),c_0_24]),c_0_19]),c_0_20]),c_0_16]),c_0_19]),c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM924+1 : TPTP v9.2.1. Released v5.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n015.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 01:18:32 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.371s
%------------------------------------------------------------------------------