TSTP Solution File: ARI698_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ARI698_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 : n025.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 5.81s 2.64s
% Output : CNFRefutation 5.81s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 118 ( 96 unt; 7 typ; 0 def)
% Number of atoms : 144 ( 122 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 76 ( 43 ~; 26 |; 6 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number arithmetic : 487 ( 16 atm; 269 fun; 180 num; 22 var)
% Number of types : 1 ( 0 usr; 1 ari)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 17 ( 7 usr; 13 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 22 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp
%Foreground sorts:
%Background operators:
tff(n,type,
n: $int ).
tff(x3,type,
x3: $int ).
tff(x5,type,
x5: $int ).
tff(x6,type,
x6: $int ).
tff(x2,type,
x2: $int ).
tff(x1,type,
x1: $int ).
tff(x4,type,
x4: $int ).
%Foreground operators:
tff(f_52,negated_conjecture,
~ ( ( x6 = 0 )
& ( x5 = 0 )
& ( x4 = 0 )
& ( x3 = 0 )
& ( x2 = 0 )
& ( x1 = 0 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_30,axiom,
n = 1000,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq1) ).
tff(f_40,axiom,
$difference($sum($sum($sum($sum($product(n,x6),$product(0,x5)),$product(0,x4)),$product(0,x3)),$product(0,x2)),x1) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq11) ).
tff(f_39,axiom,
$sum($difference($sum($sum($sum($product(n,x6),$product(0,x5)),$product(0,x4)),$product(0,x3)),x2),$product(1,x1)) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq10) ).
tff(f_38,axiom,
$sum($sum($sum($sum($sum($product(n,x6),$product(0,x5)),$product(0,x4)),$product(0,x3)),$product(1,x2)),$product(1,x1)) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq9) ).
tff(f_310,axiom,
! [A: $int,B: $int] :
( ( $less(0,A)
& $less(0,B) )
=> $less(0,$product(A,B)) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_nonneg_nonneg) ).
tff(f_285,axiom,
! [A: $int,B: $int] : ( $product(A,B) = $product(B,A) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_comm) ).
tff(f_293,axiom,
! [A: $int,B: $int] : ( $uminus($product(A,B)) = $product($uminus(A),B) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',minus_mult_left) ).
tff(f_282,axiom,
! [M: $int,N: $int] : ( $product($sum(1,M),N) = $sum(N,$product(M,N)) ),
file('/export/starexec/sandbox2/solver/bin/lemmas/mult_lemmas.p',mult_def_2) ).
tff(f_36,axiom,
$difference($difference($difference($sum($sum($product(n,x6),$product(0,x5)),$product(0,x4)),x3),x2),x1) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq7) ).
tff(f_32,axiom,
$difference($difference($difference($difference($difference($product(n,x6),x5),x4),x3),x2),x1) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq3) ).
tff(f_33,axiom,
$difference($difference($difference($difference($sum($product(n,x6),$product(1,x5)),x4),x3),x2),x1) = 0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eq4) ).
tff(c_56,plain,
( ( x6 != 0 )
| ( x5 != 0 )
| ( x4 != 0 )
| ( x3 != 0 )
| ( x2 != 0 )
| ( x1 != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_220,plain,
x1 != 0,
inference(splitLeft,[status(thm)],[c_56]) ).
tff(c_104,plain,
n = 1000,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_30,plain,
$difference($product(n,x6),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_60,plain,
$product(n,x6) = x1,
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_30]) ).
tff(c_141,plain,
$product(1000,x6) = x1,
inference(demodulation,[status(thm),theory(equality)],[c_104,c_60]) ).
tff(c_27,plain,
$sum($sum($uminus(x2),$product(n,x6)),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_64,plain,
$product(n,x6) = $sum($uminus(x1),x2),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_27]) ).
tff(c_144,plain,
$product(1000,x6) = $sum($uminus(x1),x2),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_64]) ).
tff(c_359,plain,
$product(1000,x6) = $sum(x2,$uminus(x1)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_144]) ).
tff(c_487,plain,
$sum(x2,$uminus(x1)) = x1,
inference(superposition,[status(thm),theory(equality)],[c_141,c_359]) ).
tff(c_489,plain,
x2 = $product(2,x1),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_487]) ).
tff(c_24,plain,
$sum($sum(x2,$product(n,x6)),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_68,plain,
$product(n,x6) = $sum($uminus(x1),$uminus(x2)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_24]) ).
tff(c_150,plain,
$product(1000,x6) = $sum($uminus(x1),$uminus(x2)),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_68]) ).
tff(c_153,plain,
$product(1000,x6) = $sum($uminus(x2),$uminus(x1)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_150]) ).
tff(c_673,plain,
$product(1000,x6) = $sum($uminus($product(2,x1)),$uminus(x1)),
inference(demodulation,[status(thm),theory(equality)],[c_489,c_153]) ).
tff(c_678,plain,
$product(1000,x6) = $product($uminus(3),x1),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_673]) ).
tff(c_762,plain,
$product($uminus(3),x1) = x1,
inference(superposition,[status(thm),theory(equality)],[c_678,c_141]) ).
tff(c_764,plain,
x1 = 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_762]) ).
tff(c_840,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_220,c_764]) ).
tff(c_844,plain,
x1 = 0,
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_853,plain,
$product(1000,x6) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_844,c_141]) ).
tff(c_105,plain,
! [A_27: $int,B_28: $int] :
( $less(0,$product(A_27,B_28))
| ~ $less(0,A_27)
| ~ $less(0,B_28) ),
inference(cnfTransformation,[status(thm)],[f_310]) ).
tff(c_959,plain,
( $less(0,0)
| ~ $less(0,1000)
| ~ $less(0,x6) ),
inference(superposition,[status(thm),theory(equality)],[c_853,c_105]) ).
tff(c_961,plain,
~ $less(0,x6),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_959]) ).
tff(c_114,plain,
! [B_7: $int,A_8: $int] : ( $product(B_7,A_8) = $product(A_8,B_7) ),
inference(cnfTransformation,[status(thm)],[f_285]) ).
tff(c_109,plain,
! [A_17: $int,B_18: $int,X_87: $int] :
( ( $uminus($product(A_17,B_18)) = $product(X_87,B_18) )
| ( X_87 != $uminus(A_17) ) ),
inference(cnfTransformation,[status(thm)],[f_293]) ).
tff(c_111,plain,
! [X_87: $int,B_18: $int,A_17: $int] :
( ( $uminus($product(X_87,B_18)) = $product(A_17,B_18) )
| ( X_87 != $uminus(A_17) ) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_109]) ).
tff(c_116,plain,
! [X_89: $int,N_4: $int,M_3: $int] :
( ( $product(X_89,N_4) = $sum(N_4,$product(M_3,N_4)) )
| ( X_89 != $sum(1,M_3) ) ),
inference(cnfTransformation,[status(thm)],[f_282]) ).
tff(c_919,plain,
! [M_3: $int] :
( ( $sum(x6,$product(M_3,x6)) = 0 )
| ( $sum(1,M_3) != 1000 ) ),
inference(superposition,[status(thm),theory(equality)],[c_853,c_116]) ).
tff(c_988,plain,
$product(999,x6) = $uminus(x6),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_919]) ).
tff(c_1484,plain,
$product(x6,999) = $uminus(x6),
inference(superposition,[status(thm),theory(equality)],[c_114,c_988]) ).
tff(c_1560,plain,
$uminus($product($uminus(x6),999)) = $uminus(x6),
inference(superposition,[status(thm),theory(equality)],[c_111,c_1484]) ).
tff(c_1630,plain,
$uminus($product(999,$uminus(x6))) = $uminus(x6),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_1560]) ).
tff(c_1642,plain,
$product(999,$uminus(x6)) = x6,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1630]) ).
tff(c_1691,plain,
( $less(0,x6)
| ~ $less(0,999)
| ~ $less(0,$uminus(x6)) ),
inference(superposition,[status(thm),theory(equality)],[c_1642,c_105]) ).
tff(c_1770,plain,
( ~ $less(0,999)
| ~ $less(0,$uminus(x6)) ),
inference(negUnitSimplification,[status(thm)],[c_961,c_1691]) ).
tff(c_1772,plain,
~ $less(x6,0),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1770]) ).
tff(c_843,plain,
( ( x2 != 0 )
| ( x3 != 0 )
| ( x4 != 0 )
| ( x5 != 0 )
| ( x6 != 0 ) ),
inference(splitRight,[status(thm)],[c_56]) ).
tff(c_846,plain,
x6 != 0,
inference(splitLeft,[status(thm)],[c_843]) ).
tff(c_1802,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_1772,c_961,c_846]) ).
tff(c_1805,plain,
( ( x5 != 0 )
| ( x4 != 0 )
| ( x3 != 0 )
| ( x2 != 0 ) ),
inference(splitRight,[status(thm)],[c_843]) ).
tff(c_1808,plain,
x2 != 0,
inference(splitLeft,[status(thm)],[c_1805]) ).
tff(c_1806,plain,
x6 = 0,
inference(splitRight,[status(thm)],[c_843]) ).
tff(c_147,plain,
$product(1000,x6) = $sum(x2,$uminus(x1)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_144]) ).
tff(c_2285,plain,
$product(1000,0) = $sum(x2,$uminus(0)),
inference(demodulation,[status(thm),theory(equality)],[c_1806,c_844,c_147]) ).
tff(c_2287,plain,
$product(1000,0) = x2,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_2285]) ).
tff(c_1810,plain,
$product(1000,0) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_1806,c_844,c_141]) ).
tff(c_2289,plain,
x2 = 0,
inference(superposition,[status(thm),theory(equality)],[c_2287,c_1810]) ).
tff(c_2345,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1808,c_2289]) ).
tff(c_2349,plain,
x2 = 0,
inference(splitRight,[status(thm)],[c_1805]) ).
tff(c_18,plain,
$difference($sum($uminus(x2),$sum($uminus(x3),$product(n,x6))),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_75,plain,
$product(n,x6) = $sum(x3,$sum(x2,x1)),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_18]) ).
tff(c_78,plain,
$product(n,x6) = $sum(x1,$sum(x2,x3)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_75]) ).
tff(c_162,plain,
$product(1000,x6) = $sum(x1,$sum(x2,x3)),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_78]) ).
tff(c_165,plain,
$product(1000,x6) = $sum(x2,$sum(x3,x1)),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_162]) ).
tff(c_3023,plain,
$product(1000,0) = $sum(0,$sum(x3,0)),
inference(demodulation,[status(thm),theory(equality)],[c_2349,c_844,c_1806,c_165]) ).
tff(c_3025,plain,
$product(1000,0) = x3,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3023]) ).
tff(c_2353,plain,
$product(1000,0) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_844,c_1806,c_141]) ).
tff(c_3082,plain,
x3 = 0,
inference(superposition,[status(thm),theory(equality)],[c_3025,c_2353]) ).
tff(c_6,plain,
$difference($sum($uminus(x2),$sum($uminus(x3),$sum($uminus(x5),$sum($uminus(x4),$product(n,x6))))),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_95,plain,
$product(n,x6) = $sum(x5,$sum(x1,$sum(x4,$sum(x2,x3)))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_6]) ).
tff(c_98,plain,
$product(n,x6) = $sum(x2,$sum(x5,$sum(x3,$sum(x1,x4)))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_95]) ).
tff(c_186,plain,
$product(1000,x6) = $sum(x2,$sum(x5,$sum(x3,$sum(x1,x4)))),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_98]) ).
tff(c_189,plain,
$product(1000,x6) = $sum(x5,$sum(x1,$sum(x4,$sum(x3,x2)))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_186]) ).
tff(c_3541,plain,
$product(1000,0) = $sum(x5,$sum(0,$sum(x4,$sum(0,0)))),
inference(demodulation,[status(thm),theory(equality)],[c_3082,c_2349,c_844,c_1806,c_189]) ).
tff(c_3543,plain,
$product(1000,0) = $sum(x4,x5),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3541]) ).
tff(c_3545,plain,
$sum(x4,x5) = 0,
inference(superposition,[status(thm),theory(equality)],[c_3543,c_2353]) ).
tff(c_3601,plain,
x5 = $uminus(x4),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3545]) ).
tff(c_2348,plain,
( ( x3 != 0 )
| ( x4 != 0 )
| ( x5 != 0 ) ),
inference(splitRight,[status(thm)],[c_1805]) ).
tff(c_2351,plain,
x5 != 0,
inference(splitLeft,[status(thm)],[c_2348]) ).
tff(c_3664,plain,
$uminus(x4) != 0,
inference(demodulation,[status(thm),theory(equality)],[c_3601,c_2351]) ).
tff(c_3668,plain,
x4 != 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3664]) ).
tff(c_9,plain,
$difference($sum($uminus(x2),$sum($uminus(x3),$sum(x5,$sum($uminus(x4),$product(n,x6))))),x1) = 0,
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_90,plain,
$product(n,x6) = $sum($uminus(x5),$sum(x1,$sum(x4,$sum(x2,x3)))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_9]) ).
tff(c_93,plain,
$product(n,x6) = $sum(x2,$sum($uminus(x5),$sum(x3,$sum(x1,x4)))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_90]) ).
tff(c_180,plain,
$product(1000,x6) = $sum(x2,$sum($uminus(x5),$sum(x3,$sum(x1,x4)))),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_93]) ).
tff(c_183,plain,
$product(1000,x6) = $sum($uminus(x5),$sum(x1,$sum(x4,$sum(x3,x2)))),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_180]) ).
tff(c_3769,plain,
$product(1000,0) = $sum($uminus($uminus(x4)),$sum(0,$sum(x4,$sum(0,0)))),
inference(demodulation,[status(thm),theory(equality)],[c_3601,c_3082,c_2349,c_844,c_1806,c_183]) ).
tff(c_3771,plain,
$product(1000,0) = $product(2,x4),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3769]) ).
tff(c_3773,plain,
$product(2,x4) = 0,
inference(superposition,[status(thm),theory(equality)],[c_3771,c_2353]) ).
tff(c_3829,plain,
x4 = 0,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_3773]) ).
tff(c_3886,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3668,c_3829]) ).
tff(c_3889,plain,
( ( x4 != 0 )
| ( x3 != 0 ) ),
inference(splitRight,[status(thm)],[c_2348]) ).
tff(c_3892,plain,
x3 != 0,
inference(splitLeft,[status(thm)],[c_3889]) ).
tff(c_4470,plain,
$product(1000,0) = $sum(0,$sum(x3,0)),
inference(demodulation,[status(thm),theory(equality)],[c_844,c_1806,c_2349,c_165]) ).
tff(c_4472,plain,
$product(1000,0) = x3,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_4470]) ).
tff(c_3894,plain,
$product(1000,0) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_844,c_1806,c_141]) ).
tff(c_4474,plain,
x3 = 0,
inference(superposition,[status(thm),theory(equality)],[c_4472,c_3894]) ).
tff(c_4530,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_3892,c_4474]) ).
tff(c_4533,plain,
x4 != 0,
inference(splitRight,[status(thm)],[c_3889]) ).
tff(c_4534,plain,
x3 = 0,
inference(splitRight,[status(thm)],[c_3889]) ).
tff(c_3890,plain,
x5 = 0,
inference(splitRight,[status(thm)],[c_2348]) ).
tff(c_6080,plain,
$product(1000,0) = $sum(0,$sum(0,$sum(x4,$sum(0,0)))),
inference(demodulation,[status(thm),theory(equality)],[c_4534,c_844,c_1806,c_2349,c_3890,c_189]) ).
tff(c_6082,plain,
$product(1000,0) = x4,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_6080]) ).
tff(c_4536,plain,
$product(1000,0) = 0,
inference(demodulation,[status(thm),theory(equality)],[c_844,c_1806,c_141]) ).
tff(c_6084,plain,
x4 = 0,
inference(superposition,[status(thm),theory(equality)],[c_6082,c_4536]) ).
tff(c_6140,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_4533,c_6084]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : ARI698_1 : TPTP v8.1.2. Released v6.3.0.
% 0.00/0.10 % 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.09/0.29 % Computer : n025.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.30 % CPULimit : 300
% 0.09/0.30 % WCLimit : 300
% 0.09/0.30 % DateTime : Fri Aug 4 00:24:50 EDT 2023
% 0.09/0.30 % CPUTime :
% 5.81/2.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.81/2.66
% 5.81/2.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.81/2.73
% 5.81/2.73 Inference rules
% 5.81/2.73 ----------------------
% 5.81/2.73 #Ref : 0
% 5.81/2.73 #Sup : 1042
% 5.81/2.73 #Fact : 0
% 5.81/2.73 #Define : 0
% 5.81/2.73 #Split : 11
% 5.81/2.73 #Chain : 0
% 5.81/2.73 #Close : 1
% 5.81/2.73
% 5.81/2.73 Ordering : LPO
% 5.81/2.73
% 5.81/2.73 Simplification rules
% 5.81/2.73 ----------------------
% 5.81/2.73 #Subsume : 17
% 5.81/2.73 #Demod : 530
% 5.81/2.73 #Tautology : 605
% 5.81/2.73 #SimpNegUnit : 9
% 5.81/2.73 #BackRed : 6
% 5.81/2.73
% 5.81/2.73 #Partial instantiations: 0
% 5.81/2.73 #Strategies tried : 1
% 5.81/2.73
% 5.81/2.73 Timing (in seconds)
% 5.81/2.73 ----------------------
% 5.81/2.74 Preprocessing : 0.63
% 5.81/2.74 Parsing : 0.31
% 5.81/2.74 CNF conversion : 0.03
% 5.81/2.74 Main loop : 0.89
% 5.81/2.74 Inferencing : 0.19
% 5.81/2.74 Reduction : 0.29
% 5.81/2.74 Demodulation : 0.23
% 5.81/2.74 BG Simplification : 0.14
% 5.81/2.74 Subsumption : 0.16
% 5.81/2.74 Abstraction : 0.05
% 5.81/2.74 MUC search : 0.00
% 5.81/2.74 Cooper : 0.04
% 5.81/2.74 Total : 1.63
% 5.81/2.74 Index Insertion : 0.00
% 5.81/2.74 Index Deletion : 0.00
% 5.81/2.74 Index Matching : 0.00
% 5.81/2.74 BG Taut test : 0.00
%------------------------------------------------------------------------------