TSTP Solution File: NUM926+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n003.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:18 EDT 2022
% Result : Theorem 7.59s 2.21s
% Output : CNFRefutation 7.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 21 ( 15 unt; 2 nHn; 15 RR)
% Number of literals : 29 ( 19 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 22 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_185,negated_conjecture,
plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_185) ).
cnf(i_0_149,plain,
number_number_of(int,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_149) ).
cnf(i_0_152,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_152) ).
cnf(i_0_148,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_148) ).
cnf(i_0_35,plain,
( plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))
| one_one(int) != t ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_35) ).
cnf(i_0_36,plain,
( plus_plus(int,power_power(int,esk3_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))
| ~ ord_less(int,one_one(int),t) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_36) ).
cnf(i_0_56,plain,
( X1 = X2
| ord_less(int,X1,X2)
| ~ ord_less_eq(int,X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_56) ).
cnf(i_0_34,plain,
ord_less_eq(int,one_one(int),t),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-quegg4ia/lgb.p',i_0_34) ).
cnf(c_0_194,negated_conjecture,
plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int)),
i_0_185 ).
cnf(c_0_195,plain,
number_number_of(int,X1) = X1,
i_0_149 ).
cnf(c_0_196,plain,
plus_plus(int,X1,X2) = plus_plus(int,X2,X1),
i_0_152 ).
cnf(c_0_197,negated_conjecture,
plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,one_one(int),times_times(int,bit0(bit0(bit1(pls))),m)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_195]),c_0_196]) ).
cnf(c_0_198,plain,
times_times(int,X1,X2) = times_times(int,X2,X1),
i_0_148 ).
cnf(c_0_199,plain,
( plus_plus(int,power_power(int,esk1_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk2_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))
| one_one(int) != t ),
i_0_35 ).
cnf(c_0_200,negated_conjecture,
plus_plus(int,power_power(int,X1,number_number_of(nat,bit0(bit1(pls)))),power_power(int,X2,number_number_of(nat,bit0(bit1(pls))))) != plus_plus(int,one_one(int),times_times(int,m,bit0(bit0(bit1(pls))))),
inference(rw,[status(thm)],[c_0_197,c_0_198]) ).
cnf(c_0_201,plain,
( plus_plus(int,power_power(int,esk3_0,number_number_of(nat,bit0(bit1(pls)))),power_power(int,esk4_0,number_number_of(nat,bit0(bit1(pls))))) = plus_plus(int,times_times(int,number_number_of(int,bit0(bit0(bit1(pls)))),m),one_one(int))
| ~ ord_less(int,one_one(int),t) ),
i_0_36 ).
cnf(c_0_202,plain,
( X1 = X2
| ord_less(int,X1,X2)
| ~ ord_less_eq(int,X1,X2) ),
i_0_56 ).
cnf(c_0_203,plain,
ord_less_eq(int,one_one(int),t),
i_0_34 ).
cnf(c_0_204,plain,
one_one(int) != t,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_199,c_0_195]),c_0_198]),c_0_196]),c_0_200]) ).
cnf(c_0_205,plain,
~ ord_less(int,one_one(int),t),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_201,c_0_195]),c_0_198]),c_0_196]),c_0_200]) ).
cnf(c_0_206,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_202,c_0_203]),c_0_204]),c_0_205]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : NUM926+5 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Thu Jul 7 16:22:59 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.59/2.21 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.59/2.21 # No SInE strategy applied
% 7.59/2.21 # Trying AutoSched0 for 150 seconds
% 7.59/2.21 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.59/2.21 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.59/2.21 #
% 7.59/2.21 # Preprocessing time : 0.024 s
% 7.59/2.21 # Presaturation interreduction done
% 7.59/2.21
% 7.59/2.21 # Proof found!
% 7.59/2.21 # SZS status Theorem
% 7.59/2.21 # SZS output start CNFRefutation
% See solution above
% 7.59/2.21 # Training examples: 0 positive, 0 negative
% 7.59/2.21
% 7.59/2.21 # -------------------------------------------------
% 7.59/2.21 # User time : 0.028 s
% 7.59/2.21 # System time : 0.008 s
% 7.59/2.21 # Total time : 0.037 s
% 7.59/2.21 # Maximum resident set size: 7128 pages
% 7.59/2.21
%------------------------------------------------------------------------------