%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI580_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 : n024.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.60s
% Output : CNFRefutation 2.62s
% 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 : 9 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 9 ( 5 ~; 2 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 20 ( 6 atm; 3 fun; 3 num; 8 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 : 2 ( 0 usr; 1 con; 0-2 aty)
% Number of variables : 8 ( 5 !; 3 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_33,negated_conjecture,
~ ! [Xa: $int] :
? [Ya: $int] :
( $less(Xa,Ya)
& $less(Ya,$sum(Xa,3)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mix_quant_ineq_sys_solvable_1) ).
tff(f_171,plain,
? [Xa: $int] :
! [Ya: $int] :
( ~ $less(Xa,Ya)
| ~ $less(Ya,$sum(Xa,3)) ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(f_174,plain,
! [Xa: $int,Ya: $int] :
( ? [Xa: $int] :
! [Ya: $int] :
( ~ $less(Xa,Ya)
| ~ $less(Ya,$sum(Xa,3)) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_175,plain,
$false,
inference(equivalence,[status(thm)],[f_171,f_174]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_175]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.12 % Problem : ARI580_1 : TPTP v9.0.0. Released v5.1.0.
% 0.09/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.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % 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:13:51 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.38/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.62/1.61
% 2.62/1.61 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------