TSTP Solution File: SWW965+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% Transfm : none
% Format : tptp:raw
% Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% Computer : n003.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 : Fri Sep 1 00:19:22 EDT 2023
% Result : Theorem 0.20s 0.61s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 64
% Syntax : Number of formulae : 88 ( 11 unt; 56 typ; 0 def)
% Number of atoms : 77 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 82 ( 37 ~; 35 |; 5 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 56 ( 40 >; 16 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 51 ( 51 usr; 16 con; 0-2 aty)
% Number of variables : 48 ( 19 sgn; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_22,type,
constr_CONST_0x30: $i ).
tff(decl_23,type,
constr_CONST_1: $i ).
tff(decl_24,type,
constr_CONST_2: $i ).
tff(decl_25,type,
constr_CONST_3: $i ).
tff(decl_26,type,
constr_CONST_4: $i ).
tff(decl_27,type,
constr_ZERO: $i ).
tff(decl_28,type,
name_A: $i ).
tff(decl_29,type,
name_B: $i ).
tff(decl_30,type,
name_I: $i ).
tff(decl_31,type,
name_c: $i ).
tff(decl_32,type,
name_objective: $i ).
tff(decl_33,type,
name_skA: $i ).
tff(decl_34,type,
name_skB: $i ).
tff(decl_35,type,
name_skS: $i ).
tff(decl_36,type,
constr_pkey: $i > $i ).
tff(decl_37,type,
constr_aenc: ( $i * $i ) > $i ).
tff(decl_38,type,
constr_adec: ( $i * $i ) > $i ).
tff(decl_39,type,
constr_enc: ( $i * $i ) > $i ).
tff(decl_40,type,
constr_dec: ( $i * $i ) > $i ).
tff(decl_41,type,
constr_sign: ( $i * $i ) > $i ).
tff(decl_42,type,
constr_getmess: $i > $i ).
tff(decl_43,type,
constr_checksign: ( $i * $i ) > $i ).
tff(decl_44,type,
constr_xor: ( $i * $i ) > $i ).
tff(decl_45,type,
tuple_2: ( $i * $i ) > $i ).
tff(decl_46,type,
constr_tuple_2_get_1_bitstring: $i > $i ).
tff(decl_47,type,
constr_tuple_2_get_0x30_bitstring: $i > $i ).
tff(decl_48,type,
constr_tuple_2_get_1: $i > $i ).
tff(decl_49,type,
constr_tuple_2_get_0x30: $i > $i ).
tff(decl_50,type,
pred_eq_bitstring_bitstring: ( $i * $i ) > $o ).
tff(decl_51,type,
pred_attacker: $i > $o ).
tff(decl_52,type,
tuple_true: $i ).
tff(decl_53,type,
tuple_out_3: $i > $i ).
tff(decl_54,type,
tuple_out_2: $i > $i ).
tff(decl_55,type,
tuple_out_1: $i > $i ).
tff(decl_56,type,
tuple_key_retrieval_server_out_2: $i > $i ).
tff(decl_57,type,
tuple_key_retrieval_server_in_1: ( $i * $i ) > $i ).
tff(decl_58,type,
tuple_key_register_server_in_1: ( $i * $i ) > $i ).
tff(decl_59,type,
tuple_false: $i ).
tff(decl_60,type,
tuple_client_B_out_6: $i > $i ).
tff(decl_61,type,
tuple_client_B_out_4: $i > $i ).
tff(decl_62,type,
tuple_client_B_out_1: ( $i * $i ) > $i ).
tff(decl_63,type,
tuple_client_B_in_5: $i > $i ).
tff(decl_64,type,
tuple_client_B_in_3: $i > $i ).
tff(decl_65,type,
tuple_client_B_in_2: $i > $i ).
tff(decl_66,type,
tuple_client_A_out_5: $i > $i ).
tff(decl_67,type,
tuple_client_A_out_3: $i > $i ).
tff(decl_68,type,
tuple_client_A_out_1: ( $i * $i ) > $i ).
tff(decl_69,type,
tuple_client_A_in_4: $i > $i ).
tff(decl_70,type,
tuple_client_A_in_2: $i > $i ).
tff(decl_71,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_72,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_73,type,
name_new0x2Dname: $i > $i ).
tff(decl_74,type,
tuple_keys: ( $i * $i ) > $i ).
tff(decl_75,type,
pred_table: $i > $o ).
tff(decl_76,type,
name_Na: $i > $i ).
tff(decl_77,type,
name_Nb: $i > $i ).
fof(ax184,axiom,
! [X116,X117,X118,X119] :
( ( pred_eq_bitstring_bitstring(name_Nb(X116),constr_adec(X118,name_skB))
& pred_attacker(tuple_client_B_in_5(X118))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X117,name_skB)))
& pred_attacker(tuple_client_B_in_3(X117))
& pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X119,constr_pkey(name_skS))))
& pred_attacker(tuple_client_B_in_2(X119)) )
=> pred_attacker(tuple_client_B_out_6(name_objective)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax184) ).
fof(ax103,axiom,
! [X24,X25] : pred_eq_bitstring_bitstring(X24,X25),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax103) ).
fof(ax137,axiom,
! [X70] :
( pred_attacker(X70)
=> pred_attacker(tuple_client_B_in_5(X70)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax137) ).
fof(ax139,axiom,
! [X72] :
( pred_attacker(X72)
=> pred_attacker(tuple_client_B_in_3(X72)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax139) ).
fof(ax141,axiom,
! [X74] :
( pred_attacker(X74)
=> pred_attacker(tuple_client_B_in_2(X74)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax141) ).
fof(ax173,axiom,
! [X107] : pred_attacker(name_new0x2Dname(X107)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax173) ).
fof(ax131,axiom,
! [X61] :
( pred_attacker(tuple_client_B_out_6(X61))
=> pred_attacker(X61) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax131) ).
fof(co0,conjecture,
pred_attacker(name_objective),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(c_0_8,plain,
! [X240,X241,X242,X243] :
( ~ pred_eq_bitstring_bitstring(name_Nb(X240),constr_adec(X242,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X242))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X241,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X241))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X243,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X243))
| pred_attacker(tuple_client_B_out_6(name_objective)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax184])]) ).
fof(c_0_9,plain,
! [X148,X149] : pred_eq_bitstring_bitstring(X148,X149),
inference(variable_rename,[status(thm)],[ax103]) ).
cnf(c_0_10,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_eq_bitstring_bitstring(name_Nb(X1),constr_adec(X2,name_skB))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_1(constr_adec(X3,name_skB)))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_eq_bitstring_bitstring(name_A,constr_tuple_2_get_0x30(constr_checksign(X4,constr_pkey(name_skS))))
| ~ pred_attacker(tuple_client_B_in_2(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_11,plain,
pred_eq_bitstring_bitstring(X1,X2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_12,plain,
! [X194] :
( ~ pred_attacker(X194)
| pred_attacker(tuple_client_B_in_5(X194)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax137])]) ).
cnf(c_0_13,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_5(X2))
| ~ pred_attacker(tuple_client_B_in_3(X3))
| ~ pred_attacker(tuple_client_B_in_2(X4)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_11])]) ).
cnf(c_0_14,plain,
( pred_attacker(tuple_client_B_in_5(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_15,plain,
! [X196] :
( ~ pred_attacker(X196)
| pred_attacker(tuple_client_B_in_3(X196)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax139])]) ).
cnf(c_0_16,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(tuple_client_B_in_2(X2))
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( pred_attacker(tuple_client_B_in_3(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
fof(c_0_18,plain,
! [X198] :
( ~ pred_attacker(X198)
| pred_attacker(tuple_client_B_in_2(X198)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax141])]) ).
cnf(c_0_19,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
( pred_attacker(tuple_client_B_in_2(X1))
| ~ pred_attacker(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_21,plain,
! [X231] : pred_attacker(name_new0x2Dname(X231)),
inference(variable_rename,[status(thm)],[ax173]) ).
cnf(c_0_22,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2)
| ~ pred_attacker(X3) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
fof(c_0_25,plain,
! [X185] :
( ~ pred_attacker(tuple_client_B_out_6(X185))
| pred_attacker(X185) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax131])]) ).
cnf(c_0_26,plain,
( pred_attacker(tuple_client_B_out_6(name_objective))
| ~ pred_attacker(X1) ),
inference(spm,[status(thm)],[c_0_24,c_0_23]) ).
fof(c_0_27,negated_conjecture,
~ pred_attacker(name_objective),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co0])]) ).
cnf(c_0_28,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_client_B_out_6(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_29,plain,
pred_attacker(tuple_client_B_out_6(name_objective)),
inference(spm,[status(thm)],[c_0_26,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
~ pred_attacker(name_objective),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_31,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWW965+1 : TPTP v8.1.2. Released v7.4.0.
% 0.13/0.14 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.35 % Computer : n003.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 : Sun Aug 27 22:55:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.20/0.58 start to proof: theBenchmark
% 0.20/0.61 % Version : CSE_E---1.5
% 0.20/0.61 % Problem : theBenchmark.p
% 0.20/0.61 % Proof found
% 0.20/0.61 % SZS status Theorem for theBenchmark.p
% 0.20/0.61 % SZS output start Proof
% See solution above
% 0.20/0.62 % Total time : 0.024000 s
% 0.20/0.62 % SZS output end Proof
% 0.20/0.62 % Total time : 0.028000 s
%------------------------------------------------------------------------------