TSTP Solution File: NUM924+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n019.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:09 EDT 2022
% Result : Theorem 7.07s 2.24s
% Output : CNFRefutation 7.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 14 RR)
% Number of literals : 22 ( 14 equ; 5 neg)
% Maximal clause size : 1 ( 1 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 : 12 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_197,plain,
number_number_of(int,pls) = zero_zero(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_197) ).
cnf(i_0_78,plain,
number_number_of(int,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_78) ).
cnf(i_0_215,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/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_215) ).
cnf(i_0_196,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_196) ).
cnf(i_0_53,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(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/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_53) ).
cnf(i_0_79,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_79) ).
cnf(i_0_52,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))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_52) ).
cnf(i_0_141,plain,
times_times(int,pls,X1) = pls,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-p5l0vqll/lgb.p',i_0_141) ).
cnf(c_0_224,plain,
number_number_of(int,pls) = zero_zero(int),
i_0_197 ).
cnf(c_0_225,plain,
number_number_of(int,X1) = X1,
i_0_78 ).
cnf(c_0_226,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_215 ).
cnf(c_0_227,plain,
zero_zero(int) = pls,
inference(rw,[status(thm)],[c_0_224,c_0_225]) ).
cnf(c_0_228,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_226,c_0_227]) ).
cnf(c_0_229,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
i_0_196 ).
cnf(c_0_230,plain,
times_times(int,plus_plus(int,times_times(int,number_number_of(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_53 ).
cnf(c_0_231,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
i_0_79 ).
cnf(c_0_232,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_228,c_0_229]) ).
cnf(c_0_233,plain,
plus_plus(int,one_one(int),power_power(int,s,number_number_of(nat,bit0(bit1(pls))))) = 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_230,c_0_229]),c_0_225]),c_0_231]),c_0_229]),c_0_231]) ).
cnf(c_0_234,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))),
i_0_52 ).
cnf(c_0_235,plain,
times_times(int,pls,X1) = pls,
i_0_141 ).
cnf(c_0_236,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_232,c_0_233]) ).
cnf(c_0_237,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)],[c_0_234,c_0_225]),c_0_231]),c_0_229]),c_0_231]),c_0_225]),c_0_231]),c_0_229]),c_0_227]),c_0_231]),c_0_235]),c_0_236]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM924+5 : TPTP v8.1.0. Released v5.3.0.
% 0.09/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n019.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Wed Jul 6 21:31:55 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.17/0.44 # ENIGMATIC: Selected complete mode:
% 7.07/2.24 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.07/2.24 # No SInE strategy applied
% 7.07/2.24 # Trying AutoSched0 for 150 seconds
% 7.07/2.24 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.07/2.24 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.07/2.24 #
% 7.07/2.24 # Preprocessing time : 0.023 s
% 7.07/2.24 # Presaturation interreduction done
% 7.07/2.24
% 7.07/2.24 # Proof found!
% 7.07/2.24 # SZS status Theorem
% 7.07/2.24 # SZS output start CNFRefutation
% See solution above
% 7.07/2.24 # Training examples: 0 positive, 0 negative
% 7.07/2.24
% 7.07/2.24 # -------------------------------------------------
% 7.07/2.24 # User time : 0.025 s
% 7.07/2.24 # System time : 0.006 s
% 7.07/2.24 # Total time : 0.032 s
% 7.07/2.24 # Maximum resident set size: 7124 pages
% 7.07/2.24
%------------------------------------------------------------------------------