TSTP Solution File: DAT010_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT010_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 : n022.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.01s 1.76s
% Output : CNFRefutation 3.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 10
% Syntax : Number of formulae : 49 ( 28 unt; 7 typ; 0 def)
% Number of atoms : 67 ( 53 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 39 ( 14 ~; 23 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 114 ( 10 atm; 0 fun; 87 num; 17 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 6 usr; 12 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_74,negated_conjecture,
~ ! [U: array,V: array] :
( ( ( U = write(write(write(write(V,3,33),4,444),5,55),4,44) )
& ! [Wa: $int] : $less(read(V,Wa),100) )
=> ! [Xa: $int] : $less(read(U,Xa),100) ),
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_15,plain,
~ $less(read('#skF_1','#skF_3'),100),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_54,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_15]) ).
tff(c_19,plain,
~ $less(read('#skF_1','#skF_3'),100),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_61,plain,
~ $less('#skE_1',100),
inference(demodulation,[status(thm),theory(equality)],[c_54,c_19]) ).
tff(c_10,plain,
write(write(write(write('#skF_2',3,33),4,444),5,55),4,44) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_17,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_87,plain,
read('#skF_1',4) = 44,
inference(superposition,[status(thm),theory(equality)],[c_10,c_17]) ).
tff(c_60,plain,
read('#skF_1','#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_15]) ).
tff(c_99,plain,
( ( '#skE_1' = 44 )
| ( '#skF_3' != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_87,c_60]) ).
tff(c_104,plain,
'#skF_3' != 4,
inference(splitLeft,[status(thm)],[c_99]) ).
tff(c_16,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_105,plain,
! [Z_24a: $int] :
( ( read(write(write(write('#skF_2',3,33),4,444),5,55),Z_24a) = read('#skF_1',Z_24a) )
| ( Z_24a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_16]) ).
tff(c_115,plain,
( ( read('#skF_1',5) = 55 )
| ( 5 = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_105,c_17]) ).
tff(c_131,plain,
read('#skF_1',5) = 55,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_115]) ).
tff(c_150,plain,
( ( '#skE_1' = 55 )
| ( '#skF_3' != 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_60,c_131]) ).
tff(c_153,plain,
'#skF_3' != 5,
inference(splitLeft,[status(thm)],[c_150]) ).
tff(c_154,plain,
! [Z_25a: $int] :
( ( read(write(write('#skF_2',3,33),4,444),Z_25a) = read('#skF_1',Z_25a) )
| ( Z_25a = 5 )
| ( Z_25a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_105,c_16]) ).
tff(c_188,plain,
! [Z_26a: $int] :
( ( read(write('#skF_2',3,33),Z_26a) = read('#skF_1',Z_26a) )
| ( Z_26a = 4 )
| ( Z_26a = 5 )
| ( Z_26a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_154,c_16]) ).
tff(c_198,plain,
( ( read('#skF_1',3) = 33 )
| ( 4 = 3 )
| ( 5 = 3 )
| ( 4 = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_188,c_17]) ).
tff(c_214,plain,
read('#skF_1',3) = 33,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_198]) ).
tff(c_230,plain,
( ( '#skE_1' = 33 )
| ( '#skF_3' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_214,c_60]) ).
tff(c_236,plain,
'#skF_3' != 3,
inference(splitLeft,[status(thm)],[c_230]) ).
tff(c_237,plain,
! [Z_27a: $int] :
( ( read('#skF_1',Z_27a) = read('#skF_2',Z_27a) )
| ( Z_27a = 3 )
| ( Z_27a = 4 )
| ( Z_27a = 5 )
| ( Z_27a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_188,c_16]) ).
tff(c_278,plain,
( ( read('#skF_2','#skF_3') = '#skE_1' )
| ( '#skF_3' = 3 )
| ( '#skF_3' = 5 )
| ( '#skF_3' = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_237,c_60]) ).
tff(c_296,plain,
read('#skF_2','#skF_3') = '#skE_1',
inference(negUnitSimplification,[status(thm)],[c_104,c_153,c_236,c_278]) ).
tff(c_11,plain,
! [W_10a: $int] : $less(read('#skF_2',W_10a),100),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_301,plain,
$less('#skE_1',100),
inference(superposition,[status(thm),theory(equality)],[c_296,c_11]) ).
tff(c_312,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_61,c_301]) ).
tff(c_316,plain,
'#skF_3' = 3,
inference(splitRight,[status(thm)],[c_230]) ).
tff(c_233,plain,
( ( '#skE_1' = 33 )
| ( '#skF_3' != 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_60,c_214]) ).
tff(c_325,plain,
'#skE_1' = 33,
inference(demodulation,[status(thm),theory(equality)],[c_316,c_233]) ).
tff(c_326,plain,
~ $less(33,100),
inference(demodulation,[status(thm),theory(equality)],[c_325,c_61]) ).
tff(c_329,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_326]) ).
tff(c_332,plain,
'#skE_1' = 55,
inference(splitRight,[status(thm)],[c_150]) ).
tff(c_339,plain,
~ $less(55,100),
inference(demodulation,[status(thm),theory(equality)],[c_332,c_61]) ).
tff(c_342,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_339]) ).
tff(c_345,plain,
'#skE_1' = 44,
inference(splitRight,[status(thm)],[c_99]) ).
tff(c_351,plain,
~ $less(44,100),
inference(demodulation,[status(thm),theory(equality)],[c_345,c_61]) ).
tff(c_354,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_351]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT010_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/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 : n022.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 : Thu Aug 3 13:12:19 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.01/1.76 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.01/1.76
% 3.01/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.01/1.79
% 3.01/1.79 Inference rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Ref : 0
% 3.01/1.79 #Sup : 55
% 3.01/1.79 #Fact : 0
% 3.01/1.79 #Define : 1
% 3.01/1.79 #Split : 3
% 3.01/1.79 #Chain : 0
% 3.01/1.79 #Close : 0
% 3.01/1.79
% 3.01/1.79 Ordering : LPO
% 3.01/1.79
% 3.01/1.79 Simplification rules
% 3.01/1.79 ----------------------
% 3.01/1.79 #Subsume : 5
% 3.01/1.79 #Demod : 18
% 3.01/1.79 #Tautology : 38
% 3.01/1.79 #SimpNegUnit : 2
% 3.01/1.79 #BackRed : 6
% 3.01/1.79
% 3.01/1.79 #Partial instantiations: 0
% 3.01/1.79 #Strategies tried : 1
% 3.01/1.79
% 3.01/1.79 Timing (in seconds)
% 3.01/1.79 ----------------------
% 3.01/1.79 Preprocessing : 0.48
% 3.01/1.79 Parsing : 0.24
% 3.01/1.79 CNF conversion : 0.03
% 3.01/1.79 Main loop : 0.28
% 3.01/1.79 Inferencing : 0.09
% 3.01/1.79 Reduction : 0.07
% 3.01/1.79 Demodulation : 0.05
% 3.01/1.79 BG Simplification : 0.04
% 3.01/1.79 Subsumption : 0.04
% 3.01/1.79 Abstraction : 0.01
% 3.01/1.79 MUC search : 0.00
% 3.01/1.79 Cooper : 0.02
% 3.01/1.79 Total : 0.81
% 3.01/1.79 Index Insertion : 0.00
% 3.01/1.79 Index Deletion : 0.00
% 3.01/1.79 Index Matching : 0.00
% 3.01/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------