TSTP Solution File: NUM926+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n005.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:16 EDT 2022
% Result : Theorem 8.20s 2.35s
% Output : CNFRefutation 8.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 16 unt; 2 nHn; 18 RR)
% Number of literals : 34 ( 23 equ; 15 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 8 con; 0-2 aty)
% Number of variables : 24 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_163,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(bit0(bit0(bit1(pls))),m),one_one_int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_163) ).
cnf(i_0_146,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_146) ).
cnf(i_0_142,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_142) ).
cnf(i_0_17,plain,
times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_17) ).
cnf(i_0_3,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(bit0(bit0(bit1(pls))),m),one_one_int)
| ~ ord_less_int(one_one_int,t) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_3) ).
cnf(i_0_2,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(bit0(bit0(bit1(pls))),m),one_one_int)
| t != one_one_int ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_2) ).
cnf(i_0_29,plain,
( X1 = X2
| ord_less_int(X1,X2)
| ~ ord_less_eq_int(X1,X2) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_29) ).
cnf(i_0_1,plain,
ord_less_eq_int(one_one_int,t),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-lb4oyn0p/lgb.p',i_0_1) ).
cnf(c_0_172,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(bit0(bit0(bit1(pls))),m),one_one_int),
i_0_163 ).
cnf(c_0_173,plain,
plus_plus_int(X1,X2) = plus_plus_int(X2,X1),
i_0_146 ).
cnf(c_0_174,plain,
times_times_int(X1,X2) = times_times_int(X2,X1),
i_0_142 ).
cnf(c_0_175,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)],[inference(rw,[status(thm)],[c_0_172,c_0_173]),c_0_174]) ).
cnf(c_0_176,plain,
times_times_int(X1,X1) = power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),
i_0_17 ).
cnf(c_0_177,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(bit0(bit0(bit1(pls))),m),one_one_int)
| ~ ord_less_int(one_one_int,t) ),
i_0_3 ).
cnf(c_0_178,negated_conjecture,
plus_plus_int(power_power_int(X1,number_number_of_nat(bit0(bit1(pls)))),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_175,c_0_176]) ).
cnf(c_0_179,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(bit0(bit0(bit1(pls))),m),one_one_int)
| t != one_one_int ),
i_0_2 ).
cnf(c_0_180,plain,
( plus_plus_int(times_times_int(esk3_0,esk3_0),times_times_int(esk4_0,esk4_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))
| ~ ord_less_int(one_one_int,t) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_177,c_0_176]),c_0_176]),c_0_173]),c_0_174]) ).
cnf(c_0_181,plain,
plus_plus_int(times_times_int(X1,X1),times_times_int(X2,X2)) != plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls))))),
inference(spm,[status(thm)],[c_0_178,c_0_176]) ).
cnf(c_0_182,plain,
( plus_plus_int(times_times_int(esk1_0,esk1_0),times_times_int(esk2_0,esk2_0)) = plus_plus_int(one_one_int,times_times_int(m,bit0(bit0(bit1(pls)))))
| t != one_one_int ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_176]),c_0_176]),c_0_173]),c_0_174]) ).
cnf(c_0_183,plain,
~ ord_less_int(one_one_int,t),
inference(sr,[status(thm)],[c_0_180,c_0_181]) ).
cnf(c_0_184,plain,
( X1 = X2
| ord_less_int(X1,X2)
| ~ ord_less_eq_int(X1,X2) ),
i_0_29 ).
cnf(c_0_185,plain,
ord_less_eq_int(one_one_int,t),
i_0_1 ).
cnf(c_0_186,plain,
t != one_one_int,
inference(spm,[status(thm)],[c_0_181,c_0_182]) ).
cnf(c_0_187,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_183,c_0_184]),c_0_185])]),c_0_186]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926+1 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.32 % Computer : n005.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Tue Jul 5 14:58:39 EDT 2022
% 0.12/0.32 % CPUTime :
% 0.16/0.43 # ENIGMATIC: Selected complete mode:
% 8.20/2.35 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.20/2.35 # No SInE strategy applied
% 8.20/2.35 # Trying AutoSched0 for 150 seconds
% 8.20/2.35 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S026I
% 8.20/2.35 # and selection function SelectOptimalRestrNDepth2.
% 8.20/2.35 #
% 8.20/2.35 # Preprocessing time : 0.024 s
% 8.20/2.35 # Presaturation interreduction done
% 8.20/2.35
% 8.20/2.35 # Proof found!
% 8.20/2.35 # SZS status Theorem
% 8.20/2.35 # SZS output start CNFRefutation
% See solution above
% 8.20/2.35 # Training examples: 0 positive, 0 negative
% 8.20/2.35
% 8.20/2.35 # -------------------------------------------------
% 8.20/2.35 # User time : 0.034 s
% 8.20/2.35 # System time : 0.010 s
% 8.20/2.35 # Total time : 0.044 s
% 8.20/2.35 # Maximum resident set size: 7128 pages
% 8.20/2.35
%------------------------------------------------------------------------------