TSTP Solution File: DAT003_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT003_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 : n027.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 2.90s 1.68s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 9
% Syntax : Number of formulae : 23 ( 8 unt; 6 typ; 0 def)
% Number of atoms : 34 ( 33 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 20 ( 3 ~; 16 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 75 ( 0 atm; 0 fun; 62 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 : 12 ( 5 usr; 10 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_1',type,
'#skE_1': $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_70,negated_conjecture,
~ ! [U: array,V: array] :
( ( U = write(write(write(write(V,3,33),4,444),5,55),4,44) )
=> ( read(U,3) = 33 ) ),
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_9,plain,
read('#skF_1',3) != 33,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_12,plain,
read('#skF_1',3) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_9]) ).
tff(c_16,plain,
'#skE_1' != 33,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_9]) ).
tff(c_15,plain,
read('#skF_1',3) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_9]) ).
tff(c_10,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_8,plain,
write(write(write(write('#skF_2',3,33),4,444),5,55),4,44) = '#skF_1',
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_74,plain,
! [Z_15a: $int] :
( ( read(write(write(write('#skF_2',3,33),4,444),5,55),Z_15a) = read('#skF_1',Z_15a) )
| ( Z_15a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_10]) ).
tff(c_112,plain,
! [Z_16a: $int] :
( ( read(write(write('#skF_2',3,33),4,444),Z_16a) = read('#skF_1',Z_16a) )
| ( Z_16a = 4 )
| ( Z_16a = 5 ) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_74]) ).
tff(c_147,plain,
! [Z_17a: $int] :
( ( read(write('#skF_2',3,33),Z_17a) = read('#skF_1',Z_17a) )
| ( Z_17a = 4 )
| ( Z_17a = 5 )
| ( Z_17a = 4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_112]) ).
tff(c_11,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_157,plain,
( ( read('#skF_1',3) = 33 )
| ( 4 = 3 )
| ( 5 = 3 )
| ( 4 = 3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_147,c_11]) ).
tff(c_172,plain,
( ( '#skE_1' = 33 )
| ( 4 = 3 )
| ( 5 = 3 )
| ( 4 = 3 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_15,c_157]) ).
tff(c_173,plain,
( ( 4 = 3 )
| ( 5 = 3 )
| ( 4 = 3 ) ),
inference(negUnitSimplification,[status(thm)],[c_16,c_172]) ).
tff(c_176,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_173]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT003_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 : n027.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:35:24 EDT 2023
% 0.13/0.34 % CPUTime :
% 2.90/1.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.90/1.68
% 2.90/1.68 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.90/1.70
% 2.90/1.70 Inference rules
% 2.90/1.70 ----------------------
% 2.90/1.70 #Ref : 0
% 2.90/1.70 #Sup : 34
% 2.90/1.70 #Fact : 0
% 2.90/1.70 #Define : 1
% 2.90/1.70 #Split : 0
% 2.90/1.70 #Chain : 0
% 2.90/1.70 #Close : 0
% 2.90/1.70
% 2.90/1.70 Ordering : LPO
% 2.90/1.70
% 2.90/1.70 Simplification rules
% 2.90/1.70 ----------------------
% 2.90/1.70 #Subsume : 0
% 2.90/1.70 #Demod : 5
% 2.90/1.70 #Tautology : 22
% 2.90/1.70 #SimpNegUnit : 1
% 2.90/1.70 #BackRed : 0
% 2.90/1.70
% 2.90/1.70 #Partial instantiations: 0
% 2.90/1.70 #Strategies tried : 1
% 2.90/1.70
% 2.90/1.70 Timing (in seconds)
% 2.90/1.70 ----------------------
% 2.90/1.70 Preprocessing : 0.45
% 2.90/1.70 Parsing : 0.24
% 2.90/1.70 CNF conversion : 0.02
% 2.90/1.70 Main loop : 0.21
% 2.90/1.70 Inferencing : 0.08
% 2.90/1.70 Reduction : 0.04
% 2.90/1.71 Demodulation : 0.03
% 2.90/1.71 BG Simplification : 0.03
% 2.90/1.71 Subsumption : 0.04
% 2.90/1.71 Abstraction : 0.01
% 2.90/1.71 MUC search : 0.00
% 2.90/1.71 Cooper : 0.01
% 2.90/1.71 Total : 0.71
% 2.90/1.71 Index Insertion : 0.00
% 2.90/1.71 Index Deletion : 0.00
% 2.90/1.71 Index Matching : 0.00
% 2.90/1.71 BG Taut test : 0.00
%------------------------------------------------------------------------------