TSTP Solution File: ARI648_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI648_1 : TPTP v8.1.2. Released v6.3.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:34:11 EDT 2023
% Result : Theorem 2.74s 1.74s
% Output : CNFRefutation 2.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 14 ( 8 unt; 2 typ; 0 def)
% Number of atoms : 17 ( 1 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 8 ( 3 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 70 ( 14 atm; 26 fun; 30 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 15 ( 2 usr; 11 con; 0-2 aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(b,type,
b: $int ).
tff(a,type,
a: $int ).
%Foreground operators:
tff(f_32,axiom,
( $greater(8,$difference($product(2,a),$product(4,b)))
| $less(0,$product(2,a)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_38,negated_conjecture,
~ ( ( $sum($product(20,a),$product($uminus(1),$product(30,b))) = 7 )
| $greatereq(3,$sum(a,$product($uminus(1),$product(2,b))))
| $lesseq(1,a) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_001) ).
tff(c_1,plain,
( $greater(8,$difference($product(2,a),$product(4,b)))
| $less(0,$product(2,a)) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_12,plain,
( $less(a,$sum(4,$product(2,b)))
| $less(0,a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_1]) ).
tff(c_14,plain,
$less(0,a),
inference(splitLeft,[status(thm)],[c_12]) ).
tff(c_3,plain,
~ $lesseq(1,a),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_11,plain,
$less(a,1),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_15,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_14,c_11]) ).
tff(c_18,plain,
$less(a,$sum(4,$product(2,b))),
inference(splitRight,[status(thm)],[c_12]) ).
tff(c_5,plain,
~ $greatereq(3,$sum(a,$product($uminus(2),b))),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_10,plain,
$less($sum(3,$product(2,b)),a),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_5]) ).
tff(c_20,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_18,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : ARI648_1 : TPTP v8.1.2. Released v6.3.0.
% 0.07/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.13/0.35 % Computer : n023.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri Aug 4 00:27:07 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.74/1.74 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.74/1.75
% 2.74/1.75 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.86/1.78
% 2.86/1.78 Inference rules
% 2.86/1.78 ----------------------
% 2.86/1.78 #Ref : 0
% 2.86/1.78 #Sup : 0
% 2.86/1.78 #Fact : 0
% 2.86/1.78 #Define : 0
% 2.86/1.78 #Split : 1
% 2.86/1.78 #Chain : 0
% 2.86/1.78 #Close : 2
% 2.86/1.78
% 2.86/1.78 Ordering : LPO
% 2.86/1.78
% 2.86/1.78 Simplification rules
% 2.86/1.78 ----------------------
% 2.86/1.78 #Subsume : 0
% 2.86/1.78 #Demod : 0
% 2.86/1.78 #Tautology : 0
% 2.86/1.78 #SimpNegUnit : 0
% 2.86/1.78 #BackRed : 0
% 2.86/1.78
% 2.86/1.78 #Partial instantiations: 0
% 2.86/1.78 #Strategies tried : 1
% 2.86/1.78
% 2.86/1.78 Timing (in seconds)
% 2.86/1.78 ----------------------
% 2.86/1.78 Preprocessing : 0.48
% 2.86/1.78 Parsing : 0.27
% 2.86/1.78 CNF conversion : 0.02
% 2.86/1.78 Main loop : 0.12
% 2.86/1.79 Inferencing : 0.00
% 2.86/1.79 Reduction : 0.02
% 2.86/1.79 Demodulation : 0.02
% 2.86/1.79 BG Simplification : 0.03
% 2.86/1.79 Subsumption : 0.02
% 2.86/1.79 Abstraction : 0.00
% 2.86/1.79 MUC search : 0.01
% 2.86/1.79 Cooper : 0.04
% 2.86/1.79 Total : 0.65
% 2.86/1.79 Index Insertion : 0.00
% 2.86/1.79 Index Deletion : 0.00
% 2.86/1.79 Index Matching : 0.00
% 2.86/1.79 BG Taut test : 0.00
%------------------------------------------------------------------------------