%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI593_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/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 : n018.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.53s 1.55s
% Output : CNFRefutation 2.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 1
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 8 ( 1 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 6 ( 3 ~; 0 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 14 ( 0 atm; 3 fun; 8 num; 3 var)
% Number of types : 2 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 0 usr; 4 con; 0-2 aty)
% Number of variables : 3 ( 2 !; 1 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: $int > $o ).
tff(f_36,negated_conjecture,
~ ( ( p(5)
& p(6)
& p(7) )
=> ? [Xa: $int] : p($product(3,Xa)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_in_5_6_7_div_3) ).
tff(c_10,plain,
p(6),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_18,plain,
! [X_5a: $int] : ~ p($product(3,X_5a)),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_30,plain,
! [X_5a: $int] : ( $product(3,X_5a) != 6 ),
inference(resolution,[status(thm)],[c_10,c_18]) ).
tff(c_34,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_30]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : ARI593_1 : TPTP v9.0.0. Released v5.1.0.
% 0.10/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.12/0.33 % Computer : n018.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.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon Apr 7 15:14:02 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.53/1.55 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.53/1.55
% 2.53/1.55 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------