TSTP Solution File: DAT069_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT069_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/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 : n002.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:05 EDT 2023
% Result : Theorem 3.58s 2.02s
% Output : CNFRefutation 3.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 17
% Syntax : Number of formulae : 43 ( 21 unt; 14 typ; 0 def)
% Number of atoms : 37 ( 30 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 19 ( 11 ~; 6 |; 0 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 49 ( 5 atm; 18 fun; 14 num; 12 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 18 (; 18 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > sel > app > #nlpp > toop > length > get > empty > #skF_2
%Foreground sorts:
tff(heap,type,
heap: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_3',type,
'#skF_3': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff('#skF_1',type,
'#skF_1': $int ).
%Foreground operators:
tff(toop,type,
toop: heap > $int ).
tff(lsls,type,
lsls: ( heap * heap ) > $o ).
tff('#skF_2',type,
'#skF_2': heap ).
tff(empty,type,
empty: heap ).
tff(get,type,
get: heap > heap ).
tff(sel,type,
sel: ( heap * $int ) > $int ).
tff(app,type,
app: ( heap * $int ) > heap ).
tff(length,type,
length: heap > $int ).
tff(f_112,negated_conjecture,
~ ! [Na: $int,H: heap,Ma: $int] :
( ( sel(app(H,Na),Ma) = sel(H,Ma) )
| $less(length(H),Ma) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_4) ).
tff(f_62,axiom,
! [H: heap,Ma: $int,Na: $int] :
( ( Ma = $sum(1,length(H)) )
=> ( sel(app(H,Na),Ma) = Na ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT006_0.ax',ax_2) ).
tff(f_67,axiom,
! [Na: $int,H: heap,Ma: $int] :
( ( Ma != $sum(1,length(H)) )
=> ( sel(app(H,Na),Ma) = sel(H,Ma) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT006_0.ax',ax_3) ).
tff(c_49,plain,
~ $less(length('#skF_2'),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_110,plain,
length('#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_49]) ).
tff(c_232,plain,
! [H_79: heap,N_80a: $int] : ( sel(app(H_79,N_80a),$sum(1,length(H_79))) = N_80a ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_294,plain,
! [N_92a: $int] : ( sel(app('#skF_2',N_92a),$sum(1,'#skE_1')) = N_92a ),
inference(superposition,[status(thm),theory(equality)],[c_110,c_232]) ).
tff(c_45,plain,
sel(app('#skF_2','#skF_1'),'#skF_3') != sel('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_120,plain,
sel(app('#skF_2','#skF_1'),'#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_45]) ).
tff(c_311,plain,
( ( '#skF_1' = '#skE_2' )
| ( '#skF_3' != $sum(1,'#skE_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_294,c_120]) ).
tff(c_318,plain,
'#skF_3' != $sum(1,'#skE_1'),
inference(splitLeft,[status(thm)],[c_311]) ).
tff(c_113,plain,
sel('#skF_2','#skF_3') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_45]) ).
tff(c_112,plain,
sel(app('#skF_2','#skF_1'),'#skF_3') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_45]) ).
tff(c_64,plain,
sel(app('#skF_2','#skF_1'),'#skF_3') != sel('#skF_2','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_124,plain,
'#skE_3' != '#skE_2',
inference(demodulation,[status(thm),theory(equality)],[c_113,c_112,c_64]) ).
tff(c_132,plain,
sel('#skF_2','#skF_3') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_45]) ).
tff(c_6,plain,
! [H_6: heap,N_5a: $int,M_7a: $int] :
( ( sel(app(H_6,N_5a),M_7a) = sel(H_6,M_7a) )
| ( $sum(1,length(H_6)) = M_7a ) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_371,plain,
! [H_106: heap,N_107a: $int,M_108a: $int] :
( ( sel(app(H_106,N_107a),M_108a) = sel(H_106,M_108a) )
| ( length(H_106) = $sum($uminus(1),M_108a) ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_390,plain,
( ( sel('#skF_2','#skF_3') = '#skE_2' )
| ( length('#skF_2') = $sum($uminus(1),'#skF_3') ) ),
inference(superposition,[status(thm),theory(equality)],[c_371,c_120]) ).
tff(c_421,plain,
( ( '#skE_3' = '#skE_2' )
| ( $sum($uminus(1),'#skF_3') = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_110,c_132,c_390]) ).
tff(c_422,plain,
$sum($uminus(1),'#skF_3') = '#skE_1',
inference(negUnitSimplification,[status(thm)],[c_124,c_421]) ).
tff(c_424,plain,
'#skF_3' = $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_422]) ).
tff(c_444,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_318,c_424]) ).
tff(c_448,plain,
'#skF_3' = $sum(1,'#skE_1'),
inference(splitRight,[status(thm)],[c_311]) ).
tff(c_107,plain,
length('#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_49]) ).
tff(c_65,plain,
~ $less(length('#skF_2'),'#skF_3'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_111,plain,
~ $less('#skE_1','#skF_3'),
inference(demodulation,[status(thm),theory(equality)],[c_107,c_65]) ).
tff(c_462,plain,
~ $less('#skE_1',$sum(1,'#skE_1')),
inference(demodulation,[status(thm),theory(equality)],[c_448,c_111]) ).
tff(c_468,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_462]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT069_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/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.14/0.36 % Computer : n002.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % 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 13:28:01 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.58/2.02 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.58/2.02
% 3.58/2.02 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.58/2.05
% 3.58/2.05 Inference rules
% 3.58/2.05 ----------------------
% 3.58/2.05 #Ref : 2
% 3.58/2.05 #Sup : 58
% 3.58/2.05 #Fact : 0
% 3.58/2.05 #Define : 3
% 3.58/2.05 #Split : 2
% 3.58/2.05 #Chain : 0
% 3.58/2.05 #Close : 0
% 3.58/2.05
% 3.58/2.05 Ordering : LPO
% 3.58/2.05
% 3.58/2.05 Simplification rules
% 3.58/2.05 ----------------------
% 3.58/2.05 #Subsume : 2
% 3.58/2.05 #Demod : 22
% 3.58/2.05 #Tautology : 43
% 3.58/2.05 #SimpNegUnit : 6
% 3.58/2.05 #BackRed : 3
% 3.58/2.05
% 3.58/2.05 #Partial instantiations: 0
% 3.58/2.05 #Strategies tried : 1
% 3.58/2.05
% 3.58/2.05 Timing (in seconds)
% 3.58/2.05 ----------------------
% 3.58/2.05 Preprocessing : 0.58
% 3.58/2.05 Parsing : 0.32
% 3.58/2.05 CNF conversion : 0.03
% 3.58/2.05 Main loop : 0.32
% 3.58/2.05 Inferencing : 0.11
% 3.58/2.05 Reduction : 0.09
% 3.58/2.05 Demodulation : 0.06
% 3.58/2.05 BG Simplification : 0.04
% 3.58/2.05 Subsumption : 0.06
% 3.58/2.05 Abstraction : 0.01
% 3.58/2.05 MUC search : 0.00
% 3.58/2.05 Cooper : 0.02
% 3.58/2.05 Total : 0.95
% 3.58/2.05 Index Insertion : 0.00
% 3.82/2.05 Index Deletion : 0.00
% 3.82/2.05 Index Matching : 0.00
% 3.82/2.05 BG Taut test : 0.00
%------------------------------------------------------------------------------