%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT063_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 : n003.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 2.91s 1.64s
% Output : CNFRefutation 2.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 2
% Syntax : Number of formulae : 5 ( 4 unt; 0 typ; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 4 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 1 ( 1 atm; 0 fun; 0 num; 0 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 3 ( 3 !; 0 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
%$ lsls > app > #nlpp > toop > length > get > empty > #skF_1
%Foreground sorts:
tff(heap,type,
heap: $tType ).
%Background operators:
%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(get,type,
get: heap > heap ).
tff(app,type,
app: ( heap * $int ) > heap ).
tff(length,type,
length: heap > $int ).
tff(f_87,axiom,
! [H: heap] : ~ lsls(H,empty),
file('/export/starexec/sandbox2/benchmark/Axioms/DAT005_0.ax',ax_26) ).
tff(f_100,negated_conjecture,
~ ! [H: heap] :
( lsls(H,empty)
=> $less(length(H),length(empty)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',th_lem_1b) ).
tff(c_24,plain,
! [H_18: heap] : ~ lsls(H_18,empty),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_34,plain,
lsls('#skF_1',empty),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_47,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_24,c_34]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : DAT063_1 : TPTP v9.0.0. Released v5.5.0.
% 0.12/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.34 % Computer : n003.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Mon Apr 7 18:16:48 EDT 2025
% 0.12/0.34 % CPUTime :
% 2.91/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.91/1.65
% 2.91/1.65 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------