TSTP Solution File: SWV455+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV455+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:16 EDT 2023
% Result : Theorem 22.24s 10.52s
% Output : CNFRefutation 22.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 52
% Syntax : Number of formulae : 73 ( 13 unt; 50 typ; 0 def)
% Number of atoms : 93 ( 42 equ)
% Maximal formula atoms : 46 ( 4 avg)
% Number of connectives : 117 ( 47 ~; 27 |; 25 &)
% ( 1 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 4 ( 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 : 46 (; 46 !; 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 > 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_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(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(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(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(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_455,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_Down(Y),V) ) )
=> ( setIn(X,alive)
=> ( ~ leq(host(X),host(Y))
=> ( ~ ( ( ( index(ldr,host(X)) = host(Y) )
& ( index(status,host(X)) = norm ) )
| ( ( index(status,host(X)) = wait )
& ( host(Y) = host(index(elid,host(X))) ) ) )
=> ( ~ ( ! [Z] :
( ( ~ leq(host(X),Z)
& leq(s(zero),Z) )
=> ( setIn(Z,index(down,host(X)))
| ( Z = host(Y) ) ) )
& ( index(status,host(X)) = elec_1 ) )
=> ! [Z] :
( ( host(X) != host(Z) )
=> ! [W0,X0] :
( ( host(X) = host(X0) )
=> ! [Y0] :
( ( ( host(X0) != host(Z) )
& setIn(Z,alive)
& setIn(X0,alive)
& ( host(W0) = host(Z) )
& ( host(Y0) = host(X0) ) )
=> ~ ( elem(m_Down(W0),V)
& elem(m_Down(Y0),queue(host(Z))) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
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_206,plain,
host('#skF_11') = host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_202,plain,
elem(m_Down('#skF_11'),'#skF_5'),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_214,plain,
host('#skF_7') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_216,plain,
host('#skF_7') != host('#skF_10'),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_251,plain,
host('#skF_10') != host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_214,c_216]) ).
tff(c_208,plain,
setIn('#skF_12',alive),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_226,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_255,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_12')),
inference(demodulation,[status(thm),theory(equality)],[c_214,c_226]) ).
tff(c_851,plain,
! [X_301,Q_302,Y_303] :
( ~ elem(X_301,Q_302)
| elem(X_301,cons(Y_303,Q_302)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_857,plain,
! [X_301] :
( ~ elem(X_301,'#skF_5')
| elem(X_301,queue(host('#skF_12'))) ),
inference(superposition,[status(thm),theory(equality)],[c_255,c_851]) ).
tff(c_210,plain,
setIn('#skF_10',alive),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_204,plain,
host('#skF_13') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_200,plain,
elem(m_Down('#skF_13'),queue(host('#skF_10'))),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_984,plain,
! [Pid30_312,Pid20_313,Pid0_314,Z_315] :
( ~ elem(m_Down(Pid30_312),queue(host(Pid20_313)))
| ~ elem(m_Down(Pid0_314),queue(host(Z_315)))
| ( host(Pid20_313) != host(Pid0_314) )
| ( host(Z_315) != host(Pid30_312) )
| ~ setIn(Pid20_313,alive)
| ~ setIn(Z_315,alive)
| ( host(Z_315) = host(Pid20_313) ) ),
inference(cnfTransformation,[status(thm)],[f_455]) ).
tff(c_988,plain,
! [Pid0_314,Z_315] :
( ~ elem(m_Down(Pid0_314),queue(host(Z_315)))
| ( host(Pid0_314) != host('#skF_10') )
| ( host(Z_315) != host('#skF_13') )
| ~ setIn('#skF_10',alive)
| ~ setIn(Z_315,alive)
| ( host(Z_315) = host('#skF_10') ) ),
inference(resolution,[status(thm)],[c_200,c_984]) ).
tff(c_61787,plain,
! [Pid0_1101,Z_1102] :
( ~ elem(m_Down(Pid0_1101),queue(host(Z_1102)))
| ( host(Pid0_1101) != host('#skF_10') )
| ( host(Z_1102) != host('#skF_12') )
| ~ setIn(Z_1102,alive)
| ( host(Z_1102) = host('#skF_10') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_210,c_204,c_988]) ).
tff(c_61806,plain,
! [Pid0_1101] :
( ( host(Pid0_1101) != host('#skF_10') )
| ~ setIn('#skF_12',alive)
| ( host('#skF_10') = host('#skF_12') )
| ~ elem(m_Down(Pid0_1101),'#skF_5') ),
inference(resolution,[status(thm)],[c_857,c_61787]) ).
tff(c_61818,plain,
! [Pid0_1101] :
( ( host(Pid0_1101) != host('#skF_10') )
| ( host('#skF_10') = host('#skF_12') )
| ~ elem(m_Down(Pid0_1101),'#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_208,c_61806]) ).
tff(c_61827,plain,
! [Pid0_1103] :
( ( host(Pid0_1103) != host('#skF_10') )
| ~ elem(m_Down(Pid0_1103),'#skF_5') ),
inference(negUnitSimplification,[status(thm)],[c_251,c_61818]) ).
tff(c_61839,plain,
host('#skF_11') != host('#skF_10'),
inference(resolution,[status(thm)],[c_202,c_61827]) ).
tff(c_61843,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_206,c_61839]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV455+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 : n016.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 23:02:23 EDT 2023
% 0.14/0.36 % CPUTime :
% 22.24/10.52 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.24/10.52
% 22.24/10.52 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 22.24/10.56
% 22.24/10.56 Inference rules
% 22.24/10.56 ----------------------
% 22.24/10.56 #Ref : 32
% 22.24/10.56 #Sup : 13464
% 22.24/10.56 #Fact : 22
% 22.24/10.56 #Define : 0
% 22.24/10.56 #Split : 47
% 22.24/10.56 #Chain : 0
% 22.24/10.56 #Close : 0
% 22.24/10.56
% 22.24/10.56 Ordering : KBO
% 22.24/10.56
% 22.24/10.56 Simplification rules
% 22.24/10.56 ----------------------
% 22.24/10.56 #Subsume : 4383
% 22.24/10.56 #Demod : 7129
% 22.24/10.56 #Tautology : 3946
% 22.24/10.56 #SimpNegUnit : 148
% 22.24/10.56 #BackRed : 62
% 22.24/10.56
% 22.24/10.56 #Partial instantiations: 0
% 22.24/10.56 #Strategies tried : 1
% 22.24/10.56
% 22.24/10.56 Timing (in seconds)
% 22.24/10.56 ----------------------
% 22.24/10.56 Preprocessing : 0.69
% 22.24/10.56 Parsing : 0.31
% 22.24/10.56 CNF conversion : 0.06
% 22.24/10.56 Main loop : 8.73
% 22.24/10.56 Inferencing : 1.55
% 22.24/10.56 Reduction : 3.81
% 22.24/10.56 Demodulation : 2.62
% 22.24/10.56 BG Simplification : 0.10
% 22.24/10.56 Subsumption : 2.73
% 22.24/10.56 Abstraction : 0.13
% 22.24/10.56 MUC search : 0.00
% 22.24/10.56 Cooper : 0.00
% 22.24/10.56 Total : 9.48
% 22.24/10.56 Index Insertion : 0.00
% 22.24/10.56 Index Deletion : 0.00
% 22.24/10.56 Index Matching : 0.00
% 22.24/10.57 BG Taut test : 0.00
%------------------------------------------------------------------------------