TSTP Solution File: SEU105+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SEU105+1 : TPTP v8.1.2. Released v3.2.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 : n028.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:57:37 EDT 2023
% Result : Theorem 10.47s 3.53s
% Output : CNFRefutation 11.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 45
% Syntax : Number of formulae : 106 ( 35 unt; 35 typ; 0 def)
% Number of atoms : 140 ( 12 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 141 ( 72 ~; 57 |; 4 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 36 ( 29 >; 7 *; 0 +; 0 <<)
% Number of predicates : 18 ( 16 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 6 con; 0-2 aty)
% Number of variables : 70 (; 70 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ subset > in > element > relation > preboolean > ordinal > one_to_one > natural > function > finite > epsilon_transitive > epsilon_connected > empty > diff_closed > cup_closed > cap_closed > symmetric_difference > set_union2 > set_intersection2 > set_difference > #nlpp > powerset > empty_set > #skF_9 > #skF_7 > #skF_4 > #skF_1 > #skF_5 > #skF_10 > #skF_13 > #skF_2 > #skF_3 > #skF_8 > #skF_11 > #skF_12 > #skF_6
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(epsilon_connected,type,
epsilon_connected: $i > $o ).
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(relation,type,
relation: $i > $o ).
tff(set_difference,type,
set_difference: ( $i * $i ) > $i ).
tff(cup_closed,type,
cup_closed: $i > $o ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(epsilon_transitive,type,
epsilon_transitive: $i > $o ).
tff(element,type,
element: ( $i * $i ) > $o ).
tff(finite,type,
finite: $i > $o ).
tff(one_to_one,type,
one_to_one: $i > $o ).
tff(function,type,
function: $i > $o ).
tff(symmetric_difference,type,
symmetric_difference: ( $i * $i ) > $i ).
tff(ordinal,type,
ordinal: $i > $o ).
tff(in,type,
in: ( $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff(subset,type,
subset: ( $i * $i ) > $o ).
tff(preboolean,type,
preboolean: $i > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff(set_intersection2,type,
set_intersection2: ( $i * $i ) > $i ).
tff(diff_closed,type,
diff_closed: $i > $o ).
tff('#skF_3',type,
'#skF_3': $i ).
tff(empty,type,
empty: $i > $o ).
tff(empty_set,type,
empty_set: $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(set_union2,type,
set_union2: ( $i * $i ) > $i ).
tff(powerset,type,
powerset: $i > $i ).
tff(cap_closed,type,
cap_closed: $i > $o ).
tff(natural,type,
natural: $i > $o ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_6',type,
'#skF_6': $i > $i ).
tff(f_218,negated_conjecture,
~ ! [A] :
( ~ empty(A)
=> ( ! [B] :
( element(B,A)
=> ! [C] :
( element(C,A)
=> ( in(symmetric_difference(B,C),A)
& in(set_intersection2(B,C),A) ) ) )
=> preboolean(A) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t16_finsub_1) ).
tff(f_189,axiom,
! [A,B] : subset(A,A),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
tff(f_202,axiom,
! [A] :
( preboolean(A)
<=> ! [B,C] :
( ( in(B,A)
& in(C,A) )
=> ( in(set_union2(B,C),A)
& in(set_difference(B,C),A) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t10_finsub_1) ).
tff(f_238,axiom,
! [A,B] :
( element(A,powerset(B))
<=> subset(A,B) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t3_subset) ).
tff(f_246,axiom,
! [A,B,C] :
( ( in(A,B)
& element(B,powerset(C)) )
=> element(A,C) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_subset) ).
tff(f_274,axiom,
! [A,B] : ( set_union2(A,B) = symmetric_difference(symmetric_difference(A,B),set_intersection2(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t94_xboole_1) ).
tff(f_56,axiom,
! [A,B] : ( set_union2(A,B) = set_union2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
tff(f_60,axiom,
! [A,B] : ( symmetric_difference(A,B) = symmetric_difference(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k5_xboole_0) ).
tff(f_58,axiom,
! [A,B] : ( set_intersection2(A,B) = set_intersection2(B,A) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
tff(f_191,axiom,
! [A,B] : ( set_difference(A,B) = symmetric_difference(A,set_intersection2(A,B)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t100_xboole_1) ).
tff(c_118,plain,
~ preboolean('#skF_13'),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_104,plain,
! [A_48] : subset(A_48,A_48),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_116,plain,
! [A_52] :
( in('#skF_11'(A_52),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_138,plain,
! [A_72,B_73] :
( element(A_72,powerset(B_73))
| ~ subset(A_72,B_73) ),
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_1739,plain,
! [A_238,C_239,B_240] :
( element(A_238,C_239)
| ~ element(B_240,powerset(C_239))
| ~ in(A_238,B_240) ),
inference(cnfTransformation,[status(thm)],[f_246]) ).
tff(c_1783,plain,
! [A_243,B_244,A_245] :
( element(A_243,B_244)
| ~ in(A_243,A_245)
| ~ subset(A_245,B_244) ),
inference(resolution,[status(thm)],[c_138,c_1739]) ).
tff(c_1804,plain,
! [A_52,B_244] :
( element('#skF_11'(A_52),B_244)
| ~ subset(A_52,B_244)
| preboolean(A_52) ),
inference(resolution,[status(thm)],[c_116,c_1783]) ).
tff(c_114,plain,
! [A_52] :
( in('#skF_12'(A_52),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_1803,plain,
! [A_52,B_244] :
( element('#skF_12'(A_52),B_244)
| ~ subset(A_52,B_244)
| preboolean(A_52) ),
inference(resolution,[status(thm)],[c_114,c_1783]) ).
tff(c_122,plain,
! [B_62,C_64] :
( in(set_intersection2(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_1806,plain,
! [B_62,C_64,B_244] :
( element(set_intersection2(B_62,C_64),B_244)
| ~ subset('#skF_13',B_244)
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(resolution,[status(thm)],[c_122,c_1783]) ).
tff(c_124,plain,
! [B_62,C_64] :
( in(symmetric_difference(B_62,C_64),'#skF_13')
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(cnfTransformation,[status(thm)],[f_218]) ).
tff(c_1807,plain,
! [B_62,C_64,B_244] :
( element(symmetric_difference(B_62,C_64),B_244)
| ~ subset('#skF_13',B_244)
| ~ element(C_64,'#skF_13')
| ~ element(B_62,'#skF_13') ),
inference(resolution,[status(thm)],[c_124,c_1783]) ).
tff(c_1428,plain,
! [A_219,B_220] : ( symmetric_difference(symmetric_difference(A_219,B_220),set_intersection2(A_219,B_220)) = set_union2(A_219,B_220) ),
inference(cnfTransformation,[status(thm)],[f_274]) ).
tff(c_3230,plain,
! [A_305,B_306] :
( in(set_union2(A_305,B_306),'#skF_13')
| ~ element(set_intersection2(A_305,B_306),'#skF_13')
| ~ element(symmetric_difference(A_305,B_306),'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_1428,c_124]) ).
tff(c_14,plain,
! [B_10,A_9] : ( set_union2(B_10,A_9) = set_union2(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_112,plain,
! [A_52] :
( ~ in(set_difference('#skF_11'(A_52),'#skF_12'(A_52)),A_52)
| ~ in(set_union2('#skF_11'(A_52),'#skF_12'(A_52)),A_52)
| preboolean(A_52) ),
inference(cnfTransformation,[status(thm)],[f_202]) ).
tff(c_155,plain,
! [A_52] :
( ~ in(set_difference('#skF_11'(A_52),'#skF_12'(A_52)),A_52)
| ~ in(set_union2('#skF_12'(A_52),'#skF_11'(A_52)),A_52)
| preboolean(A_52) ),
inference(demodulation,[status(thm),theory(equality)],[c_14,c_112]) ).
tff(c_3234,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| preboolean('#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(resolution,[status(thm)],[c_3230,c_155]) ).
tff(c_3273,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(negUnitSimplification,[status(thm)],[c_118,c_3234]) ).
tff(c_6735,plain,
~ element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitLeft,[status(thm)],[c_3273]) ).
tff(c_6738,plain,
( ~ subset('#skF_13','#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_1807,c_6735]) ).
tff(c_6744,plain,
( ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_6738]) ).
tff(c_6746,plain,
~ element('#skF_12'('#skF_13'),'#skF_13'),
inference(splitLeft,[status(thm)],[c_6744]) ).
tff(c_6749,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_1803,c_6746]) ).
tff(c_6755,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_6749]) ).
tff(c_6757,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_6755]) ).
tff(c_6758,plain,
~ element('#skF_11'('#skF_13'),'#skF_13'),
inference(splitRight,[status(thm)],[c_6744]) ).
tff(c_6767,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_1804,c_6758]) ).
tff(c_6773,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_6767]) ).
tff(c_6775,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_6773]) ).
tff(c_6777,plain,
element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitRight,[status(thm)],[c_3273]) ).
tff(c_18,plain,
! [B_14,A_13] : ( symmetric_difference(B_14,A_13) = symmetric_difference(A_13,B_14) ),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_2776,plain,
! [A_297,B_298] : ( symmetric_difference(symmetric_difference(A_297,B_298),set_intersection2(B_298,A_297)) = set_union2(B_298,A_297) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_1428]) ).
tff(c_4339,plain,
! [B_344,A_345] :
( in(set_union2(B_344,A_345),'#skF_13')
| ~ element(set_intersection2(B_344,A_345),'#skF_13')
| ~ element(symmetric_difference(A_345,B_344),'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_2776,c_124]) ).
tff(c_4343,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| preboolean('#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(symmetric_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13') ),
inference(resolution,[status(thm)],[c_4339,c_155]) ).
tff(c_4384,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| preboolean('#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_4343]) ).
tff(c_4385,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element(symmetric_difference('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(negUnitSimplification,[status(thm)],[c_118,c_4384]) ).
tff(c_7060,plain,
( ~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13')
| ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_6777,c_4385]) ).
tff(c_7061,plain,
~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitLeft,[status(thm)],[c_7060]) ).
tff(c_7064,plain,
( ~ subset('#skF_13','#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_1806,c_7061]) ).
tff(c_7070,plain,
( ~ element('#skF_11'('#skF_13'),'#skF_13')
| ~ element('#skF_12'('#skF_13'),'#skF_13') ),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_7064]) ).
tff(c_7072,plain,
~ element('#skF_12'('#skF_13'),'#skF_13'),
inference(splitLeft,[status(thm)],[c_7070]) ).
tff(c_7075,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_1803,c_7072]) ).
tff(c_7081,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_7075]) ).
tff(c_7083,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_7081]) ).
tff(c_7084,plain,
~ element('#skF_11'('#skF_13'),'#skF_13'),
inference(splitRight,[status(thm)],[c_7070]) ).
tff(c_7093,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_1804,c_7084]) ).
tff(c_7099,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_7093]) ).
tff(c_7101,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_7099]) ).
tff(c_7103,plain,
element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13'),
inference(splitRight,[status(thm)],[c_7060]) ).
tff(c_16,plain,
! [B_12,A_11] : ( set_intersection2(B_12,A_11) = set_intersection2(A_11,B_12) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_984,plain,
! [A_188,B_189] : ( symmetric_difference(A_188,set_intersection2(A_188,B_189)) = set_difference(A_188,B_189) ),
inference(cnfTransformation,[status(thm)],[f_191]) ).
tff(c_1193,plain,
! [A_201,B_202] : ( symmetric_difference(A_201,set_intersection2(B_202,A_201)) = set_difference(A_201,B_202) ),
inference(superposition,[status(thm),theory(equality)],[c_16,c_984]) ).
tff(c_1216,plain,
! [A_201,B_202] :
( in(set_difference(A_201,B_202),'#skF_13')
| ~ element(set_intersection2(B_202,A_201),'#skF_13')
| ~ element(A_201,'#skF_13') ),
inference(superposition,[status(thm),theory(equality)],[c_1193,c_124]) ).
tff(c_7102,plain,
~ in(set_difference('#skF_11'('#skF_13'),'#skF_12'('#skF_13')),'#skF_13'),
inference(splitRight,[status(thm)],[c_7060]) ).
tff(c_7151,plain,
( ~ element(set_intersection2('#skF_12'('#skF_13'),'#skF_11'('#skF_13')),'#skF_13')
| ~ element('#skF_11'('#skF_13'),'#skF_13') ),
inference(resolution,[status(thm)],[c_1216,c_7102]) ).
tff(c_8980,plain,
~ element('#skF_11'('#skF_13'),'#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_7103,c_7151]) ).
tff(c_8983,plain,
( ~ subset('#skF_13','#skF_13')
| preboolean('#skF_13') ),
inference(resolution,[status(thm)],[c_1804,c_8980]) ).
tff(c_8989,plain,
preboolean('#skF_13'),
inference(demodulation,[status(thm),theory(equality)],[c_104,c_8983]) ).
tff(c_8991,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_118,c_8989]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SEU105+1 : TPTP v8.1.2. Released v3.2.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.15/0.35 % Computer : n028.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 11:44:53 EDT 2023
% 0.15/0.35 % CPUTime :
% 10.47/3.53 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.47/3.54
% 10.47/3.54 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.15/3.58
% 11.15/3.58 Inference rules
% 11.15/3.58 ----------------------
% 11.15/3.58 #Ref : 0
% 11.15/3.58 #Sup : 2152
% 11.15/3.58 #Fact : 0
% 11.15/3.58 #Define : 0
% 11.15/3.58 #Split : 20
% 11.15/3.58 #Chain : 0
% 11.15/3.58 #Close : 0
% 11.15/3.58
% 11.15/3.58 Ordering : KBO
% 11.15/3.58
% 11.15/3.58 Simplification rules
% 11.15/3.58 ----------------------
% 11.15/3.58 #Subsume : 517
% 11.15/3.58 #Demod : 1681
% 11.15/3.58 #Tautology : 622
% 11.15/3.58 #SimpNegUnit : 81
% 11.15/3.58 #BackRed : 13
% 11.15/3.58
% 11.15/3.58 #Partial instantiations: 0
% 11.15/3.58 #Strategies tried : 1
% 11.15/3.58
% 11.15/3.58 Timing (in seconds)
% 11.15/3.58 ----------------------
% 11.15/3.58 Preprocessing : 0.58
% 11.15/3.58 Parsing : 0.31
% 11.15/3.58 CNF conversion : 0.05
% 11.15/3.58 Main loop : 1.93
% 11.15/3.58 Inferencing : 0.58
% 11.15/3.58 Reduction : 0.76
% 11.15/3.58 Demodulation : 0.59
% 11.15/3.58 BG Simplification : 0.05
% 11.15/3.58 Subsumption : 0.41
% 11.15/3.58 Abstraction : 0.06
% 11.15/3.58 MUC search : 0.00
% 11.15/3.58 Cooper : 0.00
% 11.15/3.58 Total : 2.58
% 11.15/3.58 Index Insertion : 0.00
% 11.15/3.58 Index Deletion : 0.00
% 11.15/3.59 Index Matching : 0.00
% 11.15/3.59 BG Taut test : 0.00
%------------------------------------------------------------------------------