%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI692_1 : TPTP v9.0.0. Released v6.3.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 : n032.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:51 PM UTC 2025
% Result : Unsatisfiable 2.26s 1.51s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 7 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 0 ( 0 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 32 ( 0 atm; 17 fun; 15 num; 0 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 : 9 ( 3 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(y,type,
y: $int ).
tff(z,type,
z: $int ).
tff(x,type,
x: $int ).
%Foreground operators:
tff(f_31,axiom,
$sum($product(2,y),$product(3,x)) = 1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq2) ).
tff(f_30,axiom,
$sum($product(2,z),x) = 2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',eq1) ).
tff(c_3,plain,
$sum($product(2,y),$product(3,x)) = 1,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_5,plain,
$product(2,y) = $sum(1,$product($uminus(3),x)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_1,plain,
$sum($product(2,z),x) = 2,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
$sum(2,$product($uminus(2),z)) = x,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_7,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_5,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.09 % Problem : ARI692_1 : TPTP v9.0.0. Released v6.3.0.
% 0.06/0.10 % 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.11/0.29 % Computer : n032.cluster.edu
% 0.11/0.29 % Model : x86_64 x86_64
% 0.11/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.29 % Memory : 8042.1875MB
% 0.11/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.29 % CPULimit : 300
% 0.11/0.29 % WCLimit : 300
% 0.11/0.29 % DateTime : Mon Apr 7 15:16:46 EDT 2025
% 0.11/0.29 % CPUTime :
% 2.26/1.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.26/1.51
% 2.26/1.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------