TSTP Solution File: DAT004_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT004_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 : n011.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:56 EDT 2023
% Result : Theorem 3.12s 1.82s
% Output : CNFRefutation 3.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 29 ( 13 unt; 8 typ; 0 def)
% Number of atoms : 33 ( 32 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 7 ~; 11 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 65 ( 0 atm; 0 fun; 52 num; 13 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 : 14 ( 7 usr; 12 con; 0-3 aty)
% Number of variables : 19 (; 19 !; 0 ?; 19 :)
% 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_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_72,negated_conjecture,
~ ! [U: array,V: array,Wa: $int] :
( ( U = write(write(write(write(V,3,33),4,44),5,55),Wa,66) )
=> ( ( read(U,4) = 44 )
| ( read(U,4) = 66 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
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(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(c_14,plain,
read('#skF_1',4) != 44,
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_23,plain,
read('#skF_1',4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_14]) ).
tff(c_15,plain,
read('#skF_1',4) != 66,
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_32,plain,
'#skE_1' != 66,
inference(demodulation,[status(thm),theory(equality)],[c_23,c_15]) ).
tff(c_66,plain,
write(write(write(write('#skF_2',3,33),4,44),5,55),'#skF_3',66) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_72]) ).
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_92,plain,
read('#skF_1','#skF_3') = 66,
inference(superposition,[status(thm),theory(equality)],[c_66,c_17]) ).
tff(c_98,plain,
( ( '#skE_1' = 66 )
| ( '#skF_3' != 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_92,c_23]) ).
tff(c_109,plain,
'#skF_3' != 4,
inference(negUnitSimplification,[status(thm)],[c_32,c_98]) ).
tff(c_20,plain,
read('#skF_1',4) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_14]) ).
tff(c_24,plain,
'#skE_1' != 44,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_14]) ).
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_115,plain,
! [Z_20a: $int] :
( ( read(write(write(write('#skF_2',3,33),4,44),5,55),Z_20a) = read('#skF_1',Z_20a) )
| ( Z_20a = '#skF_3' ) ),
inference(superposition,[status(thm),theory(equality)],[c_66,c_16]) ).
tff(c_185,plain,
! [Z_21a: $int] :
( ( read(write(write('#skF_2',3,33),4,44),Z_21a) = read('#skF_1',Z_21a) )
| ( Z_21a = '#skF_3' )
| ( Z_21a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_115]) ).
tff(c_195,plain,
( ( read('#skF_1',4) = 44 )
| ( '#skF_3' = 4 )
| ( 5 = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_185,c_17]) ).
tff(c_210,plain,
( ( '#skE_1' = 44 )
| ( '#skF_3' = 4 )
| ( 5 = 4 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_23,c_195]) ).
tff(c_211,plain,
5 = 4,
inference(negUnitSimplification,[status(thm)],[c_109,c_24,c_210]) ).
tff(c_214,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_211]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : DAT004_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/0.15 % 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.15/0.37 % Computer : n011.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 13:13:35 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.12/1.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.12/1.82
% 3.12/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.12/1.84
% 3.12/1.84 Inference rules
% 3.12/1.84 ----------------------
% 3.12/1.84 #Ref : 0
% 3.12/1.85 #Sup : 36
% 3.12/1.85 #Fact : 0
% 3.12/1.85 #Define : 2
% 3.12/1.85 #Split : 1
% 3.12/1.85 #Chain : 0
% 3.12/1.85 #Close : 0
% 3.12/1.85
% 3.12/1.85 Ordering : LPO
% 3.12/1.85
% 3.12/1.85 Simplification rules
% 3.12/1.85 ----------------------
% 3.12/1.85 #Subsume : 4
% 3.12/1.85 #Demod : 6
% 3.12/1.85 #Tautology : 20
% 3.12/1.85 #SimpNegUnit : 5
% 3.12/1.85 #BackRed : 1
% 3.12/1.85
% 3.12/1.85 #Partial instantiations: 0
% 3.12/1.85 #Strategies tried : 1
% 3.12/1.85
% 3.12/1.85 Timing (in seconds)
% 3.12/1.85 ----------------------
% 3.12/1.85 Preprocessing : 0.52
% 3.12/1.85 Parsing : 0.26
% 3.12/1.85 CNF conversion : 0.02
% 3.12/1.85 Main loop : 0.24
% 3.12/1.85 Inferencing : 0.08
% 3.12/1.85 Reduction : 0.05
% 3.12/1.85 Demodulation : 0.04
% 3.12/1.85 BG Simplification : 0.04
% 3.12/1.85 Subsumption : 0.04
% 3.12/1.85 Abstraction : 0.01
% 3.12/1.85 MUC search : 0.00
% 3.12/1.85 Cooper : 0.02
% 3.12/1.85 Total : 0.80
% 3.12/1.85 Index Insertion : 0.00
% 3.12/1.85 Index Deletion : 0.00
% 3.12/1.85 Index Matching : 0.00
% 3.12/1.85 BG Taut test : 0.00
%------------------------------------------------------------------------------