%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT075_1 : TPTP v9.0.0. Released v6.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 : n015.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 06:08:03 PM UTC 2025
% Result : Theorem 8.43s 3.03s
% Output : CNFRefutation 9.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of formulae : 25 ( 8 unt; 0 typ; 0 def)
% Number of atoms : 54 ( 37 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 43 ( 14 ~; 25 |; 3 &)
% ( 0 <=>; 0 =>; 1 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 107 ( 16 atm; 15 fun; 39 num; 37 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 8 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 18 ( 13 usr; 2 con; 0-3 aty)
% Number of variables : 65 ( 65 !; 0 ?; 65 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_6 > #skF_3 > #skF_7 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
%Foreground operators:
tff(sorted,type,
sorted: ( array * $int ) > $o ).
tff(rev,type,
rev: ( array * $int ) > array ).
tff('#skF_5',type,
'#skF_5': ( array * $int * $int ) > $int ).
tff(write,type,
write: ( array * $int * $int ) > array ).
tff(init,type,
init: $int > array ).
tff('#skF_4',type,
'#skF_4': ( array * $int ) > $int ).
tff('#skF_8',type,
'#skF_8': ( array * array * $int ) > $int ).
tff('#skF_1',type,
'#skF_1': ( array * array ) > $int ).
tff('#skF_6',type,
'#skF_6': ( array * $int ) > $int ).
tff('#skF_3',type,
'#skF_3': ( array * $int ) > $int ).
tff(max,type,
max: ( array * $int ) > $int ).
tff(inRange,type,
inRange: ( array * $int * $int ) > $o ).
tff('#skF_7',type,
'#skF_7': ( array * $int ) > $int ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(distinct,type,
distinct: ( array * $int ) > $o ).
tff('#skF_2',type,
'#skF_2': ( array * $int * $int ) > $int ).
tff(f_31,axiom,
! [A: array,Ia: $int,Va: $int] : ( read(write(A,Ia,Va),Ia) = Va ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax1) ).
tff(f_118,axiom,
! [A: array,B: array,Na: $int] :
( ( rev(A,Na) = B )
<= ! [Ia: $int] :
( ( $greatereq(Ia,0)
& $greater(Na,Ia)
& ( read(B,Ia) = read(A,$difference(Na,$sum(Ia,1))) ) )
| ( ( $greater(0,Ia)
| $greatereq(Ia,Na) )
& ( read(B,Ia) = read(A,Ia) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',rev_n1_proper) ).
tff(f_122,negated_conjecture,
~ ~ ! [A: array,Na: $int] : ( read(rev(A,$sum(Na,1)),0) = read(A,Na) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c3) ).
tff(f_35,axiom,
! [A: array,Ia: $int,Ja: $int,Va: $int] :
( ( Ia = Ja )
| ( read(write(A,Ia,Va),Ja) = read(A,Ja) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax2) ).
tff(c_104,plain,
! [A_1: array,I_2a: $int,V_3a: $int] : ( read(write(A_1,I_2a,V_3a),I_2a) = V_3a ),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_66,plain,
! [A_41: array,B_42: array,N_43a: $int] :
( ~ $greatereq('#skF_8'(A_41,B_42,N_43a),N_43a)
| ( read(B_42,'#skF_8'(A_41,B_42,N_43a)) != read(A_41,'#skF_8'(A_41,B_42,N_43a)) )
| ( rev(A_41,N_43a) = B_42 ) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_78,plain,
! [A_41: array,B_42: array,N_43a: $int] :
( $less('#skF_8'(A_41,B_42,N_43a),N_43a)
| ( read(B_42,'#skF_8'(A_41,B_42,N_43a)) != read(A_41,'#skF_8'(A_41,B_42,N_43a)) )
| ( rev(A_41,N_43a) = B_42 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_66]) ).
tff(c_492,plain,
! [A_201: array,N_202a: $int] :
( $less('#skF_8'(A_201,A_201,N_202a),N_202a)
| ( rev(A_201,N_202a) = A_201 ) ),
inference(reflexivity,[status(thm),theory(equality)],[c_78]) ).
tff(c_76,plain,
! [A_45: array,N_46a: $int] : ( read(rev(A_45,$sum(1,N_46a)),0) = read(A_45,N_46a) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_535,plain,
! [A_213: array,N_214a: $int] :
( ( read(A_213,N_214a) = read(A_213,0) )
| $less('#skF_8'(A_213,A_213,$sum(1,N_214a)),$sum(1,N_214a)) ),
inference(superposition,[status(thm),theory(equality)],[c_492,c_76]) ).
tff(c_7802,plain,
! [A_1923: array,I_1924a: $int,V_1920a: $int] :
( ( read(write(A_1923,I_1924a,V_1920a),0) = V_1920a )
| $less('#skF_8'(write(A_1923,I_1924a,V_1920a),write(A_1923,I_1924a,V_1920a),$sum(1,I_1924a)),$sum(1,I_1924a)) ),
inference(superposition,[status(thm),theory(equality)],[c_104,c_535]) ).
tff(c_103,plain,
! [A_4: array,I_5a: $int,V_7a: $int,J_6a: $int] :
( ( read(write(A_4,I_5a,V_7a),J_6a) = read(A_4,J_6a) )
| ( J_6a = I_5a ) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_8459,plain,
! [A_2081: array,V_2080a: $int,I_2083a: $int] :
( ( read(A_2081,0) = V_2080a )
| ( I_2083a = 0 )
| $less('#skF_8'(write(A_2081,I_2083a,V_2080a),write(A_2081,I_2083a,V_2080a),$sum(1,I_2083a)),$sum(1,I_2083a)) ),
inference(superposition,[status(thm),theory(equality)],[c_7802,c_103]) ).
tff(c_69,plain,
! [A_41: array,B_42: array,N_43a: $int] :
( ~ $greater(0,'#skF_8'(A_41,B_42,N_43a))
| ( read(B_42,'#skF_8'(A_41,B_42,N_43a)) != read(A_41,'#skF_8'(A_41,B_42,N_43a)) )
| ( rev(A_41,N_43a) = B_42 ) ),
inference(cnfTransformation,[status(thm)],[f_118]) ).
tff(c_77,plain,
! [A_41: array,B_42: array,N_43a: $int] :
( ~ $less('#skF_8'(A_41,B_42,N_43a),0)
| ( read(B_42,'#skF_8'(A_41,B_42,N_43a)) != read(A_41,'#skF_8'(A_41,B_42,N_43a)) )
| ( rev(A_41,N_43a) = B_42 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_69]) ).
tff(c_770,plain,
! [A_290: array,N_291a: $int] :
( ~ $less('#skF_8'(A_290,A_290,N_291a),0)
| ( rev(A_290,N_291a) = A_290 ) ),
inference(reflexivity,[status(thm),theory(equality)],[c_77]) ).
tff(c_823,plain,
! [A_297: array,N_298a: $int] :
( ( read(A_297,N_298a) = read(A_297,0) )
| ~ $less('#skF_8'(A_297,A_297,$sum(1,N_298a)),0) ),
inference(superposition,[status(thm),theory(equality)],[c_770,c_76]) ).
tff(c_1358,plain,
! [A_431: array,I_432a: $int,V_433a: $int] :
( ( read(write(A_431,I_432a,V_433a),0) = V_433a )
| ~ $less('#skF_8'(write(A_431,I_432a,V_433a),write(A_431,I_432a,V_433a),$sum(1,I_432a)),0) ),
inference(superposition,[status(thm),theory(equality)],[c_104,c_823]) ).
tff(c_1456,plain,
! [A_431: array,V_433a: $int,I_432a: $int] :
( ( read(A_431,0) = V_433a )
| ( I_432a = 0 )
| ~ $less('#skF_8'(write(A_431,I_432a,V_433a),write(A_431,I_432a,V_433a),$sum(1,I_432a)),0) ),
inference(superposition,[status(thm),theory(equality)],[c_1358,c_103]) ).
tff(c_8494,plain,
! [A_2081: array,V_2080a: $int,I_2083a: $int] :
( ( read(A_2081,0) = V_2080a )
| ( I_2083a = 0 )
| ( $sum(1,I_2083a) != 0 ) ),
inference(resolution,[status(thm)],[c_8459,c_1456]) ).
tff(c_8496,plain,
! [A_2081: array,V_2080a: $int] :
( ( read(A_2081,0) = V_2080a )
| ( $uminus(1) = 0 ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_8494]) ).
tff(c_8616,plain,
! [A_2139: array,V_2140a: $int] : ( read(A_2139,0) = V_2140a ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_8496]) ).
tff(c_8498,plain,
! [A_2081: array,V_2080a: $int] : ( read(A_2081,0) = V_2080a ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_8496]) ).
tff(c_8765,plain,
! [V_2140a: $int,V_2080a: $int] : ( V_2140a = V_2080a ),
inference(superposition,[status(thm),theory(equality)],[c_8616,c_8498]) ).
tff(c_8874,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_8765]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06 % Problem : DAT075_1 : TPTP v9.0.0. Released v6.1.0.
% 0.06/0.07 % 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.06/0.25 % Computer : n015.cluster.edu
% 0.06/0.25 % Model : x86_64 x86_64
% 0.06/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.25 % Memory : 8042.1875MB
% 0.06/0.25 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.25 % CPULimit : 300
% 0.06/0.25 % WCLimit : 300
% 0.06/0.25 % DateTime : Mon Apr 7 18:17:20 EDT 2025
% 0.06/0.25 % CPUTime :
% 8.43/3.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.43/3.04
% 8.43/3.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------