%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI123_1 : TPTP v9.0.0. Released v5.0.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 : n023.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:39:43 PM UTC 2025
% Result : Theorem 2.66s 1.58s
% Output : CNFRefutation 2.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 7 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 8 ( 3 ~; 0 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 17 ( 0 atm; 4 fun; 0 num; 13 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 1 ( 0 usr; 0 con; 2-2 aty)
% Number of variables : 13 ( 6 !; 7 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_38,negated_conjecture,
~ ? [Xa: $int,Ya: $int,Za: $int,Z1a: $int,Z2a: $int,Z3a: $int,Z4a: $int] :
( ( ( $product(Xa,Ya) = Z1a )
& ( $product(Z1a,Za) = Z2a )
& ( $product(Ya,Za) = Z3a )
& ( $product(Xa,Z3a) = Z4a ) )
=> ( Z2a = Z4a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associative_product_exists) ).
tff(f_170,plain,
! [Z2_5a: $int,Z4_7a: $int] : ( Z2_5a != Z4_7a ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(f_173,plain,
! [Z2_5a: $int,Z4_7a: $int] :
( ! [Z2_5a: $int,Z4_7a: $int] : ( Z2_5a != Z4_7a )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_174,plain,
$false,
inference(equivalence,[status(thm)],[f_170,f_173]) ).
tff(c_10,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_174]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI123_1 : TPTP v9.0.0. Released v5.0.0.
% 0.03/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 : n023.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:04:09 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.66/1.58 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.66/1.59
% 2.66/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------