TSTP Solution File: SWV449+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV449+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 : n016.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 18.05s 6.80s
% Output : CNFRefutation 18.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 54
% Syntax : Number of formulae : 82 ( 18 unt; 50 typ; 0 def)
% Number of atoms : 107 ( 51 equ)
% Maximal formula atoms : 44 ( 3 avg)
% Number of connectives : 124 ( 49 ~; 32 |; 23 &)
% ( 2 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 4 avg)
% Maximal term depth : 3 ( 2 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 : 57 (; 57 !; 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(W0),queue(host(X0)))
& elem(m_Down(Y0),snoc(V,m_Ldr(X))) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
tff(f_110,axiom,
! [X,Y] : ( m_Down(X) != m_Ldr(Y) ),
file('/export/starexec/sandbox2/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/sandbox2/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/sandbox2/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_40,plain,
! [Y_27,X_26] : ( m_Ldr(Y_27) != m_Down(X_26) ),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_200,plain,
elem(m_Down('#skF_13'),snoc('#skF_5',m_Ldr('#skF_7'))),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1971,plain,
! [X_378,Q_379,Y_380] :
( elem(X_378,Q_379)
| ( Y_380 = X_378 )
| ~ elem(X_378,snoc(Q_379,Y_380)) ),
inference(cnfTransformation,[status(thm)],[f_230]) ).
tff(c_1994,plain,
( elem(m_Down('#skF_13'),'#skF_5')
| ( m_Ldr('#skF_7') = m_Down('#skF_13') ) ),
inference(resolution,[status(thm)],[c_200,c_1971]) ).
tff(c_2007,plain,
elem(m_Down('#skF_13'),'#skF_5'),
inference(negUnitSimplification,[status(thm)],[c_40,c_1994]) ).
tff(c_220,plain,
host('#skF_10') = host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_218,plain,
host('#skF_7') = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_252,plain,
host('#skF_7') = host('#skF_9'),
inference(demodulation,[status(thm),theory(equality)],[c_220,c_218]) ).
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_256,plain,
cons(m_Ack('#skF_6','#skF_8'),'#skF_5') = queue(host('#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_252,c_234]) ).
tff(c_114,plain,
! [X_81,Q_83,Y_82] :
( ~ elem(X_81,Q_83)
| elem(X_81,cons(Y_82,Q_83)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_987,plain,
! [X_81] :
( ~ elem(X_81,'#skF_5')
| elem(X_81,queue(host('#skF_9'))) ),
inference(superposition,[status(thm),theory(equality)],[c_256,c_114]) ).
tff(c_216,plain,
host('#skF_9') != host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_210,plain,
setIn('#skF_10',alive),
inference(cnfTransformation,[status(thm)],[f_448]) ).
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_260,plain,
host('#skF_11') = host('#skF_9'),
inference(demodulation,[status(thm),theory(equality)],[c_220,c_206]) ).
tff(c_202,plain,
elem(m_Down('#skF_11'),queue(host('#skF_12'))),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1026,plain,
! [Pid30_328,Pid20_329,Pid0_330,Z_331] :
( ~ elem(m_Down(Pid30_328),queue(host(Pid20_329)))
| ~ elem(m_Down(Pid0_330),queue(host(Z_331)))
| ( host(Pid20_329) != host(Pid0_330) )
| ( host(Z_331) != host(Pid30_328) )
| ~ setIn(Pid20_329,alive)
| ~ setIn(Z_331,alive)
| ( host(Z_331) = host(Pid20_329) ) ),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_1030,plain,
! [Pid0_330,Z_331] :
( ~ elem(m_Down(Pid0_330),queue(host(Z_331)))
| ( host(Pid0_330) != host('#skF_12') )
| ( host(Z_331) != host('#skF_11') )
| ~ setIn('#skF_12',alive)
| ~ setIn(Z_331,alive)
| ( host(Z_331) = host('#skF_12') ) ),
inference(resolution,[status(thm)],[c_202,c_1026]) ).
tff(c_30711,plain,
! [Pid0_926,Z_927] :
( ~ elem(m_Down(Pid0_926),queue(host(Z_927)))
| ( host(Pid0_926) != host('#skF_12') )
| ( host(Z_927) != host('#skF_9') )
| ~ setIn(Z_927,alive)
| ( host(Z_927) = host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_260,c_1030]) ).
tff(c_30739,plain,
! [Pid0_926] :
( ~ elem(m_Down(Pid0_926),queue(host('#skF_9')))
| ( host(Pid0_926) != host('#skF_12') )
| ( host('#skF_10') != host('#skF_9') )
| ~ setIn('#skF_10',alive)
| ( host('#skF_10') = host('#skF_12') ) ),
inference(superposition,[status(thm),theory(equality)],[c_220,c_30711]) ).
tff(c_30753,plain,
! [Pid0_926] :
( ~ elem(m_Down(Pid0_926),queue(host('#skF_9')))
| ( host(Pid0_926) != host('#skF_12') )
| ( host('#skF_9') = host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_220,c_210,c_220,c_30739]) ).
tff(c_30846,plain,
! [Pid0_929] :
( ~ elem(m_Down(Pid0_929),queue(host('#skF_9')))
| ( host(Pid0_929) != host('#skF_12') ) ),
inference(negUnitSimplification,[status(thm)],[c_216,c_30753]) ).
tff(c_31437,plain,
! [Pid0_937] :
( ( host(Pid0_937) != host('#skF_12') )
| ~ elem(m_Down(Pid0_937),'#skF_5') ),
inference(resolution,[status(thm)],[c_987,c_30846]) ).
tff(c_31446,plain,
host('#skF_13') != host('#skF_12'),
inference(resolution,[status(thm)],[c_2007,c_31437]) ).
tff(c_31450,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_204,c_31446]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV449+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.36 % Computer : n016.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 23:00:53 EDT 2023
% 0.14/0.36 % CPUTime :
% 18.05/6.80 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 18.05/6.80
% 18.05/6.80 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 18.10/6.83
% 18.10/6.83 Inference rules
% 18.10/6.83 ----------------------
% 18.10/6.83 #Ref : 27
% 18.10/6.83 #Sup : 7055
% 18.10/6.83 #Fact : 16
% 18.10/6.83 #Define : 0
% 18.10/6.83 #Split : 35
% 18.10/6.83 #Chain : 0
% 18.10/6.83 #Close : 0
% 18.10/6.83
% 18.10/6.83 Ordering : KBO
% 18.10/6.83
% 18.10/6.83 Simplification rules
% 18.10/6.83 ----------------------
% 18.10/6.83 #Subsume : 1917
% 18.10/6.83 #Demod : 2907
% 18.10/6.83 #Tautology : 1775
% 18.10/6.83 #SimpNegUnit : 160
% 18.10/6.83 #BackRed : 81
% 18.10/6.83
% 18.10/6.83 #Partial instantiations: 0
% 18.10/6.83 #Strategies tried : 1
% 18.10/6.83
% 18.10/6.83 Timing (in seconds)
% 18.10/6.83 ----------------------
% 18.10/6.84 Preprocessing : 0.72
% 18.10/6.84 Parsing : 0.34
% 18.10/6.84 CNF conversion : 0.06
% 18.10/6.84 Main loop : 4.97
% 18.10/6.84 Inferencing : 1.09
% 18.10/6.84 Reduction : 1.97
% 18.10/6.84 Demodulation : 1.34
% 18.10/6.84 BG Simplification : 0.09
% 18.10/6.84 Subsumption : 1.44
% 18.10/6.84 Abstraction : 0.09
% 18.10/6.84 MUC search : 0.00
% 18.10/6.84 Cooper : 0.00
% 18.10/6.84 Total : 5.74
% 18.10/6.84 Index Insertion : 0.00
% 18.10/6.84 Index Deletion : 0.00
% 18.10/6.84 Index Matching : 0.00
% 18.10/6.84 BG Taut test : 0.00
%------------------------------------------------------------------------------