TSTP Solution File: SWV464+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV464+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/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 : n009.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 19.70s 8.25s
% Output : CNFRefutation 19.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 57
% Syntax : Number of formulae : 103 ( 34 unt; 51 typ; 0 def)
% Number of atoms : 185 ( 84 equ)
% Maximal formula atoms : 91 ( 3 avg)
% Number of connectives : 204 ( 71 ~; 43 |; 65 &)
% ( 2 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 33 ( 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 : 46 ( 46 usr; 24 con; 0-4 aty)
% Number of variables : 84 (; 84 !; 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_9 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_13 > #skF_8 > #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('#skF_9',type,
'#skF_9': ( $i * $i * $i * $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(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('#skF_13',type,
'#skF_13': $i ).
tff(last,type,
last: $i > $i ).
tff(setEmpty,type,
setEmpty: $i ).
tff(index,type,
index: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $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_552,negated_conjecture,
~ ! [V,W,X,Y] :
( ( ! [Z,Pid0] :
( elem(m_Ldr(Pid0),queue(host(Z)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ( host(Pid0) != host(Z) ) )
& ! [Z,Pid0] :
( elem(m_Halt(Pid0),queue(host(Z)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid20,Pid0] :
( elem(m_Ack(Pid0,Z),queue(host(Pid20)))
=> ~ leq(host(Z),host(Pid0)) )
& ! [Z,Pid0] :
( ( ( Pid0 != Z )
& ( host(Pid0) = host(Z) ) )
=> ( ~ setIn(Z,alive)
| ~ setIn(Pid0,alive) ) )
& ! [Z,Pid0] :
( ( setIn(Pid0,alive)
& elem(m_Ack(Pid0,Z),queue(host(Pid0))) )
=> leq(host(Z),index(pendack,host(Pid0))) )
& ! [Z,Pid0] :
( ( setIn(Pid0,alive)
& ( index(status,host(Pid0)) = elec_1 ) )
=> ~ elem(m_Ack(Pid0,Z),queue(host(Pid0))) )
& ! [Z] :
( ( ( ( index(status,host(Z)) = elec_1 )
| ( index(status,host(Z)) = elec_2 ) )
& setIn(Z,alive) )
=> ( index(elid,host(Z)) = Z ) )
& ! [Z,Pid20,Pid0] :
( ( setIn(Pid0,alive)
& elem(m_Down(Pid20),queue(host(Pid0)))
& ( host(Pid20) = host(Z) ) )
=> ~ ( setIn(Z,alive)
& ( index(ldr,host(Z)) = host(Z) )
& ( index(status,host(Z)) = norm ) ) )
& ! [Z,Pid0] :
( ( ~ leq(host(Z),host(Pid0))
& setIn(Z,alive)
& setIn(Pid0,alive)
& ( index(status,host(Z)) = elec_2 )
& ( index(status,host(Pid0)) = elec_2 ) )
=> leq(index(pendack,host(Pid0)),host(Z)) )
& ! [Z,Pid20,Pid0] :
( ( setIn(Z,alive)
& setIn(Pid0,alive)
& ( host(Pid0) = host(Pid20) )
& ( index(status,host(Z)) = elec_2 )
& ( index(status,host(Pid0)) = elec_2 ) )
=> ~ elem(m_Ack(Z,Pid20),queue(host(Z))) )
& ! [Z,Pid0] :
( ( ~ leq(host(Z),host(Pid0))
& setIn(Z,alive)
& setIn(Pid0,alive)
& ( index(status,host(Z)) = elec_2 )
& ( index(status,host(Pid0)) = elec_2 ) )
=> ~ leq(index(pendack,host(Z)),index(pendack,host(Pid0))) )
& ! [Z,Pid20,Pid0] :
( ( ~ leq(index(pendack,host(Pid0)),host(Z))
& setIn(Pid0,alive)
& elem(m_Halt(Pid0),queue(host(Pid20)))
& ( index(status,host(Pid0)) = elec_2 ) )
=> ~ ( setIn(Z,alive)
& ( index(ldr,host(Z)) = host(Z) )
& ( index(status,host(Z)) = norm ) ) )
& ! [Z,Pid30,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) = nbr_proc )
& ( host(Pid0) = host(Pid30) )
& ( index(status,host(Pid0)) = elec_1 ) )
=> ~ ( setIn(Z,alive)
& elem(m_Down(Pid30),queue(host(Z))) ) )
& ! [Z,Pid30,Pid20,Pid0] :
( ( setIn(Pid0,alive)
& elem(m_Down(Pid20),queue(host(Pid0)))
& elem(m_Ack(Pid0,Pid30),queue(host(Pid0)))
& leq(nbr_proc,s(index(pendack,host(Pid0))))
& ( index(status,host(Pid0)) = elec_2 )
& ( host(Pid30) = index(pendack,host(Pid0)) )
& ( host(Pid20) = s(index(pendack,host(Pid0))) ) )
=> ~ ( setIn(Z,alive)
& ( index(ldr,host(Z)) = host(Z) )
& ( index(status,host(Z)) = norm ) ) )
& ( queue(host(X)) = cons(m_Ack(W,Y),V) ) )
=> ( setIn(X,alive)
=> ( ( ( index(elid,host(X)) = W )
& ( index(status,host(X)) = elec_2 )
& ( host(Y) = index(pendack,host(X)) ) )
=> ( ~ leq(nbr_proc,index(pendack,host(X)))
=> ! [Z,W0,X0,Y0] :
( ( s(index(pendack,host(X))) = host(Y0) )
=> ( ( host(X) != host(Y0) )
=> ( ( setIn(Y0,alive)
& leq(nbr_proc,s(index(pendack,host(Y0))))
& elem(m_Down(X0),snoc(queue(host(Y0)),m_Halt(X)))
& elem(m_Ack(Y0,W0),snoc(queue(host(Y0)),m_Halt(X)))
& ( index(status,host(Y0)) = elec_2 )
& ( host(W0) = index(pendack,host(Y0)) )
& ( host(X0) = s(index(pendack,host(Y0))) ) )
=> ~ ( setIn(Z,alive)
& ( index(ldr,host(Z)) = host(Z) )
& ( index(status,host(Z)) = norm ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_89,axiom,
! [X,Y,Z] : ( m_Ack(X,Y) != m_Halt(Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_11) ).
tff(f_230,axiom,
! [X,Y,Q] :
( elem(X,snoc(Q,Y))
<=> ( ( X = Y )
| elem(X,Q) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_47) ).
tff(f_74,axiom,
! [P] : leq(host(P),nbr_proc),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_04) ).
tff(f_309,axiom,
! [X,Y] :
( ( leq(X,Y)
& leq(Y,X) )
<=> ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_61) ).
tff(f_107,axiom,
! [X,Y] : ( m_Down(X) != m_Halt(Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV011+0.ax',axiom_17) ).
tff(c_204,plain,
setIn('#skF_10',alive),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_202,plain,
index(ldr,host('#skF_10')) = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_200,plain,
index(status,host('#skF_10')) = norm,
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_26,plain,
! [Z_9,X_7,Y_8] : ( m_Halt(Z_9) != m_Ack(X_7,Y_8) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_232,plain,
setIn('#skF_7',alive),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_230,plain,
index(elid,host('#skF_7')) = '#skF_6',
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_228,plain,
index(status,host('#skF_7')) = elec_2,
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_1361,plain,
! [Z_343] :
( ( index(status,host(Z_343)) != elec_2 )
| ( index(elid,host(Z_343)) = Z_343 )
| ~ setIn(Z_343,alive) ),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_1373,plain,
( ( index(elid,host('#skF_7')) = '#skF_7' )
| ~ setIn('#skF_7',alive) ),
inference(superposition,[status(thm),theory(equality)],[c_228,c_1361]) ).
tff(c_1382,plain,
'#skF_7' = '#skF_6',
inference(demodulation,[status(thm),theory(equality)],[c_232,c_230,c_1373]) ).
tff(c_212,plain,
elem(m_Ack('#skF_13','#skF_11'),snoc(queue(host('#skF_13')),m_Halt('#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_1385,plain,
elem(m_Ack('#skF_13','#skF_11'),snoc(queue(host('#skF_13')),m_Halt('#skF_6'))),
inference(demodulation,[status(thm),theory(equality)],[c_1382,c_212]) ).
tff(c_118,plain,
! [X_84,Q_86,Y_85] :
( elem(X_84,Q_86)
| ( Y_85 = X_84 )
| ~ elem(X_84,snoc(Q_86,Y_85)) ),
inference(cnfTransformation,[status(thm)],[f_230]) ).
tff(c_6544,plain,
( elem(m_Ack('#skF_13','#skF_11'),queue(host('#skF_13')))
| ( m_Ack('#skF_13','#skF_11') = m_Halt('#skF_6') ) ),
inference(resolution,[status(thm)],[c_1385,c_118]) ).
tff(c_6547,plain,
elem(m_Ack('#skF_13','#skF_11'),queue(host('#skF_13'))),
inference(negUnitSimplification,[status(thm)],[c_26,c_6544]) ).
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_13')) = host('#skF_11'),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_206,plain,
s(index(pendack,host('#skF_13'))) = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_276,plain,
s(host('#skF_11')) = host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_206]) ).
tff(c_216,plain,
leq(nbr_proc,s(index(pendack,host('#skF_13')))),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_275,plain,
leq(nbr_proc,s(host('#skF_11'))),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_216]) ).
tff(c_277,plain,
leq(nbr_proc,host('#skF_12')),
inference(demodulation,[status(thm),theory(equality)],[c_276,c_275]) ).
tff(c_879,plain,
! [Y_316,X_317] :
( ( Y_316 = X_317 )
| ~ leq(Y_316,X_317)
| ~ leq(X_317,Y_316) ),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_909,plain,
( ( host('#skF_12') = nbr_proc )
| ~ leq(host('#skF_12'),nbr_proc) ),
inference(resolution,[status(thm)],[c_277,c_879]) ).
tff(c_932,plain,
host('#skF_12') = nbr_proc,
inference(demodulation,[status(thm),theory(equality)],[c_12,c_909]) ).
tff(c_38,plain,
! [Y_25,X_24] : ( m_Halt(Y_25) != m_Down(X_24) ),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_214,plain,
elem(m_Down('#skF_12'),snoc(queue(host('#skF_13')),m_Halt('#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_1387,plain,
elem(m_Down('#skF_12'),snoc(queue(host('#skF_13')),m_Halt('#skF_6'))),
inference(demodulation,[status(thm),theory(equality)],[c_1382,c_214]) ).
tff(c_5008,plain,
( elem(m_Down('#skF_12'),queue(host('#skF_13')))
| ( m_Halt('#skF_6') = m_Down('#skF_12') ) ),
inference(resolution,[status(thm)],[c_1387,c_118]) ).
tff(c_5011,plain,
elem(m_Down('#skF_12'),queue(host('#skF_13'))),
inference(negUnitSimplification,[status(thm)],[c_38,c_5008]) ).
tff(c_218,plain,
setIn('#skF_13',alive),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_184,plain,
! [Y_117] : leq(Y_117,Y_117),
inference(cnfTransformation,[status(thm)],[f_309]) ).
tff(c_950,plain,
s(host('#skF_11')) = nbr_proc,
inference(demodulation,[status(thm),theory(equality)],[c_932,c_276]) ).
tff(c_210,plain,
index(status,host('#skF_13')) = elec_2,
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_236,plain,
! [Z_203,Pid0_206,Pid20_205,Pid30_204] :
( ( index(status,host(Z_203)) != norm )
| ( index(ldr,host(Z_203)) != host(Z_203) )
| ~ setIn(Z_203,alive)
| ( s(index(pendack,host(Pid0_206))) != host(Pid20_205) )
| ( index(pendack,host(Pid0_206)) != host(Pid30_204) )
| ( index(status,host(Pid0_206)) != elec_2 )
| ~ leq(nbr_proc,s(index(pendack,host(Pid0_206))))
| ~ elem(m_Ack(Pid0_206,Pid30_204),queue(host(Pid0_206)))
| ~ elem(m_Down(Pid20_205),queue(host(Pid0_206)))
| ~ setIn(Pid0_206,alive) ),
inference(cnfTransformation,[status(thm)],[f_552]) ).
tff(c_7043,plain,
! [Pid0_537,Pid20_538,Pid30_539] :
( ( s(index(pendack,host(Pid0_537))) != host(Pid20_538) )
| ( index(pendack,host(Pid0_537)) != host(Pid30_539) )
| ( index(status,host(Pid0_537)) != elec_2 )
| ~ leq(nbr_proc,s(index(pendack,host(Pid0_537))))
| ~ elem(m_Ack(Pid0_537,Pid30_539),queue(host(Pid0_537)))
| ~ elem(m_Down(Pid20_538),queue(host(Pid0_537)))
| ~ setIn(Pid0_537,alive) ),
inference(splitLeft,[status(thm)],[c_236]) ).
tff(c_7064,plain,
! [Pid20_538,Pid30_539] :
( ( s(index(pendack,host('#skF_13'))) != host(Pid20_538) )
| ( index(pendack,host('#skF_13')) != host(Pid30_539) )
| ( index(status,host('#skF_13')) != elec_2 )
| ~ leq(nbr_proc,s(host('#skF_11')))
| ~ elem(m_Ack('#skF_13',Pid30_539),queue(host('#skF_13')))
| ~ elem(m_Down(Pid20_538),queue(host('#skF_13')))
| ~ setIn('#skF_13',alive) ),
inference(superposition,[status(thm),theory(equality)],[c_208,c_7043]) ).
tff(c_7071,plain,
! [Pid20_538,Pid30_539] :
( ( host(Pid20_538) != nbr_proc )
| ( host(Pid30_539) != host('#skF_11') )
| ~ elem(m_Ack('#skF_13',Pid30_539),queue(host('#skF_13')))
| ~ elem(m_Down(Pid20_538),queue(host('#skF_13'))) ),
inference(demodulation,[status(thm),theory(equality)],[c_218,c_184,c_950,c_210,c_208,c_950,c_208,c_7064]) ).
tff(c_36049,plain,
! [Pid20_999] :
( ( host(Pid20_999) != nbr_proc )
| ~ elem(m_Down(Pid20_999),queue(host('#skF_13'))) ),
inference(splitLeft,[status(thm)],[c_7071]) ).
tff(c_36055,plain,
host('#skF_12') != nbr_proc,
inference(resolution,[status(thm)],[c_5011,c_36049]) ).
tff(c_36059,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_932,c_36055]) ).
tff(c_36210,plain,
! [Pid30_1004] :
( ( host(Pid30_1004) != host('#skF_11') )
| ~ elem(m_Ack('#skF_13',Pid30_1004),queue(host('#skF_13'))) ),
inference(splitRight,[status(thm)],[c_7071]) ).
tff(c_36215,plain,
$false,
inference(resolution,[status(thm)],[c_6547,c_36210]) ).
tff(c_38138,plain,
! [Z_1069] :
( ( index(status,host(Z_1069)) != norm )
| ( index(ldr,host(Z_1069)) != host(Z_1069) )
| ~ setIn(Z_1069,alive) ),
inference(splitRight,[status(thm)],[c_236]) ).
tff(c_38150,plain,
( ( index(ldr,host('#skF_10')) != host('#skF_10') )
| ~ setIn('#skF_10',alive) ),
inference(superposition,[status(thm),theory(equality)],[c_200,c_38138]) ).
tff(c_38159,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_204,c_202,c_38150]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV464+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/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 : n009.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 22:48:24 EDT 2023
% 0.14/0.35 % CPUTime :
% 19.70/8.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 19.70/8.26
% 19.70/8.26 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 19.70/8.29
% 19.70/8.29 Inference rules
% 19.70/8.29 ----------------------
% 19.70/8.29 #Ref : 25
% 19.70/8.29 #Sup : 8320
% 19.70/8.29 #Fact : 18
% 19.70/8.29 #Define : 0
% 19.70/8.29 #Split : 16
% 19.70/8.29 #Chain : 0
% 19.70/8.29 #Close : 0
% 19.70/8.29
% 19.70/8.29 Ordering : KBO
% 19.70/8.29
% 19.70/8.29 Simplification rules
% 19.70/8.29 ----------------------
% 19.70/8.29 #Subsume : 2234
% 19.70/8.29 #Demod : 3892
% 19.70/8.29 #Tautology : 2238
% 19.70/8.29 #SimpNegUnit : 238
% 19.70/8.29 #BackRed : 61
% 19.70/8.29
% 19.70/8.29 #Partial instantiations: 0
% 19.70/8.29 #Strategies tried : 1
% 19.70/8.29
% 19.70/8.29 Timing (in seconds)
% 19.70/8.29 ----------------------
% 19.70/8.30 Preprocessing : 0.73
% 19.70/8.30 Parsing : 0.32
% 19.70/8.30 CNF conversion : 0.06
% 19.70/8.30 Main loop : 6.51
% 19.70/8.30 Inferencing : 1.41
% 19.70/8.30 Reduction : 2.73
% 19.70/8.30 Demodulation : 1.94
% 19.70/8.30 BG Simplification : 0.10
% 19.70/8.30 Subsumption : 1.89
% 19.70/8.30 Abstraction : 0.10
% 19.70/8.30 MUC search : 0.00
% 19.70/8.30 Cooper : 0.00
% 19.70/8.30 Total : 7.30
% 19.70/8.30 Index Insertion : 0.00
% 19.70/8.30 Index Deletion : 0.00
% 19.70/8.30 Index Matching : 0.00
% 19.70/8.30 BG Taut test : 0.00
%------------------------------------------------------------------------------