%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : DAT078_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 : n004.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:04 PM UTC 2025
% Result : Theorem 237.18s 201.81s
% Output : CNFRefutation 237.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of formulae : 18 ( 3 unt; 0 typ; 0 def)
% Number of atoms : 79 ( 14 equ)
% Maximal formula atoms : 7 ( 4 avg)
% Number of connectives : 95 ( 34 ~; 48 |; 7 &)
% ( 2 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 8 avg)
% Maximal term depth : 4 ( 1 avg)
% Number arithmetic : 114 ( 49 atm; 0 fun; 24 num; 41 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 13 usr; 1 con; 0-3 aty)
% Number of variables : 51 ( 51 !; 0 ?; 51 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_6 > #skF_3 > #skF_7 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
%Foreground operators:
tff(sorted,type,
sorted: ( array * $int ) > $o ).
tff(rev,type,
rev: ( array * $int ) > array ).
tff('#skF_5',type,
'#skF_5': ( array * $int * $int ) > $int ).
tff(write,type,
write: ( array * $int * $int ) > array ).
tff(init,type,
init: $int > array ).
tff('#skF_4',type,
'#skF_4': ( array * $int ) > $int ).
tff('#skF_8',type,
'#skF_8': ( array * array * $int ) > $int ).
tff('#skF_1',type,
'#skF_1': ( array * array ) > $int ).
tff('#skF_6',type,
'#skF_6': ( array * $int ) > $int ).
tff('#skF_3',type,
'#skF_3': ( array * $int ) > $int ).
tff(max,type,
max: ( array * $int ) > $int ).
tff(inRange,type,
inRange: ( array * $int * $int ) > $o ).
tff('#skF_7',type,
'#skF_7': ( array * $int ) > $int ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(distinct,type,
distinct: ( array * $int ) > $o ).
tff('#skF_2',type,
'#skF_2': ( array * $int * $int ) > $int ).
tff(f_43,axiom,
! [Va: $int,Ia: $int] : ( read(init(Va),Ia) = Va ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_74,axiom,
! [A: array,Na: $int] :
( sorted(A,Na)
<=> ! [Ia: $int,Ja: $int] :
( ( $lesseq(0,Ia)
& $less(Ia,Na)
& $less(Ia,Ja)
& $less(Ja,Na) )
=> $lesseq(read(A,Ia),read(A,Ja)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sorted1) ).
tff(f_126,negated_conjecture,
~ ~ ! [A: array,Na: $int] :
( ( sorted(A,Na)
& $greater(Na,0) )
=> distinct(A,Na) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c6) ).
tff(f_102,axiom,
! [A: array,Na: $int] :
( distinct(A,Na)
<=> ! [Ia: $int,Ja: $int] :
( ( $greater(Na,Ia)
& $greater(Na,Ja)
& $greatereq(Ja,0)
& $greatereq(Ia,0) )
=> ( ( read(A,Ia) = read(A,Ja) )
=> ( Ia = Ja ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distinct) ).
tff(c_297283,plain,
! [V_21435: $int,I_21436: $int] : ( read(init(V_21435),I_21436) = V_21435 ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_20,plain,
! [A_19: array,N_20a: $int] :
( ~ $lesseq(read(A_19,'#skF_3'(A_19,N_20a)),read(A_19,'#skF_4'(A_19,N_20a)))
| sorted(A_19,N_20a) ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_297418,plain,
! [A_21497: array,N_21498: $int] :
( $less(read(A_21497,'#skF_4'(A_21497,N_21498)),read(A_21497,'#skF_3'(A_21497,N_21498)))
| sorted(A_21497,N_21498) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_20]) ).
tff(c_71,plain,
! [A_45: array,N_46a: $int] :
( distinct(A_45,N_46a)
| ~ sorted(A_45,N_46a)
| ~ $greater(N_46a,0) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_297258,plain,
! [A_21368: array,N_21369: $int] :
( distinct(A_21368,N_21369)
| ~ sorted(A_21368,N_21369)
| ~ $less(0,N_21369) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_71]) ).
tff(c_297423,plain,
! [A_21497: array,N_21498: $int] :
( distinct(A_21497,N_21498)
| ~ $less(0,N_21498)
| $less(read(A_21497,'#skF_4'(A_21497,N_21498)),read(A_21497,'#skF_3'(A_21497,N_21498))) ),
inference(resolution,[status(thm)],[c_297418,c_297258]) ).
tff(c_44,plain,
! [A_33: array,J_40a: $int,I_39a: $int,N_34a: $int] :
( ( read(A_33,J_40a) != read(A_33,I_39a) )
| ~ distinct(A_33,N_34a)
| ~ $greater(N_34a,I_39a)
| ~ $greater(N_34a,J_40a)
| ~ $greatereq(J_40a,0)
| ~ $greatereq(I_39a,0)
| ( J_40a = I_39a ) ),
inference(cnfTransformation,[status(thm)],[f_102]) ).
tff(c_299589,plain,
! [A_21660: array,J_21661: $int,I_21662: $int,N_21663: $int] :
( ( read(A_21660,J_21661) != read(A_21660,I_21662) )
| ~ distinct(A_21660,N_21663)
| ~ $less(I_21662,N_21663)
| ~ $less(J_21661,N_21663)
| $less(J_21661,0)
| $less(I_21662,0)
| ( J_21661 = I_21662 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_44]) ).
tff(c_299627,plain,
! [V_21435: $int,I_21662: $int,N_21663: $int,I_21436: $int] :
( ( read(init(V_21435),I_21662) != V_21435 )
| ~ distinct(init(V_21435),N_21663)
| ~ $less(I_21662,N_21663)
| ~ $less(I_21436,N_21663)
| $less(I_21436,0)
| $less(I_21662,0)
| ( I_21662 = I_21436 ) ),
inference(superposition,[status(thm),theory(equality)],[c_297283,c_299589]) ).
tff(c_299650,plain,
! [V_21664: $int,N_21665: $int,I_21666: $int,I_21667: $int] :
( ~ distinct(init(V_21664),N_21665)
| ~ $less(I_21666,N_21665)
| ~ $less(I_21667,N_21665)
| $less(I_21667,0)
| $less(I_21666,0)
| ( I_21667 = I_21666 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_297283,c_299627]) ).
tff(c_299653,plain,
! [I_21666: $int,N_21498: $int,I_21667: $int,V_21664: $int] :
( ~ $less(I_21666,N_21498)
| ~ $less(I_21667,N_21498)
| $less(I_21667,0)
| $less(I_21666,0)
| ( I_21667 = I_21666 )
| ~ $less(0,N_21498)
| $less(read(init(V_21664),'#skF_4'(init(V_21664),N_21498)),read(init(V_21664),'#skF_3'(init(V_21664),N_21498))) ),
inference(resolution,[status(thm)],[c_297423,c_299650]) ).
tff(c_299685,plain,
! [I_21666: $int,N_21498: $int,I_21667: $int,V_21664: $int] :
( ~ $less(I_21666,N_21498)
| ~ $less(I_21667,N_21498)
| $less(I_21667,0)
| $less(I_21666,0)
| ( I_21667 = I_21666 )
| ~ $less(0,N_21498)
| $less(V_21664,V_21664) ),
inference(demodulation,[status(thm),theory(equality)],[c_297283,c_297283,c_299653]) ).
tff(c_299687,plain,
! [I_21666: $int,N_21498: $int,I_21667: $int] :
( ~ $less(I_21666,N_21498)
| ~ $less(I_21667,N_21498)
| $less(I_21667,0)
| $less(I_21666,0)
| ( I_21667 = I_21666 )
| ~ $less(0,N_21498) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_299685]) ).
tff(c_299710,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_299687]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : DAT078_1 : TPTP v9.0.0. Released v6.1.0.
% 0.11/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.14/0.33 % Computer : n004.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % 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 : Mon Apr 7 18:17:08 EDT 2025
% 0.14/0.34 % CPUTime :
% 125.19/101.67 ***********************************************************************
% 125.19/101.67 After 99.8 sec it's time to try something different, got 99.7 sec left
% 125.19/101.67 ***********************************************************************
% 236.03/201.52 ***********************************************************************
% 236.03/201.52 After 199.7 sec it's time to try something different, got 99.6 sec left
% 236.03/201.52 ***********************************************************************
% 237.18/201.81 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 237.18/201.81
% 237.18/201.81 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------