TSTP Solution File: SWV465+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV465+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 : n015.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:04:17 EDT 2023
% Result : Theorem 20.01s 8.46s
% Output : CNFRefutation 20.01s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 57
% Syntax : Number of formulae : 102 ( 31 unt; 50 typ; 0 def)
% Number of atoms : 185 ( 82 equ)
% Maximal formula atoms : 88 ( 3 avg)
% Number of connectives : 206 ( 73 ~; 45 |; 63 &)
% ( 3 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 32 ( 4 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 39 ( 27 >; 12 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 45 ( 45 usr; 23 con; 0-4 aty)
% Number of variables : 91 (; 91 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ setIn > leq > elem > pidElem > ordered > snoc > m_Ack > index > cons > #nlpp > tail > s > queue > pidMsg > m_NotNorm > m_NormQ > m_Ldr > m_Halt > m_Down > last > init > host > head > zero > wait > status > setEmpty > q_nil > pids > pendack > norm > nil > nbr_proc > ldr > elid > elec_2 > elec_1 > down > alive > #skF_2 > #skF_11 > #skF_1 > #skF_7 > #skF_3 > #skF_10 > #skF_8 > #skF_5 > #skF_6 > #skF_9 > #skF_12 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(m_NormQ,type,
m_NormQ: $i > $i ).
tff(nbr_proc,type,
nbr_proc: $i ).
tff(pids,type,
pids: $i ).
tff(down,type,
down: $i ).
tff(elec_1,type,
elec_1: $i ).
tff(ordered,type,
ordered: $i > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff(status,type,
status: $i ).
tff(snoc,type,
snoc: ( $i * $i ) > $i ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(s,type,
s: $i > $i ).
tff(host,type,
host: $i > $i ).
tff(m_Halt,type,
m_Halt: $i > $i ).
tff('#skF_1',type,
'#skF_1': $i > $i ).
tff(pidMsg,type,
pidMsg: $i > $i ).
tff(pidElem,type,
pidElem: $i > $o ).
tff(elem,type,
elem: ( $i * $i ) > $o ).
tff(alive,type,
alive: $i ).
tff('#skF_7',type,
'#skF_7': $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i * $i ) > $i ).
tff(setIn,type,
setIn: ( $i * $i ) > $o ).
tff(init,type,
init: $i > $i ).
tff(m_Ack,type,
m_Ack: ( $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(m_Ldr,type,
m_Ldr: $i > $i ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(last,type,
last: $i > $i ).
tff(setEmpty,type,
setEmpty: $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(index,type,
index: ( $i * $i ) > $i ).
tff(cons,type,
cons: ( $i * $i ) > $i ).
tff(ldr,type,
ldr: $i ).
tff(wait,type,
wait: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(tail,type,
tail: $i > $i ).
tff(m_Down,type,
m_Down: $i > $i ).
tff(m_NotNorm,type,
m_NotNorm: $i > $i ).
tff(q_nil,type,
q_nil: $i ).
tff(queue,type,
queue: $i > $i ).
tff(head,type,
head: $i > $i ).
tff(elid,type,
elid: $i ).
tff(pendack,type,
pendack: $i ).
tff(nil,type,
nil: $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(norm,type,
norm: $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(zero,type,
zero: $i ).
tff(elec_2,type,
elec_2: $i ).
tff(f_545,negated_conjecture,
~ ! [V,W,X] :
( ( ! [Y,Z] :
( elem(m_Ldr(Z),queue(host(Y)))
=> ~ leq(host(Y),host(Z)) )
& ! [Y,Z] :
( elem(m_Down(Z),queue(host(Y)))
=> ( host(Z) != host(Y) ) )
& ! [Y,Z] :
( elem(m_Halt(Z),queue(host(Y)))
=> ~ leq(host(Y),host(Z)) )
& ! [Y,Z,Pid0] :
( elem(m_Ack(Pid0,Y),queue(host(Z)))
=> ~ leq(host(Y),host(Pid0)) )
& ! [Y,Z] :
( ( ( Z != Y )
& ( host(Z) = host(Y) ) )
=> ( ~ setIn(Y,alive)
| ~ setIn(Z,alive) ) )
& ! [Y,Z] :
( ( setIn(Z,alive)
& elem(m_Ack(Z,Y),queue(host(Z))) )
=> leq(host(Y),index(pendack,host(Z))) )
& ! [Y,Z] :
( ( setIn(Z,alive)
& ( index(status,host(Z)) = elec_1 ) )
=> ~ elem(m_Ack(Z,Y),queue(host(Z))) )
& ! [Y] :
( ( ( ( index(status,host(Y)) = elec_1 )
| ( index(status,host(Y)) = elec_2 ) )
& setIn(Y,alive) )
=> ( index(elid,host(Y)) = Y ) )
& ! [Y,Z] :
( ( ~ leq(host(Y),host(Z))
& setIn(Y,alive)
& setIn(Z,alive)
& ( index(status,host(Y)) = elec_2 )
& ( index(status,host(Z)) = elec_2 ) )
=> leq(index(pendack,host(Z)),host(Y)) )
& ! [Y,Z,Pid0] :
( ( setIn(Pid0,alive)
& elem(m_Down(Z),queue(host(Pid0)))
& ( host(Z) = host(Y) ) )
=> ~ ( setIn(Y,alive)
& ( index(ldr,host(Y)) = host(Y) )
& ( index(status,host(Y)) = norm ) ) )
& ! [Y,Z,Pid0] :
( ( setIn(Y,alive)
& setIn(Pid0,alive)
& ( host(Pid0) = host(Z) )
& ( index(status,host(Y)) = elec_2 )
& ( index(status,host(Pid0)) = elec_2 ) )
=> ~ elem(m_Ack(Y,Z),queue(host(Y))) )
& ! [Y,Z] :
( ( ~ leq(host(Y),host(Z))
& setIn(Y,alive)
& setIn(Z,alive)
& ( index(status,host(Y)) = elec_2 )
& ( index(status,host(Z)) = elec_2 ) )
=> ~ leq(index(pendack,host(Y)),index(pendack,host(Z))) )
& ! [Y,Z,Pid0] :
( ( ~ leq(index(pendack,host(Pid0)),host(Y))
& setIn(Pid0,alive)
& elem(m_Halt(Pid0),queue(host(Z)))
& ( index(status,host(Pid0)) = elec_2 ) )
=> ~ ( setIn(Y,alive)
& ( index(ldr,host(Y)) = host(Y) )
& ( index(status,host(Y)) = norm ) ) )
& ! [Y,Z,Pid20,Pid0] :
( ( ! [V0] :
( ( ~ leq(host(Pid0),V0)
& leq(s(zero),V0) )
=> ( setIn(V0,index(down,host(Pid0)))
| ( V0 = host(Pid20) ) ) )
& elem(m_Down(Pid20),queue(host(Pid0)))
& ( host(Pid0) = host(Z) )
& ( host(Pid0) = nbr_proc )
& ( index(status,host(Pid0)) = elec_1 ) )
=> ~ ( setIn(Y,alive)
& elem(m_Down(Z),queue(host(Y))) ) )
& ! [Y,Z,Pid20,Pid0] :
( ( setIn(Pid0,alive)
& elem(m_Ack(Pid0,Z),queue(host(Pid0)))
& elem(m_Down(Pid20),queue(host(Pid0)))
& leq(nbr_proc,s(index(pendack,host(Pid0))))
& ( index(status,host(Pid0)) = elec_2 )
& ( host(Z) = index(pendack,host(Pid0)) )
& ( host(Pid20) = s(index(pendack,host(Pid0))) ) )
=> ~ ( setIn(Y,alive)
& ( index(ldr,host(Y)) = host(Y) )
& ( index(status,host(Y)) = norm ) ) )
& ( queue(host(X)) = cons(m_NormQ(W),V) ) )
=> ( setIn(X,alive)
=> ( ( index(status,host(X)) != norm )
=> ! [Y,Z,X0,Y0] :
( ( host(W) = host(Y0) )
=> ( ( host(X) = host(Y0) )
=> ( ( setIn(Y0,alive)
& elem(m_Down(X0),snoc(V,m_NotNorm(W)))
& elem(m_Ack(Y0,Z),snoc(V,m_NotNorm(W)))
& leq(nbr_proc,s(index(pendack,host(Y0))))
& ( index(status,host(Y0)) = elec_2 )
& ( host(Z) = index(pendack,host(Y0)) )
& ( host(X0) = s(index(pendack,host(Y0))) ) )
=> ~ ( setIn(Y,alive)
& ( index(ldr,host(Y)) = host(Y) )
& ( index(status,host(Y)) = norm ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f_74,axiom,
! [P] : leq(host(P),nbr_proc),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
tff(f_309,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
<=> ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
tff(f_113,axiom,
! [X,Y] : ( m_Down(X) != m_NotNorm(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_19) ).
tff(f_230,axiom,
! [X,Y,Q] :
( elem(X,snoc(Q,Y))
<=> ( ( X = Y )
| elem(X,Q) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
tff(f_224,axiom,
! [X,Y,Q] :
( elem(X,cons(Y,Q))
<=> ( ( X = Y )
| elem(X,Q) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_46) ).
tff(f_95,axiom,
! [X,Y,Z] : ( m_Ack(X,Y) != m_NotNorm(Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_13) ).
tff(c_204,plain,
setIn('#skF_9',alive),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_202,plain,
index(ldr,host('#skF_9')) = host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_200,plain,
index(status,host('#skF_9')) = norm,
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_12,plain,
! [P_6] : leq(host(P_6),nbr_proc),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_208,plain,
index(pendack,host('#skF_12')) = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_206,plain,
s(index(pendack,host('#skF_12'))) = host('#skF_11'),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_271,plain,
s(host('#skF_10')) = host('#skF_11'),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_206]) ).
tff(c_212,plain,
leq(nbr_proc,s(index(pendack,host('#skF_12')))),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_270,plain,
leq(nbr_proc,s(host('#skF_10'))),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_212]) ).
tff(c_272,plain,
leq(nbr_proc,host('#skF_11')),
inference(demodulation,[status(thm),theory(equality)],[c_271,c_270]) ).
tff(c_1013,plain,
! [Y_330,X_331] :
( ( Y_330 = X_331 )
| ~ leq(Y_330,X_331)
| ~ leq(X_331,Y_330) ),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_1047,plain,
( ( host('#skF_11') = nbr_proc )
| ~ leq(host('#skF_11'),nbr_proc) ),
inference(resolution,[status(thm)],[c_272,c_1013]) ).
tff(c_1068,plain,
host('#skF_11') = nbr_proc,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1047]) ).
tff(c_42,plain,
! [Y_29,X_28] : ( m_NotNorm(Y_29) != m_Down(X_28) ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_216,plain,
elem(m_Down('#skF_11'),snoc('#skF_5',m_NotNorm('#skF_6'))),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_2357,plain,
! [X_399,Q_400,Y_401] :
( elem(X_399,Q_400)
| ( Y_401 = X_399 )
| ~ elem(X_399,snoc(Q_400,Y_401)) ),
inference(cnfTransformation,[status(thm)],[f_230]) ).
tff(c_2377,plain,
( elem(m_Down('#skF_11'),'#skF_5')
| ( m_NotNorm('#skF_6') = m_Down('#skF_11') ) ),
inference(resolution,[status(thm)],[c_216,c_2357]) ).
tff(c_2396,plain,
elem(m_Down('#skF_11'),'#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_42,c_2377]) ).
tff(c_220,plain,
host('#skF_7') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_228,plain,
cons(m_NormQ('#skF_6'),'#skF_5') = queue(host('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_268,plain,
cons(m_NormQ('#skF_6'),'#skF_5') = queue(host('#skF_12')),
inference(demodulation,[status(thm),theory(equality)],[c_220,c_228]) ).
tff(c_969,plain,
! [X_325,Q_326,Y_327] :
( ~ elem(X_325,Q_326)
| elem(X_325,cons(Y_327,Q_326)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_975,plain,
! [X_325] :
( ~ elem(X_325,'#skF_5')
| elem(X_325,queue(host('#skF_12'))) ),
inference(superposition,[status(thm),theory(equality)],[c_268,c_969]) ).
tff(c_30,plain,
! [Z_15,X_13,Y_14] : ( m_NotNorm(Z_15) != m_Ack(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_214,plain,
elem(m_Ack('#skF_12','#skF_10'),snoc('#skF_5',m_NotNorm('#skF_6'))),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_2374,plain,
( elem(m_Ack('#skF_12','#skF_10'),'#skF_5')
| ( m_Ack('#skF_12','#skF_10') = m_NotNorm('#skF_6') ) ),
inference(resolution,[status(thm)],[c_214,c_2357]) ).
tff(c_2393,plain,
elem(m_Ack('#skF_12','#skF_10'),'#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_30,c_2374]) ).
tff(c_218,plain,
setIn('#skF_12',alive),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_184,plain,
! [Y_117] : leq(Y_117,Y_117),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_1084,plain,
s(host('#skF_10')) = nbr_proc,
inference(demodulation,[status(thm),theory(equality)],[c_1068,c_271]) ).
tff(c_210,plain,
index(status,host('#skF_12')) = elec_2,
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_230,plain,
! [Y_203,Pid0_206,Pid20_205,Z_204] :
( ( index(status,host(Y_203)) != norm )
| ( index(ldr,host(Y_203)) != host(Y_203) )
| ~ setIn(Y_203,alive)
| ( s(index(pendack,host(Pid0_206))) != host(Pid20_205) )
| ( index(pendack,host(Pid0_206)) != host(Z_204) )
| ( index(status,host(Pid0_206)) != elec_2 )
| ~ leq(nbr_proc,s(index(pendack,host(Pid0_206))))
| ~ elem(m_Down(Pid20_205),queue(host(Pid0_206)))
| ~ elem(m_Ack(Pid0_206,Z_204),queue(host(Pid0_206)))
| ~ setIn(Pid0_206,alive) ),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_6360,plain,
! [Pid0_551,Pid20_552,Z_553] :
( ( s(index(pendack,host(Pid0_551))) != host(Pid20_552) )
| ( index(pendack,host(Pid0_551)) != host(Z_553) )
| ( index(status,host(Pid0_551)) != elec_2 )
| ~ leq(nbr_proc,s(index(pendack,host(Pid0_551))))
| ~ elem(m_Down(Pid20_552),queue(host(Pid0_551)))
| ~ elem(m_Ack(Pid0_551,Z_553),queue(host(Pid0_551)))
| ~ setIn(Pid0_551,alive) ),
inference(splitLeft,[status(thm)],[c_230]) ).
tff(c_6377,plain,
! [Pid20_552,Z_553] :
( ( s(index(pendack,host('#skF_12'))) != host(Pid20_552) )
| ( index(pendack,host('#skF_12')) != host(Z_553) )
| ( index(status,host('#skF_12')) != elec_2 )
| ~ leq(nbr_proc,s(host('#skF_10')))
| ~ elem(m_Down(Pid20_552),queue(host('#skF_12')))
| ~ elem(m_Ack('#skF_12',Z_553),queue(host('#skF_12')))
| ~ setIn('#skF_12',alive) ),
inference(superposition,[status(thm),theory(equality)],[c_208,c_6360]) ).
tff(c_6386,plain,
! [Pid20_552,Z_553] :
( ( host(Pid20_552) != nbr_proc )
| ( host(Z_553) != host('#skF_10') )
| ~ elem(m_Down(Pid20_552),queue(host('#skF_12')))
| ~ elem(m_Ack('#skF_12',Z_553),queue(host('#skF_12'))) ),
inference(demodulation,[status(thm),theory(equality)],[c_218,c_184,c_1084,c_210,c_208,c_1084,c_208,c_6377]) ).
tff(c_39033,plain,
! [Z_1125] :
( ( host(Z_1125) != host('#skF_10') )
| ~ elem(m_Ack('#skF_12',Z_1125),queue(host('#skF_12'))) ),
inference(splitLeft,[status(thm)],[c_6386]) ).
tff(c_39038,plain,
! [Z_1126] :
( ( host(Z_1126) != host('#skF_10') )
| ~ elem(m_Ack('#skF_12',Z_1126),'#skF_5') ),
inference(resolution,[status(thm)],[c_975,c_39033]) ).
tff(c_39043,plain,
$false,
inference(resolution,[status(thm)],[c_2393,c_39038]) ).
tff(c_39045,plain,
! [Pid20_1127] :
( ( host(Pid20_1127) != nbr_proc )
| ~ elem(m_Down(Pid20_1127),queue(host('#skF_12'))) ),
inference(splitRight,[status(thm)],[c_6386]) ).
tff(c_39056,plain,
! [Pid20_1128] :
( ( host(Pid20_1128) != nbr_proc )
| ~ elem(m_Down(Pid20_1128),'#skF_5') ),
inference(resolution,[status(thm)],[c_975,c_39045]) ).
tff(c_39065,plain,
host('#skF_11') != nbr_proc,
inference(resolution,[status(thm)],[c_2396,c_39056]) ).
tff(c_39069,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1068,c_39065]) ).
tff(c_40251,plain,
! [Y_1165] :
( ( index(status,host(Y_1165)) != norm )
| ( index(ldr,host(Y_1165)) != host(Y_1165) )
| ~ setIn(Y_1165,alive) ),
inference(splitRight,[status(thm)],[c_230]) ).
tff(c_40260,plain,
( ( index(ldr,host('#skF_9')) != host('#skF_9') )
| ~ setIn('#skF_9',alive) ),
inference(superposition,[status(thm),theory(equality)],[c_200,c_40251]) ).
tff(c_40271,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_204,c_202,c_40260]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV465+1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.14 % 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.16/0.36 % Computer : n015.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 23:32:59 EDT 2023
% 0.16/0.36 % CPUTime :
% 20.01/8.46 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 20.01/8.47
% 20.01/8.47 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 20.01/8.50
% 20.01/8.50 Inference rules
% 20.01/8.50 ----------------------
% 20.01/8.50 #Ref : 30
% 20.01/8.50 #Sup : 9017
% 20.01/8.50 #Fact : 26
% 20.01/8.50 #Define : 0
% 20.01/8.50 #Split : 19
% 20.01/8.50 #Chain : 0
% 20.01/8.50 #Close : 0
% 20.01/8.50
% 20.01/8.50 Ordering : KBO
% 20.01/8.50
% 20.01/8.50 Simplification rules
% 20.01/8.50 ----------------------
% 20.01/8.50 #Subsume : 2654
% 20.01/8.50 #Demod : 4081
% 20.01/8.50 #Tautology : 2196
% 20.01/8.50 #SimpNegUnit : 370
% 20.01/8.50 #BackRed : 57
% 20.01/8.50
% 20.01/8.50 #Partial instantiations: 0
% 20.01/8.50 #Strategies tried : 1
% 20.01/8.50
% 20.01/8.50 Timing (in seconds)
% 20.01/8.50 ----------------------
% 20.01/8.51 Preprocessing : 0.73
% 20.01/8.51 Parsing : 0.32
% 20.01/8.51 CNF conversion : 0.06
% 20.01/8.51 Main loop : 6.67
% 20.01/8.51 Inferencing : 1.30
% 20.01/8.51 Reduction : 2.76
% 20.01/8.51 Demodulation : 1.96
% 20.01/8.51 BG Simplification : 0.10
% 20.01/8.51 Subsumption : 2.12
% 20.01/8.51 Abstraction : 0.11
% 20.01/8.51 MUC search : 0.00
% 20.01/8.51 Cooper : 0.00
% 20.01/8.51 Total : 7.45
% 20.01/8.51 Index Insertion : 0.00
% 20.01/8.51 Index Deletion : 0.00
% 20.01/8.51 Index Matching : 0.00
% 20.01/8.51 BG Taut test : 0.00
%------------------------------------------------------------------------------