%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI619_3 : TPTP v9.0.0. Released v5.1.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 : n004.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 05:40:42 PM UTC 2025
% Result : Theorem 3.16s 1.80s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 1
% Syntax : Number of formulae : 19 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 43 ( 20 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 35 ( 11 ~; 20 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 64 ( 4 atm; 5 fun; 48 num; 7 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 5 con; 0-2 aty)
% Number of variables : 7 ( 6 !; 1 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(pow2,type,
pow2: $real > $o ).
tff('#skF_1',type,
'#skF_1': $real > $real ).
tff(f_42,negated_conjecture,
~ ( ! [Xa: $real] :
( pow2(Xa)
<=> ( ( Xa = 1 )
| ( $lesseq(2,Xa)
& ? [Ya: $real] :
( ( $product(2,Ya) = Xa )
& pow2(Ya) ) ) ) )
=> ~ pow2(5) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',not_pow_of_2_5) ).
tff(c_2,plain,
pow2(5),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_29,plain,
! [X_9a: $real] :
( ( $product(2,'#skF_1'(X_9a)) = X_9a )
| ~ pow2(X_9a)
| ( X_9a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_36,plain,
( ( $product(2,'#skF_1'(5)) = 5 )
| ( 5 = 1 ) ),
inference(resolution,[status(thm)],[c_2,c_29]) ).
tff(c_37,plain,
'#skF_1'(5) = 5/2,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_36]) ).
tff(c_3,plain,
! [X_1a: $real] :
( pow2('#skF_1'(X_1a))
| ~ pow2(X_1a)
| ( X_1a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_166,plain,
( pow2(5/2)
| ~ pow2(5)
| ( 5 = 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_37,c_3]) ).
tff(c_170,plain,
( pow2(5/2)
| ( 5 = 1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_166]) ).
tff(c_171,plain,
pow2(5/2),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_170]) ).
tff(c_4,plain,
! [X_1a: $real] :
( ( $product(2,'#skF_1'(X_1a)) = X_1a )
| ~ pow2(X_1a)
| ( X_1a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_289,plain,
( ( $product(2,'#skF_1'(5/2)) = 5/2 )
| ( 5/2 = 1 ) ),
inference(resolution,[status(thm)],[c_171,c_4]) ).
tff(c_290,plain,
'#skF_1'(5/2) = 5/4,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_289]) ).
tff(c_317,plain,
( pow2(5/4)
| ~ pow2(5/2)
| ( 5/2 = 1 ) ),
inference(superposition,[status(thm),theory(equality)],[c_290,c_3]) ).
tff(c_321,plain,
( pow2(5/4)
| ( 5/2 = 1 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_171,c_317]) ).
tff(c_322,plain,
pow2(5/4),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_321]) ).
tff(c_5,plain,
! [X_1a: $real] :
( ~ pow2(X_1a)
| ( X_1a = 1 )
| $lesseq(2,X_1a) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_6,plain,
! [X_1a: $real] :
( ~ pow2(X_1a)
| ( X_1a = 1 )
| ~ $less(X_1a,2) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_336,plain,
( ( 5/4 = 1 )
| ~ $less(5/4,2) ),
inference(resolution,[status(thm)],[c_322,c_6]) ).
tff(c_338,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_336]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI619_3 : TPTP v9.0.0. Released v5.1.0.
% 0.12/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.13/0.34 % Computer : n004.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 : 300
% 0.13/0.34 % DateTime : Mon Apr 7 15:14:23 EDT 2025
% 0.19/0.34 % CPUTime :
% 3.16/1.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.22/1.80
% 3.22/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------