TSTP Solution File: DAT071_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT071_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 : 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 : Tue Aug 22 10:37:05 EDT 2023
% Result : Theorem 3.69s 2.09s
% Output : CNFRefutation 3.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 24
% Syntax : Number of formulae : 46 ( 14 unt; 23 typ; 0 def)
% Number of atoms : 49 ( 6 equ)
% Maximal formula atoms : 13 ( 2 avg)
% Number of connectives : 46 ( 20 ~; 14 |; 9 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 69 ( 42 atm; 0 fun; 16 num; 11 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 : 20 ( 19 usr; 7 con; 0-3 aty)
% Number of variables : 12 (; 10 !; 2 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
%$ inRange > sorted > distinct > write > rev > read > max > #nlpp > init > #skF_5 > #skF_4 > #skF_8 > #skF_1 > #skF_9 > #skF_6 > #skF_3 > #skF_7 > #skF_2
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skF_13',type,
'#skF_13': $int ).
tff('#skF_14',type,
'#skF_14': $int ).
tff('#skF_11',type,
'#skF_11': $int ).
tff('#skF_10',type,
'#skF_10': $int ).
tff('#skF_12',type,
'#skF_12': $int ).
%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_9',type,
'#skF_9': array ).
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_149,negated_conjecture,
~ ! [A: array,Na: $int,W1a: $int,W2a: $int] :
( ( ! [Ia: $int] :
( ( $greater(Na,Ia)
& $greatereq(Ia,0) )
=> $lesseq(read(A,Ia),W1a) )
& ? [Ia: $int] :
( $greater(Na,Ia)
& $greatereq(Ia,0)
& ( read(A,Ia) = W1a ) )
& ! [Ia: $int] :
( ( $greater(Na,Ia)
& $greatereq(Ia,0) )
=> $lesseq(read(A,Ia),W2a) )
& ? [Ia: $int] :
( $greater(Na,Ia)
& $greatereq(Ia,0)
& ( read(A,Ia) = W2a ) ) )
=> ( W1a = W2a ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',c) ).
tff(c_82,plain,
$greatereq('#skF_13',0),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_93,plain,
~ $less('#skF_13',0),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_82]) ).
tff(c_84,plain,
$greater('#skF_10','#skF_13'),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_92,plain,
$less('#skF_13','#skF_10'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_84]) ).
tff(c_97,plain,
read('#skF_9','#skF_13') = '#skF_11',
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_78,plain,
! [I_50a: $int] :
( $lesseq(read('#skF_9',I_50a),'#skF_12')
| ~ $greater('#skF_10',I_50a)
| ~ $greatereq(I_50a,0) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_264,plain,
! [I_101a: $int] :
( ~ $less('#skF_12',read('#skF_9',I_101a))
| ~ $less(I_101a,'#skF_10')
| $less(I_101a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_78]) ).
tff(c_267,plain,
( ~ $less('#skF_12','#skF_11')
| ~ $less('#skF_13','#skF_10')
| $less('#skF_13',0) ),
inference(superposition,[status(thm),theory(equality)],[c_97,c_264]) ).
tff(c_273,plain,
( ~ $less('#skF_12','#skF_11')
| $less('#skF_13',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_92,c_267]) ).
tff(c_275,plain,
~ $less('#skF_12','#skF_11'),
inference(negUnitSimplification,[status(thm)],[c_93,c_273]) ).
tff(c_74,plain,
$greatereq('#skF_14',0),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_103,plain,
~ $less('#skF_14',0),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_74]) ).
tff(c_76,plain,
$greater('#skF_10','#skF_14'),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_102,plain,
$less('#skF_14','#skF_10'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_76]) ).
tff(c_107,plain,
read('#skF_9','#skF_14') = '#skF_12',
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_86,plain,
! [I_49a: $int] :
( $lesseq(read('#skF_9',I_49a),'#skF_11')
| ~ $greater('#skF_10',I_49a)
| ~ $greatereq(I_49a,0) ),
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_215,plain,
! [I_83a: $int] :
( ~ $less('#skF_11',read('#skF_9',I_83a))
| ~ $less(I_83a,'#skF_10')
| $less(I_83a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_86]) ).
tff(c_221,plain,
( ~ $less('#skF_11','#skF_12')
| ~ $less('#skF_14','#skF_10')
| $less('#skF_14',0) ),
inference(superposition,[status(thm),theory(equality)],[c_107,c_215]) ).
tff(c_230,plain,
( ~ $less('#skF_11','#skF_12')
| $less('#skF_14',0) ),
inference(demodulation,[status(thm),theory(equality)],[c_102,c_221]) ).
tff(c_232,plain,
~ $less('#skF_11','#skF_12'),
inference(negUnitSimplification,[status(thm)],[c_103,c_230]) ).
tff(c_108,plain,
'#skF_12' != '#skF_11',
inference(cnfTransformation,[status(thm)],[f_149]) ).
tff(c_282,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_275,c_232,c_108]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : DAT071_1 : TPTP v8.1.2. Released v6.1.0.
% 0.00/0.14 % 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 : n020.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:13:07 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.69/2.09 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.69/2.10
% 3.69/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.69/2.13
% 3.69/2.13 Inference rules
% 3.69/2.13 ----------------------
% 3.69/2.13 #Ref : 1
% 3.69/2.13 #Sup : 18
% 3.69/2.13 #Fact : 0
% 3.69/2.13 #Define : 0
% 3.69/2.13 #Split : 0
% 3.69/2.13 #Chain : 0
% 3.69/2.13 #Close : 1
% 3.69/2.13
% 3.69/2.13 Ordering : LPO
% 3.69/2.13
% 3.69/2.13 Simplification rules
% 3.69/2.13 ----------------------
% 3.69/2.13 #Subsume : 1
% 3.69/2.13 #Demod : 4
% 3.69/2.13 #Tautology : 15
% 3.69/2.13 #SimpNegUnit : 6
% 3.69/2.13 #BackRed : 0
% 3.69/2.13
% 3.69/2.13 #Partial instantiations: 0
% 3.69/2.13 #Strategies tried : 1
% 3.69/2.13
% 3.69/2.13 Timing (in seconds)
% 3.69/2.13 ----------------------
% 3.69/2.13 Preprocessing : 0.73
% 3.69/2.13 Parsing : 0.38
% 3.69/2.13 CNF conversion : 0.05
% 3.69/2.13 Main loop : 0.32
% 3.69/2.13 Inferencing : 0.09
% 3.69/2.13 Reduction : 0.09
% 3.69/2.13 Demodulation : 0.06
% 3.69/2.13 BG Simplification : 0.07
% 3.69/2.13 Subsumption : 0.06
% 3.69/2.13 Abstraction : 0.01
% 3.69/2.13 MUC search : 0.01
% 3.69/2.13 Cooper : 0.04
% 3.69/2.13 Total : 1.09
% 3.69/2.13 Index Insertion : 0.00
% 3.69/2.13 Index Deletion : 0.00
% 3.69/2.13 Index Matching : 0.00
% 3.69/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------