%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI594_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 : n002.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:39 PM UTC 2025
% Result : Theorem 2.59s 1.58s
% Output : CNFRefutation 2.59s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 2 unt; 0 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 12 ( 4 ~; 5 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 30 ( 8 atm; 4 fun; 12 num; 6 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 6 ( 5 !; 1 ?; 6 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_37,negated_conjecture,
~ ( ! [Za: $int] :
( ( $lesseq(5,Za)
& $lesseq(Za,7) )
=> p(Za) )
=> ? [Xa: $int] : p($product(3,Xa)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exists_X_in_5_to_7_div_3) ).
tff(c_3,plain,
! [Z_1a: $int] :
( p(Z_1a)
| ~ $lesseq(5,Z_1a)
| ~ $lesseq(Z_1a,7) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_13,plain,
! [Z_7a: $int] :
( p(Z_7a)
| $less(Z_7a,5)
| $less(7,Z_7a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_9,plain,
! [X_2a: $int] : ~ p($product(3,X_2a)),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_18,plain,
! [X_2a: $int] :
( $less($product(3,X_2a),5)
| $less(7,$product(3,X_2a)) ),
inference(resolution,[status(thm)],[c_13,c_9]) ).
tff(c_20,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI594_1 : TPTP v9.0.0. Released v5.1.0.
% 0.03/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.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Mon Apr 7 15:14:46 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.59/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.59/1.59
% 2.59/1.59 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------