%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI619_1 : 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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n005.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.15s 1.82s
% Output : CNFRefutation 3.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 1
% Syntax : Number of formulae : 8 ( 5 unt; 0 typ; 0 def)
% Number of atoms : 16 ( 9 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 11 ( 3 ~; 4 |; 2 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 27 ( 1 atm; 5 fun; 18 num; 3 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 2 usr; 4 con; 0-2 aty)
% Number of variables : 3 ( 2 !; 1 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ pow2 > #nlpp > #skF_1
%Foreground sorts:
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
%Foreground operators:
tff('#skF_1',type,
'#skF_1': $int > $int ).
tff(pow2,type,
pow2: $int > $o ).
tff(f_42,negated_conjecture,
~ ( ! [Xa: $int] :
( pow2(Xa)
<=> ( ( Xa = 1 )
| ( $lesseq(2,Xa)
& ? [Ya: $int] :
( ( $product(2,Ya) = Xa )
& pow2(Ya) ) ) ) )
=> ~ pow2(5) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_pow_of_2_5) ).
tff(c_20,plain,
pow2(5),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_37,plain,
! [X_9a: $int] :
( ( $product(2,'#skF_1'(X_9a)) = X_9a )
| ~ pow2(X_9a)
| ( X_9a = 1 ) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_44,plain,
( ( $product(2,'#skF_1'(5)) = 5 )
| ( 5 = 1 ) ),
inference(resolution,[status(thm)],[c_20,c_37]) ).
tff(c_46,plain,
$product(2,'#skF_1'(5)) = 5,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_44]) ).
tff(c_202,plain,
'#skF_1'(5) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_206,plain,
$product(2,'#skE_1') = 5,
inference(demodulation,[status(thm),theory(equality)],[c_202,c_46]) ).
tff(c_325,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_206]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : ARI619_1 : TPTP v9.0.0. Released v5.1.0.
% 0.13/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Apr 7 15:14:42 EDT 2025
% 0.14/0.35 % CPUTime :
% 3.15/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.15/1.82
% 3.15/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------