%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n004.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 08:41:05 EDT 2022
% Result : Theorem 7.82s 2.44s
% Output : CNFRefutation 7.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 16 RR)
% Number of literals : 22 ( 13 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 7 con; 0-2 aty)
% Number of variables : 10 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_159,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),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_159) ).
cnf(i_0_158,plain,
pls = zero_zero_int,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_158) ).
cnf(i_0_96,plain,
number_number_of_nat(bit0(bit1(pls))) = plus_plus_nat(one_one_nat,one_one_nat),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_96) ).
cnf(i_0_157,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_157) ).
cnf(i_0_4,plain,
times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_4) ).
cnf(i_0_32,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_32) ).
cnf(i_0_3,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)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_3) ).
cnf(i_0_97,plain,
times_times_int(pls,X1) = pls,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-mxckhw8w/lgb.p',i_0_97) ).
cnf(c_0_168,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),
i_0_159 ).
cnf(c_0_169,plain,
pls = zero_zero_int,
i_0_158 ).
cnf(c_0_170,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_168,c_0_169]) ).
cnf(c_0_171,plain,
number_number_of_nat(bit0(bit1(pls))) = plus_plus_nat(one_one_nat,one_one_nat),
i_0_96 ).
cnf(c_0_172,negated_conjecture,
~ ord_less_int(plus_plus_int(power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat)),one_one_int),pls),
inference(rw,[status(thm)],[c_0_170,c_0_171]) ).
cnf(c_0_173,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
i_0_157 ).
cnf(c_0_174,plain,
times_times_int(plus_plus_int(times_times_int(bit0(bit0(bit1(pls))),m),one_one_int),t) = plus_plus_int(power_power_int(s,number_number_of_nat(bit0(bit1(pls)))),one_one_int),
i_0_4 ).
cnf(c_0_175,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
i_0_32 ).
cnf(c_0_176,negated_conjecture,
~ ord_less_int(plus_plus_int(one_one_int,power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat))),pls),
inference(rw,[status(thm)],[c_0_172,c_0_173]) ).
cnf(c_0_177,plain,
plus_plus_int(one_one_int,power_power_int(s,plus_plus_nat(one_one_nat,one_one_nat))) = times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(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_174,c_0_171]),c_0_173]),c_0_173]),c_0_175]),c_0_175]) ).
cnf(c_0_178,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)),
i_0_3 ).
cnf(c_0_179,plain,
times_times_int(pls,X1) = pls,
i_0_97 ).
cnf(c_0_180,negated_conjecture,
~ ord_less_int(times_times_int(t,plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))),pls),
inference(rw,[status(thm)],[c_0_176,c_0_177]) ).
cnf(c_0_181,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)],[c_0_178,c_0_173]),c_0_175]),c_0_175]),c_0_173]),c_0_175]),c_0_169]),c_0_175]),c_0_179]),c_0_180]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : NUM924+1 : TPTP v8.1.0. Released v5.3.0.
% 0.14/0.15 % Command : enigmatic-eprover.py %s %d 1
% 0.14/0.37 % Computer : n004.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Wed Jul 6 00:21:10 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.22/0.48 # ENIGMATIC: Selected complete mode:
% 7.82/2.44 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.44 # No SInE strategy applied
% 7.82/2.44 # Trying AutoSched0 for 150 seconds
% 7.82/2.44 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S026I
% 7.82/2.44 # and selection function SelectOptimalRestrNDepth2.
% 7.82/2.44 #
% 7.82/2.44 # Preprocessing time : 0.022 s
% 7.82/2.44 # Presaturation interreduction done
% 7.82/2.44
% 7.82/2.44 # Proof found!
% 7.82/2.44 # SZS status Theorem
% 7.82/2.44 # SZS output start CNFRefutation
% See solution above
% 7.82/2.44 # Training examples: 0 positive, 0 negative
% 7.82/2.44
% 7.82/2.44 # -------------------------------------------------
% 7.82/2.44 # User time : 0.027 s
% 7.82/2.44 # System time : 0.006 s
% 7.82/2.44 # Total time : 0.033 s
% 7.82/2.44 # Maximum resident set size: 7124 pages
% 7.82/2.44
%------------------------------------------------------------------------------