TSTP Solution File: SWV454+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV454+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 : n032.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 84.95s 70.98s
% Output : CNFRefutation 85.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 51
% Syntax : Number of formulae : 75 ( 14 unt; 49 typ; 0 def)
% Number of atoms : 109 ( 50 equ)
% Maximal formula atoms : 49 ( 4 avg)
% Number of connectives : 142 ( 59 ~; 37 |; 25 &)
% ( 1 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 5 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 : 44 ( 44 usr; 23 con; 0-2 aty)
% Number of variables : 52 (; 52 !; 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_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(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_463,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 ) )
=> ( ~ leq(nbr_proc,host(X))
=> ! [Z] :
( ( s(host(X)) != host(Z) )
=> ( ( host(X) = host(Z) )
=> ! [W0,X0] :
( ( s(host(X)) != host(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(Y0),V)
& elem(m_Down(W0),queue(host(X0))) ) ) ) ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
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_202,plain,
elem(m_Down('#skF_12'),'#skF_5'),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_204,plain,
host('#skF_11') = host('#skF_12'),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_218,plain,
host('#skF_7') = host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_214,plain,
host('#skF_11') != host('#skF_7'),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_264,plain,
host('#skF_11') != host('#skF_9'),
inference(demodulation,[status(thm),theory(equality)],[c_218,c_214]) ).
tff(c_265,plain,
host('#skF_9') != host('#skF_12'),
inference(demodulation,[status(thm),theory(equality)],[c_204,c_264]) ).
tff(c_210,plain,
setIn('#skF_9',alive),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_236,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_7')),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_258,plain,
cons(m_Down('#skF_8'),'#skF_5') = queue(host('#skF_9')),
inference(demodulation,[status(thm),theory(equality)],[c_218,c_236]) ).
tff(c_736,plain,
! [X_304,Q_305,Y_306] :
( ~ elem(X_304,Q_305)
| elem(X_304,cons(Y_306,Q_305)) ),
inference(cnfTransformation,[status(thm)],[f_224]) ).
tff(c_739,plain,
! [X_304] :
( ~ elem(X_304,'#skF_5')
| elem(X_304,queue(host('#skF_9'))) ),
inference(superposition,[status(thm),theory(equality)],[c_258,c_736]) ).
tff(c_206,plain,
host('#skF_10') = host('#skF_9'),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_200,plain,
elem(m_Down('#skF_10'),queue(host('#skF_11'))),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_267,plain,
elem(m_Down('#skF_10'),queue(host('#skF_12'))),
inference(demodulation,[status(thm),theory(equality)],[c_204,c_200]) ).
tff(c_208,plain,
setIn('#skF_11',alive),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_690,plain,
! [Pid30_287,Pid20_288,Pid0_289,Z_290] :
( ~ elem(m_Down(Pid30_287),queue(host(Pid20_288)))
| ~ elem(m_Down(Pid0_289),queue(host(Z_290)))
| ( host(Pid20_288) != host(Pid0_289) )
| ( host(Z_290) != host(Pid30_287) )
| ~ setIn(Pid20_288,alive)
| ~ setIn(Z_290,alive)
| ( host(Z_290) = host(Pid20_288) ) ),
inference(cnfTransformation,[status(thm)],[f_463]) ).
tff(c_700,plain,
! [Pid30_287,Pid0_289,Z_290] :
( ~ elem(m_Down(Pid30_287),queue(host('#skF_12')))
| ~ elem(m_Down(Pid0_289),queue(host(Z_290)))
| ( host(Pid0_289) != host('#skF_11') )
| ( host(Z_290) != host(Pid30_287) )
| ~ setIn('#skF_11',alive)
| ~ setIn(Z_290,alive)
| ( host(Z_290) = host('#skF_11') ) ),
inference(superposition,[status(thm),theory(equality)],[c_204,c_690]) ).
tff(c_38968,plain,
! [Pid30_972,Pid0_973,Z_974] :
( ~ elem(m_Down(Pid30_972),queue(host('#skF_12')))
| ~ elem(m_Down(Pid0_973),queue(host(Z_974)))
| ( host(Pid0_973) != host('#skF_12') )
| ( host(Z_974) != host(Pid30_972) )
| ~ setIn(Z_974,alive)
| ( host(Z_974) = host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_204,c_208,c_204,c_700]) ).
tff(c_38976,plain,
! [Pid0_973,Z_974] :
( ~ elem(m_Down(Pid0_973),queue(host(Z_974)))
| ( host(Pid0_973) != host('#skF_12') )
| ( host(Z_974) != host('#skF_10') )
| ~ setIn(Z_974,alive)
| ( host(Z_974) = host('#skF_12') ) ),
inference(resolution,[status(thm)],[c_267,c_38968]) ).
tff(c_321640,plain,
! [Pid0_1953,Z_1954] :
( ~ elem(m_Down(Pid0_1953),queue(host(Z_1954)))
| ( host(Pid0_1953) != host('#skF_12') )
| ( host(Z_1954) != host('#skF_9') )
| ~ setIn(Z_1954,alive)
| ( host(Z_1954) = host('#skF_12') ) ),
inference(demodulation,[status(thm),theory(equality)],[c_206,c_38976]) ).
tff(c_321659,plain,
! [Pid0_1953] :
( ( host(Pid0_1953) != host('#skF_12') )
| ~ setIn('#skF_9',alive)
| ( host('#skF_9') = host('#skF_12') )
| ~ elem(m_Down(Pid0_1953),'#skF_5') ),
inference(resolution,[status(thm)],[c_739,c_321640]) ).
tff(c_321671,plain,
! [Pid0_1953] :
( ( host(Pid0_1953) != host('#skF_12') )
| ( host('#skF_9') = host('#skF_12') )
| ~ elem(m_Down(Pid0_1953),'#skF_5') ),
inference(demodulation,[status(thm),theory(equality)],[c_210,c_321659]) ).
tff(c_321680,plain,
! [Pid0_1955] :
( ( host(Pid0_1955) != host('#skF_12') )
| ~ elem(m_Down(Pid0_1955),'#skF_5') ),
inference(negUnitSimplification,[status(thm)],[c_265,c_321671]) ).
tff(c_321694,plain,
$false,
inference(resolution,[status(thm)],[c_202,c_321680]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV454+1 : TPTP v8.1.2. Released v4.0.0.
% 0.13/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.33 % Computer : n032.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 300
% 0.13/0.33 % DateTime : Thu Aug 3 22:59:21 EDT 2023
% 0.13/0.33 % CPUTime :
% 84.95/70.98 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 84.95/70.99
% 84.95/70.99 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 85.05/71.01
% 85.05/71.01 Inference rules
% 85.05/71.01 ----------------------
% 85.05/71.01 #Ref : 30
% 85.05/71.01 #Sup : 71059
% 85.05/71.01 #Fact : 62
% 85.05/71.01 #Define : 0
% 85.05/71.01 #Split : 74
% 85.05/71.01 #Chain : 0
% 85.05/71.01 #Close : 0
% 85.05/71.01
% 85.05/71.01 Ordering : KBO
% 85.05/71.01
% 85.05/71.01 Simplification rules
% 85.05/71.01 ----------------------
% 85.05/71.01 #Subsume : 24494
% 85.05/71.01 #Demod : 42935
% 85.05/71.01 #Tautology : 19671
% 85.05/71.01 #SimpNegUnit : 726
% 85.05/71.01 #BackRed : 656
% 85.05/71.01
% 85.05/71.01 #Partial instantiations: 0
% 85.05/71.01 #Strategies tried : 1
% 85.05/71.01
% 85.05/71.01 Timing (in seconds)
% 85.05/71.01 ----------------------
% 85.05/71.02 Preprocessing : 0.72
% 85.05/71.02 Parsing : 0.34
% 85.05/71.02 CNF conversion : 0.06
% 85.05/71.02 Main loop : 69.26
% 85.05/71.02 Inferencing : 5.74
% 85.05/71.02 Reduction : 32.83
% 85.05/71.02 Demodulation : 24.00
% 85.05/71.02 BG Simplification : 0.28
% 85.05/71.02 Subsumption : 25.34
% 85.05/71.02 Abstraction : 0.48
% 85.05/71.02 MUC search : 0.00
% 85.05/71.02 Cooper : 0.00
% 85.05/71.02 Total : 70.03
% 85.05/71.02 Index Insertion : 0.00
% 85.05/71.02 Index Deletion : 0.00
% 85.05/71.02 Index Matching : 0.00
% 85.05/71.02 BG Taut test : 0.00
%------------------------------------------------------------------------------