%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n015.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.87s 2.74s
% Output : CNFRefutation 7.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 40 ( 36 unt; 0 nHn; 32 RR)
% Number of literals : 46 ( 36 equ; 9 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-4 aty)
% Number of variables : 23 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_591,plain,
number_number_of(int,hAPP(int,int,bit1,pls)) = one_one(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_591) ).
cnf(i_0_819,plain,
zero_zero(int) = pls,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_819) ).
cnf(i_0_621,plain,
number_number_of(nat,hAPP(int,int,bit1,pls)) = one_one(nat),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_621) ).
cnf(i_0_142,plain,
number_number_of(int,X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_142) ).
cnf(i_0_436,plain,
number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_436) ).
cnf(i_0_121,plain,
hAPP(nat,int,semiring_1_of_nat(int),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = number_number_of(int,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_121) ).
cnf(i_0_822,plain,
hAPP(int,int,plus_plus(int,pls),X1) = X1,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_822) ).
cnf(i_0_115,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = zero_zero(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_115) ).
cnf(i_0_882,plain,
hAPP(X1,X1,X2,ti(X1,X3)) = hAPP(X1,X1,X2,X3),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_882) ).
cnf(i_0_226,plain,
( ti(X1,X2) = zero_zero(X1)
| hAPP(nat,X1,power_power(X1,X2),X3) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_226) ).
cnf(i_0_40,plain,
ring_11004092258visors(int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_40) ).
cnf(i_0_363,plain,
( X1 != X2
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2)) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_363) ).
cnf(i_0_116,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-wh8vu4ms/lgb.p',i_0_116) ).
cnf(c_0_896,plain,
number_number_of(int,hAPP(int,int,bit1,pls)) = one_one(int),
i_0_591 ).
cnf(c_0_897,plain,
zero_zero(int) = pls,
i_0_819 ).
cnf(c_0_898,plain,
number_number_of(nat,hAPP(int,int,bit1,pls)) = one_one(nat),
i_0_621 ).
cnf(c_0_899,plain,
number_number_of(int,hAPP(int,int,bit1,zero_zero(int))) = one_one(int),
inference(rw,[status(thm)],[c_0_896,c_0_897]) ).
cnf(c_0_900,plain,
number_number_of(int,X1) = X1,
i_0_142 ).
cnf(c_0_901,plain,
number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))) = hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
i_0_436 ).
cnf(c_0_902,plain,
number_number_of(nat,hAPP(int,int,bit1,zero_zero(int))) = one_one(nat),
inference(rw,[status(thm)],[c_0_898,c_0_897]) ).
cnf(c_0_903,plain,
hAPP(int,int,bit1,zero_zero(int)) = one_one(int),
inference(rw,[status(thm)],[c_0_899,c_0_900]) ).
cnf(c_0_904,plain,
number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,zero_zero(int)))) = hAPP(nat,nat,plus_plus(nat,one_one(nat)),one_one(nat)),
inference(rw,[status(thm)],[c_0_901,c_0_897]) ).
cnf(c_0_905,plain,
one_one(nat) = number_number_of(nat,one_one(int)),
inference(rw,[status(thm)],[c_0_902,c_0_903]) ).
cnf(c_0_906,plain,
hAPP(nat,int,semiring_1_of_nat(int),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = number_number_of(int,hAPP(int,int,bit0,hAPP(int,int,bit1,pls))),
i_0_121 ).
cnf(c_0_907,plain,
number_number_of(nat,hAPP(int,int,bit0,one_one(int))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,one_one(int))),number_number_of(nat,one_one(int))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_904,c_0_903]),c_0_905]),c_0_905]) ).
cnf(c_0_908,plain,
hAPP(int,int,bit0,one_one(int)) = hAPP(nat,int,semiring_1_of_nat(int),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,one_one(int))),number_number_of(nat,one_one(int)))),
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_906,c_0_897]),c_0_903]),c_0_907]),c_0_897]),c_0_903]),c_0_900]) ).
cnf(c_0_909,plain,
hAPP(int,int,plus_plus(int,pls),X1) = X1,
i_0_822 ).
cnf(c_0_910,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),number_number_of(nat,hAPP(int,int,bit0,hAPP(int,int,bit1,pls)))) = zero_zero(int),
i_0_115 ).
cnf(c_0_911,plain,
number_number_of(nat,hAPP(nat,int,semiring_1_of_nat(int),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,one_one(int))),number_number_of(nat,one_one(int))))) = hAPP(nat,nat,plus_plus(nat,number_number_of(nat,one_one(int))),number_number_of(nat,one_one(int))),
inference(rw,[status(thm)],[c_0_907,c_0_908]) ).
cnf(c_0_912,plain,
hAPP(int,int,plus_plus(int,zero_zero(int)),X1) = X1,
inference(rw,[status(thm)],[c_0_909,c_0_897]) ).
cnf(c_0_913,plain,
hAPP(X1,X1,X2,ti(X1,X3)) = hAPP(X1,X1,X2,X3),
i_0_882 ).
cnf(c_0_914,plain,
( ti(X1,X2) = zero_zero(X1)
| hAPP(nat,X1,power_power(X1,X2),X3) != zero_zero(X1)
| ~ ring_11004092258visors(X1) ),
i_0_226 ).
cnf(c_0_915,negated_conjecture,
hAPP(nat,int,power_power(int,hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n))),hAPP(nat,nat,plus_plus(nat,number_number_of(nat,one_one(int))),number_number_of(nat,one_one(int)))) = zero_zero(int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_910,c_0_897]),c_0_903]),c_0_908]),c_0_911]) ).
cnf(c_0_916,plain,
ti(int,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_912,c_0_913]),c_0_912]) ).
cnf(c_0_917,plain,
ring_11004092258visors(int),
i_0_40 ).
cnf(c_0_918,plain,
( X1 != X2
| ~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X2)) ),
i_0_363 ).
cnf(c_0_919,plain,
hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),zero_zero(int)),hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)))),
i_0_116 ).
cnf(c_0_920,negated_conjecture,
hAPP(int,int,plus_plus(int,one_one(int)),hAPP(nat,int,semiring_1_of_nat(int),n)) = zero_zero(int),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_914,c_0_915]),c_0_916]),c_0_917])]) ).
cnf(c_0_921,plain,
~ hBOOL(hAPP(int,bool,hAPP(int,fun(int,bool),ord_less(int),X1),X1)),
inference(er,[status(thm)],[c_0_918]) ).
cnf(c_0_922,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_919,c_0_920]),c_0_921]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM925+6 : TPTP v8.1.0. Released v5.3.0.
% 0.11/0.12 % Command : enigmatic-eprover.py %s %d 1
% 0.12/0.33 % Computer : n015.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jul 7 09:38:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.45 # ENIGMATIC: Selected SinE mode:
% 0.19/0.49 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.49 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.19/0.49 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.19/0.49 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 7.87/2.74 # ENIGMATIC: Solved by autoschedule-lgb:
% 7.87/2.74 # No SInE strategy applied
% 7.87/2.74 # Trying AutoSched0 for 150 seconds
% 7.87/2.74 # AutoSched0-Mode selected heuristic G_E___208_B07_F1_AE_CS_SP_PS_S5PRR_S0Y
% 7.87/2.74 # and selection function SelectMaxLComplexAvoidPosPred.
% 7.87/2.74 #
% 7.87/2.74 # Preprocessing time : 0.027 s
% 7.87/2.74 # Presaturation interreduction done
% 7.87/2.74
% 7.87/2.74 # Proof found!
% 7.87/2.74 # SZS status Theorem
% 7.87/2.74 # SZS output start CNFRefutation
% See solution above
% 7.87/2.74 # Training examples: 0 positive, 0 negative
% 7.87/2.74
% 7.87/2.74 # -------------------------------------------------
% 7.87/2.74 # User time : 0.051 s
% 7.87/2.74 # System time : 0.006 s
% 7.87/2.74 # Total time : 0.057 s
% 7.87/2.74 # Maximum resident set size: 7176 pages
% 7.87/2.74
%------------------------------------------------------------------------------