TSTP Solution File: DAT057_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT057_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 : n017.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 2.88s 1.73s
% Output : CNFRefutation 3.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 13
% Syntax : Number of formulae : 18 ( 4 unt; 11 typ; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 4 ~; 2 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 6 ( 0 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 : 2 ( 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_79,negated_conjecture,
~ ! [D: data,Ar: array,Ma: $int,Na: $int] :
( ( get(put(Ar,Ma,D),Na) = get(Ar,Na) )
| ( Ma = Na ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_1) ).
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(c_20,plain,
'#skF_5' != '#skF_4',
inference(cnfTransformation,[status(thm)],[f_79]) ).
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_79]) ).
tff(c_190,plain,
'#skF_5' = '#skF_4',
inference(superposition,[status(thm),theory(equality)],[c_23,c_165]) ).
tff(c_194,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_20,c_190]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT057_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 : n017.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.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 12:42:21 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.88/1.73 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.88/1.73
% 2.88/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.10/1.75
% 3.10/1.75 Inference rules
% 3.10/1.75 ----------------------
% 3.10/1.75 #Ref : 1
% 3.10/1.75 #Sup : 36
% 3.10/1.75 #Fact : 0
% 3.10/1.75 #Define : 0
% 3.10/1.75 #Split : 0
% 3.10/1.75 #Chain : 0
% 3.10/1.75 #Close : 0
% 3.10/1.75
% 3.10/1.75 Ordering : LPO
% 3.10/1.75
% 3.10/1.75 Simplification rules
% 3.10/1.75 ----------------------
% 3.10/1.75 #Subsume : 14
% 3.10/1.75 #Demod : 11
% 3.10/1.75 #Tautology : 19
% 3.10/1.75 #SimpNegUnit : 1
% 3.10/1.75 #BackRed : 0
% 3.10/1.75
% 3.10/1.75 #Partial instantiations: 0
% 3.10/1.75 #Strategies tried : 1
% 3.10/1.75
% 3.10/1.75 Timing (in seconds)
% 3.10/1.75 ----------------------
% 3.10/1.76 Preprocessing : 0.52
% 3.10/1.76 Parsing : 0.27
% 3.10/1.76 CNF conversion : 0.03
% 3.10/1.76 Main loop : 0.20
% 3.10/1.76 Inferencing : 0.07
% 3.10/1.76 Reduction : 0.05
% 3.10/1.76 Demodulation : 0.04
% 3.10/1.76 BG Simplification : 0.03
% 3.10/1.76 Subsumption : 0.04
% 3.10/1.76 Abstraction : 0.01
% 3.10/1.76 MUC search : 0.00
% 3.10/1.76 Cooper : 0.01
% 3.10/1.76 Total : 0.75
% 3.10/1.76 Index Insertion : 0.00
% 3.10/1.76 Index Deletion : 0.00
% 3.10/1.76 Index Matching : 0.00
% 3.10/1.76 BG Taut test : 0.00
%------------------------------------------------------------------------------