TSTP Solution File: DAT012_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT012_1 : TPTP v8.1.2. 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 : n032.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 : Tue Aug 22 10:36:57 EDT 2023
% Result : Theorem 3.28s 1.81s
% Output : CNFRefutation 3.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of formulae : 62 ( 33 unt; 10 typ; 0 def)
% Number of atoms : 89 ( 39 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 53 ( 16 ~; 31 |; 3 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 177 ( 46 atm; 49 fun; 62 num; 20 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 9 usr; 10 con; 0-3 aty)
% Number of variables : 26 (; 26 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_5',type,
'#skF_5': $int ).
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_82,negated_conjecture,
~ ! [U: array,V: array,Wa: $int,Xa: $int] :
( ( ! [Ya: $int] :
( ( $lesseq(Wa,Ya)
& $lesseq(Ya,Xa) )
=> $greater(read(U,Ya),0) )
& ( V = write(U,$sum(Wa,2),$sum(read(U,$sum(Wa,1)),1)) ) )
=> ! [Za: $int] :
( ( $lesseq(Wa,Za)
& $lesseq(Za,Xa) )
=> $greater(read(V,Za),0) ) ),
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(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(c_19,plain,
write('#skF_1',$sum(2,'#skF_3'),$sum(1,read('#skF_1',$sum(1,'#skF_3')))) = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_89,plain,
read('#skF_1',$sum(1,'#skF_3')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_29,plain,
write('#skF_1',$sum(2,'#skF_3'),$sum(1,read('#skF_1',$sum(1,'#skF_3')))) = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_330,plain,
write('#skF_1',$sum(2,'#skF_3'),$sum(1,'#skE_2')) = '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_89,c_29]) ).
tff(c_27,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_356,plain,
read('#skF_2',$sum(2,'#skF_3')) = $sum(1,'#skE_2'),
inference(superposition,[status(thm),theory(equality)],[c_330,c_27]) ).
tff(c_5,plain,
~ $greater(read('#skF_2','#skF_5'),0),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_25,plain,
~ $less(0,read('#skF_2','#skF_5')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_38,plain,
read('#skF_2','#skF_5') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_25]) ).
tff(c_372,plain,
( ( $sum(1,'#skE_2') = '#skE_1' )
| ( '#skF_5' != $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_356,c_38]) ).
tff(c_374,plain,
( ( '#skE_2' = $sum($uminus(1),'#skE_1') )
| ( '#skF_5' != $sum(2,'#skF_3') ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_372]) ).
tff(c_382,plain,
'#skF_5' != $sum(2,'#skF_3'),
inference(splitLeft,[status(thm)],[c_374]) ).
tff(c_7,plain,
$lesseq('#skF_5','#skF_4'),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_21,plain,
~ $less('#skF_4','#skF_5'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_9,plain,
$lesseq('#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_20,plain,
~ $less('#skF_5','#skF_3'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_32,plain,
read('#skF_2','#skF_5') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_25]) ).
tff(c_31,plain,
~ $less(0,read('#skF_2','#skF_5')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_39,plain,
~ $less(0,'#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_32,c_31]) ).
tff(c_26,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_383,plain,
! [Z_66a: $int] :
( ( read('#skF_1',Z_66a) = read('#skF_2',Z_66a) )
| ( Z_66a = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_330,c_26]) ).
tff(c_13,plain,
! [Y_10a: $int] :
( $greater(read('#skF_1',Y_10a),0)
| ~ $lesseq('#skF_3',Y_10a)
| ~ $lesseq(Y_10a,'#skF_4') ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_15,plain,
! [Y_10a: $int] :
( $less(0,read('#skF_1',Y_10a))
| $less(Y_10a,'#skF_3')
| $less('#skF_4',Y_10a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_13]) ).
tff(c_451,plain,
! [Z_70a: $int] :
( $less(0,read('#skF_2',Z_70a))
| $less(Z_70a,'#skF_3')
| $less('#skF_4',Z_70a)
| ( Z_70a = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_383,c_15]) ).
tff(c_460,plain,
( $less(0,'#skE_1')
| $less('#skF_5','#skF_3')
| $less('#skF_4','#skF_5')
| ( '#skF_5' = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_451]) ).
tff(c_472,plain,
( $less('#skF_5','#skF_3')
| $less('#skF_4','#skF_5')
| ( '#skF_5' = $sum(2,'#skF_3') ) ),
inference(negUnitSimplification,[status(thm)],[c_39,c_460]) ).
tff(c_475,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_382,c_21,c_20,c_472]) ).
tff(c_478,plain,
'#skE_2' = $sum($uminus(1),'#skE_1'),
inference(splitRight,[status(thm)],[c_374]) ).
tff(c_125,plain,
write('#skF_1',$sum(2,'#skF_3'),$sum(1,'#skE_2')) = '#skF_2',
inference(demodulation,[status(thm),theory(equality)],[c_89,c_29]) ).
tff(c_205,plain,
read('#skF_2',$sum(2,'#skF_3')) = $sum(1,'#skE_2'),
inference(superposition,[status(thm),theory(equality)],[c_125,c_27]) ).
tff(c_239,plain,
( ( $sum(1,'#skE_2') = '#skE_1' )
| ( '#skF_5' != $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_205]) ).
tff(c_241,plain,
( ( '#skE_2' = $sum($uminus(1),'#skE_1') )
| ( '#skF_5' != $sum(2,'#skF_3') ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_239]) ).
tff(c_268,plain,
'#skF_5' != $sum(2,'#skF_3'),
inference(splitLeft,[status(thm)],[c_241]) ).
tff(c_149,plain,
! [Z_38a: $int] :
( ( read('#skF_1',Z_38a) = read('#skF_2',Z_38a) )
| ( Z_38a = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_125,c_26]) ).
tff(c_244,plain,
! [Z_43a: $int] :
( $less(0,read('#skF_2',Z_43a))
| $less(Z_43a,'#skF_3')
| $less('#skF_4',Z_43a)
| ( Z_43a = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_149,c_15]) ).
tff(c_253,plain,
( $less(0,'#skE_1')
| $less('#skF_5','#skF_3')
| $less('#skF_4','#skF_5')
| ( '#skF_5' = $sum(2,'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_38,c_244]) ).
tff(c_264,plain,
( $less('#skF_5','#skF_3')
| $less('#skF_4','#skF_5')
| ( '#skF_5' = $sum(2,'#skF_3') ) ),
inference(negUnitSimplification,[status(thm)],[c_39,c_253]) ).
tff(c_269,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_268,c_21,c_20,c_264]) ).
tff(c_273,plain,
'#skF_5' = $sum(2,'#skF_3'),
inference(splitRight,[status(thm)],[c_241]) ).
tff(c_290,plain,
~ $less('#skF_4',$sum(2,'#skF_3')),
inference(demodulation,[status(thm),theory(equality)],[c_273,c_21]) ).
tff(c_102,plain,
read('#skF_1',$sum(1,'#skF_3')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_115,plain,
( $less(0,'#skE_2')
| $less($sum(1,'#skF_3'),'#skF_3')
| $less('#skF_4',$sum(1,'#skF_3')) ),
inference(superposition,[status(thm),theory(equality)],[c_102,c_15]) ).
tff(c_117,plain,
( $less(0,'#skE_2')
| $less('#skF_4',$sum(1,'#skF_3')) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_115]) ).
tff(c_122,plain,
$less('#skF_4',$sum(1,'#skF_3')),
inference(splitLeft,[status(thm)],[c_117]) ).
tff(c_325,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_290,c_122]) ).
tff(c_328,plain,
$less(0,'#skE_2'),
inference(splitRight,[status(thm)],[c_117]) ).
tff(c_506,plain,
$less(0,$sum($uminus(1),'#skE_1')),
inference(demodulation,[status(thm),theory(equality)],[c_478,c_328]) ).
tff(c_520,plain,
$less(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_506]) ).
tff(c_539,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_520,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT012_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/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.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.12/0.31 % WCLimit : 300
% 0.12/0.31 % DateTime : Thu Aug 3 13:16:51 EDT 2023
% 0.12/0.32 % CPUTime :
% 3.28/1.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.28/1.81
% 3.28/1.81 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.28/1.85
% 3.28/1.85 Inference rules
% 3.28/1.85 ----------------------
% 3.28/1.85 #Ref : 0
% 3.28/1.85 #Sup : 58
% 3.28/1.85 #Fact : 0
% 3.28/1.85 #Define : 2
% 3.28/1.85 #Split : 5
% 3.28/1.85 #Chain : 0
% 3.28/1.85 #Close : 2
% 3.28/1.85
% 3.28/1.85 Ordering : LPO
% 3.28/1.85
% 3.28/1.85 Simplification rules
% 3.28/1.85 ----------------------
% 3.28/1.85 #Subsume : 4
% 3.28/1.85 #Demod : 21
% 3.28/1.85 #Tautology : 41
% 3.28/1.85 #SimpNegUnit : 5
% 3.28/1.85 #BackRed : 12
% 3.28/1.85
% 3.28/1.85 #Partial instantiations: 0
% 3.28/1.85 #Strategies tried : 1
% 3.28/1.85
% 3.28/1.85 Timing (in seconds)
% 3.28/1.85 ----------------------
% 3.28/1.85 Preprocessing : 0.53
% 3.28/1.85 Parsing : 0.26
% 3.28/1.85 CNF conversion : 0.03
% 3.28/1.85 Main loop : 0.39
% 3.28/1.85 Inferencing : 0.09
% 3.28/1.85 Reduction : 0.10
% 3.28/1.85 Demodulation : 0.07
% 3.28/1.85 BG Simplification : 0.05
% 3.28/1.85 Subsumption : 0.05
% 3.28/1.85 Abstraction : 0.02
% 3.28/1.85 MUC search : 0.01
% 3.28/1.85 Cooper : 0.05
% 3.28/1.85 Total : 0.97
% 3.28/1.85 Index Insertion : 0.00
% 3.28/1.85 Index Deletion : 0.00
% 3.28/1.85 Index Matching : 0.00
% 3.28/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------