TSTP Solution File: DAT061_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT061_1 : TPTP v8.1.2. Released v5.5.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 : n013.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:37:04 EDT 2023
% Result : Theorem 3.08s 1.73s
% Output : CNFRefutation 3.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 19 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 11 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 9 ( 3 atm; 0 fun; 0 num; 6 var)
% Number of types : 3 ( 2 usr; 1 ari)
% Number of type conns : 7 ( 3 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-3 aty)
% Number of variables : 12 (; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ put > get > #nlpp > none > mkarray > #skF_3 > #skF_2 > #skF_1
%Foreground sorts:
tff(data,type,
data: $tType ).
tff(array,type,
array: $tType ).
%Background operators:
tff('#skF_5',type,
'#skF_5': $int ).
tff('#skF_4',type,
'#skF_4': $int ).
%Foreground operators:
tff('#skF_3',type,
'#skF_3': array ).
tff('#skF_2',type,
'#skF_2': data ).
tff(get,type,
get: ( array * $int ) > data ).
tff('#skF_1',type,
'#skF_1': ( array * array ) > $int ).
tff(mkarray,type,
mkarray: array ).
tff(put,type,
put: ( array * $int * data ) > array ).
tff(none,type,
none: data ).
tff(f_65,axiom,
! [Na: $int,D: data,Ar: array,Ma: $int] :
( ( Ma != Na )
=> ( get(put(Ar,Na,D),Ma) = get(Ar,Ma) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT004_0.ax',ax_19) ).
tff(f_80,negated_conjecture,
~ ! [D: data,Ar: array,Ma: $int,Na: $int] :
( ( get(put(Ar,Ma,D),Na) = get(Ar,Na) )
| ~ $less(Ma,Na) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_7) ).
tff(c_23,plain,
! [Ar_7: array,N_5a: $int,D_6: data,M_8a: $int] :
( ( get(put(Ar_7,N_5a,D_6),M_8a) = get(Ar_7,M_8a) )
| ( N_5a = M_8a ) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_165,plain,
get(put('#skF_3','#skF_4','#skF_2'),'#skF_5') != get('#skF_3','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_190,plain,
'#skF_5' = '#skF_4',
inference(superposition,[status(thm),theory(equality)],[c_23,c_165]) ).
tff(c_20,plain,
$less('#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_199,plain,
$less('#skF_4','#skF_4'),
inference(demodulation,[status(thm),theory(equality)],[c_190,c_20]) ).
tff(c_208,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT061_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.14 % 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.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:08:02 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.08/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.08/1.73
% 3.08/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.17/1.75
% 3.17/1.75 Inference rules
% 3.17/1.75 ----------------------
% 3.17/1.75 #Ref : 1
% 3.17/1.75 #Sup : 36
% 3.17/1.75 #Fact : 0
% 3.17/1.75 #Define : 0
% 3.17/1.75 #Split : 0
% 3.17/1.75 #Chain : 0
% 3.17/1.75 #Close : 0
% 3.17/1.75
% 3.17/1.75 Ordering : LPO
% 3.17/1.75
% 3.17/1.75 Simplification rules
% 3.17/1.75 ----------------------
% 3.17/1.75 #Subsume : 14
% 3.17/1.75 #Demod : 15
% 3.17/1.75 #Tautology : 19
% 3.17/1.75 #SimpNegUnit : 0
% 3.17/1.75 #BackRed : 2
% 3.17/1.75
% 3.17/1.75 #Partial instantiations: 0
% 3.17/1.75 #Strategies tried : 1
% 3.17/1.75
% 3.17/1.75 Timing (in seconds)
% 3.17/1.75 ----------------------
% 3.17/1.75 Preprocessing : 0.50
% 3.17/1.75 Parsing : 0.26
% 3.17/1.75 CNF conversion : 0.02
% 3.17/1.75 Main loop : 0.21
% 3.17/1.75 Inferencing : 0.08
% 3.17/1.75 Reduction : 0.05
% 3.17/1.75 Demodulation : 0.04
% 3.17/1.75 BG Simplification : 0.03
% 3.17/1.75 Subsumption : 0.04
% 3.17/1.75 Abstraction : 0.01
% 3.17/1.75 MUC search : 0.00
% 3.17/1.75 Cooper : 0.01
% 3.17/1.75 Total : 0.74
% 3.17/1.75 Index Insertion : 0.00
% 3.17/1.75 Index Deletion : 0.00
% 3.17/1.76 Index Matching : 0.00
% 3.17/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------