TSTP Solution File: ARI688_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI688_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 : n016.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:15 EDT 2023
% Result : Theorem 2.35s 1.54s
% Output : CNFRefutation 2.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of formulae : 11 ( 8 unt; 3 typ; 0 def)
% Number of atoms : 8 ( 7 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number arithmetic : 38 ( 0 atm; 22 fun; 16 num; 0 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 3 usr; 10 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 ).
tff(x,type,
x: $int ).
%Foreground operators:
tff(f_33,negated_conjecture,
$sum($product(8,x),$product($uminus(1),$difference($product(4353078,b),$product(287,a)))) != 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_30,axiom,
$product(98164184,x) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq1) ).
tff(f_31,axiom,
$product(6472,x) = b,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq2) ).
tff(c_3,plain,
$sum($product(8,x),$sum($product(287,a),$product($uminus(4353078),b))) != 0,
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_5,plain,
$product(8,x) != $sum($product($uminus(287),a),$product(4353078,b)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_3]) ).
tff(c_7,plain,
$product(98164184,x) = a,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_6,plain,
$product(6472,x) = b,
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_8,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_5,c_7,c_6]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : ARI688_1 : TPTP v8.1.2. Released v6.3.0.
% 0.00/0.13 % 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 : n016.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:37:53 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.35/1.54 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.35/1.54
% 2.35/1.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.35/1.57
% 2.35/1.57 Inference rules
% 2.35/1.57 ----------------------
% 2.35/1.57 #Ref : 0
% 2.35/1.57 #Sup : 0
% 2.35/1.57 #Fact : 0
% 2.35/1.57 #Define : 0
% 2.35/1.57 #Split : 0
% 2.35/1.57 #Chain : 0
% 2.35/1.57 #Close : 1
% 2.35/1.57
% 2.35/1.57 Ordering : LPO
% 2.35/1.57
% 2.35/1.57 Simplification rules
% 2.35/1.57 ----------------------
% 2.35/1.57 #Subsume : 0
% 2.35/1.57 #Demod : 0
% 2.35/1.57 #Tautology : 0
% 2.35/1.57 #SimpNegUnit : 0
% 2.35/1.57 #BackRed : 0
% 2.35/1.57
% 2.35/1.57 #Partial instantiations: 0
% 2.35/1.57 #Strategies tried : 1
% 2.35/1.57
% 2.35/1.57 Timing (in seconds)
% 2.35/1.57 ----------------------
% 2.35/1.58 Preprocessing : 0.41
% 2.35/1.58 Parsing : 0.23
% 2.35/1.58 CNF conversion : 0.01
% 2.35/1.58 Main loop : 0.09
% 2.35/1.58 Inferencing : 0.00
% 2.35/1.58 Reduction : 0.02
% 2.35/1.58 Demodulation : 0.01
% 2.35/1.58 BG Simplification : 0.02
% 2.35/1.58 Subsumption : 0.02
% 2.35/1.58 Abstraction : 0.00
% 2.35/1.58 MUC search : 0.01
% 2.35/1.58 Cooper : 0.03
% 2.35/1.58 Total : 0.55
% 2.35/1.58 Index Insertion : 0.00
% 2.35/1.58 Index Deletion : 0.00
% 2.35/1.58 Index Matching : 0.00
% 2.35/1.58 BG Taut test : 0.00
%------------------------------------------------------------------------------