TSTP Solution File: DAT013_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT013_1 : TPTP v8.1.2. Released v5.0.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 : n003.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:36:57 EDT 2023
% Result : Theorem 3.06s 1.82s
% Output : CNFRefutation 3.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 9
% Syntax : Number of formulae : 25 ( 12 unt; 8 typ; 0 def)
% Number of atoms : 29 ( 2 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 21 ( 9 ~; 7 |; 2 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number arithmetic : 47 ( 26 atm; 3 fun; 12 num; 6 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 7 usr; 7 con; 0-3 aty)
% Number of variables : 7 (; 7 !; 0 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_4',type,
'#skF_4': $int ).
tff('#skF_2',type,
'#skF_2': $int ).
tff('#skF_3',type,
'#skF_3': $int ).
%Foreground operators:
tff(write,type,
write: ( array * $int * $int ) > array ).
tff('#skF_1',type,
'#skF_1': array ).
tff(read,type,
read: ( array * $int ) > $int ).
tff(f_80,negated_conjecture,
~ ! [U: array,Va: $int,Wa: $int] :
( ! [Xa: $int] :
( ( $lesseq(Va,Xa)
& $lesseq(Xa,Wa) )
=> $greater(read(U,Xa),0) )
=> ! [Ya: $int] :
( ( $lesseq($sum(Va,3),Ya)
& $lesseq(Ya,Wa) )
=> $greater(read(U,Ya),0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_7,plain,
$lesseq('#skF_4','#skF_3'),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_15,plain,
~ $less('#skF_3','#skF_4'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_5,plain,
~ $greater(read('#skF_1','#skF_4'),0),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_19,plain,
~ $less(0,read('#skF_1','#skF_4')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_24,plain,
read('#skF_1','#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_23,plain,
~ $less(0,read('#skF_1','#skF_4')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_31,plain,
~ $less(0,'#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_23]) ).
tff(c_30,plain,
read('#skF_1','#skF_4') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_19]) ).
tff(c_11,plain,
! [X_10a: $int] :
( $greater(read('#skF_1',X_10a),0)
| ~ $lesseq('#skF_2',X_10a)
| ~ $lesseq(X_10a,'#skF_3') ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_80,plain,
! [X_23a: $int] :
( $less(0,read('#skF_1',X_23a))
| $less(X_23a,'#skF_2')
| $less('#skF_3',X_23a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_11]) ).
tff(c_83,plain,
( $less(0,'#skE_1')
| $less('#skF_4','#skF_2')
| $less('#skF_3','#skF_4') ),
inference(superposition,[status(thm),theory(equality)],[c_30,c_80]) ).
tff(c_87,plain,
( $less('#skF_4','#skF_2')
| $less('#skF_3','#skF_4') ),
inference(negUnitSimplification,[status(thm)],[c_31,c_83]) ).
tff(c_89,plain,
$less('#skF_4','#skF_2'),
inference(negUnitSimplification,[status(thm)],[c_15,c_87]) ).
tff(c_9,plain,
$lesseq($sum('#skF_2',3),'#skF_4'),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_14,plain,
~ $less('#skF_4',$sum(3,'#skF_2')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_90,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_89,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.14 % Problem : DAT013_1 : TPTP v8.1.2. Released v5.0.0.
% 0.12/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 : n003.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:14:53 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.06/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.06/1.82
% 3.06/1.82 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.13/1.85
% 3.13/1.85 Inference rules
% 3.13/1.85 ----------------------
% 3.13/1.85 #Ref : 0
% 3.13/1.85 #Sup : 9
% 3.13/1.85 #Fact : 0
% 3.13/1.85 #Define : 1
% 3.13/1.85 #Split : 0
% 3.13/1.85 #Chain : 0
% 3.13/1.85 #Close : 1
% 3.13/1.85
% 3.13/1.85 Ordering : LPO
% 3.13/1.85
% 3.13/1.85 Simplification rules
% 3.13/1.85 ----------------------
% 3.13/1.85 #Subsume : 0
% 3.13/1.85 #Demod : 1
% 3.13/1.85 #Tautology : 8
% 3.13/1.85 #SimpNegUnit : 2
% 3.13/1.85 #BackRed : 0
% 3.13/1.85
% 3.13/1.85 #Partial instantiations: 0
% 3.13/1.85 #Strategies tried : 1
% 3.13/1.85
% 3.13/1.85 Timing (in seconds)
% 3.13/1.85 ----------------------
% 3.13/1.85 Preprocessing : 0.52
% 3.13/1.85 Parsing : 0.27
% 3.13/1.86 CNF conversion : 0.03
% 3.13/1.86 Main loop : 0.18
% 3.13/1.86 Inferencing : 0.05
% 3.13/1.86 Reduction : 0.03
% 3.13/1.86 Demodulation : 0.02
% 3.13/1.86 BG Simplification : 0.03
% 3.13/1.86 Subsumption : 0.03
% 3.13/1.86 Abstraction : 0.01
% 3.13/1.86 MUC search : 0.00
% 3.13/1.86 Cooper : 0.03
% 3.13/1.86 Total : 0.75
% 3.13/1.86 Index Insertion : 0.00
% 3.13/1.86 Index Deletion : 0.00
% 3.13/1.86 Index Matching : 0.00
% 3.13/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------