TSTP Solution File: SWC090+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWC090+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n011.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:01:06 EDT 2023
% Result : Theorem 37.68s 22.50s
% Output : CNFRefutation 37.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 86
% Syntax : Number of formulae : 142 ( 34 unt; 77 typ; 0 def)
% Number of atoms : 154 ( 34 equ)
% Maximal formula atoms : 15 ( 2 avg)
% Number of connectives : 162 ( 73 ~; 61 |; 6 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 85 ( 68 >; 17 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-2 aty)
% Number of functors : 58 ( 58 usr; 9 con; 0-2 aty)
% Number of variables : 46 (; 42 !; 4 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ segmentP > rearsegP > neq > memberP > lt > leq > gt > geq > frontsegP > totalorderedP > totalorderP > strictorderedP > strictorderP > ssList > ssItem > singletonP > equalelemsP > duplicatefreeP > cyclefreeP > cons > app > #nlpp > tl > hd > nil > #skF_36 > #skF_25 > #skF_5 > #skF_52 > #skF_44 > #skF_21 > #skF_16 > #skF_6 > #skF_49 > #skF_18 > #skF_24 > #skF_35 > #skF_19 > #skF_31 > #skF_22 > #skF_37 > #skF_40 > #skF_48 > #skF_3 > #skF_34 > #skF_29 > #skF_15 > #skF_32 > #skF_53 > #skF_51 > #skF_28 > #skF_10 > #skF_41 > #skF_2 > #skF_38 > #skF_43 > #skF_1 > #skF_8 > #skF_39 > #skF_23 > #skF_33 > #skF_26 > #skF_50 > #skF_13 > #skF_17 > #skF_11 > #skF_14 > #skF_27 > #skF_12 > #skF_7 > #skF_46 > #skF_42 > #skF_45 > #skF_9 > #skF_30 > #skF_4 > #skF_20 > #skF_47
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_36',type,
'#skF_36': $i > $i ).
tff(segmentP,type,
segmentP: ( $i * $i ) > $o ).
tff('#skF_25',type,
'#skF_25': $i > $i ).
tff(totalorderedP,type,
totalorderedP: $i > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff(equalelemsP,type,
equalelemsP: $i > $o ).
tff('#skF_52',type,
'#skF_52': $i ).
tff('#skF_44',type,
'#skF_44': $i > $i ).
tff('#skF_21',type,
'#skF_21': $i > $i ).
tff('#skF_16',type,
'#skF_16': $i > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff('#skF_49',type,
'#skF_49': $i ).
tff('#skF_18',type,
'#skF_18': $i > $i ).
tff('#skF_24',type,
'#skF_24': $i > $i ).
tff('#skF_35',type,
'#skF_35': $i > $i ).
tff(singletonP,type,
singletonP: $i > $o ).
tff('#skF_19',type,
'#skF_19': $i > $i ).
tff('#skF_31',type,
'#skF_31': $i > $i ).
tff('#skF_22',type,
'#skF_22': $i > $i ).
tff(frontsegP,type,
frontsegP: ( $i * $i ) > $o ).
tff('#skF_37',type,
'#skF_37': $i > $i ).
tff(totalorderP,type,
totalorderP: $i > $o ).
tff(ssItem,type,
ssItem: $i > $o ).
tff('#skF_40',type,
'#skF_40': $i > $i ).
tff('#skF_48',type,
'#skF_48': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_34',type,
'#skF_34': $i > $i ).
tff('#skF_29',type,
'#skF_29': $i > $i ).
tff('#skF_15',type,
'#skF_15': $i > $i ).
tff('#skF_32',type,
'#skF_32': $i > $i ).
tff('#skF_53',type,
'#skF_53': $i ).
tff('#skF_51',type,
'#skF_51': $i ).
tff('#skF_28',type,
'#skF_28': $i > $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_41',type,
'#skF_41': $i > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_38',type,
'#skF_38': $i > $i ).
tff('#skF_43',type,
'#skF_43': $i > $i ).
tff(hd,type,
hd: $i > $i ).
tff(app,type,
app: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i ) > $i ).
tff(duplicatefreeP,type,
duplicatefreeP: $i > $o ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_39',type,
'#skF_39': $i > $i ).
tff('#skF_23',type,
'#skF_23': $i > $i ).
tff(rearsegP,type,
rearsegP: ( $i * $i ) > $o ).
tff('#skF_33',type,
'#skF_33': $i > $i ).
tff(memberP,type,
memberP: ( $i * $i ) > $o ).
tff('#skF_26',type,
'#skF_26': $i > $i ).
tff('#skF_50',type,
'#skF_50': $i ).
tff('#skF_13',type,
'#skF_13': $i > $i ).
tff(ssList,type,
ssList: $i > $o ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(strictorderP,type,
strictorderP: $i > $o ).
tff('#skF_17',type,
'#skF_17': $i > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff('#skF_14',type,
'#skF_14': $i > $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(tl,type,
tl: $i > $i ).
tff(neq,type,
neq: ( $i * $i ) > $o ).
tff('#skF_27',type,
'#skF_27': $i > $i ).
tff('#skF_12',type,
'#skF_12': $i > $i ).
tff('#skF_7',type,
'#skF_7': ( $i * $i ) > $i ).
tff('#skF_46',type,
'#skF_46': $i > $i ).
tff(nil,type,
nil: $i ).
tff('#skF_42',type,
'#skF_42': $i > $i ).
tff('#skF_45',type,
'#skF_45': $i > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i ) > $i ).
tff(strictorderedP,type,
strictorderedP: $i > $o ).
tff('#skF_30',type,
'#skF_30': $i > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': $i > $i ).
tff(cyclefreeP,type,
cyclefreeP: $i > $o ).
tff('#skF_47',type,
'#skF_47': $i > $i ).
tff(f_1018,negated_conjecture,
~ ! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( ( V != X )
| ( U != W )
| ~ neq(V,nil)
| ? [Y] :
( ssList(Y)
& neq(Y,nil)
& segmentP(V,Y)
& segmentP(U,Y) )
| ! [Z] :
( ssList(Z)
=> ! [X1] :
( ssList(X1)
=> ( ( app(Z,X1) != X )
| ( app(X1,Z) != W ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_667,axiom,
! [U] :
( ssList(U)
=> segmentP(U,U) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
tff(f_769,axiom,
! [U] :
( ssList(U)
=> ( ( nil != U )
=> ? [V] :
( ssItem(V)
& ( hd(U) = V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax75) ).
tff(f_413,axiom,
! [U] :
( ssList(U)
=> ( app(nil,U) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
tff(f_859,axiom,
! [U] :
( ssList(U)
=> ( app(U,nil) = U ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
tff(f_319,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
tff(f_311,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( neq(U,V)
<=> ( U != V ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
tff(f_682,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ! [W] :
( ssList(W)
=> ! [X] :
( ssList(X)
=> ( segmentP(U,V)
=> segmentP(app(app(W,U),X),V) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
tff(f_135,axiom,
! [U] :
( ssList(U)
=> ! [V] :
( ssList(V)
=> ( segmentP(U,V)
<=> ? [W] :
( ssList(W)
& ? [X] :
( ssList(X)
& ( app(app(W,V),X) = U ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
tff(c_402,plain,
ssList('#skF_50'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_270,plain,
! [U_1014] :
( segmentP(U_1014,U_1014)
| ~ ssList(U_1014) ),
inference(cnfTransformation,[status(thm)],[f_667]) ).
tff(c_384,plain,
app('#skF_53','#skF_52') = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_388,plain,
ssList('#skF_53'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_819,plain,
! [U_1261] :
( ( hd(U_1261) = '#skF_46'(U_1261) )
| ( nil = U_1261 )
| ~ ssList(U_1261) ),
inference(cnfTransformation,[status(thm)],[f_769]) ).
tff(c_930,plain,
( ( hd('#skF_53') = '#skF_46'('#skF_53') )
| ( nil = '#skF_53' ) ),
inference(resolution,[status(thm)],[c_388,c_819]) ).
tff(c_1202,plain,
nil = '#skF_53',
inference(splitLeft,[status(thm)],[c_930]) ).
tff(c_390,plain,
ssList('#skF_52'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_456,plain,
! [U_1208] :
( ( app(nil,U_1208) = U_1208 )
| ~ ssList(U_1208) ),
inference(cnfTransformation,[status(thm)],[f_413]) ).
tff(c_473,plain,
app(nil,'#skF_52') = '#skF_52',
inference(resolution,[status(thm)],[c_390,c_456]) ).
tff(c_1230,plain,
app('#skF_53','#skF_52') = '#skF_52',
inference(demodulation,[status(thm),theory(equality)],[c_1202,c_473]) ).
tff(c_1249,plain,
'#skF_52' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_384,c_1230]) ).
tff(c_386,plain,
app('#skF_52','#skF_53') = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_498,plain,
! [U_1210] :
( ( app(U_1210,nil) = U_1210 )
| ~ ssList(U_1210) ),
inference(cnfTransformation,[status(thm)],[f_859]) ).
tff(c_516,plain,
app('#skF_52',nil) = '#skF_52',
inference(resolution,[status(thm)],[c_390,c_498]) ).
tff(c_1224,plain,
app('#skF_52','#skF_53') = '#skF_52',
inference(demodulation,[status(thm),theory(equality)],[c_1202,c_516]) ).
tff(c_1248,plain,
'#skF_52' = '#skF_51',
inference(demodulation,[status(thm),theory(equality)],[c_386,c_1224]) ).
tff(c_1264,plain,
'#skF_51' = '#skF_50',
inference(demodulation,[status(thm),theory(equality)],[c_1249,c_1248]) ).
tff(c_400,plain,
ssList('#skF_51'),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_398,plain,
'#skF_49' = '#skF_51',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_394,plain,
neq('#skF_49',nil),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_411,plain,
neq('#skF_51',nil),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_394]) ).
tff(c_396,plain,
'#skF_48' = '#skF_50',
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_392,plain,
! [Y_1193] :
( ~ segmentP('#skF_48',Y_1193)
| ~ segmentP('#skF_49',Y_1193)
| ~ neq(Y_1193,nil)
| ~ ssList(Y_1193) ),
inference(cnfTransformation,[status(thm)],[f_1018]) ).
tff(c_437,plain,
! [Y_1203] :
( ~ segmentP('#skF_50',Y_1203)
| ~ segmentP('#skF_51',Y_1203)
| ~ neq(Y_1203,nil)
| ~ ssList(Y_1203) ),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_396,c_392]) ).
tff(c_441,plain,
( ~ segmentP('#skF_50','#skF_51')
| ~ neq('#skF_51',nil)
| ~ ssList('#skF_51') ),
inference(resolution,[status(thm)],[c_270,c_437]) ).
tff(c_444,plain,
~ segmentP('#skF_50','#skF_51'),
inference(demodulation,[status(thm),theory(equality)],[c_400,c_411,c_441]) ).
tff(c_1271,plain,
~ segmentP('#skF_50','#skF_50'),
inference(demodulation,[status(thm),theory(equality)],[c_1264,c_444]) ).
tff(c_1288,plain,
~ ssList('#skF_50'),
inference(resolution,[status(thm)],[c_270,c_1271]) ).
tff(c_1292,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_402,c_1288]) ).
tff(c_1294,plain,
nil != '#skF_53',
inference(splitRight,[status(thm)],[c_930]) ).
tff(c_168,plain,
ssList(nil),
inference(cnfTransformation,[status(thm)],[f_319]) ).
tff(c_162,plain,
! [U_856,V_858] :
( neq(U_856,V_858)
| ( V_858 = U_856 )
| ~ ssList(V_858)
| ~ ssList(U_856) ),
inference(cnfTransformation,[status(thm)],[f_311]) ).
tff(c_518,plain,
app('#skF_51',nil) = '#skF_51',
inference(resolution,[status(thm)],[c_400,c_498]) ).
tff(c_77894,plain,
! [W_2888,U_2889,X_2890,V_2891] :
( segmentP(app(app(W_2888,U_2889),X_2890),V_2891)
| ~ segmentP(U_2889,V_2891)
| ~ ssList(X_2890)
| ~ ssList(W_2888)
| ~ ssList(V_2891)
| ~ ssList(U_2889) ),
inference(cnfTransformation,[status(thm)],[f_682]) ).
tff(c_78166,plain,
! [X_2890,V_2891] :
( segmentP(app('#skF_51',X_2890),V_2891)
| ~ segmentP('#skF_53',V_2891)
| ~ ssList(X_2890)
| ~ ssList('#skF_52')
| ~ ssList(V_2891)
| ~ ssList('#skF_53') ),
inference(superposition,[status(thm),theory(equality)],[c_386,c_77894]) ).
tff(c_78330,plain,
! [X_2892,V_2893] :
( segmentP(app('#skF_51',X_2892),V_2893)
| ~ segmentP('#skF_53',V_2893)
| ~ ssList(X_2892)
| ~ ssList(V_2893) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_390,c_78166]) ).
tff(c_78341,plain,
! [V_2893] :
( segmentP('#skF_51',V_2893)
| ~ segmentP('#skF_53',V_2893)
| ~ ssList(nil)
| ~ ssList(V_2893) ),
inference(superposition,[status(thm),theory(equality)],[c_518,c_78330]) ).
tff(c_78744,plain,
! [V_2905] :
( segmentP('#skF_51',V_2905)
| ~ segmentP('#skF_53',V_2905)
| ~ ssList(V_2905) ),
inference(demodulation,[status(thm),theory(equality)],[c_168,c_78341]) ).
tff(c_78752,plain,
( segmentP('#skF_51','#skF_53')
| ~ ssList('#skF_53') ),
inference(resolution,[status(thm)],[c_270,c_78744]) ).
tff(c_78758,plain,
segmentP('#skF_51','#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_78752]) ).
tff(c_412,plain,
! [Y_1193] :
( ~ segmentP('#skF_50',Y_1193)
| ~ segmentP('#skF_51',Y_1193)
| ~ neq(Y_1193,nil)
| ~ ssList(Y_1193) ),
inference(demodulation,[status(thm),theory(equality)],[c_398,c_396,c_392]) ).
tff(c_78783,plain,
( ~ segmentP('#skF_50','#skF_53')
| ~ neq('#skF_53',nil)
| ~ ssList('#skF_53') ),
inference(resolution,[status(thm)],[c_78758,c_412]) ).
tff(c_78793,plain,
( ~ segmentP('#skF_50','#skF_53')
| ~ neq('#skF_53',nil) ),
inference(demodulation,[status(thm),theory(equality)],[c_388,c_78783]) ).
tff(c_78860,plain,
~ neq('#skF_53',nil),
inference(splitLeft,[status(thm)],[c_78793]) ).
tff(c_78863,plain,
( ( nil = '#skF_53' )
| ~ ssList(nil)
| ~ ssList('#skF_53') ),
inference(resolution,[status(thm)],[c_162,c_78860]) ).
tff(c_78869,plain,
nil = '#skF_53',
inference(demodulation,[status(thm),theory(equality)],[c_388,c_168,c_78863]) ).
tff(c_78871,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1294,c_78869]) ).
tff(c_78872,plain,
~ segmentP('#skF_50','#skF_53'),
inference(splitRight,[status(thm)],[c_78793]) ).
tff(c_474,plain,
app(nil,'#skF_53') = '#skF_53',
inference(resolution,[status(thm)],[c_388,c_456]) ).
tff(c_79519,plain,
! [W_2911,V_2912,X_2913] :
( segmentP(app(app(W_2911,V_2912),X_2913),V_2912)
| ~ ssList(X_2913)
| ~ ssList(W_2911)
| ~ ssList(V_2912)
| ~ ssList(app(app(W_2911,V_2912),X_2913)) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_79815,plain,
! [X_2913] :
( segmentP(app('#skF_53',X_2913),'#skF_53')
| ~ ssList(X_2913)
| ~ ssList(nil)
| ~ ssList('#skF_53')
| ~ ssList(app(app(nil,'#skF_53'),X_2913)) ),
inference(superposition,[status(thm),theory(equality)],[c_474,c_79519]) ).
tff(c_96174,plain,
! [X_3253] :
( segmentP(app('#skF_53',X_3253),'#skF_53')
| ~ ssList(X_3253)
| ~ ssList(app('#skF_53',X_3253)) ),
inference(demodulation,[status(thm),theory(equality)],[c_474,c_388,c_168,c_79815]) ).
tff(c_96200,plain,
( segmentP('#skF_50','#skF_53')
| ~ ssList('#skF_52')
| ~ ssList(app('#skF_53','#skF_52')) ),
inference(superposition,[status(thm),theory(equality)],[c_384,c_96174]) ).
tff(c_96216,plain,
segmentP('#skF_50','#skF_53'),
inference(demodulation,[status(thm),theory(equality)],[c_402,c_384,c_390,c_96200]) ).
tff(c_96218,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_78872,c_96216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWC090+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.35 % Computer : n011.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.20/0.35 % DateTime : Thu Aug 3 21:18:36 EDT 2023
% 0.20/0.35 % CPUTime :
% 37.68/22.50 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 37.68/22.51
% 37.68/22.51 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 37.68/22.54
% 37.68/22.54 Inference rules
% 37.68/22.54 ----------------------
% 37.68/22.54 #Ref : 6
% 37.68/22.54 #Sup : 20692
% 37.68/22.54 #Fact : 0
% 37.68/22.54 #Define : 0
% 37.68/22.54 #Split : 400
% 38.00/22.54 #Chain : 0
% 38.00/22.54 #Close : 0
% 38.00/22.54
% 38.00/22.54 Ordering : KBO
% 38.00/22.54
% 38.00/22.54 Simplification rules
% 38.00/22.54 ----------------------
% 38.00/22.54 #Subsume : 3822
% 38.00/22.54 #Demod : 21405
% 38.00/22.54 #Tautology : 5914
% 38.00/22.54 #SimpNegUnit : 2123
% 38.00/22.54 #BackRed : 1617
% 38.00/22.54
% 38.00/22.54 #Partial instantiations: 0
% 38.00/22.54 #Strategies tried : 1
% 38.00/22.54
% 38.00/22.54 Timing (in seconds)
% 38.00/22.54 ----------------------
% 38.00/22.55 Preprocessing : 0.92
% 38.00/22.55 Parsing : 0.43
% 38.00/22.55 CNF conversion : 0.12
% 38.00/22.55 Main loop : 20.56
% 38.00/22.55 Inferencing : 4.63
% 38.00/22.55 Reduction : 9.51
% 38.00/22.55 Demodulation : 6.93
% 38.00/22.55 BG Simplification : 0.19
% 38.00/22.55 Subsumption : 4.90
% 38.00/22.55 Abstraction : 0.26
% 38.00/22.55 MUC search : 0.00
% 38.00/22.55 Cooper : 0.00
% 38.00/22.55 Total : 21.54
% 38.00/22.55 Index Insertion : 0.00
% 38.00/22.55 Index Deletion : 0.00
% 38.00/22.55 Index Matching : 0.00
% 38.00/22.55 BG Taut test : 0.00
%------------------------------------------------------------------------------