TSTP Solution File: NUM925+5 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n012.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:14 EDT 2022
% Result : Theorem 7.07s 2.21s
% Output : CNFRefutation 7.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of clauses : 29 ( 24 unt; 0 nHn; 22 RR)
% Number of literals : 37 ( 22 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-3 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_73,plain,
number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))) = plus_plus(nat,one_one(nat),one_one(nat)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_73) ).
cnf(i_0_148,plain,
plus_plus(int,X1,pls) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_148) ).
cnf(i_0_45,plain,
( ti(X1,X2) = zero_zero(X1)
| power_power(X1,X2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_45) ).
cnf(i_0_198,negated_conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) = zero_zero(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_198) ).
cnf(i_0_146,plain,
zero_zero(int) = pls,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_146) ).
cnf(i_0_149,plain,
plus_plus(int,pls,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_149) ).
cnf(i_0_6,plain,
( plus_plus(X1,X2,ti(X1,X3)) = plus_plus(X1,X2,X3)
| ~ number_semiring(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_6) ).
cnf(i_0_180,plain,
number_semiring(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_180) ).
cnf(i_0_37,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_37) ).
cnf(i_0_177,plain,
ring_11004092258visors(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_177) ).
cnf(i_0_78,plain,
~ ord_less(int,pls,pls),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-6c7kqs9j/lgb.p',i_0_78) ).
cnf(c_0_210,plain,
number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls))) = plus_plus(nat,one_one(nat),one_one(nat)),
i_0_73 ).
cnf(c_0_211,plain,
plus_plus(int,X1,pls) = X1,
i_0_148 ).
cnf(c_0_212,plain,
( ti(X1,X2) = zero_zero(X1)
| power_power(X1,X2,number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
i_0_45 ).
cnf(c_0_213,plain,
number_number_of(nat,plus_plus(int,one_one(int),one_one(int))) = plus_plus(nat,one_one(nat),one_one(nat)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_210,c_0_211]),c_0_211]),c_0_211]),c_0_211]) ).
cnf(c_0_214,negated_conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),number_number_of(nat,plus_plus(int,plus_plus(int,plus_plus(int,one_one(int),pls),pls),plus_plus(int,plus_plus(int,one_one(int),pls),pls)))) = zero_zero(int),
i_0_198 ).
cnf(c_0_215,plain,
zero_zero(int) = pls,
i_0_146 ).
cnf(c_0_216,plain,
plus_plus(int,pls,X1) = X1,
i_0_149 ).
cnf(c_0_217,plain,
( plus_plus(X1,X2,ti(X1,X3)) = plus_plus(X1,X2,X3)
| ~ number_semiring(X1) ),
i_0_6 ).
cnf(c_0_218,plain,
number_semiring(int),
i_0_180 ).
cnf(c_0_219,plain,
ord_less(int,zero_zero(int),plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
i_0_37 ).
cnf(c_0_220,plain,
( ti(X1,X2) = zero_zero(X1)
| power_power(X1,X2,plus_plus(nat,one_one(nat),one_one(nat))) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_211]),c_0_211]),c_0_211]),c_0_211]),c_0_213]) ).
cnf(c_0_221,negated_conjecture,
power_power(int,plus_plus(int,one_one(int),semiring_1_of_nat(int,n)),plus_plus(nat,one_one(nat),one_one(nat))) = pls,
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_214,c_0_211]),c_0_211]),c_0_211]),c_0_211]),c_0_213]),c_0_215]) ).
cnf(c_0_222,plain,
ti(int,X1) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_216,c_0_217]),c_0_216]),c_0_218])]) ).
cnf(c_0_223,plain,
ring_11004092258visors(int),
i_0_177 ).
cnf(c_0_224,plain,
ord_less(int,pls,plus_plus(int,one_one(int),semiring_1_of_nat(int,n))),
inference(rw,[status(thm)],[c_0_219,c_0_215]) ).
cnf(c_0_225,negated_conjecture,
plus_plus(int,one_one(int),semiring_1_of_nat(int,n)) = pls,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_220,c_0_221]),c_0_222]),c_0_215]),c_0_215]),c_0_223])]) ).
cnf(c_0_226,plain,
~ ord_less(int,pls,pls),
i_0_78 ).
cnf(c_0_227,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_224,c_0_225]),c_0_226]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : NUM925+5 : TPTP v8.1.0. Released v5.3.0.
% 0.09/0.11 % Command : enigmatic-eprover.py %s %d 1
% 0.11/0.32 % Computer : n012.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Wed Jul 6 17:14:32 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.19/0.44 # ENIGMATIC: Selected complete mode:
% 7.07/2.21 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.07/2.21 # No SInE strategy applied
% 7.07/2.21 # Trying AutoSched0 for 150 seconds
% 7.07/2.21 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 7.07/2.21 # and selection function SelectComplexExceptUniqMaxHorn.
% 7.07/2.21 #
% 7.07/2.21 # Preprocessing time : 0.024 s
% 7.07/2.21 # Presaturation interreduction done
% 7.07/2.21
% 7.07/2.21 # Proof found!
% 7.07/2.21 # SZS status Theorem
% 7.07/2.21 # SZS output start CNFRefutation
% See solution above
% 7.07/2.21 # Training examples: 0 positive, 0 negative
% 7.07/2.21
% 7.07/2.21 # -------------------------------------------------
% 7.07/2.21 # User time : 0.036 s
% 7.07/2.21 # System time : 0.007 s
% 7.07/2.21 # Total time : 0.043 s
% 7.07/2.21 # Maximum resident set size: 7124 pages
% 7.07/2.21
%------------------------------------------------------------------------------