%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI589_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 : n023.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:38 PM UTC 2025
% Result : Theorem 2.06s 1.43s
% Output : CNFRefutation 2.27s
% 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 : 9 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 7 ( 3 ~; 2 |; 1 &)
% ( 1 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number arithmetic : 12 ( 0 atm; 0 fun; 0 num; 12 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 : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 12 ( 7 !; 5 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_35,negated_conjecture,
~ ! [Ya: $int,Za: $int] :
? [Xa: $int] :
( ( Ya != Xa )
& ( Za != Xa ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',exists_X_noteq_Y_Z) ).
tff(f_160,plain,
? [Ya: $int,Za: $int] :
! [Xa: $int] :
( ( Ya = Xa )
| ( Za = Xa ) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(f_163,plain,
! [Ya: $int,Za: $int,Xa: $int] :
( ? [Ya: $int,Za: $int] :
! [Xa: $int] :
( ( Ya = Xa )
| ( Za = Xa ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_164,plain,
$false,
inference(equivalence,[status(thm)],[f_160,f_163]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_164]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : ARI589_1 : TPTP v9.0.0. Released v5.1.0.
% 0.03/0.12 % 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 : n023.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:13:54 EDT 2025
% 0.12/0.33 % CPUTime :
% 2.06/1.43 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.06/1.44
% 2.06/1.44 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------