%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI573_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 : 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:35 PM UTC 2025
% Result : Theorem 2.27s 1.44s
% Output : CNFRefutation 2.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 15 ( 0 equ)
% Maximal formula atoms : 5 ( 3 avg)
% Number of connectives : 13 ( 3 ~; 0 |; 8 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 6 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 78 ( 12 atm; 33 fun; 21 num; 12 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 : 5 ( 0 usr; 2 con; 0-2 aty)
% Number of variables : 12 ( 6 !; 6 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_36,negated_conjecture,
~ ! [Xa: $int,Ya: $int,Za: $int] :
( ( $lesseq(1,$sum($product(Xa,2),$uminus(Ya)))
& $lesseq(1,$sum($product(Ya,2),$uminus(Za)))
& $lesseq(1,$sum($product(Za,2),$uminus(Xa))) )
=> $lesseq(2,$sum($sum(Xa,Ya),Za)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',impl_3_ineq) ).
tff(f_21404,plain,
? [Xa: $int,Ya: $int,Za: $int] :
( $lesseq(1,$sum($product(2,Xa),$uminus(Ya)))
& $lesseq(1,$sum($product(2,Ya),$uminus(Za)))
& $lesseq(1,$sum($product(2,Za),$uminus(Xa)))
& ~ $lesseq(2,$sum($sum(Ya,Xa),Za)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(f_21407,plain,
! [Xa: $int,Ya: $int,Za: $int] :
( ? [Xa: $int,Ya: $int,Za: $int] :
( $lesseq(1,$sum($product(2,Xa),$uminus(Ya)))
& $lesseq(1,$sum($product(2,Ya),$uminus(Za)))
& $lesseq(1,$sum($product(2,Za),$uminus(Xa)))
& ~ $lesseq(2,$sum($sum(Ya,Xa),Za)) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_21408,plain,
$false,
inference(equivalence,[status(thm)],[f_21404,f_21407]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_21408]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.09 % Problem : ARI573_1 : TPTP v9.0.0. Released v5.1.0.
% 0.05/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.10/0.28 % Computer : n032.cluster.edu
% 0.10/0.28 % Model : x86_64 x86_64
% 0.10/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.28 % Memory : 8042.1875MB
% 0.10/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon Apr 7 15:13:16 EDT 2025
% 0.10/0.29 % CPUTime :
% 2.27/1.44 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.27/1.44
% 2.27/1.44 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------