TSTP Solution File: DAT008_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT008_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/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 : n003.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.17s 1.82s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 10
% Syntax : Number of formulae : 46 ( 29 unt; 7 typ; 0 def)
% Number of atoms : 52 ( 36 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 26 ( 13 ~; 11 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 71 ( 13 atm; 0 fun; 39 num; 19 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 6 usr; 8 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_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_74,negated_conjecture,
~ ! [U: array,V: array] :
( ( ! [Wa: $int] : $greater(read(V,Wa),Wa)
& ( U = write(write(V,3,5),7,9) ) )
=> ! [Xa: $int] : $greater(read(U,Xa),Xa) ),
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_5,plain,
~ $greater(read('#skF_1','#skF_3'),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_17,plain,
~ $less('#skF_3',read('#skF_1','#skF_3')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_48,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_21,plain,
~ $less('#skF_3',read('#skF_1','#skF_3')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_55,plain,
~ $less('#skF_3','#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_48,c_21]) ).
tff(c_54,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_13,plain,
write(write('#skF_2',3,5),7,9) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_81,plain,
! [X_22: array,Y_23a: $int,X1_24a: $int,Z_25a: $int] :
( ( read(write(X_22,Y_23a,X1_24a),Z_25a) = read(X_22,Z_25a) )
| ( Z_25a = Y_23a ) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_107,plain,
! [Z_26a: $int] :
( ( read(write('#skF_2',3,5),Z_26a) = read('#skF_1',Z_26a) )
| ( Z_26a = 7 ) ),
inference(superposition,[status(thm),theory(equality)],[c_13,c_81]) ).
tff(c_19,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_117,plain,
( ( read('#skF_1',3) = 5 )
| ( 7 = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_107,c_19]) ).
tff(c_133,plain,
read('#skF_1',3) = 5,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_117]) ).
tff(c_152,plain,
( ( '#skE_1' = 5 )
| ( '#skF_3' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_54,c_133]) ).
tff(c_155,plain,
'#skF_3' != 3,
inference(splitLeft,[status(thm)],[c_152]) ).
tff(c_58,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_17]) ).
tff(c_40,plain,
read('#skF_1',7) = 9,
inference(superposition,[status(thm),theory(equality)],[c_13,c_19]) ).
tff(c_74,plain,
( ( '#skE_1' = 9 )
| ( '#skF_3' != 7 ) ),
inference(superposition,[status(thm),theory(equality)],[c_58,c_40]) ).
tff(c_80,plain,
'#skF_3' != 7,
inference(splitLeft,[status(thm)],[c_74]) ).
tff(c_18,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_156,plain,
! [Z_27a: $int] :
( ( read('#skF_1',Z_27a) = read('#skF_2',Z_27a) )
| ( Z_27a = 7 )
| ( Z_27a = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_107]) ).
tff(c_196,plain,
( ( read('#skF_2','#skF_3') = '#skE_1' )
| ( '#skF_3' = 7 )
| ( '#skF_3' = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_54,c_156]) ).
tff(c_205,plain,
read('#skF_2','#skF_3') = '#skE_1',
inference(negUnitSimplification,[status(thm)],[c_155,c_80,c_196]) ).
tff(c_10,plain,
! [W_10a: $int] : $greater(read('#skF_2',W_10a),W_10a),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_12,plain,
! [W_10a: $int] : $less(W_10a,read('#skF_2',W_10a)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_10]) ).
tff(c_219,plain,
$less('#skF_3','#skE_1'),
inference(superposition,[status(thm),theory(equality)],[c_205,c_12]) ).
tff(c_223,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_55,c_219]) ).
tff(c_227,plain,
'#skF_3' = 3,
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_226,plain,
'#skE_1' = 5,
inference(splitRight,[status(thm)],[c_152]) ).
tff(c_238,plain,
~ $less('#skF_3',5),
inference(demodulation,[status(thm),theory(equality)],[c_226,c_55]) ).
tff(c_240,plain,
~ $less(3,5),
inference(demodulation,[status(thm),theory(equality)],[c_227,c_238]) ).
tff(c_242,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_240]) ).
tff(c_246,plain,
'#skF_3' = 7,
inference(splitRight,[status(thm)],[c_74]) ).
tff(c_245,plain,
'#skE_1' = 9,
inference(splitRight,[status(thm)],[c_74]) ).
tff(c_257,plain,
~ $less('#skF_3',9),
inference(demodulation,[status(thm),theory(equality)],[c_245,c_55]) ).
tff(c_284,plain,
~ $less(7,9),
inference(demodulation,[status(thm),theory(equality)],[c_246,c_257]) ).
tff(c_286,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_284]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : DAT008_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/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.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:16:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.17/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.17/1.82
% 3.17/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.17/1.85
% 3.17/1.85 Inference rules
% 3.17/1.85 ----------------------
% 3.17/1.85 #Ref : 0
% 3.17/1.85 #Sup : 42
% 3.17/1.85 #Fact : 0
% 3.17/1.85 #Define : 1
% 3.17/1.85 #Split : 2
% 3.17/1.85 #Chain : 0
% 3.17/1.85 #Close : 0
% 3.17/1.85
% 3.17/1.85 Ordering : LPO
% 3.17/1.85
% 3.17/1.85 Simplification rules
% 3.17/1.85 ----------------------
% 3.17/1.85 #Subsume : 3
% 3.17/1.85 #Demod : 9
% 3.17/1.85 #Tautology : 30
% 3.17/1.85 #SimpNegUnit : 2
% 3.17/1.85 #BackRed : 4
% 3.17/1.85
% 3.17/1.85 #Partial instantiations: 0
% 3.17/1.85 #Strategies tried : 1
% 3.17/1.85
% 3.17/1.85 Timing (in seconds)
% 3.17/1.86 ----------------------
% 3.17/1.86 Preprocessing : 0.53
% 3.17/1.86 Parsing : 0.27
% 3.17/1.86 CNF conversion : 0.03
% 3.17/1.86 Main loop : 0.27
% 3.17/1.86 Inferencing : 0.08
% 3.17/1.86 Reduction : 0.06
% 3.17/1.86 Demodulation : 0.05
% 3.17/1.86 BG Simplification : 0.04
% 3.17/1.86 Subsumption : 0.04
% 3.17/1.86 Abstraction : 0.01
% 3.17/1.86 MUC search : 0.00
% 3.17/1.86 Cooper : 0.02
% 3.17/1.86 Total : 0.85
% 3.17/1.86 Index Insertion : 0.00
% 3.17/1.86 Index Deletion : 0.00
% 3.17/1.86 Index Matching : 0.00
% 3.17/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------