TSTP Solution File: DAT067_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT067_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.63s 1.94s
% Output : CNFRefutation 3.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 36 ( 16 unt; 14 typ; 0 def)
% Number of atoms : 28 ( 27 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 15 ( 9 ~; 5 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 38 ( 0 atm; 18 fun; 12 num; 8 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 9 ( 6 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 12 usr; 8 con; 0-2 aty)
% Number of variables : 12 (; 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > sel > app > #nlpp > toop > length > get > empty > #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 ).
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(empty,type,
empty: heap ).
tff('#skF_3',type,
'#skF_3': 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,Ma: $int,H: heap] :
( ( sel(app(H,Na),Ma) = sel(H,Ma) )
| ( Ma = $sum(1,length(H)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_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_39,plain,
$sum(1,length('#skF_3')) != '#skF_2',
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_47,plain,
length('#skF_3') != $sum($uminus(1),'#skF_2'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_39]) ).
tff(c_103,plain,
length('#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_47]) ).
tff(c_105,plain,
$sum($uminus(1),'#skF_2') != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_103,c_47]) ).
tff(c_108,plain,
'#skF_2' != $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_105]) ).
tff(c_46,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') != sel('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_110,plain,
sel('#skF_3','#skF_2') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_109,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_62,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') != sel('#skF_3','#skF_2'),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_121,plain,
'#skE_3' != '#skE_2',
inference(demodulation,[status(thm),theory(equality)],[c_110,c_109,c_62]) ).
tff(c_106,plain,
length('#skF_3') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_47]) ).
tff(c_129,plain,
sel('#skF_3','#skF_2') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_46]) ).
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_397,plain,
! [H_112: heap,N_113a: $int,M_114a: $int] :
( ( sel(app(H_112,N_113a),M_114a) = sel(H_112,M_114a) )
| ( length(H_112) = $sum($uminus(1),M_114a) ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_117,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_416,plain,
( ( sel('#skF_3','#skF_2') = '#skE_2' )
| ( length('#skF_3') = $sum($uminus(1),'#skF_2') ) ),
inference(superposition,[status(thm),theory(equality)],[c_397,c_117]) ).
tff(c_447,plain,
( ( '#skE_3' = '#skE_2' )
| ( $sum($uminus(1),'#skF_2') = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_106,c_129,c_416]) ).
tff(c_448,plain,
$sum($uminus(1),'#skF_2') = '#skE_1',
inference(negUnitSimplification,[status(thm)],[c_121,c_447]) ).
tff(c_450,plain,
'#skF_2' = $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_448]) ).
tff(c_470,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_108,c_450]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT067_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.13/0.35 % Computer : n002.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 13:27:31 EDT 2023
% 0.13/0.35 % CPUTime :
% 3.63/1.94 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.63/1.94
% 3.63/1.94 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.63/1.97
% 3.63/1.97 Inference rules
% 3.63/1.97 ----------------------
% 3.63/1.97 #Ref : 2
% 3.63/1.97 #Sup : 64
% 3.63/1.97 #Fact : 0
% 3.63/1.97 #Define : 3
% 3.63/1.97 #Split : 0
% 3.63/1.97 #Chain : 0
% 3.63/1.97 #Close : 0
% 3.63/1.97
% 3.63/1.97 Ordering : LPO
% 3.63/1.97
% 3.63/1.97 Simplification rules
% 3.63/1.97 ----------------------
% 3.63/1.97 #Subsume : 3
% 3.63/1.97 #Demod : 19
% 3.63/1.97 #Tautology : 43
% 3.63/1.97 #SimpNegUnit : 6
% 3.63/1.97 #BackRed : 0
% 3.63/1.97
% 3.63/1.97 #Partial instantiations: 0
% 3.63/1.97 #Strategies tried : 1
% 3.63/1.97
% 3.63/1.97 Timing (in seconds)
% 3.63/1.97 ----------------------
% 3.63/1.97 Preprocessing : 0.57
% 3.63/1.97 Parsing : 0.31
% 3.63/1.97 CNF conversion : 0.03
% 3.63/1.97 Main loop : 0.32
% 3.63/1.97 Inferencing : 0.11
% 3.63/1.97 Reduction : 0.09
% 3.63/1.97 Demodulation : 0.06
% 3.63/1.97 BG Simplification : 0.04
% 3.63/1.97 Subsumption : 0.06
% 3.63/1.97 Abstraction : 0.01
% 3.63/1.97 MUC search : 0.00
% 3.63/1.97 Cooper : 0.01
% 3.63/1.97 Total : 0.93
% 3.63/1.97 Index Insertion : 0.00
% 3.63/1.97 Index Deletion : 0.00
% 3.63/1.97 Index Matching : 0.00
% 3.63/1.97 BG Taut test : 0.00
%------------------------------------------------------------------------------