TSTP Solution File: DAT032_1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : DAT032_1 : TPTP v8.1.2. Released v5.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 : n021.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:37:00 EDT 2023
% Result : Theorem 11.59s 3.82s
% Output : CNFRefutation 12.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 20
% Syntax : Number of formulae : 109 ( 53 unt; 12 typ; 0 def)
% Number of atoms : 142 ( 105 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 75 ( 30 ~; 38 |; 0 &)
% ( 5 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number arithmetic : 154 ( 14 atm; 38 fun; 73 num; 29 var)
% Number of types : 3 ( 1 usr; 1 ari)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 5 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 19 ( 10 usr; 13 con; 0-2 aty)
% Number of variables : 58 (; 58 !; 0 ?; 58 :)
% Comments :
%------------------------------------------------------------------------------
%$ in > remove > add > #nlpp > count > empty > #skF_1
%Foreground sorts:
tff(collection,type,
collection: $tType ).
%Background operators:
tff('#skE_2',type,
'#skE_2': $int ).
tff('#skE_1',type,
'#skE_1': $int ).
tff('#skE_5',type,
'#skE_5': $int ).
tff('#skE_4',type,
'#skE_4': $int ).
tff('#skE_3',type,
'#skE_3': $int ).
%Foreground operators:
tff(empty,type,
empty: collection ).
tff(count,type,
count: collection > $int ).
tff('#skF_1',type,
'#skF_1': collection ).
tff(in,type,
in: ( $int * collection ) > $o ).
tff(remove,type,
remove: ( $int * collection ) > collection ).
tff(add,type,
add: ( $int * collection ) > collection ).
tff(f_142,negated_conjecture,
~ ! [U: collection] :
( $greatereq(count(remove(5,U)),7)
=> $greatereq(count(remove(4,U)),6) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
tff(f_131,axiom,
! [X14a: $int,X15: collection] :
( ~ in(X14a,X15)
<=> ( count(remove(X14a,X15)) = count(X15) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax6) ).
tff(f_135,axiom,
! [X16a: $int,X17: collection] :
( in(X16a,X17)
=> ( X17 = add(X16a,remove(X16a,X17)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax7) ).
tff(f_60,axiom,
! [Ua: $int] : ~ in(Ua,empty),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax1) ).
tff(f_71,axiom,
! [Za: $int,X1: collection,X2a: $int] :
( ( in(Za,X1)
| ( Za = X2a ) )
<=> in(Za,add(X2a,X1)) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002_0.ax',ax4) ).
tff(f_122,axiom,
! [X10a: $int,X11: collection] :
( in(X10a,X11)
<=> ( count(add(X10a,X11)) = count(X11) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax4) ).
tff(f_113,axiom,
! [X7: collection] :
( ( X7 = empty )
<=> ( count(X7) = 0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax2) ).
tff(f_126,axiom,
! [X12a: $int,X13: collection] :
( in(X12a,X13)
<=> ( count(remove(X12a,X13)) = $difference(count(X13),1) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/DAT002=1.ax',ax5) ).
tff(c_50,plain,
$greatereq(count(remove(5,'#skF_1')),7),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_52,plain,
~ $less(count(remove(5,'#skF_1')),7),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_50]) ).
tff(c_97,plain,
count(remove(5,'#skF_1')) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_101,plain,
~ $less('#skE_1',7),
inference(demodulation,[status(thm),theory(equality)],[c_97,c_52]) ).
tff(c_206,plain,
! [X14_46a: $int,X15_47: collection] :
( ( count(remove(X14_46a,X15_47)) = count(X15_47) )
| in(X14_46a,X15_47) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_54,plain,
! [X16_22a: $int,X17_23: collection] :
( ( add(X16_22a,remove(X16_22a,X17_23)) = X17_23 )
| ~ in(X16_22a,X17_23) ),
inference(cnfTransformation,[status(thm)],[f_135]) ).
tff(c_735,plain,
! [X14_83a: $int,X15_84: collection] :
( ( add(X14_83a,remove(X14_83a,X15_84)) = X15_84 )
| ( count(remove(X14_83a,X15_84)) = count(X15_84) ) ),
inference(resolution,[status(thm)],[c_206,c_54]) ).
tff(c_74,plain,
! [U_1a: $int] : ~ in(U_1a,empty),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_70,plain,
! [X2_8a: $int,X1_7: collection] : in(X2_8a,add(X2_8a,X1_7)),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_157,plain,
! [X10_39a: $int,X11_40: collection] :
( ( count(add(X10_39a,X11_40)) = count(X11_40) )
| ~ in(X10_39a,X11_40) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_372,plain,
! [X2_62a: $int,X1_63: collection] : ( count(add(X2_62a,add(X2_62a,X1_63))) = count(add(X2_62a,X1_63)) ),
inference(resolution,[status(thm)],[c_70,c_157]) ).
tff(c_63,plain,
! [X7_13: collection] :
( ( empty = X7_13 )
| ( count(X7_13) != 0 ) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_539,plain,
! [X2_73a: $int,X1_74: collection] :
( ( add(X2_73a,add(X2_73a,X1_74)) = empty )
| ( count(add(X2_73a,X1_74)) != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_372,c_63]) ).
tff(c_566,plain,
! [X2_73a: $int,X1_74: collection] :
( in(X2_73a,empty)
| ( count(add(X2_73a,X1_74)) != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_539,c_70]) ).
tff(c_591,plain,
! [X2_73a: $int,X1_74: collection] : ( count(add(X2_73a,X1_74)) != 0 ),
inference(negUnitSimplification,[status(thm)],[c_74,c_566]) ).
tff(c_794,plain,
! [X15_85: collection,X14_86a: $int] :
( ( count(X15_85) != 0 )
| ( count(remove(X14_86a,X15_85)) = count(X15_85) ) ),
inference(superposition,[status(thm),theory(equality)],[c_735,c_591]) ).
tff(c_47,plain,
~ $greatereq(count(remove(4,'#skF_1')),6),
inference(cnfTransformation,[status(thm)],[f_142]) ).
tff(c_53,plain,
$less(count(remove(4,'#skF_1')),6),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_47]) ).
tff(c_117,plain,
count(remove(4,'#skF_1')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_53]) ).
tff(c_844,plain,
( ( count('#skF_1') = '#skE_2' )
| ( count('#skF_1') != 0 ) ),
inference(superposition,[status(thm),theory(equality)],[c_794,c_117]) ).
tff(c_860,plain,
count('#skF_1') = '#skE_3',
inference(define,[status(thm),theory(equality)],[c_844]) ).
tff(c_60,plain,
! [X10_16a: $int,X11_17: collection] :
( ( count(add(X10_16a,X11_17)) = count(X11_17) )
| ~ in(X10_16a,X11_17) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_1214,plain,
! [X14_99a: $int,X15_100: collection] :
( ( count(add(X14_99a,X15_100)) = count(X15_100) )
| ( count(remove(X14_99a,X15_100)) = count(X15_100) ) ),
inference(resolution,[status(thm)],[c_206,c_60]) ).
tff(c_100,plain,
count(remove(5,'#skF_1')) = '#skE_1',
inference(define,[status(thm),theory(equality)],[c_52]) ).
tff(c_1240,plain,
( ( count('#skF_1') = '#skE_1' )
| ( count(add(5,'#skF_1')) = count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_1214,c_100]) ).
tff(c_1287,plain,
( ( '#skE_3' = '#skE_1' )
| ( count(add(5,'#skF_1')) = '#skE_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_860,c_860,c_1240]) ).
tff(c_1316,plain,
count(add(5,'#skF_1')) = '#skE_5',
inference(define,[status(thm),theory(equality)],[c_1287]) ).
tff(c_1320,plain,
( ( '#skE_3' = '#skE_1' )
| ( '#skE_5' = '#skE_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1316,c_1287]) ).
tff(c_1322,plain,
'#skE_5' = '#skE_3',
inference(splitLeft,[status(thm)],[c_1320]) ).
tff(c_1319,plain,
count(add(5,'#skF_1')) = '#skE_5',
inference(define,[status(thm),theory(equality)],[c_1287]) ).
tff(c_1343,plain,
count(add(5,'#skF_1')) = '#skE_3',
inference(demodulation,[status(thm),theory(equality)],[c_1322,c_1319]) ).
tff(c_59,plain,
! [X10_16a: $int,X11_17: collection] :
( in(X10_16a,X11_17)
| ( count(add(X10_16a,X11_17)) != count(X11_17) ) ),
inference(cnfTransformation,[status(thm)],[f_122]) ).
tff(c_35,plain,
! [X12_18a: $int,X13_19: collection] :
( ( count(remove(X12_18a,X13_19)) = $difference(count(X13_19),1) )
| ~ in(X12_18a,X13_19) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_489,plain,
! [X12_70a: $int,X13_71: collection] :
( ( count(remove(X12_70a,X13_71)) = $sum($uminus(1),count(X13_71)) )
| ~ in(X12_70a,X13_71) ),
inference(backgroundSimplification,[status(thm),theory('LRFIA')],[c_35]) ).
tff(c_8998,plain,
! [X10_297a: $int,X11_298: collection] :
( ( count(remove(X10_297a,X11_298)) = $sum($uminus(1),count(X11_298)) )
| ( count(add(X10_297a,X11_298)) != count(X11_298) ) ),
inference(resolution,[status(thm)],[c_59,c_489]) ).
tff(c_9077,plain,
( ( $sum($uminus(1),count('#skF_1')) = '#skE_1' )
| ( count(add(5,'#skF_1')) != count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_8998,c_100]) ).
tff(c_9185,plain,
$sum($uminus(1),'#skE_3') = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_1343,c_860,c_860,c_9077]) ).
tff(c_9187,plain,
'#skE_3' = $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_9185]) ).
tff(c_1237,plain,
( ( count('#skF_1') = '#skE_2' )
| ( count(add(4,'#skF_1')) = count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_1214,c_117]) ).
tff(c_1285,plain,
( ( '#skE_3' = '#skE_2' )
| ( count(add(4,'#skF_1')) = '#skE_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_860,c_860,c_1237]) ).
tff(c_1309,plain,
count(add(4,'#skF_1')) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_1285]) ).
tff(c_1313,plain,
( ( '#skE_3' = '#skE_2' )
| ( '#skE_4' = '#skE_3' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_1309,c_1285]) ).
tff(c_1315,plain,
'#skE_4' = '#skE_3',
inference(splitLeft,[status(thm)],[c_1313]) ).
tff(c_1312,plain,
count(add(4,'#skF_1')) = '#skE_4',
inference(define,[status(thm),theory(equality)],[c_1285]) ).
tff(c_1324,plain,
count(add(4,'#skF_1')) = '#skE_3',
inference(demodulation,[status(thm),theory(equality)],[c_1315,c_1312]) ).
tff(c_9074,plain,
( ( $sum($uminus(1),count('#skF_1')) = '#skE_2' )
| ( count(add(4,'#skF_1')) != count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_8998,c_117]) ).
tff(c_9181,plain,
$sum($uminus(1),'#skE_3') = '#skE_2',
inference(demodulation,[status(thm),theory(equality)],[c_1324,c_860,c_860,c_9074]) ).
tff(c_9183,plain,
'#skE_3' = $sum(1,'#skE_2'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_9181]) ).
tff(c_9258,plain,
$sum(1,'#skE_2') = $sum(1,'#skE_1'),
inference(demodulation,[status(thm),theory(equality)],[c_9187,c_9183]) ).
tff(c_9261,plain,
'#skE_2' = '#skE_1',
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_9258]) ).
tff(c_114,plain,
count(remove(4,'#skF_1')) = '#skE_2',
inference(define,[status(thm),theory(equality)],[c_53]) ).
tff(c_118,plain,
$less('#skE_2',6),
inference(demodulation,[status(thm),theory(equality)],[c_114,c_53]) ).
tff(c_9271,plain,
$less('#skE_1',6),
inference(demodulation,[status(thm),theory(equality)],[c_9261,c_118]) ).
tff(c_9272,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_9271,c_101]) ).
tff(c_9275,plain,
'#skE_3' = '#skE_1',
inference(splitRight,[status(thm)],[c_1320]) ).
tff(c_9285,plain,
'#skE_4' = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_9275,c_1315]) ).
tff(c_9307,plain,
count(add(4,'#skF_1')) = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_9285,c_1312]) ).
tff(c_9286,plain,
count('#skF_1') = '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_9275,c_860]) ).
tff(c_190,plain,
! [X14_44a: $int,X15_45: collection] :
( ~ in(X14_44a,X15_45)
| ( count(remove(X14_44a,X15_45)) != count(X15_45) ) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_9393,plain,
! [X10_301a: $int,X11_302: collection] :
( ( count(remove(X10_301a,X11_302)) != count(X11_302) )
| ( count(add(X10_301a,X11_302)) != count(X11_302) ) ),
inference(resolution,[status(thm)],[c_59,c_190]) ).
tff(c_9417,plain,
( ( count('#skF_1') != '#skE_2' )
| ( count(add(4,'#skF_1')) != count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_117,c_9393]) ).
tff(c_9439,plain,
'#skE_2' != '#skE_1',
inference(demodulation,[status(thm),theory(equality)],[c_9307,c_9286,c_9286,c_9417]) ).
tff(c_56,plain,
! [X14_20a: $int,X15_21: collection] :
( ( count(remove(X14_20a,X15_21)) = count(X15_21) )
| in(X14_20a,X15_21) ),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_14991,plain,
! [X14_440a: $int,X15_441: collection] :
( ( count(remove(X14_440a,X15_441)) = $sum($uminus(1),count(X15_441)) )
| ( count(remove(X14_440a,X15_441)) = count(X15_441) ) ),
inference(resolution,[status(thm)],[c_56,c_489]) ).
tff(c_15059,plain,
( ( $sum($uminus(1),count('#skF_1')) = '#skE_2' )
| ( count(remove(4,'#skF_1')) = count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_14991,c_117]) ).
tff(c_15150,plain,
( ( '#skE_2' = $sum($uminus(1),'#skE_1') )
| ( '#skE_2' = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_9286,c_117,c_9286,c_15059]) ).
tff(c_15152,plain,
'#skE_2' = $sum($uminus(1),'#skE_1'),
inference(negUnitSimplification,[status(thm)],[c_9439,c_15150]) ).
tff(c_15200,plain,
$less($sum($uminus(1),'#skE_1'),6),
inference(demodulation,[status(thm),theory(equality)],[c_15152,c_118]) ).
tff(c_15202,plain,
$less('#skE_1',7),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_15200]) ).
tff(c_15205,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_101,c_15202]) ).
tff(c_15208,plain,
'#skE_3' = '#skE_2',
inference(splitRight,[status(thm)],[c_1313]) ).
tff(c_1272,plain,
( ( count(add(5,'#skF_1')) = count('#skF_1') )
| ( count('#skF_1') = '#skE_1' ) ),
inference(superposition,[status(thm),theory(equality)],[c_100,c_1214]) ).
tff(c_1308,plain,
( ( count(add(5,'#skF_1')) = '#skE_3' )
| ( '#skE_3' = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_860,c_860,c_1272]) ).
tff(c_15210,plain,
count(add(5,'#skF_1')) = '#skE_5',
inference(define,[status(thm),theory(equality)],[c_1308]) ).
tff(c_15214,plain,
( ( '#skE_5' = '#skE_3' )
| ( '#skE_3' = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_15210,c_1308]) ).
tff(c_15240,plain,
( ( '#skE_5' = '#skE_2' )
| ( '#skE_2' = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_15208,c_15208,c_15214]) ).
tff(c_15242,plain,
'#skE_2' = '#skE_1',
inference(splitLeft,[status(thm)],[c_15240]) ).
tff(c_15261,plain,
$less('#skE_1',6),
inference(demodulation,[status(thm),theory(equality)],[c_15242,c_118]) ).
tff(c_15283,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_15261,c_101]) ).
tff(c_15287,plain,
'#skE_2' != '#skE_1',
inference(splitRight,[status(thm)],[c_15240]) ).
tff(c_15221,plain,
count('#skF_1') = '#skE_2',
inference(demodulation,[status(thm),theory(equality)],[c_15208,c_860]) ).
tff(c_19375,plain,
! [X14_572a: $int,X15_573: collection] :
( ( count(remove(X14_572a,X15_573)) = $sum($uminus(1),count(X15_573)) )
| ( count(remove(X14_572a,X15_573)) = count(X15_573) ) ),
inference(resolution,[status(thm)],[c_56,c_489]) ).
tff(c_19439,plain,
( ( $sum($uminus(1),count('#skF_1')) = '#skE_1' )
| ( count(remove(5,'#skF_1')) = count('#skF_1') ) ),
inference(superposition,[status(thm),theory(equality)],[c_19375,c_100]) ).
tff(c_19520,plain,
( ( $sum($uminus(1),'#skE_2') = '#skE_1' )
| ( '#skE_2' = '#skE_1' ) ),
inference(demodulation,[status(thm),theory(equality)],[c_100,c_15221,c_15221,c_19439]) ).
tff(c_19521,plain,
$sum($uminus(1),'#skE_2') = '#skE_1',
inference(negUnitSimplification,[status(thm)],[c_15287,c_19520]) ).
tff(c_19523,plain,
'#skE_2' = $sum(1,'#skE_1'),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_19521]) ).
tff(c_19579,plain,
$less($sum(1,'#skE_1'),6),
inference(demodulation,[status(thm),theory(equality)],[c_19523,c_118]) ).
tff(c_19589,plain,
$less('#skE_1',5),
inference(backgroundSimplification,[status(thm),theory('LIA')],[c_19579]) ).
tff(c_19590,plain,
$false,
inference(close,[status(thm),theory('LIA')],[c_19589,c_101]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT032_1 : TPTP v8.1.2. Released v5.0.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.34 % Computer : n021.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 13:14:06 EDT 2023
% 0.13/0.35 % CPUTime :
% 11.59/3.82 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.59/3.83
% 11.59/3.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.03/3.91
% 12.03/3.91 Inference rules
% 12.03/3.91 ----------------------
% 12.03/3.91 #Ref : 0
% 12.03/3.91 #Sup : 3969
% 12.03/3.91 #Fact : 5
% 12.03/3.91 #Define : 6
% 12.03/3.91 #Split : 89
% 12.03/3.91 #Chain : 0
% 12.03/3.91 #Close : 3
% 12.03/3.91
% 12.03/3.91 Ordering : LPO
% 12.03/3.91
% 12.03/3.91 Simplification rules
% 12.03/3.91 ----------------------
% 12.03/3.91 #Subsume : 1079
% 12.03/3.91 #Demod : 2480
% 12.03/3.91 #Tautology : 1364
% 12.03/3.91 #SimpNegUnit : 91
% 12.03/3.91 #BackRed : 50
% 12.03/3.91
% 12.03/3.91 #Partial instantiations: 0
% 12.03/3.91 #Strategies tried : 1
% 12.03/3.91
% 12.03/3.91 Timing (in seconds)
% 12.03/3.91 ----------------------
% 12.03/3.91 Preprocessing : 0.56
% 12.03/3.91 Parsing : 0.30
% 12.03/3.91 CNF conversion : 0.04
% 12.03/3.91 Main loop : 2.24
% 12.03/3.91 Inferencing : 0.64
% 12.03/3.91 Reduction : 0.61
% 12.03/3.91 Demodulation : 0.43
% 12.03/3.91 BG Simplification : 0.23
% 12.03/3.91 Subsumption : 0.50
% 12.03/3.91 Abstraction : 0.09
% 12.03/3.92 MUC search : 0.00
% 12.03/3.92 Cooper : 0.06
% 12.03/3.92 Total : 2.90
% 12.03/3.92 Index Insertion : 0.00
% 12.03/3.92 Index Deletion : 0.00
% 12.03/3.92 Index Matching : 0.00
% 12.03/3.92 BG Taut test : 0.00
%------------------------------------------------------------------------------