%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI488_1 : TPTP v9.0.0. Released v5.0.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 : n031.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:24 PM UTC 2025
% Result : Theorem 2.43s 1.54s
% Output : CNFRefutation 2.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 4 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 16 ( 10 ~; 5 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 51 ( 7 atm; 16 fun; 22 num; 6 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 : 7 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 4 !; 2 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_32,negated_conjecture,
~ ? [Xa: $real,Ya: $real] :
( ( $sum(Xa,Ya) = 36/5 )
& ( $difference(Xa,Ya) = 0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',real_combined_problem_3) ).
tff(c_1,plain,
! [X_1a: $real,Y_2a: $real] :
( ( $sum(X_1a,Y_2a) != 36/5 )
| ( $difference(X_1a,Y_2a) != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_2,plain,
! [Y_2a: $real] :
( ~ $lesseq(0,0)
| ~ $lesseq(0,$sum($product($uminus(2),Y_2a),36/5))
| ~ $lesseq(0,$sum($product(2,Y_2a),$uminus(36/5)))
| ~ $lesseq(0,0) ),
inference(quantifierElimination,[status(thm),theory('LFA')],[c_1]) ).
tff(c_3,plain,
! [Y_2a: $real] :
( ~ $lesseq(0,$sum($product($uminus(2),Y_2a),36/5))
| ~ $lesseq(0,$sum($product(2,Y_2a),$uminus(36/5))) ),
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_2]) ).
tff(c_4,plain,
~ $lesseq(0,0),
inference(quantifierElimination,[status(thm),theory('LFA')],[c_3]) ).
tff(c_5,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LFA')],[c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : ARI488_1 : TPTP v9.0.0. Released v5.0.0.
% 0.12/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.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Mon Apr 7 15:11:37 EDT 2025
% 0.13/0.35 % CPUTime :
% 2.43/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.43/1.54
% 2.43/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------