%------------------------------------------------------------------------------
% File : Etableau---0.67
% Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% Computer : n023.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 : 600s
% DateTime : Mon Jul 18 09:46:40 EDT 2022
% Result : Theorem 0.20s 0.38s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of formulae : 29 ( 29 unt; 0 def)
% Number of atoms : 29 ( 19 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 : 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(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/sandbox/benchmark/theBenchmark.p',conj_0) ).
fof(fact_24_number__of__is__id,axiom,
! [X11] : number_number_of_int(X11) = X11,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_24_number__of__is__id) ).
fof(fact_105_zero__is__num__zero,axiom,
zero_zero_int = number_number_of_int(pls),
file('/export/starexec/sandbox/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/sandbox/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/sandbox/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/sandbox/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/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(fact_66_mult__Pls,axiom,
! [X10] : times_times_int(pls,X10) = pls,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_66_mult__Pls) ).
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,plain,
! [X63] : number_number_of_int(X63) = X63,
inference(variable_rename,[status(thm)],[fact_24_number__of__is__id]) ).
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_simplification,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
zero_zero_int = number_number_of_int(pls),
inference(split_conjunct,[status(thm)],[fact_105_zero__is__num__zero]) ).
cnf(c_0_12,plain,
number_number_of_int(X1) = X1,
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,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_14,plain,
! [X64,X65] : times_times_int(X64,X65) = times_times_int(X65,X64),
inference(variable_rename,[status(thm)],[fact_25_zmult__commute]) ).
fof(c_0_15,plain,
! [X208,X209] : plus_plus_int(X208,X209) = plus_plus_int(X209,X208),
inference(variable_rename,[status(thm)],[fact_104_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),zero_zero_int),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
pls = zero_zero_int,
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,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_19,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_13,c_0_12]) ).
cnf(c_0_20,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_22,plain,
! [X135] : times_times_int(pls,X135) = pls,
inference(variable_rename,[status(thm)],[fact_66_mult__Pls]) ).
cnf(c_0_23,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_24,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_18,c_0_12]),c_0_12]) ).
cnf(c_0_25,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_19,c_0_20]),c_0_21]),c_0_20]),c_0_21]) ).
cnf(c_0_26,plain,
times_times_int(pls,X1) = pls,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_27,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_23,c_0_21]) ).
cnf(c_0_28,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_24,c_0_20]),c_0_21]),c_0_20]),c_0_25]),c_0_20]),c_0_21]),c_0_17]),c_0_20]),c_0_26]),c_0_27]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% 0.03/0.13 % Command : etableau --auto --tsmdo --quicksat=10000 --tableau=1 --tableau-saturation=1 -s -p --tableau-cores=8 --cpu-limit=%d %s
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jul 6 00:46:12 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.38 # No SInE strategy applied
% 0.20/0.38 # Auto-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 0.20/0.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 0.20/0.38 #
% 0.20/0.38 # Presaturation interreduction done
% 0.20/0.38
% 0.20/0.38 # Proof found!
% 0.20/0.38 # SZS status Theorem
% 0.20/0.38 # SZS output start CNFRefutation
% See solution above
% 0.20/0.38 # Training examples: 0 positive, 0 negative
%------------------------------------------------------------------------------