%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : ARI734_1 : TPTP v9.0.0. Released v6.4.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 : n022.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:54 PM UTC 2025
% Result : Theorem 2.45s 1.56s
% Output : CNFRefutation 2.56s
% 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 : 27 ( 21 equ)
% Maximal formula atoms : 9 ( 5 avg)
% Number of connectives : 36 ( 14 ~; 8 |; 10 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 9 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 61 ( 3 atm; 12 fun; 24 num; 22 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 0 usr; 3 con; 0-2 aty)
% Number of variables : 22 ( 17 !; 5 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(f_49,negated_conjecture,
~ ! [Ia: $int] :
( $greatereq(Ia,0)
=> ? [Res_1a: $int] :
( ? [Res1_2a: $int] :
( ? [I_3a: $int] :
( ( I_3a = $difference(Ia,1) )
& ( Res1_2a = $product(2,I_3a) ) )
& ( ( Ia = 0 )
=> ( Res_1a = 0 ) )
& ( ( Ia != 0 )
=> ( Res_1a = $sum(Res1_2a,2) ) ) )
& ( Res_1a = $product(2,Ia) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',formula) ).
tff(f_678,plain,
! [Res_1a: $int,Res1_2a: $int,I_3a: $int] :
? [Ia: $int] :
( $greatereq(Ia,0)
& ! [Res_1a: $int] :
( ! [Res1_2a: $int] :
( ! [I_3a: $int] :
( ( I_3a != $difference(Ia,1) )
| ( Res1_2a != $product(2,I_3a) ) )
| ( ( Ia = 0 )
& ( Res_1a != 0 ) )
| ( ( Ia != 0 )
& ( Res_1a != $sum(Res1_2a,2) ) ) )
| ( Res_1a != $product(2,Ia) ) ) ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(f_681,plain,
! [Res_1a: $int,Res1_2a: $int,I_3a: $int,Ia: $int] :
( ! [Res_1a: $int,Res1_2a: $int,I_3a: $int] :
? [Ia: $int] :
( $greatereq(Ia,0)
& ! [Res_1a: $int] :
( ! [Res1_2a: $int] :
( ! [I_3a: $int] :
( ( I_3a != $difference(Ia,1) )
| ( Res1_2a != $product(2,I_3a) ) )
| ( ( Ia = 0 )
& ( Res_1a != 0 ) )
| ( ( Ia != 0 )
& ( Res_1a != $sum(Res1_2a,2) ) ) )
| ( Res_1a != $product(2,Ia) ) ) )
<=> $false ),
inference(theorem,[status(thm),theory('LIA')],[]) ).
tff(f_682,plain,
$false,
inference(equivalence,[status(thm)],[f_678,f_681]) ).
tff(c_2,plain,
$false,
inference(cnfTransformation,[status(thm)],[f_682]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ARI734_1 : TPTP v9.0.0. Released v6.4.0.
% 0.06/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 : n022.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 : Mon Apr 7 15:19:06 EDT 2025
% 0.13/0.34 % CPUTime :
% 2.45/1.56 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.45/1.56
% 2.45/1.56 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------