TSTP Solution File: DAT078_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT078_1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n010.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:06 EDT 2023
% Result : Theorem 238.30s 202.01s
% Output : CNFRefutation 238.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 35 ( 3 unt; 17 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 : 36 ( 16 >; 20 *; 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/sandbox/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/sandbox/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/sandbox/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/sandbox/benchmark/theBenchmark.p',distinct) ).
tff(c_290990,plain,
! [V_21137: $int,I_21138: $int] : ( read(init(V_21137),I_21138) = V_21137 ),
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_291125,plain,
! [A_21199: array,N_21200: $int] :
( $less(read(A_21199,'#skF_4'(A_21199,N_21200)),read(A_21199,'#skF_3'(A_21199,N_21200)))
| sorted(A_21199,N_21200) ),
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_290965,plain,
! [A_21070: array,N_21071: $int] :
( distinct(A_21070,N_21071)
| ~ sorted(A_21070,N_21071)
| ~ $less(0,N_21071) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_71]) ).
tff(c_291130,plain,
! [A_21199: array,N_21200: $int] :
( distinct(A_21199,N_21200)
| ~ $less(0,N_21200)
| $less(read(A_21199,'#skF_4'(A_21199,N_21200)),read(A_21199,'#skF_3'(A_21199,N_21200))) ),
inference(resolution,[status(thm)],[c_291125,c_290965]) ).
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_293296,plain,
! [A_21362: array,J_21363: $int,I_21364: $int,N_21365: $int] :
( ( read(A_21362,J_21363) != read(A_21362,I_21364) )
| ~ distinct(A_21362,N_21365)
| ~ $less(I_21364,N_21365)
| ~ $less(J_21363,N_21365)
| $less(J_21363,0)
| $less(I_21364,0)
| ( J_21363 = I_21364 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_44]) ).
tff(c_293334,plain,
! [V_21137: $int,I_21364: $int,N_21365: $int,I_21138: $int] :
( ( read(init(V_21137),I_21364) != V_21137 )
| ~ distinct(init(V_21137),N_21365)
| ~ $less(I_21364,N_21365)
| ~ $less(I_21138,N_21365)
| $less(I_21138,0)
| $less(I_21364,0)
| ( I_21364 = I_21138 ) ),
inference(superposition,[status(thm),theory(equality)],[c_290990,c_293296]) ).
tff(c_293357,plain,
! [V_21366: $int,N_21367: $int,I_21368: $int,I_21369: $int] :
( ~ distinct(init(V_21366),N_21367)
| ~ $less(I_21368,N_21367)
| ~ $less(I_21369,N_21367)
| $less(I_21369,0)
| $less(I_21368,0)
| ( I_21369 = I_21368 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_290990,c_293334]) ).
tff(c_293360,plain,
! [I_21368: $int,N_21200: $int,I_21369: $int,V_21366: $int] :
( ~ $less(I_21368,N_21200)
| ~ $less(I_21369,N_21200)
| $less(I_21369,0)
| $less(I_21368,0)
| ( I_21369 = I_21368 )
| ~ $less(0,N_21200)
| $less(read(init(V_21366),'#skF_4'(init(V_21366),N_21200)),read(init(V_21366),'#skF_3'(init(V_21366),N_21200))) ),
inference(resolution,[status(thm)],[c_291130,c_293357]) ).
tff(c_293392,plain,
! [I_21368: $int,N_21200: $int,I_21369: $int,V_21366: $int] :
( ~ $less(I_21368,N_21200)
| ~ $less(I_21369,N_21200)
| $less(I_21369,0)
| $less(I_21368,0)
| ( I_21369 = I_21368 )
| ~ $less(0,N_21200)
| $less(V_21366,V_21366) ),
inference(demodulation,[status(thm),theory(equality)],[c_290990,c_290990,c_293360]) ).
tff(c_293394,plain,
! [I_21368: $int,N_21200: $int,I_21369: $int] :
( ~ $less(I_21368,N_21200)
| ~ $less(I_21369,N_21200)
| $less(I_21369,0)
| $less(I_21368,0)
| ( I_21369 = I_21368 )
| ~ $less(0,N_21200) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_293392]) ).
tff(c_293417,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_293394]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : DAT078_1 : TPTP v8.1.2. Released v6.1.0.
% 0.13/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 13:01:58 EDT 2023
% 0.14/0.35 % CPUTime :
% 127.28/102.07 ***********************************************************************
% 127.28/102.07 After 100.3 sec it's time to try something different, got 99.5 sec left
% 127.28/102.07 ***********************************************************************
% 236.90/201.71 ***********************************************************************
% 236.90/201.71 After 199.9 sec it's time to try something different, got 99.4 sec left
% 236.90/201.71 ***********************************************************************
% 238.30/202.01 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 238.30/202.02
% 238.30/202.02 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 238.30/202.04
% 238.30/202.04 Inference rules
% 238.30/202.04 ----------------------
% 238.30/202.04 #Ref : 50
% 238.30/202.04 #Sup : 56715
% 238.30/202.04 #Fact : 36
% 238.30/202.04 #Define : 0
% 238.30/202.04 #Split : 0
% 238.30/202.04 #Chain : 0
% 238.30/202.04 #Close : 0
% 238.30/202.04
% 238.30/202.04 Ordering : LPO
% 238.30/202.04
% 238.30/202.04 Simplification rules
% 238.30/202.04 ----------------------
% 238.30/202.04 #Subsume : 1445
% 238.30/202.04 #Demod : 7041
% 238.30/202.04 #Tautology : 25114
% 238.30/202.04 #SimpNegUnit : 0
% 238.30/202.04 #BackRed : 0
% 238.30/202.04
% 238.30/202.04 #Partial instantiations: 0
% 238.30/202.04 #Strategies tried : 3
% 238.30/202.04
% 238.30/202.04 Timing (in seconds)
% 238.30/202.04 ----------------------
% 238.30/202.04 Preprocessing : 0.66
% 238.30/202.04 Parsing : 0.33
% 238.30/202.04 CNF conversion : 0.04
% 238.30/202.04 Main loop : 200.24
% 238.30/202.04 Inferencing : 24.88
% 238.30/202.04 Reduction : 13.62
% 238.30/202.04 Demodulation : 10.57
% 238.30/202.04 BG Simplification : 3.75
% 238.30/202.04 Subsumption : 154.08
% 238.30/202.04 Abstraction : 1.74
% 238.30/202.04 MUC search : 0.00
% 238.30/202.04 Cooper : 0.02
% 238.30/202.04 Total : 200.94
% 238.30/202.04 Index Insertion : 0.00
% 238.30/202.04 Index Deletion : 0.00
% 238.30/202.04 Index Matching : 0.00
% 238.30/202.04 BG Taut test : 0.00
%------------------------------------------------------------------------------