TSTP Solution File: DAT062_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT062_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 : n026.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.26s 1.86s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 37 ( 19 unt; 12 typ; 0 def)
% Number of atoms : 35 ( 12 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 19 ( 9 ~; 7 |; 0 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 25 ( 10 atm; 5 fun; 5 num; 5 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 4 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 16 (; 16 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > app > #nlpp > toop > length > get > empty > #skF_1 > #skF_3
%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_2',type,
'#skF_2': $int ).
%Foreground operators:
tff(toop,type,
toop: heap > $int ).
tff(lsls,type,
lsls: ( heap * heap ) > $o ).
tff('#skF_1',type,
'#skF_1': heap ).
tff(empty,type,
empty: heap ).
tff('#skF_3',type,
'#skF_3': heap ).
tff(get,type,
get: heap > heap ).
tff(app,type,
app: ( heap * $int ) > heap ).
tff(length,type,
length: heap > $int ).
tff(f_75,axiom,
! [Na: $int,H: heap] : ( length(app(H,Na)) = $sum(1,length(H)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT005_0.ax',ax_23) ).
tff(f_107,negated_conjecture,
~ ! [H: heap,Na: $int] :
( ~ ! [H0: heap] :
( lsls(H0,H)
=> $less(length(H0),length(H)) )
| ! [H0: heap] :
( lsls(H0,app(H,Na))
=> $less(length(H0),length(app(H,Na))) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',th_lem_1a) ).
tff(f_93,axiom,
! [Na: $int,H0: heap,H: heap] :
( lsls(H0,app(H,Na))
<=> ( ( H0 = H )
| lsls(H0,H) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT005_0.ax',ax_27) ).
tff(c_49,plain,
! [H_13: heap,N_12a: $int] : ( length(app(H_13,N_12a)) = $sum(1,length(H_13)) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_45,plain,
~ $less(length('#skF_3'),length(app('#skF_1','#skF_2'))),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_62,plain,
~ $less(length('#skF_3'),$sum(1,length('#skF_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_49,c_45]) ).
tff(c_97,plain,
length('#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_62]) ).
tff(c_41,plain,
lsls('#skF_3',app('#skF_1','#skF_2')),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_204,plain,
! [H0_71: heap,H_72: heap,N_73a: $int] :
( lsls(H0_71,H_72)
| ( H_72 = H0_71 )
| ~ lsls(H0_71,app(H_72,N_73a)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_216,plain,
( lsls('#skF_3','#skF_1')
| ( '#skF_1' = '#skF_3' ) ),
inference(resolution,[status(thm)],[c_41,c_204]) ).
tff(c_221,plain,
'#skF_1' = '#skF_3',
inference(splitLeft,[status(thm)],[c_216]) ).
tff(c_98,plain,
length('#skF_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_62]) ).
tff(c_228,plain,
length('#skF_3') = '#skE_2',
inference(demodulation,[status(thm),theory(equality)],[c_221,c_98]) ).
tff(c_238,plain,
'#skE_2' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_97,c_228]) ).
tff(c_94,plain,
length('#skF_1') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_62]) ).
tff(c_93,plain,
length('#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_62]) ).
tff(c_99,plain,
~ $less('#skE_1',$sum(1,'#skE_2')),
inference(demodulation,[status(thm),theory(equality)],[c_94,c_93,c_62]) ).
tff(c_245,plain,
~ $less('#skE_1',$sum(1,'#skE_1')),
inference(demodulation,[status(thm),theory(equality)],[c_238,c_99]) ).
tff(c_248,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_245]) ).
tff(c_249,plain,
lsls('#skF_3','#skF_1'),
inference(splitRight,[status(thm)],[c_216]) ).
tff(c_37,plain,
! [H0_24: heap] :
( $less(length(H0_24),length('#skF_1'))
| ~ lsls(H0_24,'#skF_1') ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_117,plain,
! [H0_24: heap] :
( $less(length(H0_24),'#skE_2')
| ~ lsls(H0_24,'#skF_1') ),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_37]) ).
tff(c_255,plain,
$less(length('#skF_3'),'#skE_2'),
inference(resolution,[status(thm)],[c_249,c_117]) ).
tff(c_259,plain,
$less('#skE_1','#skE_2'),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_255]) ).
tff(c_260,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_259,c_99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT062_1 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.13 % 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.34 % Computer : n026.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu Aug 3 13:30:16 EDT 2023
% 0.14/0.34 % CPUTime :
% 3.26/1.86 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.26/1.87
% 3.26/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.56/1.89
% 3.56/1.89 Inference rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Ref : 2
% 3.56/1.89 #Sup : 30
% 3.56/1.89 #Fact : 0
% 3.56/1.89 #Define : 2
% 3.56/1.89 #Split : 1
% 3.56/1.89 #Chain : 0
% 3.56/1.89 #Close : 1
% 3.56/1.89
% 3.56/1.89 Ordering : LPO
% 3.56/1.89
% 3.56/1.89 Simplification rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Subsume : 1
% 3.56/1.89 #Demod : 13
% 3.56/1.89 #Tautology : 24
% 3.56/1.89 #SimpNegUnit : 3
% 3.56/1.89 #BackRed : 4
% 3.56/1.89
% 3.56/1.89 #Partial instantiations: 0
% 3.56/1.89 #Strategies tried : 1
% 3.56/1.89
% 3.56/1.89 Timing (in seconds)
% 3.56/1.89 ----------------------
% 3.56/1.89 Preprocessing : 0.56
% 3.56/1.90 Parsing : 0.30
% 3.56/1.90 CNF conversion : 0.03
% 3.56/1.90 Main loop : 0.29
% 3.56/1.90 Inferencing : 0.08
% 3.56/1.90 Reduction : 0.07
% 3.56/1.90 Demodulation : 0.05
% 3.56/1.90 BG Simplification : 0.03
% 3.56/1.90 Subsumption : 0.06
% 3.56/1.90 Abstraction : 0.01
% 3.56/1.90 MUC search : 0.00
% 3.56/1.90 Cooper : 0.03
% 3.56/1.90 Total : 0.89
% 3.56/1.90 Index Insertion : 0.00
% 3.56/1.90 Index Deletion : 0.00
% 3.56/1.90 Index Matching : 0.00
% 3.56/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------