%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT092_1 : TPTP v9.0.0. Released v6.1.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 : n020.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:06 PM UTC 2025
% Result : Theorem 3.14s 1.75s
% Output : CNFRefutation 3.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 4
% Syntax : Number of formulae : 12 ( 12 unt; 0 typ; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number arithmetic : 13 ( 0 atm; 3 fun; 8 num; 2 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 13 usr; 3 con; 0-2 aty)
% Number of variables : 12 ( 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > in > count > cons > append > #nlpp > tail > length > head > nil > #skF_4 > #skF_1 > #skF_2 > #skF_6 > #skF_3 > #skF_5
%Foreground sorts:
tff(list,type,
list: $tType ).
%Background operators:
%Foreground operators:
tff(inRange,type,
inRange: ( $int * list ) > $o ).
tff(tail,type,
tail: list > list ).
tff(nil,type,
nil: list ).
tff(head,type,
head: list > $int ).
tff(length,type,
length: list > $int ).
tff('#skF_4',type,
'#skF_4': ( $int * list ) > list ).
tff(append,type,
append: ( list * list ) > list ).
tff(count,type,
count: ( $int * list ) > $int ).
tff(cons,type,
cons: ( $int * list ) > list ).
tff(in,type,
in: ( $int * list ) > $o ).
tff('#skF_1',type,
'#skF_1': ( $int * list ) > $int ).
tff('#skF_2',type,
'#skF_2': ( $int * list ) > list ).
tff('#skF_6',type,
'#skF_6': ( $int * list ) > list ).
tff('#skF_3',type,
'#skF_3': ( $int * list ) > $int ).
tff('#skF_5',type,
'#skF_5': ( $int * list ) > $int ).
tff(f_70,axiom,
length(nil) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l) ).
tff(f_87,axiom,
! [L: list] : ( append(nil,L) = L ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_6) ).
tff(f_97,negated_conjecture,
~ ~ ! [K: list,L: list] : ( length(append(K,L)) = length(K) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(f_72,axiom,
! [Ha: $int,T: list] : ( length(cons(Ha,T)) = $sum(1,length(T)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l_1) ).
tff(c_65,plain,
length(nil) = 0,
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_46,plain,
! [L_41: list] : ( append(nil,L_41) = L_41 ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_129,plain,
! [K_60: list,L_61: list] : ( length(append(K_60,L_61)) = length(K_60) ),
inference(cnfTransformation,[status(thm)],[f_97]) ).
tff(c_138,plain,
! [L_41: list] : ( length(nil) = length(L_41) ),
inference(superposition,[status(thm),theory(equality)],[c_46,c_129]) ).
tff(c_144,plain,
! [L_41: list] : ( length(L_41) = 0 ),
inference(demodulation,[status(thm),theory(equality)],[c_65,c_138]) ).
tff(c_64,plain,
! [H_30a: $int,T_31: list] : ( length(cons(H_30a,T_31)) = $sum(1,length(T_31)) ),
inference(cnfTransformation,[status(thm)],[f_72]) ).
tff(c_156,plain,
$sum(1,0) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_144,c_144,c_64]) ).
tff(c_158,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_156]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : DAT092_1 : TPTP v9.0.0. Released v6.1.0.
% 0.06/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.13/0.32 % Computer : n020.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon Apr 7 18:17:19 EDT 2025
% 0.13/0.32 % CPUTime :
% 3.14/1.75 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.30/1.75
% 3.30/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------