TSTP Solution File: DAT016_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT016_1 : TPTP v8.1.2. Bugfixed v5.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 : n023.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:58 EDT 2023
% Result : Theorem 2.74s 1.64s
% Output : CNFRefutation 2.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 11 ( 2 unt; 4 typ; 0 def)
% Number of atoms : 17 ( 6 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 15 ( 5 ~; 7 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number arithmetic : 47 ( 10 atm; 8 fun; 23 num; 6 var)
% Number of types : 2 ( 1 usr; 1 ari)
% Number of type conns : 5 ( 2 >; 3 *; 0 +; 0 <<)
% Number of predicates : 4 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 3 usr; 7 con; 0-3 aty)
% Number of variables : 7 (; 6 !; 1 ?; 7 :)
% Comments :
%------------------------------------------------------------------------------
%$ write > read > #nlpp > #skF_1
%Foreground sorts:
tff(array,type,
array: $tType ).
%Background operators:
%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_77,negated_conjecture,
~ ! [U: array] :
( ! [Va: $int] :
( ( $lesseq(20,Va)
& $lesseq(Va,30) )
=> ( read(U,Va) = $sum($product(2,Va),3) ) )
=> ? [Wa: $int] : ( read(U,Wa) = 53 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
tff(c_6,plain,
! [V_10a: $int] :
( ( read('#skF_1',V_10a) = $sum($product(2,V_10a),3) )
| ~ $lesseq(20,V_10a)
| ~ $lesseq(V_10a,30) ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_46,plain,
! [V_20a: $int] :
( ( read('#skF_1',V_20a) = $sum(3,$product(2,V_20a)) )
| $less(V_20a,20)
| $less(30,V_20a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_9,plain,
! [W_11a: $int] : ( read('#skF_1',W_11a) != 53 ),
inference(cnfTransformation,[status(thm)],[f_77]) ).
tff(c_51,plain,
! [V_20a: $int] :
( ( $sum(3,$product(2,V_20a)) != 53 )
| $less(V_20a,20)
| $less(30,V_20a) ),
inference(superposition,[status(thm),theory(equality)],[c_46,c_9]) ).
tff(c_58,plain,
( $less(25,20)
| $less(30,25) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_51]) ).
tff(c_61,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : DAT016_1 : TPTP v8.1.2. Bugfixed v5.1.0.
% 0.14/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.35 % Computer : n023.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:07 EDT 2023
% 0.15/0.35 % CPUTime :
% 2.74/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.64
% 2.74/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.82/1.67
% 2.82/1.67 Inference rules
% 2.82/1.67 ----------------------
% 2.82/1.67 #Ref : 0
% 2.82/1.67 #Sup : 9
% 2.82/1.67 #Fact : 0
% 2.82/1.67 #Define : 0
% 2.82/1.67 #Split : 0
% 2.82/1.67 #Chain : 0
% 2.82/1.67 #Close : 0
% 2.82/1.67
% 2.82/1.67 Ordering : LPO
% 2.82/1.67
% 2.82/1.67 Simplification rules
% 2.82/1.67 ----------------------
% 2.82/1.67 #Subsume : 0
% 2.82/1.67 #Demod : 0
% 2.82/1.67 #Tautology : 7
% 2.82/1.67 #SimpNegUnit : 0
% 2.82/1.67 #BackRed : 0
% 2.82/1.67
% 2.82/1.67 #Partial instantiations: 0
% 2.82/1.67 #Strategies tried : 1
% 2.82/1.67
% 2.82/1.67 Timing (in seconds)
% 2.82/1.67 ----------------------
% 2.82/1.67 Preprocessing : 0.48
% 2.82/1.67 Parsing : 0.26
% 2.82/1.67 CNF conversion : 0.02
% 2.82/1.67 Main loop : 0.14
% 2.82/1.67 Inferencing : 0.06
% 2.82/1.67 Reduction : 0.03
% 2.82/1.67 Demodulation : 0.02
% 2.82/1.67 BG Simplification : 0.03
% 2.82/1.67 Subsumption : 0.03
% 2.82/1.67 Abstraction : 0.00
% 2.82/1.67 MUC search : 0.00
% 2.82/1.67 Cooper : 0.00
% 2.82/1.67 Total : 0.66
% 2.82/1.67 Index Insertion : 0.00
% 2.82/1.67 Index Deletion : 0.00
% 2.82/1.67 Index Matching : 0.00
% 2.82/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------