%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI651_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/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:40:46 PM UTC 2025
% Result : Unsatisfiable 2.58s 1.75s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 11 ( 11 unt; 0 typ; 0 def)
% Number of atoms : 11 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 51 ( 10 atm; 23 fun; 18 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 2 usr; 7 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_30,axiom,
$lesseq(20,$product($uminus(1),$sum(a,$product($uminus(1),$product(2,b))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_32,axiom,
$lesseq($uminus(5),$product($uminus(1),$sum(a,b))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_002) ).
tff(f_31,axiom,
$lesseq(0,a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).
tff(c_1,plain,
$lesseq(20,$product($uminus(1),$sum($product($uminus(2),b),a))),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_10,plain,
~ $less($product(2,b),$sum(20,a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_5,plain,
$lesseq($uminus(5),$product($uminus(1),$sum(b,a))),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_6,plain,
~ $less(5,$sum(b,a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_8,plain,
~ $less(5,$sum(a,b)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_6]) ).
tff(c_3,plain,
$lesseq(0,a),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_9,plain,
~ $less(a,0),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_11,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_10,c_8,c_9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI651_1 : TPTP v9.0.0. Released v6.3.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.14/0.34 % Computer : n023.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Apr 7 15:15:54 EDT 2025
% 0.14/0.34 % CPUTime :
% 2.58/1.75 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.58/1.75
% 2.58/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------