%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI587_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 : 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:38 PM UTC 2025
% Result : Theorem 2.38s 1.57s
% Output : CNFRefutation 2.57s
% 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 : 12 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 5 ~; 2 |; 3 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 34 ( 9 atm; 6 fun; 9 num; 10 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 : 5 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 10 ( 7 !; 3 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_35,negated_conjecture,
~ ! [Xa: $int] :
( $less(1,Xa)
=> ? [Ya: $int] :
( $less($sum(Xa,2),Ya)
& $less(Ya,$product(Xa,3)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_Y_between_Xplus2_and_3X) ).
tff(f_250,plain,
! [Ya: $int] :
? [Xa: $int] :
( $less(1,Xa)
& ! [Ya: $int] :
( ~ $less($sum(Xa,2),Ya)
| ~ $less(Ya,$product(Xa,3)) ) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(f_253,plain,
! [Ya: $int,Xa: $int] :
( ! [Ya: $int] :
? [Xa: $int] :
( $less(1,Xa)
& ! [Ya: $int] :
( ~ $less($sum(Xa,2),Ya)
| ~ $less(Ya,$product(Xa,3)) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_254,plain,
$false,
inference(equivalence,[status(thm)],[f_250,f_253]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_254]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI587_1 : TPTP v9.0.0. Released v5.1.0.
% 0.07/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.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:14:07 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.38/1.57 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.57/1.58
% 2.57/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------