TSTP Solution File: DAT014_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT014_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/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 : n002.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.35s 1.83s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 36 ( 21 unt; 6 typ; 0 def)
% Number of atoms : 52 ( 2 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 33 ( 11 ~; 14 |; 4 &)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 97 ( 45 atm; 6 fun; 39 num; 7 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 : 14 ( 5 usr; 10 con; 0-3 aty)
% Number of variables : 8 (; 8 !; 0 ?; 8 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skF_2',type,
'#skF_2': $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_87,negated_conjecture,
~ ! [U: array] :
( ( ! [Va: $int] :
( ( $lesseq(1,Va)
& $lesseq(Va,10) )
=> $greater(read(U,Va),Va) )
& ! [Wa: $int] :
( ( $lesseq(11,Wa)
& $lesseq(Wa,20) )
=> $greater(read(U,Wa),$difference(20,Wa)) ) )
=> ! [Xa: $int] :
( ( $lesseq(6,Xa)
& $lesseq(Xa,15) )
=> $greater(read(U,Xa),5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(c_5,plain,
~ $greater(read('#skF_1','#skF_2'),5),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_22,plain,
~ $less(5,read('#skF_1','#skF_2')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_33,plain,
read('#skF_1','#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_22]) ).
tff(c_11,plain,
! [W_12a: $int] :
( $greater(read('#skF_1',W_12a),$difference(20,W_12a))
| ~ $lesseq(11,W_12a)
| ~ $lesseq(W_12a,20) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_91,plain,
! [W_26a: $int] :
( $less(20,$sum(W_26a,read('#skF_1',W_26a)))
| $less(W_26a,11)
| $less(20,W_26a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_11]) ).
tff(c_96,plain,
( $less(20,$sum('#skF_2','#skE_1'))
| $less('#skF_2',11)
| $less(20,'#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_33,c_91]) ).
tff(c_98,plain,
$less(20,'#skF_2'),
inference(splitLeft,[status(thm)],[c_96]) ).
tff(c_7,plain,
$lesseq('#skF_2',15),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_18,plain,
~ $less(15,'#skF_2'),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_7]) ).
tff(c_99,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_98,c_18]) ).
tff(c_102,plain,
( $less('#skF_2',11)
| $less(20,$sum('#skF_2','#skE_1')) ),
inference(splitRight,[status(thm)],[c_96]) ).
tff(c_105,plain,
$less(20,$sum('#skF_2','#skE_1')),
inference(splitLeft,[status(thm)],[c_102]) ).
tff(c_27,plain,
read('#skF_1','#skF_2') = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_22]) ).
tff(c_26,plain,
~ $less(5,read('#skF_1','#skF_2')),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_34,plain,
~ $less(5,'#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_27,c_26]) ).
tff(c_106,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_105,c_34,c_18]) ).
tff(c_109,plain,
$less('#skF_2',11),
inference(splitRight,[status(thm)],[c_102]) ).
tff(c_13,plain,
! [V_11a: $int] :
( $greater(read('#skF_1',V_11a),V_11a)
| ~ $lesseq(1,V_11a)
| ~ $lesseq(V_11a,10) ),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_83,plain,
! [V_25a: $int] :
( $less(V_25a,read('#skF_1',V_25a))
| $less(V_25a,1)
| $less(10,V_25a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_13]) ).
tff(c_88,plain,
( $less('#skF_2','#skE_1')
| $less('#skF_2',1)
| $less(10,'#skF_2') ),
inference(superposition,[status(thm),theory(equality)],[c_33,c_83]) ).
tff(c_90,plain,
$less(10,'#skF_2'),
inference(splitLeft,[status(thm)],[c_88]) ).
tff(c_111,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_109,c_90]) ).
tff(c_114,plain,
( $less('#skF_2',1)
| $less('#skF_2','#skE_1') ),
inference(splitRight,[status(thm)],[c_88]) ).
tff(c_117,plain,
$less('#skF_2','#skE_1'),
inference(splitLeft,[status(thm)],[c_114]) ).
tff(c_9,plain,
$lesseq(6,'#skF_2'),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_17,plain,
~ $less('#skF_2',6),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_124,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_117,c_34,c_17]) ).
tff(c_127,plain,
$less('#skF_2',1),
inference(splitRight,[status(thm)],[c_114]) ).
tff(c_129,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_127,c_17]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : DAT014_1 : TPTP v8.1.2. Released v5.0.0.
% 0.00/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.15/0.35 % Computer : n002.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu Aug 3 13:28:01 EDT 2023
% 0.15/0.35 % CPUTime :
% 3.35/1.83 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.35/1.83
% 3.35/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.35/1.87
% 3.35/1.87 Inference rules
% 3.35/1.87 ----------------------
% 3.35/1.87 #Ref : 0
% 3.35/1.87 #Sup : 11
% 3.35/1.87 #Fact : 0
% 3.35/1.87 #Define : 1
% 3.35/1.87 #Split : 4
% 3.35/1.87 #Chain : 0
% 3.35/1.87 #Close : 5
% 3.35/1.87
% 3.35/1.87 Ordering : LPO
% 3.35/1.87
% 3.35/1.87 Simplification rules
% 3.35/1.87 ----------------------
% 3.35/1.87 #Subsume : 0
% 3.35/1.87 #Demod : 1
% 3.35/1.87 #Tautology : 8
% 3.35/1.87 #SimpNegUnit : 0
% 3.35/1.87 #BackRed : 0
% 3.35/1.87
% 3.35/1.87 #Partial instantiations: 0
% 3.35/1.87 #Strategies tried : 1
% 3.35/1.87
% 3.35/1.87 Timing (in seconds)
% 3.35/1.87 ----------------------
% 3.35/1.87 Preprocessing : 0.53
% 3.35/1.87 Parsing : 0.27
% 3.35/1.87 CNF conversion : 0.03
% 3.35/1.87 Main loop : 0.25
% 3.35/1.87 Inferencing : 0.06
% 3.35/1.87 Reduction : 0.05
% 3.35/1.87 Demodulation : 0.03
% 3.35/1.87 BG Simplification : 0.04
% 3.35/1.87 Subsumption : 0.04
% 3.35/1.87 Abstraction : 0.01
% 3.35/1.88 MUC search : 0.02
% 3.35/1.88 Cooper : 0.06
% 3.35/1.88 Total : 0.84
% 3.35/1.88 Index Insertion : 0.00
% 3.35/1.88 Index Deletion : 0.00
% 3.35/1.88 Index Matching : 0.00
% 3.35/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------