%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT066_1 : TPTP v9.0.0. 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 : 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 : Wed Apr 9 06:08:02 PM UTC 2025
% Result : Theorem 3.39s 1.79s
% Output : CNFRefutation 3.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 2
% Syntax : Number of formulae : 15 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 7 ( 5 ~; 1 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 23 ( 0 atm; 9 fun; 7 num; 7 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > sel > app > #nlpp > toop > length > get > empty > #skF_3
%Foreground sorts:
tff(heap,type,
heap: $tType ).
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_2',type,
'#skF_2': $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_113,negated_conjecture,
~ ! [Na: $int,Ma: $int,H: heap] :
( ( sel(app(H,Na),Ma) = Na )
| ( Ma != $sum(1,length(H)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_1) ).
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(c_46,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_109,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_62,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') != '#skF_1',
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_116,plain,
'#skF_1' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_109,c_62]) ).
tff(c_39,plain,
$sum(1,length('#skF_3')) = '#skF_2',
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_47,plain,
length('#skF_3') = $sum($uminus(1),'#skF_2'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_39]) ).
tff(c_203,plain,
! [H_72: heap,N_73a: $int] : ( sel(app(H_72,N_73a),$sum(1,length(H_72))) = N_73a ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_227,plain,
! [N_73a: $int] : ( sel(app('#skF_3',N_73a),$sum(1,$sum($uminus(1),'#skF_2'))) = N_73a ),
inference(superposition,[status(thm),theory(equality)],[c_47,c_203]) ).
tff(c_247,plain,
! [N_78a: $int] : ( sel(app('#skF_3',N_78a),'#skF_2') = N_78a ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_227]) ).
tff(c_115,plain,
sel(app('#skF_3','#skF_1'),'#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_46]) ).
tff(c_263,plain,
'#skF_1' = '#skE_1',
inference(superposition,[status(thm),theory(equality)],[c_247,c_115]) ).
tff(c_265,plain,
'#skF_1' = '#skE_1',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_263]) ).
tff(c_272,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_116,c_265]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.12 % Problem : DAT066_1 : TPTP v9.0.0. Released v5.5.0.
% 0.02/0.13 % 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.12/0.32 % Computer : n026.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon Apr 7 18:16:53 EDT 2025
% 0.12/0.32 % CPUTime :
% 3.39/1.79 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.43/1.80
% 3.43/1.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------