TSTP Solution File: SWV104+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV104+1 : TPTP v8.1.2. Bugfixed v3.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 : n023.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:02:55 EDT 2023
% Result : Theorem 12.67s 3.89s
% Output : CNFRefutation 12.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 77
% Syntax : Number of formulae : 131 ( 48 unt; 62 typ; 0 def)
% Number of atoms : 108 ( 65 equ)
% Maximal formula atoms : 12 ( 1 avg)
% Number of connectives : 75 ( 36 ~; 22 |; 12 &)
% ( 2 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 160 ( 49 >; 111 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 57 ( 57 usr; 12 con; 0-8 aty)
% Number of variables : 53 (; 53 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ lt > leq > gt > geq > tptp_update3 > tptp_update2 > tptp_const_array2 > sum > a_select3 > uniform_int_rnd > tptp_msub > tptp_mmul > tptp_madd > tptp_const_array1 > plus > minus > dim > a_select2 > #nlpp > trans > succ > pred > inv > xinit_defuse > use > u_defuse > true > tptp_minus_1 > tptp_float_0_0 > n5 > n4 > n3 > n2 > n1 > n0 > def > #skF_13 > #skF_24 > #skF_17 > #skF_23 > #skF_6 > #skF_19 > #skF_27 > #skF_21 > #skF_25 > #skF_12 > #skF_18 > #skF_3 > #skF_26 > #skF_20 > #skF_11 > #skF_7 > #skF_9 > #skF_15 > #skF_22 > #skF_14 > #skF_2 > #skF_8 > #skF_1 > #skF_5 > #skF_4 > #skF_16 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(xinit_defuse,type,
xinit_defuse: $i ).
tff(true,type,
true: $o ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i * $i ) > $i ).
tff(tptp_const_array2,type,
tptp_const_array2: ( $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(tptp_minus_1,type,
tptp_minus_1: $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i * $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i * $i ) > $i ).
tff(a_select3,type,
a_select3: ( $i * $i * $i ) > $i ).
tff(tptp_float_0_0,type,
tptp_float_0_0: $i ).
tff(a_select2,type,
a_select2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(trans,type,
trans: $i > $i ).
tff(tptp_update3,type,
tptp_update3: ( $i * $i * $i * $i ) > $i ).
tff(n3,type,
n3: $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(use,type,
use: $i ).
tff(inv,type,
inv: $i > $i ).
tff(n1,type,
n1: $i ).
tff(tptp_madd,type,
tptp_madd: ( $i * $i ) > $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(tptp_update2,type,
tptp_update2: ( $i * $i * $i ) > $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(n4,type,
n4: $i ).
tff(tptp_msub,type,
tptp_msub: ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff(tptp_const_array1,type,
tptp_const_array1: ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(tptp_mmul,type,
tptp_mmul: ( $i * $i ) > $i ).
tff(uniform_int_rnd,type,
uniform_int_rnd: ( $i * $i ) > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(def,type,
def: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff(u_defuse,type,
u_defuse: $i ).
tff(n2,type,
n2: $i ).
tff(n5,type,
n5: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(succ,type,
succ: $i > $i ).
tff(pred,type,
pred: $i > $i ).
tff(sum,type,
sum: ( $i * $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(dim,type,
dim: ( $i * $i ) > $i ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_74,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
tff(f_89,axiom,
! [X,Y] :
( geq(X,Y)
<=> leq(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_geq) ).
tff(f_453,axiom,
! [X,U,VAL] : ( a_select2(tptp_update2(X,U,VAL),U) = VAL ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
tff(f_460,axiom,
! [I,U,X,VAL,VAL2] :
( ( ( I != U )
& ( a_select2(X,U) = VAL ) )
=> ( a_select2(tptp_update2(X,I,VAL2),U) = VAL ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_2) ).
tff(f_596,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).
tff(f_597,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_3) ).
tff(f_595,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
tff(f_593,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).
tff(f_116,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
tff(f_71,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
tff(f_504,negated_conjecture,
~ ( ( ( a_select3(u_defuse,n0,n0) = use )
& ( a_select3(u_defuse,n1,n0) = use )
& ( a_select3(u_defuse,n2,n0) = use )
& ( a_select2(xinit_defuse,n3) = use )
& ( a_select2(xinit_defuse,n4) = use )
& ( a_select2(xinit_defuse,n5) = use ) )
=> ( ( a_select3(u_defuse,n0,n0) = use )
& ( a_select3(u_defuse,n1,n0) = use )
& ( a_select3(u_defuse,n2,n0) = use )
& ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) = use )
& ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) = use )
& ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) = use ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',quaternion_ds1_inuse_0016) ).
tff(f_108,axiom,
! [X] : gt(succ(X),X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',gt_succ) ).
tff(f_506,axiom,
gt(n5,n4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_5_4) ).
tff(f_68,axiom,
! [X,Y,Z] :
( ( gt(X,Y)
& gt(Y,Z) )
=> gt(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
tff(f_594,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).
tff(c_8,plain,
! [X_7] : leq(X_7,X_7),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_3784,plain,
! [X_290,Y_291] :
( geq(X_290,Y_291)
| ~ leq(Y_291,X_290) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_3792,plain,
! [X_7] : geq(X_7,X_7),
inference(resolution,[status(thm)],[c_8,c_3784]) ).
tff(c_498,plain,
! [X_168,U_169,VAL_170] : ( a_select2(tptp_update2(X_168,U_169,VAL_170),U_169) = VAL_170 ),
inference(cnfTransformation,[status(thm)],[f_453]) ).
tff(c_6381,plain,
! [X_371,I_372,VAL2_373,U_374] :
( ( a_select2(tptp_update2(X_371,I_372,VAL2_373),U_374) = a_select2(X_371,U_374) )
| ( U_374 = I_372 ) ),
inference(cnfTransformation,[status(thm)],[f_460]) ).
tff(c_586,plain,
succ(succ(n0)) = n2,
inference(cnfTransformation,[status(thm)],[f_596]) ).
tff(c_588,plain,
succ(succ(succ(n0))) = n3,
inference(cnfTransformation,[status(thm)],[f_597]) ).
tff(c_589,plain,
succ(n2) = n3,
inference(demodulation,[status(thm),theory(equality)],[c_586,c_588]) ).
tff(c_584,plain,
succ(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_595]) ).
tff(c_590,plain,
succ(n1) = n2,
inference(demodulation,[status(thm),theory(equality)],[c_584,c_586]) ).
tff(c_580,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(cnfTransformation,[status(thm)],[f_593]) ).
tff(c_592,plain,
succ(n3) = n4,
inference(demodulation,[status(thm),theory(equality)],[c_589,c_590,c_584,c_580]) ).
tff(c_1473,plain,
! [Y_226,X_227] :
( gt(succ(Y_226),X_227)
| ~ leq(X_227,Y_226) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_6,plain,
! [X_6] : ~ gt(X_6,X_6),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_1516,plain,
! [Y_228] : ~ leq(succ(Y_228),Y_228),
inference(resolution,[status(thm)],[c_1473,c_6]) ).
tff(c_1561,plain,
~ leq(n4,n3),
inference(superposition,[status(thm),theory(equality)],[c_592,c_1516]) ).
tff(c_500,plain,
! [X_173,I_171,VAL2_175,U_172] :
( ( a_select2(tptp_update2(X_173,I_171,VAL2_175),U_172) = a_select2(X_173,U_172) )
| ( U_172 = I_171 ) ),
inference(cnfTransformation,[status(thm)],[f_460]) ).
tff(c_3207,plain,
! [X_276,I_277,VAL2_278,U_279] :
( ( a_select2(tptp_update2(X_276,I_277,VAL2_278),U_279) = a_select2(X_276,U_279) )
| ( U_279 = I_277 ) ),
inference(cnfTransformation,[status(thm)],[f_460]) ).
tff(c_524,plain,
a_select3(u_defuse,n0,n0) = use,
inference(cnfTransformation,[status(thm)],[f_504]) ).
tff(c_522,plain,
a_select3(u_defuse,n1,n0) = use,
inference(cnfTransformation,[status(thm)],[f_504]) ).
tff(c_520,plain,
a_select3(u_defuse,n2,n0) = use,
inference(cnfTransformation,[status(thm)],[f_504]) ).
tff(c_512,plain,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use )
| ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use )
| ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use )
| ( a_select3(u_defuse,n2,n0) != use )
| ( a_select3(u_defuse,n1,n0) != use )
| ( a_select3(u_defuse,n0,n0) != use ) ),
inference(cnfTransformation,[status(thm)],[f_504]) ).
tff(c_595,plain,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n5) != use )
| ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use )
| ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ) ),
inference(demodulation,[status(thm),theory(equality)],[c_524,c_522,c_520,c_512]) ).
tff(c_597,plain,
( ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use )
| ( a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use ) ),
inference(demodulation,[status(thm),theory(equality)],[c_498,c_595]) ).
tff(c_994,plain,
a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n3) != use,
inference(splitLeft,[status(thm)],[c_597]) ).
tff(c_3217,plain,
( ( a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use )
| ( n5 = n3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_3207,c_994]) ).
tff(c_3341,plain,
a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n3) != use,
inference(splitLeft,[status(thm)],[c_3217]) ).
tff(c_3639,plain,
( ( a_select2(tptp_update2(xinit_defuse,n3,use),n3) != use )
| ( n4 = n3 ) ),
inference(superposition,[status(thm),theory(equality)],[c_500,c_3341]) ).
tff(c_3641,plain,
n4 = n3,
inference(demodulation,[status(thm),theory(equality)],[c_498,c_3639]) ).
tff(c_3642,plain,
a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n3,use),n3) != use,
inference(demodulation,[status(thm),theory(equality)],[c_3641,c_3341]) ).
tff(c_3698,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_498,c_3642]) ).
tff(c_3699,plain,
n5 = n3,
inference(splitRight,[status(thm)],[c_3217]) ).
tff(c_28,plain,
! [X_21] : gt(succ(X_21),X_21),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_526,plain,
gt(n5,n4),
inference(cnfTransformation,[status(thm)],[f_506]) ).
tff(c_2832,plain,
! [X_262,Z_263,Y_264] :
( gt(X_262,Z_263)
| ~ gt(Y_264,Z_263)
| ~ gt(X_262,Y_264) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_3228,plain,
! [X_280] :
( gt(X_280,n4)
| ~ gt(X_280,n5) ),
inference(resolution,[status(thm)],[c_526,c_2832]) ).
tff(c_3248,plain,
gt(succ(n5),n4),
inference(resolution,[status(thm)],[c_28,c_3228]) ).
tff(c_34,plain,
! [X_24,Y_25] :
( leq(X_24,Y_25)
| ~ gt(succ(Y_25),X_24) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_3262,plain,
leq(n4,n5),
inference(resolution,[status(thm)],[c_3248,c_34]) ).
tff(c_3706,plain,
leq(n4,n3),
inference(demodulation,[status(thm),theory(equality)],[c_3699,c_3262]) ).
tff(c_3751,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1561,c_3706]) ).
tff(c_3752,plain,
a_select2(tptp_update2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n5,use),n4) != use,
inference(splitRight,[status(thm)],[c_597]) ).
tff(c_6391,plain,
( ( a_select2(tptp_update2(tptp_update2(xinit_defuse,n3,use),n4,use),n4) != use )
| ( n5 = n4 ) ),
inference(superposition,[status(thm),theory(equality)],[c_6381,c_3752]) ).
tff(c_6407,plain,
n5 = n4,
inference(demodulation,[status(thm),theory(equality)],[c_498,c_6391]) ).
tff(c_16,plain,
! [Y_14,X_13] :
( leq(Y_14,X_13)
| ~ geq(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_582,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(cnfTransformation,[status(thm)],[f_594]) ).
tff(c_591,plain,
succ(succ(n3)) = n5,
inference(demodulation,[status(thm),theory(equality)],[c_589,c_590,c_584,c_582]) ).
tff(c_593,plain,
succ(n4) = n5,
inference(demodulation,[status(thm),theory(equality)],[c_592,c_591]) ).
tff(c_4466,plain,
! [Y_320,X_321] :
( gt(succ(Y_320),X_321)
| ~ leq(X_321,Y_320) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_4513,plain,
! [Y_322] : ~ leq(succ(Y_322),Y_322),
inference(resolution,[status(thm)],[c_4466,c_6]) ).
tff(c_4542,plain,
~ leq(n5,n4),
inference(superposition,[status(thm),theory(equality)],[c_593,c_4513]) ).
tff(c_4571,plain,
~ geq(n4,n5),
inference(resolution,[status(thm)],[c_16,c_4542]) ).
tff(c_6423,plain,
~ geq(n4,n4),
inference(demodulation,[status(thm),theory(equality)],[c_6407,c_4571]) ).
tff(c_6453,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3792,c_6423]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV104+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/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.14/0.35 % Computer : n023.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:23:37 EDT 2023
% 0.14/0.35 % CPUTime :
% 12.67/3.89 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 12.67/3.90
% 12.67/3.90 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 12.67/3.95
% 12.67/3.95 Inference rules
% 12.67/3.95 ----------------------
% 12.67/3.95 #Ref : 0
% 12.67/3.95 #Sup : 1548
% 12.67/3.95 #Fact : 4
% 12.67/3.95 #Define : 0
% 12.67/3.95 #Split : 2
% 12.67/3.95 #Chain : 0
% 12.67/3.95 #Close : 0
% 12.67/3.95
% 12.67/3.95 Ordering : KBO
% 12.67/3.95
% 12.67/3.95 Simplification rules
% 12.67/3.95 ----------------------
% 12.67/3.95 #Subsume : 231
% 12.67/3.95 #Demod : 615
% 12.67/3.95 #Tautology : 462
% 12.67/3.95 #SimpNegUnit : 7
% 12.67/3.95 #BackRed : 136
% 12.67/3.95
% 12.67/3.95 #Partial instantiations: 0
% 12.67/3.95 #Strategies tried : 1
% 12.67/3.95
% 12.67/3.95 Timing (in seconds)
% 12.67/3.95 ----------------------
% 12.67/3.95 Preprocessing : 0.91
% 12.67/3.95 Parsing : 0.37
% 12.67/3.95 CNF conversion : 0.07
% 12.67/3.95 Main loop : 1.95
% 12.67/3.95 Inferencing : 0.50
% 12.67/3.95 Reduction : 0.81
% 12.67/3.95 Demodulation : 0.57
% 12.67/3.95 BG Simplification : 0.12
% 12.67/3.95 Subsumption : 0.41
% 12.67/3.95 Abstraction : 0.08
% 12.67/3.96 MUC search : 0.00
% 12.67/3.96 Cooper : 0.00
% 12.67/3.96 Total : 2.94
% 12.67/3.96 Index Insertion : 0.00
% 12.67/3.96 Index Deletion : 0.00
% 12.67/3.96 Index Matching : 0.00
% 12.67/3.96 BG Taut test : 0.00
%------------------------------------------------------------------------------