%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI579_3 : 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 : n005.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:37 PM UTC 2025
% Result : Theorem 2.38s 1.51s
% Output : CNFRefutation 2.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 0 equ)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 12 ( 7 ~; 3 |; 2 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 39 ( 9 atm; 9 fun; 16 num; 5 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 : 10 ( 0 usr; 7 con; 0-2 aty)
% Number of variables : 5 ( 3 !; 2 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_34,negated_conjecture,
~ ? [Xa: $real,Ya: $real] :
( $less(0,Xa)
& $less(0,Ya)
& $less($sum($product(3,Xa),$product(4,Ya)),6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ineq_sys_rat_solvable) ).
tff(c_1,plain,
! [X_1a: $real,Y_2a: $real] :
( ~ $less(0,X_1a)
| ~ $less(0,Y_2a)
| ~ $less($sum($product(3,X_1a),$product(4,Y_2a)),6) ),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_2,plain,
! [Y_2a: $real] :
( ~ $less(0,$sum($product($uminus(4/3),Y_2a),2))
| ~ $less(0,Y_2a) ),
inference(quantifierElimination,[status(thm),theory('LFA')],[c_1]) ).
tff(c_3,plain,
~ $less(0,3/2),
inference(quantifierElimination,[status(thm),theory('LFA')],[c_2]) ).
tff(c_4,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_3]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ARI579_3 : TPTP v9.0.0. Released v5.1.0.
% 0.12/0.13 % 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.14/0.34 % Computer : n005.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:13:42 EDT 2025
% 0.14/0.35 % CPUTime :
% 2.38/1.51 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.38/1.52
% 2.38/1.52 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------