%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM925_1 : TPTP v9.0.0. Released v5.3.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n014.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 : 300s
% DateTime : Wed Apr 9 07:57:35 PM UTC 2025
% Result : Theorem 6.76s 2.63s
% Output : CNFRefutation 7.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 20 ( 17 unt; 0 typ; 0 def)
% Number of atoms : 23 ( 15 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 7 ~; 2 |; 0 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 17 usr; 7 con; 0-2 aty)
% Number of variables : 3 ( 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ ord_less_nat > ord_less_int > power_power_nat > power_power_int > plus_plus_nat > plus_plus_int > #nlpp > semiri984289939at_nat > semiri1621563631at_int > number_number_of_nat > number_number_of_int > bit1 > bit0 > zero_zero_nat > zero_zero_int > t > pls > one_one_nat > one_one_int > n
%Foreground sorts:
tff(nat,type,
nat: $tType ).
tff(int,type,
int: $tType ).
%Background operators:
%Foreground operators:
tff(bit1,type,
bit1: int > int ).
tff(n,type,
n: nat ).
tff(one_one_int,type,
one_one_int: int ).
tff(semiri984289939at_nat,type,
semiri984289939at_nat: nat > nat ).
tff(power_power_nat,type,
power_power_nat: ( nat * nat ) > nat ).
tff(number_number_of_int,type,
number_number_of_int: int > int ).
tff(number_number_of_nat,type,
number_number_of_nat: int > nat ).
tff(semiri1621563631at_int,type,
semiri1621563631at_int: nat > int ).
tff(plus_plus_nat,type,
plus_plus_nat: ( nat * nat ) > nat ).
tff(one_one_nat,type,
one_one_nat: nat ).
tff(power_power_int,type,
power_power_int: ( int * nat ) > int ).
tff(ord_less_nat,type,
ord_less_nat: ( nat * nat ) > $o ).
tff(pls,type,
pls: int ).
tff(zero_zero_nat,type,
zero_zero_nat: nat ).
tff(bit0,type,
bit0: int > int ).
tff(ord_less_int,type,
ord_less_int: ( int * int ) > $o ).
tff(plus_plus_int,type,
plus_plus_int: ( int * int ) > int ).
tff(t,type,
t: int ).
tff(zero_zero_int,type,
zero_zero_int: int ).
tff(f_272,axiom,
pls = zero_zero_int,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_78_Pls__def) ).
tff(f_220,axiom,
~ ord_less_int(pls,zero_zero_int),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_62_bin__less__0__simps_I1_J) ).
tff(f_111,axiom,
plus_plus_nat(one_one_nat,one_one_nat) = number_number_of_nat(bit0(bit1(pls))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_33_nat__1__add__1) ).
tff(f_347,negated_conjecture,
~ ( ( power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
tff(f_47,axiom,
! [A_1: int] :
( ( power_power_int(A_1,number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int )
<=> ( A_1 = zero_zero_int ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_7_zero__eq__power2) ).
tff(f_32,axiom,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_n1pos) ).
tff(c_242,plain,
zero_zero_int = pls,
inference(cnfTransformation,[status(thm)],[f_272]) ).
tff(c_192,plain,
~ ord_less_int(pls,zero_zero_int),
inference(cnfTransformation,[status(thm)],[f_220]) ).
tff(c_349,plain,
~ ord_less_int(pls,pls),
inference(demodulation,[status(thm),theory(equality)],[c_242,c_192]) ).
tff(c_84,plain,
number_number_of_nat(bit0(bit1(pls))) = plus_plus_nat(one_one_nat,one_one_nat),
inference(cnfTransformation,[status(thm)],[f_111]) ).
tff(c_312,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = zero_zero_int,
inference(cnfTransformation,[status(thm)],[f_347]) ).
tff(c_336,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),number_number_of_nat(bit0(bit1(pls)))) = pls,
inference(demodulation,[status(thm),theory(equality)],[c_242,c_312]) ).
tff(c_359,plain,
power_power_int(plus_plus_int(one_one_int,semiri1621563631at_int(n)),plus_plus_nat(one_one_nat,one_one_nat)) = pls,
inference(demodulation,[status(thm),theory(equality)],[c_84,c_336]) ).
tff(c_20,plain,
! [A_1_3: int] :
( ( zero_zero_int = A_1_3 )
| ( power_power_int(A_1_3,number_number_of_nat(bit0(bit1(pls)))) != zero_zero_int ) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_2360,plain,
! [A_1_236: int] :
( ( pls = A_1_236 )
| ( power_power_int(A_1_236,plus_plus_nat(one_one_nat,one_one_nat)) != pls ) ),
inference(demodulation,[status(thm),theory(equality)],[c_84,c_242,c_242,c_20]) ).
tff(c_2377,plain,
plus_plus_int(one_one_int,semiri1621563631at_int(n)) = pls,
inference(superposition,[status(thm),theory(equality)],[c_359,c_2360]) ).
tff(c_2,plain,
ord_less_int(zero_zero_int,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_395,plain,
ord_less_int(pls,plus_plus_int(one_one_int,semiri1621563631at_int(n))),
inference(demodulation,[status(thm),theory(equality)],[c_242,c_2]) ).
tff(c_2378,plain,
ord_less_int(pls,pls),
inference(demodulation,[status(thm),theory(equality)],[c_2377,c_395]) ).
tff(c_2381,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_349,c_2378]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NUM925_1 : TPTP v9.0.0. Released v5.3.0.
% 0.06/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.34 % Computer : n014.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 8 15:47:49 EDT 2025
% 0.14/0.34 % CPUTime :
% 6.76/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 6.76/2.64
% 6.76/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------