TSTP Solution File: SWV450+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV450+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 : n014.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:15 EDT 2023
% Result : Theorem 86.82s 69.43s
% Output : CNFRefutation 86.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 54
% Syntax : Number of formulae : 86 ( 20 unt; 50 typ; 0 def)
% Number of atoms : 118 ( 56 equ)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 138 ( 56 ~; 39 |; 23 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 35 ( 26 >; 9 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 45 ( 45 usr; 24 con; 0-2 aty)
% Number of variables : 61 (; 61 !; 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 > elid > elec_2 > elec_1 > alive > acks > #skF_2 > #skF_11 > #skF_1 > #skF_7 > #skF_3 > #skF_10 > #skF_5 > #skF_6 > #skF_13 > #skF_9 > #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(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(acks,type,
acks: $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(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('#skF_9',type,
'#skF_9': $i ).
tff(index,type,
index: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(cons,type,
cons: ( $i * $i ) > $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_448,negated_conjecture,
~ ! [V,W,X,Y] :
( ( ! [Z,Pid0] :
( setIn(Pid0,alive)
=> ~ elem(m_Down(Pid0),queue(host(Z))) )
& ! [Z,Pid0] :
( elem(m_Down(Pid0),queue(host(Z)))
=> ~ setIn(Pid0,alive) )
& ! [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] :
( ( ~ setIn(Z,alive)
& leq(Pid0,Z)
& ( host(Pid0) = host(Z) ) )
=> ~ setIn(Pid0,alive) )
& ! [Z,Pid0] :
( ( ( Pid0 != Z )
& ( host(Pid0) = host(Z) ) )
=> ( ~ setIn(Z,alive)
| ~ setIn(Pid0,alive) ) )
& ! [Z,Pid30,Pid20,Pid0] :
( ( ( host(Pid20) != host(Z) )
& setIn(Z,alive)
& setIn(Pid20,alive)
& ( host(Pid30) = host(Z) )
& ( host(Pid0) = host(Pid20) ) )
=> ~ ( elem(m_Down(Pid0),queue(host(Z)))
& elem(m_Down(Pid30),queue(host(Pid20))) ) )
& ( 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] :
( ( setIn(host(Z),index(acks,host(X)))
| ( host(Z) = host(Y) ) )
=> ! [V0] :
( ( host(Z) != host(V0) )
=> ( ( host(X) = host(V0) )
=> ! [W0,X0] :
( ( host(Z) = host(X0) )
=> ( ( host(X) != host(X0) )
=> ! [Y0] :
( ( ( host(X0) != host(V0) )
& setIn(V0,alive)
& setIn(X0,alive)
& ( host(W0) = host(V0) )
& ( host(Y0) = host(X0) ) )
=> ~ ( elem(m_Down(Y0),V)
& elem(m_Down(W0),snoc(queue(host(X0)),m_Ldr(X))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
tff(f_110,axiom,
! [X,Y] : ( m_Down(X) != m_Ldr(Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV011+0.ax',axiom_18) ).
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(c_204,plain,
host('#skF_13') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_202,plain,
elem(m_Down('#skF_13'),'#skF_5'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_216,plain,
host('#skF_9') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_220,plain,
host('#skF_10') != host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_257,plain,
host('#skF_10') != host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_216,c_220]) ).
tff(c_208,plain,
setIn('#skF_12',alive),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_206,plain,
host('#skF_11') = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_40,plain,
! [Y_27,X_26] : ( m_Ldr(Y_27) != m_Down(X_26) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_218,plain,
host('#skF_7') = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_232,plain,
setIn('#skF_7',alive),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_210,plain,
setIn('#skF_10',alive),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_596,plain,
! [Pid0_292,Z_293] :
( ~ setIn(Pid0_292,alive)
| ~ setIn(Z_293,alive)
| ( host(Z_293) != host(Pid0_292) )
| ( Z_293 = Pid0_292 ) ),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1689,plain,
! [Z_371] :
( ~ setIn(Z_371,alive)
| ( host(Z_371) != host('#skF_10') )
| ( Z_371 = '#skF_10' ) ),
inference(resolution,[status(thm)],[c_210,c_596]) ).
tff(c_1698,plain,
( ( host('#skF_7') != host('#skF_10') )
| ( '#skF_7' = '#skF_10' ) ),
inference(resolution,[status(thm)],[c_232,c_1689]) ).
tff(c_1704,plain,
'#skF_7' = '#skF_10',
inference(demodulation,[status(thm),theory(equality)],[c_218,c_1698]) ).
tff(c_200,plain,
elem(m_Down('#skF_11'),snoc(queue(host('#skF_12')),m_Ldr('#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1705,plain,
elem(m_Down('#skF_11'),snoc(queue(host('#skF_12')),m_Ldr('#skF_10'))),
inference(demodulation,[status(thm),theory(equality)],[c_1704,c_200]) ).
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_2005,plain,
( elem(m_Down('#skF_11'),queue(host('#skF_12')))
| ( m_Ldr('#skF_10') = m_Down('#skF_11') ) ),
inference(resolution,[status(thm)],[c_1705,c_118]) ).
tff(c_2008,plain,
elem(m_Down('#skF_11'),queue(host('#skF_12'))),
inference(negUnitSimplification,[status(thm)],[c_40,c_2005]) ).
tff(c_234,plain,
cons(m_Ack('#skF_6','#skF_8'),'#skF_5') = queue(host('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_255,plain,
cons(m_Ack('#skF_6','#skF_8'),'#skF_5') = queue(host('#skF_10')),
inference(demodulation,[status(thm),theory(equality)],[c_218,c_234]) ).
tff(c_1050,plain,
! [X_339,Q_340,Y_341] :
( ~ elem(X_339,Q_340)
| elem(X_339,cons(Y_341,Q_340)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_1271,plain,
! [X_351] :
( ~ elem(X_351,'#skF_5')
| elem(X_351,queue(host('#skF_10'))) ),
inference(superposition,[status(thm),theory(equality)],[c_255,c_1050]) ).
tff(c_236,plain,
! [Pid30_180,Pid20_181,Pid0_182,Z_179] :
( ~ elem(m_Down(Pid30_180),queue(host(Pid20_181)))
| ~ elem(m_Down(Pid0_182),queue(host(Z_179)))
| ( host(Pid20_181) != host(Pid0_182) )
| ( host(Z_179) != host(Pid30_180) )
| ~ setIn(Pid20_181,alive)
| ~ setIn(Z_179,alive)
| ( host(Z_179) = host(Pid20_181) ) ),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1274,plain,
! [Pid0_182,Z_179,Pid30_180] :
( ~ elem(m_Down(Pid0_182),queue(host(Z_179)))
| ( host(Pid0_182) != host('#skF_10') )
| ( host(Z_179) != host(Pid30_180) )
| ~ setIn('#skF_10',alive)
| ~ setIn(Z_179,alive)
| ( host(Z_179) = host('#skF_10') )
| ~ elem(m_Down(Pid30_180),'#skF_5') ),
inference(resolution,[status(thm)],[c_1271,c_236]) ).
tff(c_253481,plain,
! [Pid0_20367,Z_20368,Pid30_20369] :
( ~ elem(m_Down(Pid0_20367),queue(host(Z_20368)))
| ( host(Pid0_20367) != host('#skF_10') )
| ( host(Z_20368) != host(Pid30_20369) )
| ~ setIn(Z_20368,alive)
| ( host(Z_20368) = host('#skF_10') )
| ~ elem(m_Down(Pid30_20369),'#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_210,c_1274]) ).
tff(c_253496,plain,
! [Pid30_20369] :
( ( host('#skF_11') != host('#skF_10') )
| ( host(Pid30_20369) != host('#skF_12') )
| ~ setIn('#skF_12',alive)
| ( host('#skF_10') = host('#skF_12') )
| ~ elem(m_Down(Pid30_20369),'#skF_5') ),
inference(resolution,[status(thm)],[c_2008,c_253481]) ).
tff(c_253513,plain,
! [Pid30_20369] :
( ( host(Pid30_20369) != host('#skF_12') )
| ( host('#skF_10') = host('#skF_12') )
| ~ elem(m_Down(Pid30_20369),'#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_206,c_253496]) ).
tff(c_253524,plain,
! [Pid30_20370] :
( ( host(Pid30_20370) != host('#skF_12') )
| ~ elem(m_Down(Pid30_20370),'#skF_5') ),
inference(negUnitSimplification,[status(thm)],[c_257,c_253513]) ).
tff(c_253536,plain,
host('#skF_13') != host('#skF_12'),
inference(resolution,[status(thm)],[c_202,c_253524]) ).
tff(c_253540,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_204,c_253536]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV450+1 : TPTP v8.1.2. Released v4.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 : n014.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.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:57:03 EDT 2023
% 0.13/0.35 % CPUTime :
% 86.82/69.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 86.82/69.43
% 86.82/69.43 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 86.82/69.46
% 86.82/69.46 Inference rules
% 86.82/69.46 ----------------------
% 86.82/69.46 #Ref : 40
% 86.82/69.46 #Sup : 60343
% 86.82/69.46 #Fact : 80
% 86.82/69.46 #Define : 0
% 86.82/69.46 #Split : 69
% 86.82/69.46 #Chain : 0
% 86.82/69.46 #Close : 0
% 86.82/69.46
% 86.82/69.46 Ordering : KBO
% 86.82/69.46
% 86.82/69.46 Simplification rules
% 86.82/69.46 ----------------------
% 86.82/69.46 #Subsume : 21233
% 86.82/69.47 #Demod : 24400
% 86.82/69.47 #Tautology : 10990
% 86.82/69.47 #SimpNegUnit : 4171
% 86.82/69.47 #BackRed : 144
% 86.82/69.47
% 86.82/69.47 #Partial instantiations: 20992
% 86.82/69.47 #Strategies tried : 1
% 86.82/69.47
% 86.82/69.47 Timing (in seconds)
% 86.82/69.47 ----------------------
% 86.82/69.47 Preprocessing : 0.70
% 86.82/69.47 Parsing : 0.32
% 86.82/69.47 CNF conversion : 0.06
% 86.82/69.47 Main loop : 67.71
% 86.82/69.47 Inferencing : 6.01
% 86.82/69.47 Reduction : 31.14
% 86.82/69.47 Demodulation : 23.55
% 86.82/69.47 BG Simplification : 0.29
% 86.82/69.47 Subsumption : 26.12
% 86.82/69.47 Abstraction : 0.50
% 86.82/69.47 MUC search : 0.00
% 86.82/69.47 Cooper : 0.00
% 86.82/69.47 Total : 68.46
% 86.82/69.47 Index Insertion : 0.00
% 86.82/69.47 Index Deletion : 0.00
% 86.82/69.47 Index Matching : 0.00
% 86.82/69.47 BG Taut test : 0.00
%------------------------------------------------------------------------------