%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT018_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 : n016.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:55 PM UTC 2025
% Result : Theorem 3.49s 2.02s
% Output : CNFRefutation 3.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of formulae : 27 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 46 ( 14 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 25 ( 6 ~; 14 |; 4 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 125 ( 29 atm; 31 fun; 49 num; 16 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 : 11 ( 6 usr; 8 con; 0-3 aty)
% Number of variables : 22 ( 21 !; 1 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skF_4',type,
'#skF_4': $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_79,negated_conjecture,
~ ! [U: array,V: array,Wa: $int,Xa: $int] :
( ( ( U = write(write(write(V,Wa,3),$sum(Wa,2),2),$sum(Wa,4),1) )
& $lesseq(Wa,Xa)
& $lesseq(Xa,$sum(Wa,3)) )
=> ? [Ya: $int] :
( $lesseq(Xa,Ya)
& $lesseq(Ya,$sum(Xa,3))
& $lesseq(read(U,Ya),3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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/sandbox/benchmark/Axioms/DAT001_0.ax',ax2) ).
tff(f_59,axiom,
! [U: array,Va: $int,Wa: $int] : ( read(write(U,Va,Wa),Va) = Wa ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT001_0.ax',ax1) ).
tff(c_57,plain,
write(write(write('#skF_2','#skF_3',3),$sum(2,'#skF_3'),2),$sum(4,'#skF_3'),1) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_19,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_107,plain,
! [Z_33a: $int] :
( ( read(write(write('#skF_2','#skF_3',3),$sum(2,'#skF_3'),2),Z_33a) = read('#skF_1',Z_33a) )
| ( Z_33a = $sum(4,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_57,c_19]) ).
tff(c_20,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_135,plain,
( ( read('#skF_1',$sum(2,'#skF_3')) = 2 )
| ( $sum(4,'#skF_3') = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_107,c_20]) ).
tff(c_151,plain,
read('#skF_1',$sum(2,'#skF_3')) = 2,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_135]) ).
tff(c_4,plain,
! [Y_9a: $int] :
( ~ $lesseq(read('#skF_1',Y_9a),3)
| ~ $lesseq('#skF_4',Y_9a)
| ~ $lesseq(Y_9a,$sum('#skF_4',3)) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_18,plain,
! [Y_9a: $int] :
( $less(3,read('#skF_1',Y_9a))
| $less(Y_9a,'#skF_4')
| $less($sum(3,'#skF_4'),Y_9a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_4]) ).
tff(c_173,plain,
( $less(3,2)
| $less($sum(2,'#skF_3'),'#skF_4')
| $less($sum(3,'#skF_4'),$sum(2,'#skF_3')) ),
inference(superposition,[status(thm),theory(equality)],[c_151,c_18]) ).
tff(c_175,plain,
( $less($sum(2,'#skF_3'),'#skF_4')
| $less($sum(1,'#skF_4'),'#skF_3') ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_173]) ).
tff(c_185,plain,
$less($sum(1,'#skF_4'),'#skF_3'),
inference(splitLeft,[status(thm)],[c_175]) ).
tff(c_8,plain,
$lesseq('#skF_3','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_16,plain,
~ $less('#skF_4','#skF_3'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_8]) ).
tff(c_186,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_185,c_16]) ).
tff(c_189,plain,
$less($sum(2,'#skF_3'),'#skF_4'),
inference(splitRight,[status(thm)],[c_175]) ).
tff(c_84,plain,
read('#skF_1',$sum(4,'#skF_3')) = 1,
inference(superposition,[status(thm),theory(equality)],[c_57,c_20]) ).
tff(c_97,plain,
( $less(3,1)
| $less($sum(4,'#skF_3'),'#skF_4')
| $less($sum(3,'#skF_4'),$sum(4,'#skF_3')) ),
inference(superposition,[status(thm),theory(equality)],[c_84,c_18]) ).
tff(c_99,plain,
( $less($sum(4,'#skF_3'),'#skF_4')
| $less('#skF_4',$sum(1,'#skF_3')) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_97]) ).
tff(c_104,plain,
$less('#skF_4',$sum(1,'#skF_3')),
inference(splitLeft,[status(thm)],[c_99]) ).
tff(c_191,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_189,c_104]) ).
tff(c_194,plain,
$less($sum(4,'#skF_3'),'#skF_4'),
inference(splitRight,[status(thm)],[c_99]) ).
tff(c_6,plain,
$lesseq('#skF_4',$sum('#skF_3',3)),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_17,plain,
~ $less($sum(3,'#skF_3'),'#skF_4'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_238,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_194,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT018_1 : TPTP v9.0.0. Released v5.0.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 : n016.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:38 EDT 2025
% 0.13/0.34 % CPUTime :
% 3.49/2.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.49/2.03
% 3.49/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------