TSTP Solution File: NUM925+3 by Enigma---0.5.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Enigma---0.5.1
% Problem : NUM925+3 : TPTP v8.1.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : enigmatic-eprover.py %s %d 1
% Computer : n028.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:12 EDT 2022
% Result : Theorem 5.67s 2.80s
% Output : CNFRefutation 5.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 13
% Syntax : Number of clauses : 38 ( 32 unt; 0 nHn; 33 RR)
% Number of literals : 49 ( 28 equ; 14 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 : 15 ( 15 usr; 7 con; 0-2 aty)
% Number of variables : 17 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(i_0_479,plain,
number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))) = plus_plus_int(one_one_int,one_one_int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_479) ).
cnf(i_0_1750,plain,
plus_plus_int(pls,pls) = pls,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1750) ).
cnf(i_0_419,plain,
number_number_of_int(plus_plus_int(X1,plus_plus_int(plus_plus_int(pls,pls),one_one_int))) = plus_plus_int(number_number_of_int(X1),one_one_int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_419) ).
cnf(i_0_621,plain,
number_number_of_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int)) = one_one_int,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_621) ).
cnf(i_0_1,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))))) = zero_zero_int,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1) ).
cnf(i_0_1761,plain,
zero_zero_int = pls,
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1761) ).
cnf(i_0_881,plain,
nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int)))) = plus_plus_nat(one_one_nat,one_one_nat),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_881) ).
cnf(i_0_628,plain,
( X1 = zero_zero_int
| hAPP_nat_int(power_power_int(X1),X2) != zero_zero_int
| ~ is_int(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_628) ).
cnf(i_0_2,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_2) ).
cnf(i_0_1781,hypothesis,
( is_int(plus_plus_int(X1,X2))
| ~ is_int(X2)
| ~ is_int(X1) ),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1781) ).
cnf(i_0_1786,hypothesis,
is_int(hAPP_nat_int(X1,X2)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1786) ).
cnf(i_0_1780,hypothesis,
is_int(one_one_int),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1780) ).
cnf(i_0_1450,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-zb7ayscu/lgb.p',i_0_1450) ).
cnf(c_0_1800,plain,
number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))) = plus_plus_int(one_one_int,one_one_int),
i_0_479 ).
cnf(c_0_1801,plain,
plus_plus_int(pls,pls) = pls,
i_0_1750 ).
cnf(c_0_1802,plain,
number_number_of_int(plus_plus_int(X1,plus_plus_int(plus_plus_int(pls,pls),one_one_int))) = plus_plus_int(number_number_of_int(X1),one_one_int),
i_0_419 ).
cnf(c_0_1803,plain,
number_number_of_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int)) = one_one_int,
i_0_621 ).
cnf(c_0_1804,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int))))) = zero_zero_int,
i_0_1 ).
cnf(c_0_1805,plain,
number_number_of_int(plus_plus_int(plus_plus_int(pls,one_one_int),plus_plus_int(pls,one_one_int))) = plus_plus_int(one_one_int,one_one_int),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1800,c_0_1801]),c_0_1801]) ).
cnf(c_0_1806,plain,
zero_zero_int = pls,
i_0_1761 ).
cnf(c_0_1807,plain,
nat(number_number_of_int(plus_plus_int(plus_plus_int(plus_plus_int(pls,pls),one_one_int),plus_plus_int(plus_plus_int(pls,pls),one_one_int)))) = plus_plus_nat(one_one_nat,one_one_nat),
i_0_881 ).
cnf(c_0_1808,plain,
number_number_of_int(plus_plus_int(X1,plus_plus_int(pls,one_one_int))) = plus_plus_int(number_number_of_int(X1),one_one_int),
inference(rw,[status(thm)],[c_0_1802,c_0_1801]) ).
cnf(c_0_1809,plain,
number_number_of_int(plus_plus_int(pls,one_one_int)) = one_one_int,
inference(rw,[status(thm)],[c_0_1803,c_0_1801]) ).
cnf(c_0_1810,plain,
( X1 = zero_zero_int
| hAPP_nat_int(power_power_int(X1),X2) != zero_zero_int
| ~ is_int(X1) ),
i_0_628 ).
cnf(c_0_1811,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),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)],[c_0_1804,c_0_1801]),c_0_1801]),c_0_1805]),c_0_1806]) ).
cnf(c_0_1812,plain,
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_1807,c_0_1801]),c_0_1801]),c_0_1808]),c_0_1809]) ).
cnf(c_0_1813,plain,
( X1 = pls
| hAPP_nat_int(power_power_int(X1),X2) != pls
| ~ is_int(X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_1810,c_0_1806]),c_0_1806]) ).
cnf(c_0_1814,negated_conjecture,
hAPP_nat_int(power_power_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))),plus_plus_nat(one_one_nat,one_one_nat)) = pls,
inference(rw,[status(thm)],[c_0_1811,c_0_1812]) ).
cnf(c_0_1815,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,zero_zero_int),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
i_0_2 ).
cnf(c_0_1816,negated_conjecture,
( plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = pls
| ~ is_int(plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n))) ),
inference(spm,[status(thm)],[c_0_1813,c_0_1814]) ).
cnf(c_0_1817,hypothesis,
( is_int(plus_plus_int(X1,X2))
| ~ is_int(X2)
| ~ is_int(X1) ),
i_0_1781 ).
cnf(c_0_1818,hypothesis,
is_int(hAPP_nat_int(X1,X2)),
i_0_1786 ).
cnf(c_0_1819,hypothesis,
is_int(one_one_int),
i_0_1780 ).
cnf(c_0_1820,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),zero_zero_int)),
i_0_1450 ).
cnf(c_0_1821,plain,
hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)))),
inference(rw,[status(thm)],[c_0_1815,c_0_1806]) ).
cnf(c_0_1822,hypothesis,
plus_plus_int(one_one_int,hAPP_nat_int(semiri1621563631at_int,n)) = pls,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_1816,c_0_1817]),c_0_1818]),c_0_1819])]) ).
cnf(c_0_1823,plain,
~ hBOOL(hAPP_int_bool(hAPP_i1948725293t_bool(ord_less_int,pls),pls)),
inference(rw,[status(thm)],[c_0_1820,c_0_1806]) ).
cnf(c_0_1824,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_1821,c_0_1822]),c_0_1823]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM925+3 : TPTP v8.1.0. Released v5.3.0.
% 0.06/0.13 % Command : enigmatic-eprover.py %s %d 1
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 11:49:22 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.20/0.46 # ENIGMATIC: Selected SinE mode:
% 0.20/0.52 # Parsing /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.52 # Filter: axfilter_auto 0 goes into file theBenchmark_axfilter_auto 0.p
% 0.20/0.52 # Filter: axfilter_auto 1 goes into file theBenchmark_axfilter_auto 1.p
% 0.20/0.52 # Filter: axfilter_auto 2 goes into file theBenchmark_axfilter_auto 2.p
% 5.67/2.80 # ENIGMATIC: Solved by autoschedule-lgb:
% 5.67/2.80 # No SInE strategy applied
% 5.67/2.80 # Trying AutoSched0 for 150 seconds
% 5.67/2.80 # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_TT_S0Y
% 5.67/2.80 # and selection function SelectMaxLComplexAvoidPosPred.
% 5.67/2.80 #
% 5.67/2.80 # Preprocessing time : 0.015 s
% 5.67/2.80 # Presaturation interreduction done
% 5.67/2.80
% 5.67/2.80 # Proof found!
% 5.67/2.80 # SZS status Theorem
% 5.67/2.80 # SZS output start CNFRefutation
% See solution above
% 5.67/2.80 # Training examples: 0 positive, 0 negative
% 5.67/2.80
% 5.67/2.80 # -------------------------------------------------
% 5.67/2.80 # User time : 0.041 s
% 5.67/2.80 # System time : 0.007 s
% 5.67/2.80 # Total time : 0.048 s
% 5.67/2.80 # Maximum resident set size: 7336 pages
% 5.67/2.80
%------------------------------------------------------------------------------