TSTP Solution File: DAT059_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT059_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.40s 1.58s
% Output : CNFRefutation 2.40s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 13
% Syntax : Number of formulae : 16 ( 5 unt; 11 typ; 0 def)
% Number of atoms : 5 ( 4 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 3 ( 0 atm; 0 fun; 0 num; 3 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_5 > #skF_1
%Foreground sorts:
tff(data,type,
data: $tType ).
tff(array,type,
array: $tType ).
%Background operators:
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_5',type,
'#skF_5': 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_67,axiom,
! [D2: data,Ar: array,Ma: $int,D1: data] : ( put(put(Ar,Ma,D2),Ma,D1) = put(Ar,Ma,D1) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT004_0.ax',ax_20) ).
tff(f_77,negated_conjecture,
~ ! [D1: data,Ar: array,Ma: $int,D2: data] : ( put(put(Ar,Ma,D1),Ma,D2) = put(Ar,Ma,D2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_5) ).
tff(c_20,plain,
! [Ar_10: array,M_11a: $int,D2_9: data,D1_12: data] : ( put(put(Ar_10,M_11a,D2_9),M_11a,D1_12) = put(Ar_10,M_11a,D1_12) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_18,plain,
put(put('#skF_3','#skF_4','#skF_2'),'#skF_4','#skF_5') != put('#skF_3','#skF_4','#skF_5'),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_27,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_20,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT059_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.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 12:41:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.40/1.58 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.40/1.58
% 2.40/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.40/1.60
% 2.40/1.60 Inference rules
% 2.40/1.60 ----------------------
% 2.40/1.60 #Ref : 0
% 2.40/1.60 #Sup : 0
% 2.40/1.60 #Fact : 0
% 2.40/1.60 #Define : 0
% 2.40/1.60 #Split : 0
% 2.40/1.60 #Chain : 0
% 2.40/1.60 #Close : 0
% 2.40/1.60
% 2.40/1.60 Ordering : LPO
% 2.40/1.60
% 2.40/1.60 Simplification rules
% 2.40/1.60 ----------------------
% 2.40/1.60 #Subsume : 5
% 2.40/1.60 #Demod : 1
% 2.40/1.60 #Tautology : 1
% 2.40/1.60 #SimpNegUnit : 0
% 2.40/1.60 #BackRed : 0
% 2.40/1.60
% 2.40/1.60 #Partial instantiations: 0
% 2.40/1.60 #Strategies tried : 1
% 2.40/1.60
% 2.40/1.60 Timing (in seconds)
% 2.40/1.60 ----------------------
% 2.40/1.60 Preprocessing : 0.50
% 2.40/1.60 Parsing : 0.26
% 2.40/1.60 CNF conversion : 0.02
% 2.40/1.60 Main loop : 0.04
% 2.40/1.60 Inferencing : 0.00
% 2.40/1.60 Reduction : 0.02
% 2.40/1.60 Demodulation : 0.02
% 2.40/1.60 BG Simplification : 0.02
% 2.40/1.60 Subsumption : 0.02
% 2.40/1.61 Abstraction : 0.01
% 2.40/1.61 MUC search : 0.00
% 2.40/1.61 Cooper : 0.00
% 2.40/1.61 Total : 0.58
% 2.40/1.61 Index Insertion : 0.00
% 2.40/1.61 Index Deletion : 0.00
% 2.40/1.61 Index Matching : 0.00
% 2.40/1.61 BG Taut test : 0.00
%------------------------------------------------------------------------------