TSTP Solution File: SWW962+1 by CSE_E---1.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : CSE_E---1.5
% Problem : SWW962+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 : n017.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:21 EDT 2023
% Result : Theorem 0.19s 0.60s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 63
% Syntax : Number of formulae : 78 ( 16 unt; 58 typ; 0 def)
% Number of atoms : 24 ( 7 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 10 ( 6 ~; 3 |; 0 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 58 ( 42 >; 16 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 53 ( 53 usr; 16 con; 0-2 aty)
% Number of variables : 31 ( 7 sgn; 18 !; 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,
name_A: $i ).
tff(decl_28,type,
name_B: $i ).
tff(decl_29,type,
name_I: $i ).
tff(decl_30,type,
name_c: $i ).
tff(decl_31,type,
name_objective: $i ).
tff(decl_32,type,
name_skA: $i ).
tff(decl_33,type,
name_skB: $i ).
tff(decl_34,type,
name_skS: $i ).
tff(decl_35,type,
constr_pkey: $i > $i ).
tff(decl_36,type,
constr_aenc: ( $i * $i ) > $i ).
tff(decl_37,type,
constr_adec: ( $i * $i ) > $i ).
tff(decl_38,type,
constr_enc: ( $i * $i ) > $i ).
tff(decl_39,type,
constr_dec: ( $i * $i ) > $i ).
tff(decl_40,type,
constr_sign: ( $i * $i ) > $i ).
tff(decl_41,type,
constr_getmess: $i > $i ).
tff(decl_42,type,
constr_checksign: ( $i * $i ) > $i ).
tff(decl_43,type,
tuple_assoc_pair: ( $i * $i ) > $i ).
tff(decl_44,type,
constr_assoc_pair_2_get_1_bitstring: $i > $i ).
tff(decl_45,type,
constr_assoc_pair_2_get_0x30_bitstring: $i > $i ).
tff(decl_46,type,
constr_assoc_pair_2_get_1: $i > $i ).
tff(decl_47,type,
constr_assoc_pair_2_get_0x30: $i > $i ).
tff(decl_48,type,
tuple_2: ( $i * $i ) > $i ).
tff(decl_49,type,
constr_tuple_2_get_1_bitstring: $i > $i ).
tff(decl_50,type,
constr_tuple_2_get_0x30: $i > $i ).
tff(decl_51,type,
pred_eq_bitstring_bitstring: ( $i * $i ) > $o ).
tff(decl_52,type,
pred_attacker: $i > $o ).
tff(decl_53,type,
tuple_true: $i ).
tff(decl_54,type,
tuple_out_3: $i > $i ).
tff(decl_55,type,
tuple_out_2: $i > $i ).
tff(decl_56,type,
tuple_out_1: $i > $i ).
tff(decl_57,type,
tuple_key_retrieval_server_out_2: $i > $i ).
tff(decl_58,type,
tuple_key_retrieval_server_in_1: ( $i * $i ) > $i ).
tff(decl_59,type,
tuple_key_register_server_in_1: ( $i * $i ) > $i ).
tff(decl_60,type,
tuple_false: $i ).
tff(decl_61,type,
tuple_client_B_out_6: $i > $i ).
tff(decl_62,type,
tuple_client_B_out_4: $i > $i ).
tff(decl_63,type,
tuple_client_B_out_1: ( $i * $i ) > $i ).
tff(decl_64,type,
tuple_client_B_in_5: $i > $i ).
tff(decl_65,type,
tuple_client_B_in_3: $i > $i ).
tff(decl_66,type,
tuple_client_B_in_2: $i > $i ).
tff(decl_67,type,
tuple_client_A_out_5: $i > $i ).
tff(decl_68,type,
tuple_client_A_out_3: $i > $i ).
tff(decl_69,type,
tuple_client_A_out_1: ( $i * $i ) > $i ).
tff(decl_70,type,
tuple_client_A_in_4: $i > $i ).
tff(decl_71,type,
tuple_client_A_in_2: $i > $i ).
tff(decl_72,type,
pred_mess: ( $i * $i ) > $o ).
tff(decl_73,type,
pred_equal: ( $i * $i ) > $o ).
tff(decl_74,type,
name_new0x2Dname: $i > $i ).
tff(decl_75,type,
tuple_keys: ( $i * $i ) > $i ).
tff(decl_76,type,
pred_table: $i > $o ).
tff(decl_77,type,
name_Na: $i > $i ).
tff(decl_78,type,
name_Nb: $i > $i ).
tff(decl_79,type,
esk1_0: $i ).
fof(ax83,axiom,
! [X12,X13] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X12,X13)) = X13,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax83) ).
fof(ax82,axiom,
! [X9,X10,X11] : tuple_assoc_pair(X9,tuple_assoc_pair(X10,X11)) = tuple_assoc_pair(tuple_assoc_pair(X9,X10),X11),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax82) ).
fof(ax143,axiom,
! [X94,X95] :
( pred_attacker(tuple_assoc_pair(X94,X95))
=> pred_attacker(X94) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax143) ).
fof(co0,conjecture,
! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co0) ).
fof(ax162,axiom,
! [X113] : pred_attacker(name_new0x2Dname(X113)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax162) ).
fof(c_0_5,plain,
! [X143,X144] : constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X143,X144)) = X144,
inference(variable_rename,[status(thm)],[ax83]) ).
fof(c_0_6,plain,
! [X140,X141,X142] : tuple_assoc_pair(X140,tuple_assoc_pair(X141,X142)) = tuple_assoc_pair(tuple_assoc_pair(X140,X141),X142),
inference(variable_rename,[status(thm)],[ax82]) ).
fof(c_0_7,plain,
! [X225,X226] :
( ~ pred_attacker(tuple_assoc_pair(X225,X226))
| pred_attacker(X225) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax143])]) ).
cnf(c_0_8,plain,
constr_assoc_pair_2_get_1_bitstring(tuple_assoc_pair(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
tuple_assoc_pair(X1,tuple_assoc_pair(X2,X3)) = tuple_assoc_pair(tuple_assoc_pair(X1,X2),X3),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
fof(c_0_10,negated_conjecture,
~ ! [X131] : pred_attacker(tuple_2(name_Nb(X131),name_objective)),
inference(assume_negation,[status(cth)],[co0]) ).
cnf(c_0_11,plain,
( pred_attacker(X1)
| ~ pred_attacker(tuple_assoc_pair(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_12,plain,
tuple_assoc_pair(X1,X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_8]) ).
fof(c_0_13,plain,
! [X244] : pred_attacker(name_new0x2Dname(X244)),
inference(variable_rename,[status(thm)],[ax162]) ).
fof(c_0_14,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).
cnf(c_0_15,plain,
( pred_attacker(X1)
| ~ pred_attacker(X2) ),
inference(rw,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,plain,
pred_attacker(name_new0x2Dname(X1)),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_17,negated_conjecture,
~ pred_attacker(tuple_2(name_Nb(esk1_0),name_objective)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
pred_attacker(X1),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWW962+1 : TPTP v8.1.2. Released v7.4.0.
% 0.07/0.13 % Command : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 20:27:57 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.19/0.57 start to proof: theBenchmark
% 0.19/0.60 % Version : CSE_E---1.5
% 0.19/0.60 % Problem : theBenchmark.p
% 0.19/0.60 % Proof found
% 0.19/0.60 % SZS status Theorem for theBenchmark.p
% 0.19/0.60 % SZS output start Proof
% See solution above
% 0.19/0.60 % Total time : 0.024000 s
% 0.19/0.60 % SZS output end Proof
% 0.19/0.60 % Total time : 0.029000 s
%------------------------------------------------------------------------------