%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : NUM891_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 : n021.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 07:57:27 PM UTC 2025
% Result : Theorem 2.11s 1.46s
% Output : CNFRefutation 2.28s
% 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 : 13 ( 10 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 13 ( 5 ~; 2 |; 4 &)
% ( 2 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 14 ( 0 atm; 5 fun; 5 num; 4 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 : 2 ( 0 usr; 1 con; 0-1 aty)
% Number of variables : 4 ( 2 !; 2 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_32,negated_conjecture,
~ ! [Xa: $int] :
( ( Xa = $uminus(Xa) )
<=> ( Xa = 0 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',uminus_equal) ).
tff(f_163,plain,
? [Xa: $int] :
( ( ( Xa = $uminus(Xa) )
& ( Xa != 0 ) )
| ( ( Xa = 0 )
& ( Xa != $uminus(Xa) ) ) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(f_166,plain,
! [Xa: $int] :
( ? [Xa: $int] :
( ( ( Xa = $uminus(Xa) )
& ( Xa != 0 ) )
| ( ( Xa = 0 )
& ( Xa != $uminus(Xa) ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_167,plain,
$false,
inference(equivalence,[status(thm)],[f_163,f_166]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM891_1 : TPTP v9.0.0. Released v5.0.0.
% 0.11/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 : n021.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 : Tue Apr 8 15:39:13 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.11/1.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.11/1.46
% 2.11/1.46 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------