%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM926+7 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n013.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:19 EDT 2022
% Result : Theorem 8.41s 2.85s
% Output : CNFRefutation 8.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of clauses : 38 ( 32 unt; 2 nHn; 22 RR)
% Number of literals : 46 ( 35 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 10 con; 0-4 aty)
% Number of variables : 44 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_239,plain,
number_number_of(int,bit1(pls)) = one_one(int),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_239) ).
cnf(i_0_1423,plain,
number_number_of(int,X1) = ti(int,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1423) ).
cnf(i_0_1640,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1640) ).
cnf(i_0_156,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_156) ).
cnf(i_0_1627,plain,
ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1627) ).
cnf(i_0_1412,plain,
hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1412) ).
cnf(i_0_1463,plain,
hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1463) ).
cnf(i_0_1436,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X1),X2)),X3) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X2),X3)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1436) ).
cnf(i_0_229,plain,
hAPP(int,int,plus_plus(int,bit1(X1)),hAPP(int,int,plus_plus(int,X2),X2)) = bit1(hAPP(int,int,plus_plus(int,X1),X2)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_229) ).
cnf(i_0_201,plain,
hAPP(int,int,plus_plus(int,pls),X1) = ti(int,X1),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_201) ).
cnf(i_0_157,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_157) ).
cnf(i_0_177,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,esk2_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
| one_one(int) != t ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_177) ).
cnf(i_0_305,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk6_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,esk7_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_305) ).
cnf(i_0_336,plain,
( ti(int,X1) = ti(int,X2)
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2)) ),
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_336) ).
cnf(i_0_1683,plain,
ti(int,t) = t,
file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-l_wzjjjp/lgb.p',i_0_1683) ).
cnf(c_0_1699,plain,
number_number_of(int,bit1(pls)) = one_one(int),
i_0_239 ).
cnf(c_0_1700,plain,
number_number_of(int,X1) = ti(int,X1),
i_0_1423 ).
cnf(c_0_1701,plain,
ti(int,bit1(pls)) = one_one(int),
inference(rw,[status(thm)],[c_0_1699,c_0_1700]) ).
cnf(c_0_1702,hypothesis,
ti(int,bit1(X1)) = bit1(X1),
i_0_1640 ).
cnf(c_0_1703,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) != hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int)),
i_0_156 ).
cnf(c_0_1704,plain,
ti(X1,hAPP(X2,X1,X3,X4)) = hAPP(X2,X1,X3,X4),
i_0_1627 ).
cnf(c_0_1705,plain,
hAPP(int,int,times_times(int,X1),X2) = hAPP(int,int,times_times(int,X2),X1),
i_0_1412 ).
cnf(c_0_1706,plain,
one_one(int) = bit1(pls),
inference(rw,[status(thm)],[c_0_1701,c_0_1702]) ).
cnf(c_0_1707,plain,
hAPP(int,int,plus_plus(int,X1),X2) = hAPP(int,int,plus_plus(int,X2),X1),
i_0_1463 ).
cnf(c_0_1708,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) != hAPP(int,int,plus_plus(int,bit1(pls)),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1703,c_0_1700]),c_0_1704]),c_0_1705]),c_0_1706]),c_0_1707]) ).
cnf(c_0_1709,plain,
hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,X1),X2)),X3) = hAPP(int,int,plus_plus(int,X1),hAPP(int,int,plus_plus(int,X2),X3)),
i_0_1436 ).
cnf(c_0_1710,plain,
hAPP(int,int,plus_plus(int,bit1(X1)),hAPP(int,int,plus_plus(int,X2),X2)) = bit1(hAPP(int,int,plus_plus(int,X1),X2)),
i_0_229 ).
cnf(c_0_1711,plain,
hAPP(int,int,plus_plus(int,pls),X1) = ti(int,X1),
i_0_201 ).
cnf(c_0_1712,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),one_one(int)),t)),
i_0_157 ).
cnf(c_0_1713,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk1_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,esk2_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
| one_one(int) != t ),
i_0_177 ).
cnf(c_0_1714,negated_conjecture,
hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,X1),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,X2),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) != hAPP(int,int,plus_plus(int,bit1(pls)),hAPP(int,int,times_times(int,m),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(bit1(pls))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1708,c_0_1709]),c_0_1710]),c_0_1711]),c_0_1702]) ).
cnf(c_0_1715,plain,
( hAPP(int,int,plus_plus(int,hAPP(nat,int,power_power(int,esk6_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),hAPP(nat,int,power_power(int,esk7_0),number_number_of(nat,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))) = hAPP(int,int,plus_plus(int,hAPP(int,int,times_times(int,number_number_of(int,hAPP(int,int,plus_plus(int,hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))),hAPP(int,int,plus_plus(int,bit1(pls)),bit1(pls))))),m)),one_one(int))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),one_one(int)),t)) ),
i_0_305 ).
cnf(c_0_1716,plain,
( ti(int,X1) = ti(int,X2)
| hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2))
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),X1),X2)) ),
i_0_336 ).
cnf(c_0_1717,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less_eq(int),bit1(pls)),t)),
inference(rw,[status(thm)],[c_0_1712,c_0_1706]) ).
cnf(c_0_1718,plain,
ti(int,t) = t,
i_0_1683 ).
cnf(c_0_1719,plain,
bit1(pls) != t,
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_1713,c_0_1700]),c_0_1704]),c_0_1709]),c_0_1710]),c_0_1711]),c_0_1702]),c_0_1705]),c_0_1706]),c_0_1707]),c_0_1706]),c_0_1714]) ).
cnf(c_0_1720,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),bit1(pls)),t)),
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_1715,c_0_1700]),c_0_1704]),c_0_1709]),c_0_1710]),c_0_1711]),c_0_1702]),c_0_1705]),c_0_1706]),c_0_1707]),c_0_1706]),c_0_1714]) ).
cnf(c_0_1721,plain,
$false,
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1716,c_0_1717]),c_0_1702]),c_0_1718]),c_0_1719]),c_0_1720]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NUM926+7 : TPTP v8.1.0. Released v5.3.0.
% 0.10/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 09:01:31 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.19/0.46 # ENIGMATIC: Selected SinE mode:
% 0.19/0.55 # Parsing /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.19/0.55 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.55 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.55 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 8.41/2.85 # ENIGMATIC: Solved by autoschedule-lgb:
% 8.41/2.85 # No SInE strategy applied
% 8.41/2.85 # Trying AutoSched0 for 150 seconds
% 8.41/2.85 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 8.41/2.85 # and selection function SelectComplexExceptUniqMaxHorn.
% 8.41/2.85 #
% 8.41/2.85 # Preprocessing time : 0.014 s
% 8.41/2.85 # Presaturation interreduction done
% 8.41/2.85
% 8.41/2.85 # Proof found!
% 8.41/2.85 # SZS status Theorem
% 8.41/2.85 # SZS output start CNFRefutation
% See solution above
% 8.41/2.85 # Training examples: 0 positive, 0 negative
% 8.41/2.85
% 8.41/2.85 # -------------------------------------------------
% 8.41/2.85 # User time : 0.018 s
% 8.41/2.85 # System time : 0.008 s
% 8.41/2.85 # Total time : 0.026 s
% 8.41/2.85 # Maximum resident set size: 7368 pages
% 8.41/2.85
%------------------------------------------------------------------------------