%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI085_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/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 : n019.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:39:38 PM UTC 2025
% Result : Theorem 2.64s 1.68s
% Output : CNFRefutation 2.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 1
% Syntax : Number of formulae : 6 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 10 ( 3 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 1 |; 2 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 23 ( 0 atm; 6 fun; 12 num; 5 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 : 7 ( 0 usr; 5 con; 0-2 aty)
% Number of variables : 5 ( 3 !; 2 ?; 5 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(p,type,
p: ( $int * $int ) > $o ).
tff(f_37,negated_conjecture,
~ ( ( p(3,4)
& ~ p(1,6) )
=> ? [Xa: $int,Ya: $int] :
( p(Xa,Ya)
& ( $sum(Xa,Ya) = 7 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_X_Y_7_predicate) ).
tff(c_8,plain,
p(3,4),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_1,plain,
! [X_1a: $int,Y_2a: $int] :
( ~ p(X_1a,Y_2a)
| ( $sum(X_1a,Y_2a) != 7 ) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_16,plain,
! [Y_6a: $int] : ~ p($sum(7,$uminus(Y_6a)),Y_6a),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_20,plain,
$sum(7,$uminus(4)) != 3,
inference(resolution,[status(thm)],[c_8,c_16]) ).
tff(c_23,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : ARI085_1 : TPTP v9.0.0. Released v5.0.0.
% 0.06/0.12 % 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 : n019.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:03:17 EDT 2025
% 0.13/0.33 % CPUTime :
% 2.64/1.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.78/1.68
% 2.78/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------