%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI690_1 : TPTP v9.0.0. Released v6.3.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 : n013.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:50 PM UTC 2025
% Result : Theorem 2.34s 1.47s
% Output : CNFRefutation 2.34s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of formulae : 9 ( 9 unt; 0 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 14 ( 0 atm; 7 fun; 7 num; 0 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 : 7 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 0 ( 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(c,type,
c: $int ).
tff(d,type,
d: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_33,negated_conjecture,
a != $product(2,c),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_31,axiom,
$difference(c,d) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq2) ).
tff(f_30,axiom,
$product(2,d) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq1) ).
tff(c_5,plain,
$product(2,c) != a,
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
$difference(c,d) = 0,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_6,plain,
d = c,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_2]) ).
tff(c_7,plain,
$product(2,d) = a,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_8,plain,
$product(2,c) = a,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_7]) ).
tff(c_9,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_5,c_8]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ARI690_1 : TPTP v9.0.0. Released v6.3.0.
% 0.07/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.14/0.32 % Computer : n013.cluster.edu
% 0.14/0.32 % Model : x86_64 x86_64
% 0.14/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.32 % Memory : 8042.1875MB
% 0.14/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.32 % CPULimit : 300
% 0.14/0.32 % WCLimit : 300
% 0.14/0.32 % DateTime : Mon Apr 7 15:16:47 EDT 2025
% 0.14/0.32 % CPUTime :
% 2.34/1.47 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.34/1.48
% 2.34/1.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------