TSTP Solution File: NUM925+1 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n029.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:11 EDT 2022
% Result : Theorem 13.29s 3.38s
% Output : CNFRefutation 13.29s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 17 ( 14 unt; 0 nHn; 15 RR)
% Number of literals : 20 ( 14 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_133,plain,
( X1 = zero_zero_int
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_133) ).
cnf(i_0_117,plain,
pls = zero_zero_int,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_117) ).
cnf(i_0_152,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_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/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_152) ).
cnf(i_0_119,plain,
plus_plus_int(X1,pls) = X1,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_119) ).
cnf(i_0_1,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_1) ).
cnf(i_0_47,plain,
~ ord_less_int(pls,pls),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-qyor73x1/lgb.p',i_0_47) ).
cnf(c_0_159,plain,
( X1 = zero_zero_int
| power_power_int(X1,number_number_of_nat(X2)) != zero_zero_int ),
i_0_133 ).
cnf(c_0_160,plain,
pls = zero_zero_int,
i_0_117 ).
cnf(c_0_161,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_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_152 ).
cnf(c_0_162,plain,
plus_plus_int(X1,pls) = X1,
i_0_119 ).
cnf(c_0_163,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
i_0_1 ).
cnf(c_0_164,plain,
( X1 = pls
| power_power_int(X1,number_number_of_nat(X2)) != pls ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_159,c_0_160]),c_0_160]) ).
cnf(c_0_165,negated_conjecture,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(plus_plus_int(one_one_int,one_one_int))) = pls,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_161,c_0_162]),c_0_162]),c_0_162]),c_0_162]),c_0_160]) ).
cnf(c_0_166,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(rw,[status(thm)],[c_0_163,c_0_160]) ).
cnf(c_0_167,negated_conjecture,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
inference(spm,[status(thm)],[c_0_164,c_0_165]) ).
cnf(c_0_168,plain,
~ ord_less_int(pls,pls),
i_0_47 ).
cnf(c_0_169,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_166,c_0_167]),c_0_168]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.11 % Problem : NUM925+1 : TPTP v8.1.0. Released v5.3.0.
% 0.05/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.10/0.32 % Computer : n029.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 600
% 0.10/0.32 % DateTime : Tue Jul 5 06:57:44 EDT 2022
% 0.10/0.32 % CPUTime :
% 0.16/0.42 # ENIGMATIC: Selected complete mode:
% 13.29/3.38 # ENIGMATIC: Solved by autoschedule-lgb:
% 13.29/3.38 # No SInE strategy applied
% 13.29/3.38 # Trying AutoSched0 for 150 seconds
% 13.29/3.38 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 13.29/3.38 # and selection function SelectComplexExceptUniqMaxHorn.
% 13.29/3.38 #
% 13.29/3.38 # Preprocessing time : 0.021 s
% 13.29/3.38 # Presaturation interreduction done
% 13.29/3.38
% 13.29/3.38 # Proof found!
% 13.29/3.38 # SZS status Theorem
% 13.29/3.38 # SZS output start CNFRefutation
% See solution above
% 13.29/3.38 # Training examples: 0 positive, 0 negative
% 13.29/3.38
% 13.29/3.38 # -------------------------------------------------
% 13.29/3.38 # User time : 0.025 s
% 13.29/3.38 # System time : 0.005 s
% 13.29/3.38 # Total time : 0.030 s
% 13.29/3.38 # Maximum resident set size: 7120 pages
% 13.29/3.38
%------------------------------------------------------------------------------