TSTP Solution File: DAT017_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT017_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 : n028.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:58 EDT 2023
% Result : Theorem 3.39s 1.97s
% Output : CNFRefutation 3.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 14
% Syntax : Number of formulae : 58 ( 31 unt; 11 typ; 0 def)
% Number of atoms : 64 ( 62 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 11 ~; 15 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 78 ( 0 atm; 14 fun; 42 num; 22 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 10 usr; 10 con; 0-3 aty)
% Number of variables : 28 (; 27 !; 1 ?; 28 :)
% 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 ).
tff('#skE_3',type,
'#skE_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_75,negated_conjecture,
~ ! [U: array,V: array,Wa: $int,Xa: $int,Ya: $int] :
( ( ( read(V,Wa) != read(V,Xa) )
& ( U = write(write(write(V,Xa,0),Ya,$sum(read(V,Ya),1)),Wa,0) ) )
=> ? [Za: $int] : ( read(U,Za) != read(V,Za) ) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/benchmark/Axioms/DAT001_0.ax',ax1) ).
tff(c_13,plain,
read('#skF_2','#skF_4') != read('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_48,plain,
read('#skF_2','#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_47,plain,
read('#skF_2','#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_21,plain,
read('#skF_2','#skF_4') != read('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_59,plain,
'#skE_2' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_48,c_47,c_21]) ).
tff(c_77,plain,
read('#skF_2','#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_58,plain,
read('#skF_2','#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_83,plain,
( ( '#skE_2' = '#skE_1' )
| ( '#skF_4' != '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_77,c_58]) ).
tff(c_96,plain,
'#skF_4' != '#skF_3',
inference(negUnitSimplification,[status(thm)],[c_59,c_83]) ).
tff(c_17,plain,
write(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,read('#skF_2','#skF_5'))),'#skF_3',0) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_139,plain,
read('#skF_2','#skF_5') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_171,plain,
( ( '#skE_3' = '#skE_2' )
| ( '#skF_5' != '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_58,c_139]) ).
tff(c_175,plain,
'#skF_5' != '#skF_3',
inference(splitLeft,[status(thm)],[c_171]) ).
tff(c_138,plain,
read('#skF_2','#skF_5') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_18,plain,
! [Z_9a: $int] : ( read('#skF_1',Z_9a) = read('#skF_2',Z_9a) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_126,plain,
read('#skF_2','#skF_5') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_22,plain,
write(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,read('#skF_2','#skF_5'))),'#skF_3',0) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_178,plain,
write(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,'#skE_3')),'#skF_3',0) = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_126,c_22]) ).
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_184,plain,
! [Z_6a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,'#skE_3')),Z_6a) = read('#skF_1',Z_6a) )
| ( Z_6a = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_178,c_19]) ).
tff(c_294,plain,
! [Z_67a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,'#skE_3')),Z_67a) = read('#skF_2',Z_67a) )
| ( Z_67a = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_184]) ).
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_304,plain,
( ( read('#skF_2','#skF_5') = $sum(1,'#skE_3') )
| ( '#skF_5' = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_294,c_20]) ).
tff(c_323,plain,
( ( $sum(1,'#skE_3') = '#skE_3' )
| ( '#skF_5' = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_138,c_304]) ).
tff(c_324,plain,
$sum(1,'#skE_3') = '#skE_3',
inference(negUnitSimplification,[status(thm)],[c_175,c_323]) ).
tff(c_327,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_324]) ).
tff(c_331,plain,
'#skF_5' = '#skF_3',
inference(splitRight,[status(thm)],[c_171]) ).
tff(c_330,plain,
'#skE_3' = '#skE_2',
inference(splitRight,[status(thm)],[c_171]) ).
tff(c_136,plain,
write(write(write('#skF_2','#skF_4',0),'#skF_5',$sum(1,'#skE_3')),'#skF_3',0) = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_126,c_22]) ).
tff(c_350,plain,
write(write(write('#skF_2','#skF_4',0),'#skF_3',$sum(1,'#skE_2')),'#skF_3',0) = '#skF_1',
inference(demodulation,[status(thm),theory(equality)],[c_331,c_330,c_136]) ).
tff(c_383,plain,
read('#skF_1','#skF_3') = 0,
inference(superposition,[status(thm),theory(equality)],[c_350,c_20]) ).
tff(c_410,plain,
read('#skF_2','#skF_3') = 0,
inference(superposition,[status(thm),theory(equality)],[c_383,c_18]) ).
tff(c_434,plain,
'#skE_2' = 0,
inference(superposition,[status(thm),theory(equality)],[c_410,c_58]) ).
tff(c_436,plain,
'#skE_2' = 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_434]) ).
tff(c_466,plain,
'#skE_1' != 0,
inference(demodulation,[status(thm),theory(equality)],[c_436,c_59]) ).
tff(c_76,plain,
read('#skF_2','#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_13]) ).
tff(c_356,plain,
! [Z_6a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_3',$sum(1,'#skE_2')),Z_6a) = read('#skF_1',Z_6a) )
| ( Z_6a = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_350,c_19]) ).
tff(c_371,plain,
! [Z_6a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_3',$sum(1,'#skE_2')),Z_6a) = read('#skF_2',Z_6a) )
| ( Z_6a = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_356]) ).
tff(c_471,plain,
! [Z_6a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_3',$sum(1,0)),Z_6a) = read('#skF_2',Z_6a) )
| ( Z_6a = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_436,c_371]) ).
tff(c_476,plain,
! [Z_114a: $int] :
( ( read(write(write('#skF_2','#skF_4',0),'#skF_3',1),Z_114a) = read('#skF_2',Z_114a) )
| ( Z_114a = '#skF_3' ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_471]) ).
tff(c_525,plain,
! [Z_118a: $int] :
( ( read(write('#skF_2','#skF_4',0),Z_118a) = read('#skF_2',Z_118a) )
| ( Z_118a = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_476,c_19]) ).
tff(c_535,plain,
( ( read('#skF_2','#skF_4') = 0 )
| ( '#skF_4' = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_525,c_20]) ).
tff(c_554,plain,
( ( '#skE_1' = 0 )
| ( '#skF_4' = '#skF_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_76,c_535]) ).
tff(c_556,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_96,c_466,c_554]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT017_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.14 % 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.15/0.36 % Computer : n028.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:27:24 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.39/1.97 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.39/1.98
% 3.39/1.98 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.62/2.01
% 3.62/2.01 Inference rules
% 3.62/2.01 ----------------------
% 3.62/2.01 #Ref : 0
% 3.62/2.01 #Sup : 68
% 3.62/2.01 #Fact : 0
% 3.62/2.01 #Define : 3
% 3.62/2.01 #Split : 2
% 3.62/2.01 #Chain : 0
% 3.62/2.01 #Close : 0
% 3.62/2.01
% 3.62/2.01 Ordering : LPO
% 3.62/2.01
% 3.62/2.01 Simplification rules
% 3.62/2.01 ----------------------
% 3.62/2.01 #Subsume : 8
% 3.62/2.01 #Demod : 29
% 3.62/2.01 #Tautology : 40
% 3.62/2.01 #SimpNegUnit : 7
% 3.62/2.01 #BackRed : 8
% 3.62/2.01
% 3.62/2.01 #Partial instantiations: 0
% 3.62/2.01 #Strategies tried : 1
% 3.62/2.01
% 3.62/2.01 Timing (in seconds)
% 3.62/2.01 ----------------------
% 3.62/2.01 Preprocessing : 0.52
% 3.62/2.01 Parsing : 0.26
% 3.62/2.01 CNF conversion : 0.03
% 3.62/2.01 Main loop : 0.35
% 3.62/2.01 Inferencing : 0.10
% 3.62/2.01 Reduction : 0.10
% 3.62/2.01 Demodulation : 0.07
% 3.62/2.01 BG Simplification : 0.04
% 3.62/2.01 Subsumption : 0.06
% 3.62/2.01 Abstraction : 0.02
% 3.62/2.01 MUC search : 0.00
% 3.62/2.01 Cooper : 0.02
% 3.62/2.01 Total : 0.93
% 3.62/2.01 Index Insertion : 0.00
% 3.62/2.01 Index Deletion : 0.00
% 3.62/2.01 Index Matching : 0.00
% 3.62/2.01 BG Taut test : 0.00
%------------------------------------------------------------------------------