TSTP Solution File: SWV236+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.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 : n028.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:03:16 EDT 2023
% Result : Theorem 11.71s 4.03s
% Output : CNFRefutation 11.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 24
% Syntax : Number of formulae : 50 ( 19 unt; 14 typ; 0 def)
% Number of atoms : 64 ( 6 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 53 ( 25 ~; 21 |; 4 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 10 con; 0-2 aty)
% Number of variables : 40 (; 39 !; 1 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ p > xor > decrypt > crypt > #nlpp > pp > pin > kp > km > imp > id > exp > eurk > data > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(kp,type,
kp: $i ).
tff(a,type,
a: $i ).
tff(id,type,
id: $i ).
tff(crypt,type,
crypt: ( $i * $i ) > $i ).
tff(pp,type,
pp: $i ).
tff(decrypt,type,
decrypt: ( $i * $i ) > $i ).
tff(eurk,type,
eurk: $i ).
tff(data,type,
data: $i ).
tff(p,type,
p: $i > $o ).
tff(xor,type,
xor: ( $i * $i ) > $i ).
tff(exp,type,
exp: $i ).
tff(imp,type,
imp: $i ).
tff(pin,type,
pin: $i ).
tff(km,type,
km: $i ).
tff(f_32,axiom,
! [X1,X2] : ( xor(X1,X2) = xor(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_commutative) ).
tff(f_131,axiom,
p(crypt(xor(km,exp),eurk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_7) ).
tff(f_139,negated_conjecture,
~ ? [X] :
( p(crypt(xor(km,exp),X))
& p(X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',find_known_exporter) ).
tff(f_132,axiom,
p(crypt(xor(km,data),eurk)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_8) ).
tff(f_123,axiom,
! [X1,X2] :
( p(crypt(xor(X1,data),X2))
=> p(crypt(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',data_cv_is_known_to_be_zero) ).
tff(f_127,axiom,
p(id),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',initial_knowledge_of_intruder_4) ).
tff(f_38,axiom,
! [X1] : ( xor(X1,id) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xor_rules_1) ).
tff(f_56,axiom,
! [Xtype,Xk1,Xkek1] :
( ( p(crypt(xor(km,Xtype),Xk1))
& p(Xtype)
& p(crypt(xor(km,exp),Xkek1)) )
=> p(crypt(xor(Xkek1,Xtype),Xk1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',key_export) ).
tff(f_36,axiom,
! [X1,X2] : ( decrypt(X1,crypt(X1,X2)) = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',encryption_decryption_cancellation) ).
tff(f_90,axiom,
! [X1,Xk1] :
( ( p(X1)
& p(crypt(xor(km,data),Xk1)) )
=> p(decrypt(Xk1,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',decrypt_data) ).
tff(c_2,plain,
! [X2_2,X1_1] : ( xor(X2_2,X1_1) = xor(X1_1,X2_2) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_48,plain,
p(crypt(xor(km,exp),eurk)),
inference(cnfTransformation,[status(thm)],[f_131]) ).
tff(c_59,plain,
p(crypt(xor(exp,km),eurk)),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_48]) ).
tff(c_56,plain,
! [X_44] :
( ~ p(X_44)
| ~ p(crypt(xor(km,exp),X_44)) ),
inference(cnfTransformation,[status(thm)],[f_139]) ).
tff(c_57,plain,
! [X_44] :
( ~ p(X_44)
| ~ p(crypt(xor(exp,km),X_44)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_56]) ).
tff(c_198,plain,
~ p(eurk),
inference(resolution,[status(thm)],[c_59,c_57]) ).
tff(c_50,plain,
p(crypt(xor(km,data),eurk)),
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_58,plain,
p(crypt(xor(data,km),eurk)),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_50]) ).
tff(c_579,plain,
! [X1_68,X2_69] :
( p(crypt(X1_68,X2_69))
| ~ p(crypt(xor(X1_68,data),X2_69)) ),
inference(cnfTransformation,[status(thm)],[f_123]) ).
tff(c_1279,plain,
! [X2_106,X2_107] :
( p(crypt(X2_106,X2_107))
| ~ p(crypt(xor(data,X2_106),X2_107)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_579]) ).
tff(c_1312,plain,
p(crypt(km,eurk)),
inference(resolution,[status(thm)],[c_58,c_1279]) ).
tff(c_42,plain,
p(id),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_8,plain,
! [X1_8] : ( xor(X1_8,id) = X1_8 ),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_14,plain,
! [Xkek1_17,Xtype_15,Xk1_16] :
( p(crypt(xor(Xkek1_17,Xtype_15),Xk1_16))
| ~ p(crypt(xor(km,exp),Xkek1_17))
| ~ p(Xtype_15)
| ~ p(crypt(xor(km,Xtype_15),Xk1_16)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_1225,plain,
! [Xkek1_100,Xtype_101,Xk1_102] :
( p(crypt(xor(Xkek1_100,Xtype_101),Xk1_102))
| ~ p(crypt(xor(exp,km),Xkek1_100))
| ~ p(Xtype_101)
| ~ p(crypt(xor(km,Xtype_101),Xk1_102)) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_14]) ).
tff(c_14375,plain,
! [Xtype_210,Xk1_211] :
( p(crypt(xor(eurk,Xtype_210),Xk1_211))
| ~ p(Xtype_210)
| ~ p(crypt(xor(km,Xtype_210),Xk1_211)) ),
inference(resolution,[status(thm)],[c_59,c_1225]) ).
tff(c_14479,plain,
! [Xk1_211] :
( p(crypt(xor(eurk,id),Xk1_211))
| ~ p(id)
| ~ p(crypt(km,Xk1_211)) ),
inference(superposition,[status(thm),theory(equality)],[c_8,c_14375]) ).
tff(c_14527,plain,
! [Xk1_212] :
( p(crypt(eurk,Xk1_212))
| ~ p(crypt(km,Xk1_212)) ),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_8,c_14479]) ).
tff(c_14546,plain,
p(crypt(eurk,eurk)),
inference(resolution,[status(thm)],[c_1312,c_14527]) ).
tff(c_6,plain,
! [X1_6,X2_7] : ( decrypt(X1_6,crypt(X1_6,X2_7)) = X2_7 ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_24,plain,
! [Xk1_29,X1_28] :
( p(decrypt(Xk1_29,X1_28))
| ~ p(crypt(xor(km,data),Xk1_29))
| ~ p(X1_28) ),
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_776,plain,
! [Xk1_75,X1_76] :
( p(decrypt(Xk1_75,X1_76))
| ~ p(crypt(xor(data,km),Xk1_75))
| ~ p(X1_76) ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_24]) ).
tff(c_784,plain,
! [X1_77] :
( p(decrypt(eurk,X1_77))
| ~ p(X1_77) ),
inference(resolution,[status(thm)],[c_58,c_776]) ).
tff(c_788,plain,
! [X2_7] :
( p(X2_7)
| ~ p(crypt(eurk,X2_7)) ),
inference(superposition,[status(thm),theory(equality)],[c_6,c_784]) ).
tff(c_14561,plain,
p(eurk),
inference(resolution,[status(thm)],[c_14546,c_788]) ).
tff(c_14568,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_198,c_14561]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV236+1 : TPTP v8.1.2. Released v3.2.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 : n028.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:51:39 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.71/4.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.71/4.04
% 11.71/4.04 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.71/4.07
% 11.71/4.07 Inference rules
% 11.71/4.07 ----------------------
% 11.71/4.07 #Ref : 0
% 11.71/4.07 #Sup : 3727
% 11.71/4.07 #Fact : 0
% 11.71/4.07 #Define : 0
% 11.71/4.07 #Split : 6
% 11.71/4.07 #Chain : 0
% 11.71/4.07 #Close : 0
% 11.71/4.07
% 11.71/4.07 Ordering : KBO
% 11.71/4.07
% 11.71/4.07 Simplification rules
% 11.71/4.07 ----------------------
% 11.71/4.07 #Subsume : 579
% 11.71/4.07 #Demod : 5058
% 11.71/4.07 #Tautology : 1418
% 11.71/4.07 #SimpNegUnit : 48
% 11.71/4.07 #BackRed : 11
% 11.71/4.07
% 11.71/4.07 #Partial instantiations: 0
% 11.71/4.07 #Strategies tried : 1
% 11.71/4.07
% 11.71/4.07 Timing (in seconds)
% 11.71/4.07 ----------------------
% 11.71/4.07 Preprocessing : 0.53
% 11.71/4.07 Parsing : 0.29
% 11.71/4.07 CNF conversion : 0.03
% 11.71/4.07 Main loop : 2.47
% 11.71/4.07 Inferencing : 0.52
% 11.71/4.07 Reduction : 1.48
% 11.71/4.07 Demodulation : 1.35
% 11.71/4.07 BG Simplification : 0.06
% 11.71/4.07 Subsumption : 0.31
% 11.71/4.07 Abstraction : 0.08
% 11.71/4.07 MUC search : 0.00
% 11.71/4.07 Cooper : 0.00
% 11.71/4.07 Total : 3.05
% 11.71/4.07 Index Insertion : 0.00
% 11.71/4.07 Index Deletion : 0.00
% 11.71/4.07 Index Matching : 0.00
% 11.71/4.07 BG Taut test : 0.00
%------------------------------------------------------------------------------