%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT005_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/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 : n010.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:07:53 PM UTC 2025
% Result : Theorem 3.51s 1.96s
% Output : CNFRefutation 3.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 52 ( 33 unt; 0 typ; 0 def)
% Number of atoms : 84 ( 56 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 45 ( 13 ~; 28 |; 3 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 157 ( 22 atm; 0 fun; 118 num; 17 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 6 usr; 11 con; 0-3 aty)
% Number of variables : 23 ( 23 !; 0 ?; 23 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_3',type,
'#skF_3': $int ).
%Foreground operators:
tff(write,type,
write: ( array * $int * $int ) > array ).
tff('#skF_1',type,
'#skF_1': array ).
tff('#skF_2',type,
'#skF_2': array ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(f_63,axiom,
! [X: array,Ya: $int,Za: $int,X1a: $int] :
( ( Ya = Za )
| ( read(write(X,Ya,X1a),Za) = read(X,Za) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax2) ).
tff(f_76,negated_conjecture,
~ ! [U: array,V: array,Wa: $int] :
( ( ( U = write(write(write(write(V,3,33),4,444),5,55),4,44) )
& $lesseq(3,Wa)
& $lesseq(Wa,4) )
=> ( $lesseq(33,read(U,Wa))
& $lesseq(read(U,Wa),44) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(f_59,axiom,
! [U: array,Va: $int,Wa: $int] : ( read(write(U,Va,Wa),Va) = Wa ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT001_0.ax',ax1) ).
tff(c_20,plain,
! [X_4: array,Y_5a: $int,X1_7a: $int,Z_6a: $int] :
( ( read(write(X_4,Y_5a,X1_7a),Z_6a) = read(X_4,Z_6a) )
| ( Z_6a = Y_5a ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_13,plain,
write(write(write(write('#skF_2',3,33),4,444),5,55),4,44) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_342,plain,
! [Z_26a: $int] :
( ( read(write(write(write('#skF_2',3,33),4,444),5,55),Z_26a) = read('#skF_1',Z_26a) )
| ( Z_26a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_13,c_20]) ).
tff(c_393,plain,
! [Z_27a: $int] :
( ( read(write(write('#skF_2',3,33),4,444),Z_27a) = read('#skF_1',Z_27a) )
| ( Z_27a = 4 )
| ( Z_27a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_342]) ).
tff(c_427,plain,
! [Z_28a: $int] :
( ( read(write('#skF_2',3,33),Z_28a) = read('#skF_1',Z_28a) )
| ( Z_28a = 4 )
| ( Z_28a = 4 )
| ( Z_28a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_393,c_20]) ).
tff(c_21,plain,
! [U_1: array,V_2a: $int,W_3a: $int] : ( read(write(U_1,V_2a,W_3a),V_2a) = W_3a ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_437,plain,
( ( read('#skF_1',3) = 33 )
| ( 4 = 3 )
| ( 4 = 3 )
| ( 5 = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_427,c_21]) ).
tff(c_453,plain,
read('#skF_1',3) = 33,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_437]) ).
tff(c_5,plain,
( ~ $lesseq(read('#skF_1','#skF_3'),44)
| ~ $lesseq(33,read('#skF_1','#skF_3')) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_19,plain,
( $less(44,read('#skF_1','#skF_3'))
| $less(read('#skF_1','#skF_3'),33) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_63,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_469,plain,
( ( '#skE_1' = 33 )
| ( '#skF_3' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_453,c_63]) ).
tff(c_475,plain,
'#skF_3' != 3,
inference(splitLeft,[status(thm)],[c_469]) ).
tff(c_326,plain,
read('#skF_1',4) = 44,
inference(superposition,[status(thm),theory(equality)],[c_13,c_21]) ).
tff(c_338,plain,
( ( '#skE_1' = 44 )
| ( '#skF_3' != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_326,c_63]) ).
tff(c_375,plain,
'#skF_3' != 4,
inference(splitLeft,[status(thm)],[c_338]) ).
tff(c_7,plain,
$lesseq('#skF_3',4),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_15,plain,
~ $less(4,'#skF_3'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_9,plain,
$lesseq(3,'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_14,plain,
~ $less('#skF_3',3),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_478,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_475,c_375,c_15,c_14]) ).
tff(c_481,plain,
'#skE_1' = 33,
inference(splitRight,[status(thm)],[c_469]) ).
tff(c_110,plain,
! [Z_22a: $int] :
( ( read(write(write(write('#skF_2',3,33),4,444),5,55),Z_22a) = read('#skF_1',Z_22a) )
| ( Z_22a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_13,c_20]) ).
tff(c_159,plain,
! [Z_23a: $int] :
( ( read(write(write('#skF_2',3,33),4,444),Z_23a) = read('#skF_1',Z_23a) )
| ( Z_23a = 4 )
| ( Z_23a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_20,c_110]) ).
tff(c_193,plain,
! [Z_24a: $int] :
( ( read(write('#skF_2',3,33),Z_24a) = read('#skF_1',Z_24a) )
| ( Z_24a = 4 )
| ( Z_24a = 4 )
| ( Z_24a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_159,c_20]) ).
tff(c_203,plain,
( ( read('#skF_1',3) = 33 )
| ( 4 = 3 )
| ( 4 = 3 )
| ( 5 = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_193,c_21]) ).
tff(c_219,plain,
read('#skF_1',3) = 33,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_203]) ).
tff(c_235,plain,
( ( '#skE_1' = 33 )
| ( '#skF_3' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_219,c_63]) ).
tff(c_241,plain,
'#skF_3' != 3,
inference(splitLeft,[status(thm)],[c_235]) ).
tff(c_92,plain,
read('#skF_1',4) = 44,
inference(superposition,[status(thm),theory(equality)],[c_13,c_21]) ).
tff(c_104,plain,
( ( '#skE_1' = 44 )
| ( '#skF_3' != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_92,c_63]) ).
tff(c_109,plain,
'#skF_3' != 4,
inference(splitLeft,[status(thm)],[c_104]) ).
tff(c_242,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_241,c_109,c_15,c_14]) ).
tff(c_245,plain,
'#skE_1' = 33,
inference(splitRight,[status(thm)],[c_235]) ).
tff(c_57,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_22,plain,
( $less(44,read('#skF_1','#skF_3'))
| $less(read('#skF_1','#skF_3'),33) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_64,plain,
( $less(44,'#skE_1')
| $less('#skE_1',33) ),
inference(demodulation,[status(thm),theory(equality)],[c_57,c_57,c_22]) ).
tff(c_81,plain,
$less('#skE_1',33),
inference(splitLeft,[status(thm)],[c_64]) ).
tff(c_258,plain,
$less(33,33),
inference(demodulation,[status(thm),theory(equality)],[c_245,c_81]) ).
tff(c_261,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_258]) ).
tff(c_264,plain,
'#skE_1' = 44,
inference(splitRight,[status(thm)],[c_104]) ).
tff(c_308,plain,
$less(44,33),
inference(demodulation,[status(thm),theory(equality)],[c_264,c_81]) ).
tff(c_311,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_308]) ).
tff(c_314,plain,
$less(44,'#skE_1'),
inference(splitRight,[status(thm)],[c_64]) ).
tff(c_494,plain,
$less(44,33),
inference(demodulation,[status(thm),theory(equality)],[c_481,c_314]) ).
tff(c_497,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_494]) ).
tff(c_500,plain,
'#skE_1' = 44,
inference(splitRight,[status(thm)],[c_338]) ).
tff(c_512,plain,
$less(44,44),
inference(demodulation,[status(thm),theory(equality)],[c_500,c_314]) ).
tff(c_515,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_512]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : DAT005_1 : TPTP v9.0.0. Released v5.0.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.13/0.34 % Computer : n010.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 18:15:17 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.51/1.96 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.51/1.96
% 3.51/1.96 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------