%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI653_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 : n027.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.34s 1.49s
% Output : CNFRefutation 2.46s
% 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 ( 0 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 20 ( 6 atm; 4 fun; 10 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 1 usr; 6 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_30,axiom,
$greatereq(6,$product(7,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_31,axiom,
$lesseq(1,$product(5,a)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).
tff(c_1,plain,
$greatereq(6,$product(7,a)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
~ $less(0,a),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_3,plain,
$lesseq(1,$product(5,a)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_5,plain,
~ $less(a,1),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_7,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_6,c_5]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : ARI653_1 : TPTP v9.0.0. Released v6.3.0.
% 0.11/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.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 15:15:51 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.34/1.49 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.34/1.50
% 2.34/1.50 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------