TSTP Solution File: SWW663_2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWW663_2 : TPTP v8.1.2. Released v6.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 : n017.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 11:07:55 EDT 2023
% Result : Theorem 13.36s 4.07s
% Output : CNFRefutation 13.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 80
% Syntax : Number of formulae : 145 ( 47 unt; 71 typ; 0 def)
% Number of atoms : 111 ( 52 equ)
% Maximal formula atoms : 9 ( 1 avg)
% Number of connectives : 70 ( 33 ~; 23 |; 6 &)
% ( 1 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number arithmetic : 253 ( 32 atm; 73 fun; 110 num; 38 var)
% Number of types : 8 ( 6 usr; 1 ari)
% Number of type conns : 118 ( 43 >; 75 *; 0 +; 0 <<)
% Number of predicates : 8 ( 4 usr; 1 prp; 0-4 aty)
% Number of functors : 68 ( 61 usr; 25 con; 0-5 aty)
% Number of variables : 40 (; 39 !; 1 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
%$ phase11 > partial_sum1 > sort1 > is_power_of_21 > set > set2 > match_bool1 > get > sum3 > sum2 > mk_array1 > make1 > get2 > const > power1 > mod1 > map > length1 > go_right1 > go_left1 > elts > div1 > #nlpp > witness1 > tb2t2 > tb2t1 > tb2t > t2tb2 > t2tb1 > t2tb > array > abs1 > tuple03 > tuple0 > true1 > real > qtmark > int > false1 > bool > #skF_3 > #skF_10 > #skF_16 > #skF_14 > #skF_1 > #skF_9 > #skF_7 > #skF_2 > #skF_5 > #skF_8 > #skF_12 > #skF_6 > #skF_4 > #skF_11
%Foreground sorts:
tff(map_int_int,type,
map_int_int: $tType ).
tff(tuple02,type,
tuple02: $tType ).
tff(bool1,type,
bool1: $tType ).
tff(array_int,type,
array_int: $tType ).
tff(ty,type,
ty: $tType ).
tff(uni,type,
uni: $tType ).
%Background operators:
tff('#skE_7',type,
'#skE_7': $int ).
tff('#skF_13',type,
'#skF_13': $int ).
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_6',type,
'#skE_6': $int ).
tff('#skF_15',type,
'#skF_15': $int ).
tff('#skE_10',type,
'#skE_10': $int ).
tff('#skE_5',type,
'#skE_5': $int ).
tff('#skE_8',type,
'#skE_8': $int ).
tff('#skE_4',type,
'#skE_4': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
tff('#skE_9',type,
'#skE_9': $int ).
%Foreground operators:
tff(phase11,type,
phase11: ( $int * $int * array_int * array_int ) > $o ).
tff(tb2t1,type,
tb2t1: uni > map_int_int ).
tff(mod1,type,
mod1: ( $int * $int ) > $int ).
tff(length1,type,
length1: ( ty * uni ) > $int ).
tff(go_right1,type,
go_right1: ( $int * $int ) > $int ).
tff(div1,type,
div1: ( $int * $int ) > $int ).
tff(get2,type,
get2: ( ty * uni * $int ) > uni ).
tff(true1,type,
true1: bool1 ).
tff(go_left1,type,
go_left1: ( $int * $int ) > $int ).
tff(is_power_of_21,type,
is_power_of_21: $int > $o ).
tff('#skF_3',type,
'#skF_3': ( $int * $int * array_int * array_int ) > $int ).
tff(const,type,
const: ( ty * ty * uni ) > uni ).
tff('#skF_10',type,
'#skF_10': ( $int * array_int * array_int * array_int * $int ) > $int ).
tff(elts,type,
elts: ( ty * uni ) > uni ).
tff('#skF_16',type,
'#skF_16': map_int_int ).
tff(int,type,
int: ty ).
tff(partial_sum1,type,
partial_sum1: ( $int * $int * array_int * array_int ) > $o ).
tff(false1,type,
false1: bool1 ).
tff(tb2t,type,
tb2t: uni > $int ).
tff(tb2t2,type,
tb2t2: uni > array_int ).
tff(sort1,type,
sort1: ( ty * uni ) > $o ).
tff('#skF_14',type,
'#skF_14': map_int_int ).
tff(t2tb,type,
t2tb: $int > uni ).
tff(witness1,type,
witness1: ty > uni ).
tff(real,type,
real: ty ).
tff('#skF_1',type,
'#skF_1': ( map_int_int * map_int_int * $int * $int ) > $int ).
tff('#skF_9',type,
'#skF_9': ( $int * $int * array_int * array_int ) > array_int ).
tff(t2tb2,type,
t2tb2: array_int > uni ).
tff(set,type,
set: ( ty * ty * uni * uni * uni ) > uni ).
tff(match_bool1,type,
match_bool1: ( ty * bool1 * uni * uni ) > uni ).
tff(array,type,
array: ty > ty ).
tff(make1,type,
make1: ( ty * $int * uni ) > uni ).
tff('#skF_7',type,
'#skF_7': ( $int * $int * array_int * array_int ) > $int ).
tff('#skF_2',type,
'#skF_2': $int > $int ).
tff(tuple0,type,
tuple0: ty ).
tff('#skF_5',type,
'#skF_5': ( $int * $int * array_int * array_int ) > array_int ).
tff(qtmark,type,
qtmark: ty ).
tff(sum2,type,
sum2: ( map_int_int * $int * $int ) > $int ).
tff(bool,type,
bool: ty ).
tff(t2tb1,type,
t2tb1: map_int_int > uni ).
tff(get,type,
get: ( ty * ty * uni * uni ) > uni ).
tff(tuple03,type,
tuple03: tuple02 ).
tff('#skF_8',type,
'#skF_8': ( $int * $int * array_int * array_int ) > array_int ).
tff(power1,type,
power1: ( $int * $int ) > $int ).
tff(map,type,
map: ( ty * ty ) > ty ).
tff(set2,type,
set2: ( ty * uni * $int * uni ) > uni ).
tff('#skF_12',type,
'#skF_12': ( $int * $int * array_int * array_int ) > $int ).
tff('#skF_6',type,
'#skF_6': ( $int * $int * array_int * array_int ) > $int ).
tff(sum3,type,
sum3: ( array_int * $int * $int ) > $int ).
tff(mk_array1,type,
mk_array1: ( ty * $int * uni ) > uni ).
tff('#skF_4',type,
'#skF_4': ( $int * $int * array_int * array_int ) > array_int ).
tff('#skF_11',type,
'#skF_11': ( array_int * $int * array_int * array_int * $int ) > $int ).
tff(abs1,type,
abs1: $int > $int ).
tff(f_124,axiom,
! [Xa: $int] : ( div1(Xa,1) = Xa ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',div_1) ).
tff(f_76,axiom,
! [Xa: $int,Ya: $int] :
( ( Ya != 0 )
=> ( Xa = $sum($product(Ya,div1(Xa,Ya)),mod1(Xa,Ya)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',div_mod) ).
tff(f_126,axiom,
! [Xa: $int] : ( mod1(Xa,1) = 0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mod_1) ).
tff(f_4347,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_164,axiom,
! [Xa: $int,Na: $int] :
( $less(0,Na)
=> ( power1(Xa,Na) = $product(Xa,power1(Xa,$difference(Na,1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',power_s_alt) ).
tff(f_412,negated_conjecture,
~ ! [Aa: $int,A1: map_int_int] :
( ( $lesseq(0,Aa)
& $lesseq(2,Aa)
& is_power_of_21(Aa) )
=> ! [A0a: $int,A01: map_int_int] :
( ( $lesseq(0,A0a)
& ( A0a = Aa )
& ! [Ia: $int] :
( ( $lesseq(0,Ia)
& $less(Ia,A0a) )
=> ( tb2t(get(int,int,t2tb1(A01),t2tb(Ia))) = tb2t(get(int,int,t2tb1(A1),t2tb(Ia))) ) ) )
=> is_power_of_21($difference($difference(Aa,1),$difference(div1(Aa,2),1))) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wP_parameter_compute_sums) ).
tff(f_298,axiom,
! [Xa: $int] :
( is_power_of_21(Xa)
=> ( $less(1,Xa)
=> ( $product(2,div1(Xa,2)) = Xa ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_power_of_2_1) ).
tff(f_292,axiom,
! [Xa: $int] :
( is_power_of_21(Xa)
<=> ? [Ka: $int] :
( $lesseq(0,Ka)
& ( Xa = power1(2,Ka) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',is_power_of_2_def) ).
tff(f_156,axiom,
! [Xa: $int] : ( power1(Xa,0) = 1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',power_0) ).
tff(c_480,plain,
! [X_37a: $int] : ( div1(X_37a,1) = X_37a ),
inference(cnfTransformation,[status(thm)],[f_124]) ).
tff(c_30,plain,
! [Y_22a: $int,X_21a: $int] :
( ( $sum($product(Y_22a,div1(X_21a,Y_22a)),mod1(X_21a,Y_22a)) = X_21a )
| ( Y_22a = 0 ) ),
inference(cnfTransformation,[status(thm)],[f_76]) ).
tff(c_4234,plain,
! [X_1356a: $int,Y_1357a: $int] :
( ( mod1(X_1356a,Y_1357a) = $sum(X_1356a,$uminus($product(Y_1357a,div1(X_1356a,Y_1357a)))) )
| ( Y_1357a = 0 ) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_30]) ).
tff(c_479,plain,
! [X_38a: $int] : ( mod1(X_38a,1) = 0 ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_4262,plain,
! [X_1356a: $int] :
( ( $sum(X_1356a,$uminus($product(1,div1(X_1356a,1)))) = 0 )
| ( 1 = 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_4234,c_479]) ).
tff(c_4288,plain,
! [X_1356a: $int] :
( ( $sum(X_1356a,$uminus($product(1,X_1356a))) = 0 )
| ( 1 = 0 ) ),
inference(demodulation,[status(thm),theory(equality)],[c_480,c_4262]) ).
tff(c_4305,plain,
! [X_1358a: $int] : ( $product(1,X_1358a) = X_1358a ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_4288]) ).
tff(c_510,plain,
! [X_274: $int,N_213: $int,M_212: $int] :
( ( $product(X_274,N_213) = $sum(N_213,$product(M_212,N_213)) )
| ( X_274 != $sum(1,M_212) ) ),
inference(cnfTransformation,[status(thm)],[f_4347]) ).
tff(c_4398,plain,
! [X_1358a: $int] : ( $product($sum(1,1),X_1358a) = $sum(X_1358a,X_1358a) ),
inference(superposition,[status(thm),theory(equality)],[c_4305,c_510]) ).
tff(c_4400,plain,
! [X_1358a: $int] : ( $product(2,X_1358a) = $product(2,X_1358a) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_4398]) ).
tff(c_7721,plain,
! [X_1673a: $int,N_1674a: $int] :
( ( $product(X_1673a,power1(X_1673a,$sum($uminus(1),N_1674a))) = power1(X_1673a,N_1674a) )
| ~ $less(0,N_1674a) ),
inference(cnfTransformation,[status(thm)],[f_164]) ).
tff(c_292,plain,
~ is_power_of_21($difference($sum($uminus(1),'#skF_13'),$sum($uminus(1),div1('#skF_13',2)))),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_340,plain,
~ is_power_of_21($sum('#skF_13',$uminus(div1('#skF_13',2)))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_292]) ).
tff(c_711,plain,
div1('#skF_13',2) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_340]) ).
tff(c_333,plain,
is_power_of_21('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_1614,plain,
! [X_874a: $int] :
( ( $product(2,div1(X_874a,2)) = X_874a )
| ~ is_power_of_21(X_874a)
| ~ $less(1,X_874a) ),
inference(cnfTransformation,[status(thm)],[f_298]) ).
tff(c_1623,plain,
( ( $product(2,div1('#skF_13',2)) = '#skF_13' )
| ~ $less(1,'#skF_13') ),
inference(resolution,[status(thm)],[c_333,c_1614]) ).
tff(c_1632,plain,
( ( '#skF_13' = $product(2,'#skE_1') )
| ~ $less(1,'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_711,c_1623]) ).
tff(c_1646,plain,
~ $less(1,'#skF_13'),
inference(splitLeft,[status(thm)],[c_1632]) ).
tff(c_301,plain,
$lesseq(2,'#skF_13'),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_329,plain,
~ $less('#skF_13',2),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_301]) ).
tff(c_1647,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_1646,c_329]) ).
tff(c_1650,plain,
'#skF_13' = $product(2,'#skE_1'),
inference(splitRight,[status(thm)],[c_1632]) ).
tff(c_153,plain,
! [X_157a: $int] :
( $lesseq(0,'#skF_2'(X_157a))
| ~ is_power_of_21(X_157a) ),
inference(cnfTransformation,[status(thm)],[f_292]) ).
tff(c_761,plain,
! [X_478a: $int] :
( ~ $less('#skF_2'(X_478a),0)
| ~ is_power_of_21(X_478a) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_153]) ).
tff(c_767,plain,
~ $less('#skF_2'('#skF_13'),0),
inference(resolution,[status(thm)],[c_333,c_761]) ).
tff(c_779,plain,
'#skF_2'('#skF_13') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_767]) ).
tff(c_937,plain,
! [X_734a: $int] :
( ( power1(2,'#skF_2'(X_734a)) = X_734a )
| ~ is_power_of_21(X_734a) ),
inference(cnfTransformation,[status(thm)],[f_292]) ).
tff(c_946,plain,
power1(2,'#skF_2'('#skF_13')) = '#skF_13',
inference(resolution,[status(thm)],[c_333,c_937]) ).
tff(c_964,plain,
power1(2,'#skE_2') = '#skF_13',
inference(demodulation,[status(thm),theory(equality)],[c_779,c_946]) ).
tff(c_1698,plain,
power1(2,'#skE_2') = $product(2,'#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_1650,c_964]) ).
tff(c_7908,plain,
( ( $product(2,power1(2,$sum($uminus(1),'#skE_2'))) = $product(2,'#skE_1') )
| ~ $less(0,'#skE_2') ),
inference(superposition,[status(thm),theory(equality)],[c_7721,c_1698]) ).
tff(c_8148,plain,
power1(2,$sum($uminus(1),'#skE_2')) = '#skE_9',
inference(define,[status(thm),theory(equality)],[c_7908]) ).
tff(c_8002,plain,
( ( $product(2,power1(2,$sum($uminus(1),'#skE_2'))) = $product(2,'#skE_1') )
| ~ $less(0,'#skE_2') ),
inference(superposition,[status(thm),theory(equality)],[c_1698,c_7721]) ).
tff(c_8308,plain,
( ( $product(2,'#skE_9') = $product(2,'#skE_1') )
| ~ $less(0,'#skE_2') ),
inference(demodulation,[status(thm),theory(equality)],[c_4400,c_8148,c_8002]) ).
tff(c_8310,plain,
( ( '#skE_9' = '#skE_1' )
| ~ $less(0,'#skE_2') ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_8308]) ).
tff(c_8312,plain,
~ $less(0,'#skE_2'),
inference(splitLeft,[status(thm)],[c_8310]) ).
tff(c_967,plain,
power1(2,'#skE_2') = '#skF_13',
inference(demodulation,[status(thm),theory(equality)],[c_779,c_946]) ).
tff(c_474,plain,
! [X_49a: $int] : ( power1(X_49a,0) = 1 ),
inference(cnfTransformation,[status(thm)],[f_156]) ).
tff(c_1002,plain,
( ( '#skF_13' = 1 )
| ( '#skE_2' != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_967,c_474]) ).
tff(c_1010,plain,
'#skE_2' != 0,
inference(splitLeft,[status(thm)],[c_1002]) ).
tff(c_770,plain,
'#skF_2'('#skF_13') = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_767]) ).
tff(c_769,plain,
~ $less('#skF_2'('#skF_13'),0),
inference(resolution,[status(thm)],[c_333,c_761]) ).
tff(c_777,plain,
~ $less('#skE_2',0),
inference(demodulation,[status(thm),theory(equality)],[c_770,c_769]) ).
tff(c_8313,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_8312,c_1010,c_777]) ).
tff(c_8316,plain,
'#skE_9' = '#skE_1',
inference(splitRight,[status(thm)],[c_8310]) ).
tff(c_8149,plain,
power1(2,$sum($uminus(1),'#skE_2')) = '#skE_9',
inference(define,[status(thm),theory(equality)],[c_7908]) ).
tff(c_148,plain,
! [K_160a: $int] :
( is_power_of_21(power1(2,K_160a))
| ~ $lesseq(0,K_160a) ),
inference(cnfTransformation,[status(thm)],[f_292]) ).
tff(c_428,plain,
! [K_160a: $int] :
( is_power_of_21(power1(2,K_160a))
| $less(K_160a,0) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_148]) ).
tff(c_8269,plain,
( is_power_of_21('#skE_9')
| $less($sum($uminus(1),'#skE_2'),0) ),
inference(superposition,[status(thm),theory(equality)],[c_8149,c_428]) ).
tff(c_8272,plain,
( is_power_of_21('#skE_9')
| $less('#skE_2',1) ),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_8269]) ).
tff(c_11295,plain,
( is_power_of_21('#skE_1')
| $less('#skE_2',1) ),
inference(demodulation,[status(thm),theory(equality)],[c_8316,c_8272]) ).
tff(c_11298,plain,
$less('#skE_2',1),
inference(splitLeft,[status(thm)],[c_11295]) ).
tff(c_11300,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_11298,c_1010,c_777]) ).
tff(c_11308,plain,
is_power_of_21('#skE_1'),
inference(splitRight,[status(thm)],[c_11295]) ).
tff(c_617,plain,
div1('#skF_13',2) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_340]) ).
tff(c_518,plain,
~ is_power_of_21($sum('#skF_13',$uminus(div1('#skF_13',2)))),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_292]) ).
tff(c_625,plain,
~ is_power_of_21($sum('#skF_13',$uminus('#skE_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_617,c_518]) ).
tff(c_628,plain,
~ is_power_of_21($sum($uminus('#skE_1'),'#skF_13')),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_625]) ).
tff(c_1666,plain,
~ is_power_of_21($sum($uminus('#skE_1'),$product(2,'#skE_1'))),
inference(demodulation,[status(thm),theory(equality)],[c_1650,c_628]) ).
tff(c_1703,plain,
~ is_power_of_21('#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_1666]) ).
tff(c_11311,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_11308,c_1703]) ).
tff(c_11314,plain,
'#skF_13' = 1,
inference(splitRight,[status(thm)],[c_1002]) ).
tff(c_11344,plain,
~ $less(1,2),
inference(demodulation,[status(thm),theory(equality)],[c_11314,c_329]) ).
tff(c_11360,plain,
$false,
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_11344]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW663_2 : TPTP v8.1.2. Released v6.1.0.
% 0.00/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.18/0.36 % Computer : n017.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Thu Aug 3 18:55:06 EDT 2023
% 0.18/0.36 % CPUTime :
% 13.36/4.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 13.36/4.08
% 13.36/4.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 13.36/4.11
% 13.36/4.11 Inference rules
% 13.36/4.11 ----------------------
% 13.36/4.11 #Ref : 0
% 13.36/4.11 #Sup : 1689
% 13.36/4.11 #Fact : 1
% 13.36/4.11 #Define : 10
% 13.36/4.11 #Split : 31
% 13.36/4.11 #Chain : 0
% 13.36/4.11 #Close : 9
% 13.36/4.11
% 13.36/4.11 Ordering : LPO
% 13.36/4.11
% 13.36/4.11 Simplification rules
% 13.36/4.11 ----------------------
% 13.36/4.11 #Subsume : 156
% 13.36/4.11 #Demod : 481
% 13.36/4.11 #Tautology : 860
% 13.36/4.11 #SimpNegUnit : 52
% 13.36/4.11 #BackRed : 48
% 13.36/4.11
% 13.36/4.11 #Partial instantiations: 175
% 13.36/4.11 #Strategies tried : 1
% 13.36/4.11
% 13.36/4.11 Timing (in seconds)
% 13.36/4.11 ----------------------
% 13.36/4.12 Preprocessing : 0.93
% 13.36/4.12 Parsing : 0.45
% 13.36/4.12 CNF conversion : 0.07
% 13.36/4.12 Main loop : 2.10
% 13.36/4.12 Inferencing : 0.46
% 13.36/4.12 Reduction : 0.60
% 13.36/4.12 Demodulation : 0.44
% 13.36/4.12 BG Simplification : 0.23
% 13.36/4.12 Subsumption : 0.42
% 13.36/4.12 Abstraction : 0.08
% 13.36/4.12 MUC search : 0.08
% 13.36/4.12 Cooper : 0.25
% 13.36/4.12 Total : 3.09
% 13.36/4.12 Index Insertion : 0.00
% 13.36/4.12 Index Deletion : 0.00
% 13.36/4.12 Index Matching : 0.00
% 13.36/4.12 BG Taut test : 0.00
%------------------------------------------------------------------------------