TSTP Solution File: DAT073_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT073_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 : n015.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 225.51s 201.51s
% Output : CNFRefutation 225.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 20
% Syntax : Number of formulae : 31 ( 5 unt; 17 typ; 0 def)
% Number of atoms : 35 ( 2 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 37 ( 16 ~; 16 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 67 ( 24 atm; 0 fun; 17 num; 26 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 : 32 (; 32 !; 0 ?; 32 :)
% 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_124,negated_conjecture,
~ ~ ! [A: array,Na: $int] :
( $greatereq(Na,0)
=> inRange(A,max(A,Na),Na) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c1) ).
tff(f_43,axiom,
! [Va: $int,Ia: $int] : ( read(init(Va),Ia) = Va ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax3) ).
tff(f_86,axiom,
! [A: array,Ra: $int,Na: $int] :
( inRange(A,Ra,Na)
<=> ! [Ia: $int] :
( ( $greater(Na,Ia)
& $greatereq(Ia,0) )
=> ( $greatereq(Ra,read(A,Ia))
& $greatereq(read(A,Ia),0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inRange) ).
tff(c_71,plain,
! [A_45: array,N_46a: $int] :
( inRange(A_45,max(A_45,N_46a),N_46a)
| ~ $greatereq(N_46a,0) ),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_220800,plain,
! [A_19707: array,N_19708: $int] :
( inRange(A_19707,max(A_19707,N_19708),N_19708)
| $less(N_19708,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_71]) ).
tff(c_220825,plain,
! [V_19774: $int,I_19775: $int] : ( read(init(V_19774),I_19775) = V_19774 ),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_31,plain,
! [A_27: array,I_32a: $int,R_28a: $int,N_29a: $int] :
( $greatereq(read(A_27,I_32a),0)
| ~ inRange(A_27,R_28a,N_29a)
| ~ $greater(N_29a,I_32a)
| ~ $greatereq(I_32a,0) ),
inference(cnfTransformation,[status(thm)],[f_86]) ).
tff(c_220937,plain,
! [A_19830: array,I_19831: $int,R_19832: $int,N_19833: $int] :
( ~ $less(read(A_19830,I_19831),0)
| ~ inRange(A_19830,R_19832,N_19833)
| ~ $less(I_19831,N_19833)
| $less(I_19831,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_31]) ).
tff(c_220947,plain,
! [V_19834: $int,R_19835: $int,N_19836: $int,I_19837: $int] :
( ~ $less(V_19834,0)
| ~ inRange(init(V_19834),R_19835,N_19836)
| ~ $less(I_19837,N_19836)
| $less(I_19837,0) ),
inference(superposition,[status(thm),theory(equality)],[c_220825,c_220937]) ).
tff(c_220962,plain,
! [V_19834: $int,I_19837: $int,N_19708: $int] :
( ~ $less(V_19834,0)
| ~ $less(I_19837,N_19708)
| $less(I_19837,0)
| $less(N_19708,0) ),
inference(resolution,[status(thm)],[c_220800,c_220947]) ).
tff(c_220964,plain,
! [V_19834: $int] : ~ $less(V_19834,0),
inference(splitLeft,[status(thm)],[c_220962]) ).
tff(c_220971,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_220964]) ).
tff(c_220973,plain,
! [I_19837: $int,N_19708: $int] :
( ~ $less(I_19837,N_19708)
| $less(I_19837,0)
| $less(N_19708,0) ),
inference(splitRight,[status(thm)],[c_220962]) ).
tff(c_220975,plain,
$false,
inference(quantifierElimination,[status(thm),theory('LIA')],[c_220973]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : DAT073_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.15 % 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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 13:27:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 119.17/101.75 ***********************************************************************
% 119.17/101.75 After 100.1 sec it's time to try something different, got 99.6 sec left
% 119.17/101.75 ***********************************************************************
% 225.28/201.45 ***********************************************************************
% 225.28/201.45 After 199.8 sec it's time to try something different, got 99.6 sec left
% 225.28/201.45 ***********************************************************************
% 225.51/201.51 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 225.51/201.51
% 225.51/201.51 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 225.51/201.54
% 225.51/201.54 Inference rules
% 225.51/201.54 ----------------------
% 225.51/201.54 #Ref : 17
% 225.51/201.54 #Sup : 43274
% 225.51/201.54 #Fact : 124
% 225.51/201.54 #Define : 0
% 225.51/201.54 #Split : 1
% 225.51/201.54 #Chain : 0
% 225.51/201.54 #Close : 0
% 225.51/201.54
% 225.51/201.54 Ordering : LPO
% 225.51/201.54
% 225.51/201.54 Simplification rules
% 225.51/201.54 ----------------------
% 225.51/201.54 #Subsume : 2608
% 225.51/201.54 #Demod : 7756
% 225.51/201.54 #Tautology : 17163
% 225.51/201.54 #SimpNegUnit : 3
% 225.51/201.54 #BackRed : 1
% 225.51/201.54
% 225.51/201.54 #Partial instantiations: 0
% 225.51/201.54 #Strategies tried : 3
% 225.51/201.54
% 225.51/201.54 Timing (in seconds)
% 225.51/201.54 ----------------------
% 225.51/201.54 Preprocessing : 0.63
% 225.51/201.54 Parsing : 0.31
% 225.51/201.54 CNF conversion : 0.04
% 225.51/201.54 Main loop : 199.84
% 225.51/201.54 Inferencing : 20.34
% 225.51/201.54 Reduction : 11.30
% 225.51/201.54 Demodulation : 8.78
% 225.51/201.54 BG Simplification : 2.86
% 225.51/201.54 Subsumption : 162.36
% 225.51/201.54 Abstraction : 1.11
% 225.51/201.54 MUC search : 0.00
% 225.51/201.54 Cooper : 0.02
% 225.51/201.54 Total : 200.51
% 225.51/201.54 Index Insertion : 0.00
% 225.51/201.54 Index Deletion : 0.00
% 225.51/201.54 Index Matching : 0.00
% 225.51/201.54 BG Taut test : 0.00
%------------------------------------------------------------------------------