TSTP Solution File: DAT074_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT074_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/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 : Tue Aug 22 10:37:06 EDT 2023
% Result : Theorem 3.79s 2.21s
% Output : CNFRefutation 3.79s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 20
% Syntax : Number of formulae : 27 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 37 ( 11 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 44 ( 17 ~; 21 |; 3 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 54 ( 20 atm; 0 fun; 10 num; 24 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 36 ( 16 >; 20 *; 0 +; 0 <<)
% Number of predicates : 8 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 13 usr; 1 con; 0-3 aty)
% Number of variables : 27 (; 27 !; 0 ?; 27 :)
% 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_122,negated_conjecture,
~ ~ ! [Na: $int,Ia: $int] : distinct(init(Na),Ia),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c2) ).
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_98,plain,
! [V_11a: $int,I_12a: $int] : ( read(init(V_11a),I_12a) = V_11a ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_73,plain,
! [N_45a: $int,I_46a: $int] : distinct(init(N_45a),I_46a),
inference(cnfTransformation,[status(thm)],[f_122]) ).
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_487,plain,
! [A_191: array,J_192a: $int,I_193a: $int,N_194a: $int] :
( ( read(A_191,J_192a) != read(A_191,I_193a) )
| ~ distinct(A_191,N_194a)
| ~ $less(I_193a,N_194a)
| ~ $less(J_192a,N_194a)
| $less(J_192a,0)
| $less(I_193a,0)
| ( J_192a = I_193a ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_44]) ).
tff(c_508,plain,
! [N_45a: $int,J_192a: $int,I_193a: $int,I_46a: $int] :
( ( read(init(N_45a),J_192a) != read(init(N_45a),I_193a) )
| ~ $less(I_193a,I_46a)
| ~ $less(J_192a,I_46a)
| $less(J_192a,0)
| $less(I_193a,0)
| ( J_192a = I_193a ) ),
inference(resolution,[status(thm)],[c_73,c_487]) ).
tff(c_524,plain,
! [I_193a: $int,I_46a: $int,J_192a: $int] :
( ~ $less(I_193a,I_46a)
| ~ $less(J_192a,I_46a)
| $less(J_192a,0)
| $less(I_193a,0)
| ( J_192a = I_193a ) ),
inference(demodulation,[status(thm),theory(equality)],[c_98,c_98,c_508]) ).
tff(c_526,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_524]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT074_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/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.18/0.35 % Computer : n026.cluster.edu
% 0.18/0.35 % Model : x86_64 x86_64
% 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.35 % Memory : 8042.1875MB
% 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.35 % CPULimit : 300
% 0.18/0.35 % WCLimit : 300
% 0.18/0.35 % DateTime : Thu Aug 3 13:29:47 EDT 2023
% 0.18/0.35 % CPUTime :
% 3.79/2.21 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.79/2.21
% 3.79/2.21 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.79/2.23
% 3.79/2.23 Inference rules
% 3.79/2.23 ----------------------
% 3.79/2.23 #Ref : 3
% 3.79/2.23 #Sup : 73
% 3.79/2.23 #Fact : 0
% 3.79/2.23 #Define : 0
% 3.79/2.23 #Split : 0
% 3.79/2.23 #Chain : 0
% 3.79/2.23 #Close : 0
% 3.79/2.23
% 3.79/2.23 Ordering : LPO
% 3.79/2.23
% 3.79/2.23 Simplification rules
% 3.79/2.23 ----------------------
% 3.79/2.23 #Subsume : 1
% 3.79/2.23 #Demod : 6
% 3.79/2.23 #Tautology : 38
% 3.79/2.23 #SimpNegUnit : 0
% 3.79/2.23 #BackRed : 0
% 3.79/2.23
% 3.79/2.23 #Partial instantiations: 0
% 3.79/2.23 #Strategies tried : 1
% 3.79/2.23
% 3.79/2.23 Timing (in seconds)
% 3.79/2.23 ----------------------
% 3.79/2.24 Preprocessing : 0.66
% 3.79/2.24 Parsing : 0.34
% 3.79/2.24 CNF conversion : 0.04
% 3.79/2.24 Main loop : 0.40
% 3.79/2.24 Inferencing : 0.15
% 3.79/2.24 Reduction : 0.08
% 3.79/2.24 Demodulation : 0.06
% 3.79/2.24 BG Simplification : 0.08
% 3.79/2.24 Subsumption : 0.08
% 3.79/2.24 Abstraction : 0.02
% 3.79/2.24 MUC search : 0.00
% 3.79/2.24 Cooper : 0.02
% 3.79/2.24 Total : 1.10
% 3.79/2.24 Index Insertion : 0.00
% 3.79/2.24 Index Deletion : 0.00
% 3.79/2.24 Index Matching : 0.00
% 3.79/2.24 BG Taut test : 0.00
%------------------------------------------------------------------------------