TSTP Solution File: COM021+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : COM021+1 : TPTP v8.1.2. Released v4.0.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 : n003.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:35:20 EDT 2023
% Result : Theorem 28.12s 14.11s
% Output : CNFRefutation 28.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 45
% Syntax : Number of formulae : 93 ( 22 unt; 33 typ; 4 def)
% Number of atoms : 205 ( 12 equ)
% Maximal formula atoms : 8 ( 3 avg)
% Number of connectives : 252 ( 107 ~; 112 |; 21 &)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 46 ( 24 >; 22 *; 0 +; 0 <<)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 23 ( 23 usr; 9 con; 0-4 aty)
% Number of variables : 72 (; 70 !; 2 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sdtmndtplgtdt0 > sdtmndtasgtdt0 > aReductOfIn0 > aNormalFormOfIn0 > iLess0 > isTerminating0 > isLocallyConfluent0 > isConfluent0 > aRewritingSystem0 > aElement0 > #nlpp > xx > xw > xv > xu > xd > xc > xb > xa > xR > #skF_9 > #skF_7 > #skF_5 > #skF_1 > #skF_4 > #skF_12 > #skF_8 > #skF_13 > #skF_10 > #skF_2 > #skF_6 > #skF_14 > #skF_3 > #skF_11
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_9',type,
'#skF_9': $i > $i ).
tff('#skF_7',type,
'#skF_7': $i > $i ).
tff(sdtmndtplgtdt0,type,
sdtmndtplgtdt0: ( $i * $i * $i ) > $o ).
tff('#skF_5',type,
'#skF_5': $i > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff(aReductOfIn0,type,
aReductOfIn0: ( $i * $i * $i ) > $o ).
tff(xa,type,
xa: $i ).
tff(xd,type,
xd: $i ).
tff(xw,type,
xw: $i ).
tff(aElement0,type,
aElement0: $i > $o ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i > $i ).
tff(xu,type,
xu: $i ).
tff(isTerminating0,type,
isTerminating0: $i > $o ).
tff(aNormalFormOfIn0,type,
aNormalFormOfIn0: ( $i * $i * $i ) > $o ).
tff(xR,type,
xR: $i ).
tff('#skF_13',type,
'#skF_13': ( $i * $i ) > $i ).
tff(xc,type,
xc: $i ).
tff(xx,type,
xx: $i ).
tff('#skF_10',type,
'#skF_10': $i > $i ).
tff('#skF_2',type,
'#skF_2': ( $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i * $i * $i ) > $i ).
tff(xb,type,
xb: $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff('#skF_11',type,
'#skF_11': $i > $i ).
tff(aRewritingSystem0,type,
aRewritingSystem0: $i > $o ).
tff(isConfluent0,type,
isConfluent0: $i > $o ).
tff(isLocallyConfluent0,type,
isLocallyConfluent0: $i > $o ).
tff(iLess0,type,
iLess0: ( $i * $i ) > $o ).
tff(sdtmndtasgtdt0,type,
sdtmndtasgtdt0: ( $i * $i * $i ) > $o ).
tff(xv,type,
xv: $i ).
tff(f_233,hypothesis,
( aElement0(xu)
& aReductOfIn0(xu,xa,xR)
& sdtmndtasgtdt0(xu,xR,xb) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__755) ).
tff(f_244,hypothesis,
aNormalFormOfIn0(xd,xw,xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__818) ).
tff(f_243,hypothesis,
( aElement0(xw)
& sdtmndtasgtdt0(xu,xR,xw)
& sdtmndtasgtdt0(xv,xR,xw) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__799) ).
tff(f_198,hypothesis,
aRewritingSystem0(xR),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656) ).
tff(f_187,definition,
! [W0,W1] :
( ( aElement0(W0)
& aRewritingSystem0(W1) )
=> ! [W2] :
( aNormalFormOfIn0(W2,W0,W1)
<=> ( aElement0(W2)
& sdtmndtasgtdt0(W0,W1,W2)
& ~ ? [W3] : aReductOfIn0(W3,W2,W1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mNFRDef) ).
tff(f_115,axiom,
! [W0,W1,W2,W3] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2)
& aElement0(W3) )
=> ( ( sdtmndtasgtdt0(W0,W1,W2)
& sdtmndtasgtdt0(W2,W1,W3) )
=> sdtmndtasgtdt0(W0,W1,W3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRTrans) ).
tff(f_251,negated_conjecture,
~ sdtmndtasgtdt0(xb,xR,xd),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__) ).
tff(f_249,hypothesis,
( aElement0(xx)
& sdtmndtasgtdt0(xb,xR,xx)
& sdtmndtasgtdt0(xd,xR,xx) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__850) ).
tff(f_201,hypothesis,
( isLocallyConfluent0(xR)
& isTerminating0(xR) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m__656_01) ).
tff(f_101,definition,
! [W0,W1,W2] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2) )
=> ( sdtmndtasgtdt0(W0,W1,W2)
<=> ( ( W0 = W2 )
| sdtmndtplgtdt0(W0,W1,W2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCRDef) ).
tff(f_172,definition,
! [W0] :
( aRewritingSystem0(W0)
=> ( isTerminating0(W0)
<=> ! [W1,W2] :
( ( aElement0(W1)
& aElement0(W2) )
=> ( sdtmndtplgtdt0(W1,W0,W2)
=> iLess0(W2,W1) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTermin) ).
tff(f_75,definition,
! [W0,W1,W2] :
( ( aElement0(W0)
& aRewritingSystem0(W1)
& aElement0(W2) )
=> ( sdtmndtplgtdt0(W0,W1,W2)
<=> ( aReductOfIn0(W2,W0,W1)
| ? [W3] :
( aElement0(W3)
& aReductOfIn0(W3,W0,W1)
& sdtmndtplgtdt0(W3,W1,W2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mTCDef) ).
tff(c_114,plain,
aElement0(xu),
inference(cnfTransformation,[status(thm)],[f_233]) ).
tff(c_128,plain,
aNormalFormOfIn0(xd,xw,xR),
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_126,plain,
aElement0(xw),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_88,plain,
aRewritingSystem0(xR),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_171,plain,
! [W2_108,W0_109,W1_110] :
( aElement0(W2_108)
| ~ aNormalFormOfIn0(W2_108,W0_109,W1_110)
| ~ aRewritingSystem0(W1_110)
| ~ aElement0(W0_109) ),
inference(cnfTransformation,[status(thm)],[f_187]) ).
tff(c_174,plain,
( aElement0(xd)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xw) ),
inference(resolution,[status(thm)],[c_128,c_171]) ).
tff(c_177,plain,
aElement0(xd),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_88,c_174]) ).
tff(c_124,plain,
sdtmndtasgtdt0(xu,xR,xw),
inference(cnfTransformation,[status(thm)],[f_243]) ).
tff(c_82,plain,
! [W0_70,W1_71,W2_77] :
( sdtmndtasgtdt0(W0_70,W1_71,W2_77)
| ~ aNormalFormOfIn0(W2_77,W0_70,W1_71)
| ~ aRewritingSystem0(W1_71)
| ~ aElement0(W0_70) ),
inference(cnfTransformation,[status(thm)],[f_187]) ).
tff(c_436,plain,
! [W0_165,W1_166,W3_167,W2_168] :
( sdtmndtasgtdt0(W0_165,W1_166,W3_167)
| ~ sdtmndtasgtdt0(W2_168,W1_166,W3_167)
| ~ sdtmndtasgtdt0(W0_165,W1_166,W2_168)
| ~ aElement0(W3_167)
| ~ aElement0(W2_168)
| ~ aRewritingSystem0(W1_166)
| ~ aElement0(W0_165) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_91308,plain,
! [W0_2518,W1_2519,W2_2520,W0_2521] :
( sdtmndtasgtdt0(W0_2518,W1_2519,W2_2520)
| ~ sdtmndtasgtdt0(W0_2518,W1_2519,W0_2521)
| ~ aElement0(W2_2520)
| ~ aElement0(W0_2518)
| ~ aNormalFormOfIn0(W2_2520,W0_2521,W1_2519)
| ~ aRewritingSystem0(W1_2519)
| ~ aElement0(W0_2521) ),
inference(resolution,[status(thm)],[c_82,c_436]) ).
tff(c_91380,plain,
! [W2_2520] :
( sdtmndtasgtdt0(xu,xR,W2_2520)
| ~ aElement0(W2_2520)
| ~ aElement0(xu)
| ~ aNormalFormOfIn0(W2_2520,xw,xR)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xw) ),
inference(resolution,[status(thm)],[c_124,c_91308]) ).
tff(c_102124,plain,
! [W2_2781] :
( sdtmndtasgtdt0(xu,xR,W2_2781)
| ~ aElement0(W2_2781)
| ~ aNormalFormOfIn0(W2_2781,xw,xR) ),
inference(demodulation,[status(thm),theory(equality)],[c_126,c_88,c_114,c_91380]) ).
tff(c_765,plain,
! [W2_187,W0_188,W1_189] :
( aNormalFormOfIn0(W2_187,W0_188,W1_189)
| aReductOfIn0('#skF_12'(W0_188,W1_189,W2_187),W2_187,W1_189)
| ~ sdtmndtasgtdt0(W0_188,W1_189,W2_187)
| ~ aElement0(W2_187)
| ~ aRewritingSystem0(W1_189)
| ~ aElement0(W0_188) ),
inference(cnfTransformation,[status(thm)],[f_187]) ).
tff(c_80,plain,
! [W3_80,W2_77,W1_71,W0_70] :
( ~ aReductOfIn0(W3_80,W2_77,W1_71)
| ~ aNormalFormOfIn0(W2_77,W0_70,W1_71)
| ~ aRewritingSystem0(W1_71)
| ~ aElement0(W0_70) ),
inference(cnfTransformation,[status(thm)],[f_187]) ).
tff(c_79127,plain,
! [W2_2227,W0_2228,W1_2229,W0_2230] :
( ~ aNormalFormOfIn0(W2_2227,W0_2228,W1_2229)
| ~ aElement0(W0_2228)
| aNormalFormOfIn0(W2_2227,W0_2230,W1_2229)
| ~ sdtmndtasgtdt0(W0_2230,W1_2229,W2_2227)
| ~ aElement0(W2_2227)
| ~ aRewritingSystem0(W1_2229)
| ~ aElement0(W0_2230) ),
inference(resolution,[status(thm)],[c_765,c_80]) ).
tff(c_79131,plain,
! [W0_2230] :
( ~ aElement0(xw)
| aNormalFormOfIn0(xd,W0_2230,xR)
| ~ sdtmndtasgtdt0(W0_2230,xR,xd)
| ~ aElement0(xd)
| ~ aRewritingSystem0(xR)
| ~ aElement0(W0_2230) ),
inference(resolution,[status(thm)],[c_128,c_79127]) ).
tff(c_79135,plain,
! [W0_2230] :
( aNormalFormOfIn0(xd,W0_2230,xR)
| ~ sdtmndtasgtdt0(W0_2230,xR,xd)
| ~ aElement0(W0_2230) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_177,c_126,c_79131]) ).
tff(c_102130,plain,
( aNormalFormOfIn0(xd,xu,xR)
| ~ aElement0(xu)
| ~ aElement0(xd)
| ~ aNormalFormOfIn0(xd,xw,xR) ),
inference(resolution,[status(thm)],[c_102124,c_79135]) ).
tff(c_102155,plain,
aNormalFormOfIn0(xd,xu,xR),
inference(demodulation,[status(thm),theory(equality)],[c_128,c_177,c_114,c_102130]) ).
tff(c_136,plain,
~ sdtmndtasgtdt0(xb,xR,xd),
inference(cnfTransformation,[status(thm)],[f_251]) ).
tff(c_134,plain,
aElement0(xx),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_90,plain,
isTerminating0(xR),
inference(cnfTransformation,[status(thm)],[f_201]) ).
tff(c_130,plain,
sdtmndtasgtdt0(xd,xR,xx),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_283,plain,
! [W0_142,W1_143,W2_144] :
( sdtmndtplgtdt0(W0_142,W1_143,W2_144)
| ( W2_144 = W0_142 )
| ~ sdtmndtasgtdt0(W0_142,W1_143,W2_144)
| ~ aElement0(W2_144)
| ~ aRewritingSystem0(W1_143)
| ~ aElement0(W0_142) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_68,plain,
! [W2_69,W1_68,W0_63] :
( iLess0(W2_69,W1_68)
| ~ sdtmndtplgtdt0(W1_68,W0_63,W2_69)
| ~ aElement0(W2_69)
| ~ aElement0(W1_68)
| ~ isTerminating0(W0_63)
| ~ aRewritingSystem0(W0_63) ),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_1436,plain,
! [W2_240,W0_241,W1_242] :
( iLess0(W2_240,W0_241)
| ~ isTerminating0(W1_242)
| ( W2_240 = W0_241 )
| ~ sdtmndtasgtdt0(W0_241,W1_242,W2_240)
| ~ aElement0(W2_240)
| ~ aRewritingSystem0(W1_242)
| ~ aElement0(W0_241) ),
inference(resolution,[status(thm)],[c_283,c_68]) ).
tff(c_1529,plain,
( iLess0(xx,xd)
| ~ isTerminating0(xR)
| ( xx = xd )
| ~ aElement0(xx)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xd) ),
inference(resolution,[status(thm)],[c_130,c_1436]) ).
tff(c_1606,plain,
( iLess0(xx,xd)
| ( xx = xd ) ),
inference(demodulation,[status(thm),theory(equality)],[c_177,c_88,c_134,c_90,c_1529]) ).
tff(c_72227,plain,
xx = xd,
inference(splitLeft,[status(thm)],[c_1606]) ).
tff(c_132,plain,
sdtmndtasgtdt0(xb,xR,xx),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_72233,plain,
sdtmndtasgtdt0(xb,xR,xd),
inference(demodulation,[status(thm),theory(equality)],[c_72227,c_132]) ).
tff(c_72237,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_136,c_72233]) ).
tff(c_72239,plain,
xx != xd,
inference(splitRight,[status(thm)],[c_1606]) ).
tff(c_24,plain,
! [W0_22,W1_23,W2_24] :
( sdtmndtplgtdt0(W0_22,W1_23,W2_24)
| ( W2_24 = W0_22 )
| ~ sdtmndtasgtdt0(W0_22,W1_23,W2_24)
| ~ aElement0(W2_24)
| ~ aRewritingSystem0(W1_23)
| ~ aElement0(W0_22) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_879,plain,
! [W0_195,W1_196,W2_197] :
( aReductOfIn0('#skF_1'(W0_195,W1_196,W2_197),W0_195,W1_196)
| aReductOfIn0(W2_197,W0_195,W1_196)
| ~ sdtmndtplgtdt0(W0_195,W1_196,W2_197)
| ~ aElement0(W2_197)
| ~ aRewritingSystem0(W1_196)
| ~ aElement0(W0_195) ),
inference(cnfTransformation,[status(thm)],[f_75]) ).
tff(c_78145,plain,
! [W0_2188,W0_2189,W1_2190,W2_2191] :
( ~ aNormalFormOfIn0(W0_2188,W0_2189,W1_2190)
| ~ aElement0(W0_2189)
| aReductOfIn0(W2_2191,W0_2188,W1_2190)
| ~ sdtmndtplgtdt0(W0_2188,W1_2190,W2_2191)
| ~ aElement0(W2_2191)
| ~ aRewritingSystem0(W1_2190)
| ~ aElement0(W0_2188) ),
inference(resolution,[status(thm)],[c_879,c_80]) ).
tff(c_78149,plain,
! [W2_2191] :
( ~ aElement0(xw)
| aReductOfIn0(W2_2191,xd,xR)
| ~ sdtmndtplgtdt0(xd,xR,W2_2191)
| ~ aElement0(W2_2191)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xd) ),
inference(resolution,[status(thm)],[c_128,c_78145]) ).
tff(c_78876,plain,
! [W2_2218] :
( aReductOfIn0(W2_2218,xd,xR)
| ~ sdtmndtplgtdt0(xd,xR,W2_2218)
| ~ aElement0(W2_2218) ),
inference(demodulation,[status(thm),theory(equality)],[c_177,c_88,c_126,c_78149]) ).
tff(c_78896,plain,
! [W2_24] :
( aReductOfIn0(W2_24,xd,xR)
| ( xd = W2_24 )
| ~ sdtmndtasgtdt0(xd,xR,W2_24)
| ~ aElement0(W2_24)
| ~ aRewritingSystem0(xR)
| ~ aElement0(xd) ),
inference(resolution,[status(thm)],[c_24,c_78876]) ).
tff(c_113221,plain,
! [W2_3020] :
( aReductOfIn0(W2_3020,xd,xR)
| ( xd = W2_3020 )
| ~ sdtmndtasgtdt0(xd,xR,W2_3020)
| ~ aElement0(W2_3020) ),
inference(demodulation,[status(thm),theory(equality)],[c_177,c_88,c_78896]) ).
tff(c_113394,plain,
( aReductOfIn0(xx,xd,xR)
| ( xx = xd )
| ~ aElement0(xx) ),
inference(resolution,[status(thm)],[c_130,c_113221]) ).
tff(c_113540,plain,
( aReductOfIn0(xx,xd,xR)
| ( xx = xd ) ),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_113394]) ).
tff(c_113541,plain,
aReductOfIn0(xx,xd,xR),
inference(negUnitSimplification,[status(thm)],[c_72239,c_113540]) ).
tff(c_113557,plain,
! [W0_70] :
( ~ aNormalFormOfIn0(xd,W0_70,xR)
| ~ aRewritingSystem0(xR)
| ~ aElement0(W0_70) ),
inference(resolution,[status(thm)],[c_113541,c_80]) ).
tff(c_114042,plain,
! [W0_3023] :
( ~ aNormalFormOfIn0(xd,W0_3023,xR)
| ~ aElement0(W0_3023) ),
inference(demodulation,[status(thm),theory(equality)],[c_88,c_113557]) ).
tff(c_114048,plain,
~ aElement0(xu),
inference(resolution,[status(thm)],[c_102155,c_114042]) ).
tff(c_114065,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_114,c_114048]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : COM021+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.12 % 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.32 % Computer : n003.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Thu Aug 3 23:36:38 EDT 2023
% 0.13/0.32 % CPUTime :
% 28.12/14.11 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 28.12/14.12
% 28.12/14.12 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 28.27/14.15
% 28.27/14.15 Inference rules
% 28.27/14.15 ----------------------
% 28.27/14.15 #Ref : 0
% 28.27/14.15 #Sup : 18010
% 28.27/14.15 #Fact : 0
% 28.27/14.15 #Define : 0
% 28.27/14.15 #Split : 216
% 28.27/14.15 #Chain : 0
% 28.27/14.15 #Close : 0
% 28.27/14.15
% 28.27/14.15 Ordering : KBO
% 28.27/14.15
% 28.27/14.15 Simplification rules
% 28.27/14.15 ----------------------
% 28.27/14.15 #Subsume : 6152
% 28.27/14.15 #Demod : 37533
% 28.27/14.15 #Tautology : 4589
% 28.27/14.15 #SimpNegUnit : 2430
% 28.27/14.15 #BackRed : 1397
% 28.27/14.15
% 28.27/14.15 #Partial instantiations: 0
% 28.27/14.15 #Strategies tried : 1
% 28.27/14.15
% 28.27/14.15 Timing (in seconds)
% 28.27/14.15 ----------------------
% 28.27/14.16 Preprocessing : 0.59
% 28.27/14.16 Parsing : 0.30
% 28.27/14.16 CNF conversion : 0.05
% 28.27/14.16 Main loop : 12.48
% 28.27/14.16 Inferencing : 3.56
% 28.27/14.16 Reduction : 5.24
% 28.27/14.16 Demodulation : 3.74
% 28.27/14.16 BG Simplification : 0.17
% 28.27/14.16 Subsumption : 2.82
% 28.27/14.16 Abstraction : 0.26
% 28.27/14.16 MUC search : 0.00
% 28.27/14.16 Cooper : 0.00
% 28.27/14.16 Total : 13.12
% 28.27/14.16 Index Insertion : 0.00
% 28.27/14.16 Index Deletion : 0.00
% 28.27/14.16 Index Matching : 0.00
% 28.27/14.16 BG Taut test : 0.00
%------------------------------------------------------------------------------