%------------------------------------------------------------------------------
% File     : cvc5---1.0.5
% Problem  : SWW950+1 : TPTP v8.2.0. Released v7.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : do_cvc5 %s %d

% Computer : n008.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 : Wed May 29 18:20:50 EDT 2024

% Result   : Theorem 0.45s 0.67s
% Output   : Proof 0.50s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem    : SWW950+1 : TPTP v8.2.0. Released v7.4.0.
% 0.04/0.14  % Command    : do_cvc5 %s %d
% 0.14/0.35  % Computer : n008.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 May 26 04:44:24 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.20/0.50  %----Proving TF0_NAR, FOF, or CNF
% 0.45/0.67  --- Run --decision=internal --simplification=none --no-inst-no-entail --no-cbqi --full-saturate-quant at 10...
% 0.45/0.67  % SZS status Theorem for /export/starexec/sandbox2/tmp/tmp.lkMAvpJz3r/cvc5---1.0.5_32045.smt2
% 0.45/0.67  % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.lkMAvpJz3r/cvc5---1.0.5_32045.smt2
% 0.45/0.67  (assume a0 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_1)))
% 0.45/0.67  (assume a1 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_2)))
% 0.45/0.67  (assume a2 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_3)))
% 0.45/0.67  (assume a3 (not (= tptp.constr_CONST_0x30 tptp.constr_CONST_4)))
% 0.45/0.67  (assume a4 (not (= tptp.constr_CONST_0x30 tptp.constr_ZERO)))
% 0.45/0.67  (assume a5 (not (= tptp.constr_CONST_0x30 tptp.name_c)))
% 0.45/0.67  (assume a6 (not (= tptp.constr_CONST_0x30 tptp.name_k0x30)))
% 0.45/0.67  (assume a7 (not (= tptp.constr_CONST_0x30 tptp.name_ki)))
% 0.45/0.67  (assume a8 (not (= tptp.constr_CONST_0x30 tptp.name_objective)))
% 0.45/0.67  (assume a9 (not (= tptp.constr_CONST_1 tptp.constr_CONST_2)))
% 0.45/0.67  (assume a10 (not (= tptp.constr_CONST_1 tptp.constr_CONST_3)))
% 0.45/0.67  (assume a11 (not (= tptp.constr_CONST_1 tptp.constr_CONST_4)))
% 0.45/0.67  (assume a12 (not (= tptp.constr_CONST_1 tptp.constr_ZERO)))
% 0.45/0.67  (assume a13 (not (= tptp.constr_CONST_1 tptp.name_c)))
% 0.45/0.67  (assume a14 (not (= tptp.constr_CONST_1 tptp.name_k0x30)))
% 0.45/0.67  (assume a15 (not (= tptp.constr_CONST_1 tptp.name_ki)))
% 0.45/0.67  (assume a16 (not (= tptp.constr_CONST_1 tptp.name_objective)))
% 0.45/0.67  (assume a17 (not (= tptp.constr_CONST_2 tptp.constr_CONST_3)))
% 0.45/0.67  (assume a18 (not (= tptp.constr_CONST_2 tptp.constr_CONST_4)))
% 0.45/0.67  (assume a19 (not (= tptp.constr_CONST_2 tptp.constr_ZERO)))
% 0.45/0.67  (assume a20 (not (= tptp.constr_CONST_2 tptp.name_c)))
% 0.45/0.67  (assume a21 (not (= tptp.constr_CONST_2 tptp.name_k0x30)))
% 0.45/0.67  (assume a22 (not (= tptp.constr_CONST_2 tptp.name_ki)))
% 0.45/0.67  (assume a23 (not (= tptp.constr_CONST_2 tptp.name_objective)))
% 0.45/0.67  (assume a24 (not (= tptp.constr_CONST_3 tptp.constr_CONST_4)))
% 0.45/0.67  (assume a25 (not (= tptp.constr_CONST_3 tptp.constr_ZERO)))
% 0.45/0.67  (assume a26 (not (= tptp.constr_CONST_3 tptp.name_c)))
% 0.45/0.67  (assume a27 (not (= tptp.constr_CONST_3 tptp.name_k0x30)))
% 0.45/0.67  (assume a28 (not (= tptp.constr_CONST_3 tptp.name_ki)))
% 0.45/0.67  (assume a29 (not (= tptp.constr_CONST_3 tptp.name_objective)))
% 0.45/0.67  (assume a30 (not (= tptp.constr_CONST_4 tptp.constr_ZERO)))
% 0.45/0.67  (assume a31 (not (= tptp.constr_CONST_4 tptp.name_c)))
% 0.45/0.67  (assume a32 (not (= tptp.constr_CONST_4 tptp.name_k0x30)))
% 0.45/0.67  (assume a33 (not (= tptp.constr_CONST_4 tptp.name_ki)))
% 0.45/0.67  (assume a34 (not (= tptp.constr_CONST_4 tptp.name_objective)))
% 0.45/0.67  (assume a35 (not (= tptp.constr_ZERO tptp.name_c)))
% 0.45/0.67  (assume a36 (not (= tptp.constr_ZERO tptp.name_k0x30)))
% 0.45/0.67  (assume a37 (not (= tptp.constr_ZERO tptp.name_ki)))
% 0.45/0.67  (assume a38 (not (= tptp.constr_ZERO tptp.name_objective)))
% 0.45/0.67  (assume a39 (not (= tptp.name_c tptp.name_k0x30)))
% 0.45/0.67  (assume a40 (not (= tptp.name_c tptp.name_ki)))
% 0.45/0.67  (assume a41 (not (= tptp.name_c tptp.name_objective)))
% 0.45/0.67  (assume a42 (not (= tptp.name_k0x30 tptp.name_ki)))
% 0.45/0.67  (assume a43 (not (= tptp.name_k0x30 tptp.name_objective)))
% 0.45/0.67  (assume a44 (not (= tptp.name_ki tptp.name_objective)))
% 0.45/0.67  (assume a45 (forall ((VAR_X_10X30 $$unsorted)) (= (tptp.constr_xor VAR_X_10X30 VAR_X_10X30) tptp.constr_ZERO)))
% 0.45/0.67  (assume a46 (forall ((VAR_X_9 $$unsorted)) (= (tptp.constr_xor VAR_X_9 tptp.constr_ZERO) VAR_X_9)))
% 0.45/0.67  (assume a47 (forall ((VAR_X_7 $$unsorted) (VAR_Y_8 $$unsorted)) (= (tptp.constr_xor VAR_X_7 VAR_Y_8) (tptp.constr_xor VAR_Y_8 VAR_X_7))))
% 0.45/0.67  (assume a48 (forall ((VAR_X_0X30 $$unsorted) (VAR_Y_0X30 $$unsorted) (VAR_Z_0X30 $$unsorted)) (= (tptp.constr_xor VAR_X_0X30 (tptp.constr_xor VAR_Y_0X30 VAR_Z_0X30)) (tptp.constr_xor (tptp.constr_xor VAR_X_0X30 VAR_Y_0X30) VAR_Z_0X30))))
% 0.45/0.67  (assume a49 (forall ((VAR_V_29 $$unsorted) (VAR_V_30X30 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_29) (tptp.pred_attacker VAR_V_30X30)) (tptp.pred_attacker (tptp.constr_xor VAR_V_29 VAR_V_30X30)))))
% 0.45/0.67  (assume a50 (tptp.pred_attacker tptp.tuple_true))
% 0.45/0.67  (assume a51 (forall ((VAR_V_33 $$unsorted)) (=> (tptp.pred_attacker VAR_V_33) (tptp.pred_attacker (tptp.constr_h VAR_V_33)))))
% 0.45/0.67  (assume a52 (tptp.pred_attacker tptp.tuple_false))
% 0.45/0.67  (assume a53 (tptp.pred_attacker tptp.constr_ZERO))
% 0.45/0.67  (assume a54 (forall ((VAR_V_35 $$unsorted)) (=> (tptp.pred_attacker VAR_V_35) (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_35)))))
% 0.45/0.67  (assume a55 (forall ((VAR_V_38 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38)) (tptp.pred_attacker VAR_V_38))))
% 0.45/0.67  (assume a56 (forall ((VAR_V_41 $$unsorted)) (=> (tptp.pred_attacker VAR_V_41) (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_41)))))
% 0.45/0.67  (assume a57 (forall ((VAR_V_44 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44)) (tptp.pred_attacker VAR_V_44))))
% 0.45/0.67  (assume a58 (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_48) (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))))
% 0.45/0.67  (assume a59 (forall ((VAR_V_56 $$unsorted) (VAR_V_57 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_56 VAR_V_57)) (tptp.pred_attacker VAR_V_56))))
% 0.45/0.67  (assume a60 (forall ((VAR_V_59 $$unsorted) (VAR_V_60X30 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_59 VAR_V_60X30)) (tptp.pred_attacker VAR_V_60X30))))
% 0.45/0.67  (assume a61 (forall ((VAR_V_63 $$unsorted)) (=> (tptp.pred_attacker VAR_V_63) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))))
% 0.45/0.67  (assume a62 (forall ((VAR_V_66 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_66)) (tptp.pred_attacker VAR_V_66))))
% 0.45/0.67  (assume a63 (tptp.pred_attacker tptp.constr_CONST_4))
% 0.45/0.67  (assume a64 (tptp.pred_attacker tptp.constr_CONST_3))
% 0.45/0.67  (assume a65 (tptp.pred_attacker tptp.constr_CONST_2))
% 0.45/0.67  (assume a66 (tptp.pred_attacker tptp.constr_CONST_1))
% 0.45/0.67  (assume a67 (tptp.pred_attacker tptp.constr_CONST_0x30))
% 0.45/0.67  (assume a68 (forall ((VAR_V_72 $$unsorted) (VAR_V_73 $$unsorted)) (=> (and (tptp.pred_mess VAR_V_73 VAR_V_72) (tptp.pred_attacker VAR_V_73)) (tptp.pred_attacker VAR_V_72))))
% 0.45/0.67  (assume a69 (forall ((VAR_V_74 $$unsorted) (VAR_V_75 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_75) (tptp.pred_attacker VAR_V_74)) (tptp.pred_mess VAR_V_75 VAR_V_74))))
% 0.45/0.67  (assume a70 (tptp.pred_attacker tptp.name_c))
% 0.45/0.67  (assume a71 (forall ((VAR_V_77 $$unsorted)) (tptp.pred_equal VAR_V_77 VAR_V_77)))
% 0.45/0.67  (assume a72 (forall ((VAR_V_78 $$unsorted)) (tptp.pred_attacker (tptp.name_new0x2Dname VAR_V_78))))
% 0.45/0.67  (assume a73 (forall ((VAR_R_10X308 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308)) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))
% 0.45/0.67  (assume a74 (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (=> (and (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))))
% 0.45/0.67  (assume a75 (not (tptp.pred_attacker tptp.name_objective)))
% 0.45/0.67  (assume a76 true)
% 0.45/0.67  (step t1 (cl (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) :rule implies_neg1)
% 0.45/0.67  (anchor :step t2)
% 0.45/0.67  (assume t2.a0 (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))))
% 0.45/0.67  (step t2.t1 (cl (or (not (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule forall_inst :args ((:= VAR_V_38 tptp.name_objective)))
% 0.45/0.67  (step t2.t2 (cl (not (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) :rule or :premises (t2.t1))
% 0.45/0.67  (step t2.t3 (cl (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) :rule resolution :premises (t2.t2 t2.a0))
% 0.50/0.67  (step t2 (cl (not (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) :rule subproof :discharge (t2.a0))
% 0.50/0.67  (step t3 (cl (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) :rule resolution :premises (t1 t2))
% 0.50/0.67  (step t4 (cl (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule implies_neg2)
% 0.50/0.67  (step t5 (cl (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule resolution :premises (t3 t4))
% 0.50/0.67  (step t6 (cl (=> (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule contraction :premises (t5))
% 0.50/0.67  (step t7 (cl (not (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) :rule implies :premises (t6))
% 0.50/0.67  (step t8 (cl (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective))) (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)) :rule or_pos)
% 0.50/0.67  (step t9 (cl (tptp.pred_attacker tptp.name_objective) (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule reordering :premises (t8))
% 0.50/0.67  (step t10 (cl (not (= (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (=> (and (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))) (or (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))))) (not (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (=> (and (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))))) (or (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))))) :rule equiv_pos2)
% 0.50/0.67  (step t11 (cl (= (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (=> (and (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))) (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))))) :rule all_simplify)
% 0.50/0.67  (step t12 (cl (= (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))) (or (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))))) :rule all_simplify)
% 0.50/0.67  (step t13 (cl (= (forall ((VAR_A_143 $$unsorted) (VAR_R_144 $$unsorted)) (=> (and (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))) (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)))) (or (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))))) :rule trans :premises (t11 t12))
% 0.50/0.67  (step t14 (cl (or (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))))) :rule resolution :premises (t10 t13 a74))
% 0.50/0.67  (step t15 (cl (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective)) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) :rule or :premises (t14))
% 0.50/0.67  (step t16 (cl (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t17)
% 0.50/0.67  (assume t17.a0 (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))
% 0.50/0.67  (step t17.t1 (cl (or (not (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule forall_inst :args ((:= VAR_A_143 tptp.constr_CONST_1)))
% 0.50/0.67  (step t17.t2 (cl (not (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule or :premises (t17.t1))
% 0.50/0.67  (step t17.t3 (cl (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t17.t2 t17.a0))
% 0.50/0.67  (step t17 (cl (not (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule subproof :discharge (t17.a0))
% 0.50/0.67  (step t18 (cl (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t16 t17))
% 0.50/0.67  (step t19 (cl (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule implies_neg2)
% 0.50/0.67  (step t20 (cl (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule resolution :premises (t18 t19))
% 0.50/0.67  (step t21 (cl (=> (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule contraction :premises (t20))
% 0.50/0.67  (step t22 (cl (not (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule implies :premises (t21))
% 0.50/0.67  (step t23 (cl (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule or_pos)
% 0.50/0.67  (step t24 (cl (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule reordering :premises (t23))
% 0.50/0.67  (step t25 (cl (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) :rule or_pos)
% 0.50/0.67  (step t26 (cl (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule reordering :premises (t25))
% 0.50/0.67  (step t27 (cl (not (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule or_pos)
% 0.50/0.67  (step t28 (cl (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule reordering :premises (t27))
% 0.50/0.67  (step t29 (cl (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) :rule or_pos)
% 0.50/0.67  (step t30 (cl (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)) (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule reordering :premises (t29))
% 0.50/0.67  (step t31 (cl (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t32)
% 0.50/0.67  (assume t32.a0 (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))))
% 0.50/0.67  (step t32.t1 (cl (or (not (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule forall_inst :args ((:= VAR_V_63 tptp.constr_CONST_1)))
% 0.50/0.67  (step t32.t2 (cl (not (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule or :premises (t32.t1))
% 0.50/0.67  (step t32.t3 (cl (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule resolution :premises (t32.t2 t32.a0))
% 0.50/0.67  (step t32 (cl (not (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule subproof :discharge (t32.a0))
% 0.50/0.67  (step t33 (cl (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule resolution :premises (t31 t32))
% 0.50/0.67  (step t34 (cl (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule implies_neg2)
% 0.50/0.67  (step t35 (cl (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule resolution :premises (t33 t34))
% 0.50/0.67  (step t36 (cl (=> (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule contraction :premises (t35))
% 0.50/0.67  (step t37 (cl (not (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule implies :premises (t36))
% 0.50/0.67  (step t38 (cl (not (= (forall ((VAR_V_63 $$unsorted)) (=> (tptp.pred_attacker VAR_V_63) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))))) (not (forall ((VAR_V_63 $$unsorted)) (=> (tptp.pred_attacker VAR_V_63) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) :rule equiv_pos2)
% 0.50/0.67  (step t39 (cl (= (forall ((VAR_V_63 $$unsorted)) (=> (tptp.pred_attacker VAR_V_63) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))) (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63)))))) :rule all_simplify)
% 0.50/0.67  (step t40 (cl (forall ((VAR_V_63 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_63)) (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_V_63))))) :rule resolution :premises (t38 t39 a61))
% 0.50/0.67  (step t41 (cl (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule resolution :premises (t37 t40))
% 0.50/0.67  (step t42 (cl (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) :rule resolution :premises (t30 a66 t41))
% 0.50/0.67  (step t43 (cl (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t44)
% 0.50/0.67  (assume t44.a0 (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))
% 0.50/0.67  (step t44.t1 (cl (or (not (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule forall_inst :args ((:= VAR_R_10X308 tptp.constr_CONST_1)))
% 0.50/0.67  (step t44.t2 (cl (not (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule or :premises (t44.t1))
% 0.50/0.67  (step t44.t3 (cl (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t44.t2 t44.a0))
% 0.50/0.67  (step t44 (cl (not (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule subproof :discharge (t44.a0))
% 0.50/0.67  (step t45 (cl (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t43 t44))
% 0.50/0.67  (step t46 (cl (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule implies_neg2)
% 0.50/0.67  (step t47 (cl (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule resolution :premises (t45 t46))
% 0.50/0.67  (step t48 (cl (=> (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule contraction :premises (t47))
% 0.50/0.67  (step t49 (cl (not (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule implies :premises (t48))
% 0.50/0.67  (step t50 (cl (not (= (forall ((VAR_R_10X308 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308)) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))) (not (forall ((VAR_R_10X308 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308)) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule equiv_pos2)
% 0.50/0.67  (step t51 (cl (= (forall ((VAR_R_10X308 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308)) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))) :rule all_simplify)
% 0.50/0.67  (step t52 (cl (forall ((VAR_R_10X308 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_10X308))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor VAR_R_10X308 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule resolution :premises (t50 t51 a73))
% 0.50/0.67  (step t53 (cl (or (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))) (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t49 t52))
% 0.50/0.67  (step t54 (cl (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule resolution :premises (t28 t42 t53))
% 0.50/0.67  (step t55 (cl (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t56)
% 0.50/0.67  (assume t56.a0 (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))))
% 0.50/0.67  (step t56.t1 (cl (or (not (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule forall_inst :args ((:= VAR_V_44 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))
% 0.50/0.67  (step t56.t2 (cl (not (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule or :premises (t56.t1))
% 0.50/0.67  (step t56.t3 (cl (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule resolution :premises (t56.t2 t56.a0))
% 0.50/0.67  (step t56 (cl (not (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule subproof :discharge (t56.a0))
% 0.50/0.67  (step t57 (cl (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule resolution :premises (t55 t56))
% 0.50/0.67  (step t58 (cl (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule implies_neg2)
% 0.50/0.67  (step t59 (cl (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t57 t58))
% 0.50/0.67  (step t60 (cl (=> (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule contraction :premises (t59))
% 0.50/0.67  (step t61 (cl (not (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule implies :premises (t60))
% 0.50/0.67  (step t62 (cl (not (= (forall ((VAR_V_44 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44)) (tptp.pred_attacker VAR_V_44))) (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))))) (not (forall ((VAR_V_44 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44)) (tptp.pred_attacker VAR_V_44)))) (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) :rule equiv_pos2)
% 0.50/0.67  (step t63 (cl (= (forall ((VAR_V_44 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44)) (tptp.pred_attacker VAR_V_44))) (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44))))) :rule all_simplify)
% 0.50/0.67  (step t64 (cl (forall ((VAR_V_44 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 VAR_V_44))) (tptp.pred_attacker VAR_V_44)))) :rule resolution :premises (t62 t63 a57))
% 0.50/0.67  (step t65 (cl (or (not (tptp.pred_attacker (tptp.tuple_T_out_2 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule resolution :premises (t61 t64))
% 0.50/0.67  (step t66 (cl (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) :rule resolution :premises (t26 t54 t65))
% 0.50/0.67  (step t67 (cl (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t68)
% 0.50/0.67  (assume t68.a0 (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))))
% 0.50/0.67  (step t68.t1 (cl (or (not (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule forall_inst :args ((:= VAR_V_48 tptp.constr_CONST_1) (:= VAR_V_49 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))
% 0.50/0.67  (step t68.t2 (cl (not (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule or :premises (t68.t1))
% 0.50/0.67  (step t68.t3 (cl (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t68.t2 t68.a0))
% 0.50/0.67  (step t68 (cl (not (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule subproof :discharge (t68.a0))
% 0.50/0.67  (step t69 (cl (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t67 t68))
% 0.50/0.67  (step t70 (cl (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (not (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule implies_neg2)
% 0.50/0.67  (step t71 (cl (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule resolution :premises (t69 t70))
% 0.50/0.67  (step t72 (cl (=> (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))))) :rule contraction :premises (t71))
% 0.50/0.67  (step t73 (cl (not (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule implies :premises (t72))
% 0.50/0.67  (step t74 (cl (not (= (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_48) (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))))) (not (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_48) (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) :rule equiv_pos2)
% 0.50/0.67  (step t75 (cl (= (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (=> (and (tptp.pred_attacker VAR_V_48) (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))) (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49)))))) :rule all_simplify)
% 0.50/0.67  (step t76 (cl (forall ((VAR_V_48 $$unsorted) (VAR_V_49 $$unsorted)) (or (not (tptp.pred_attacker VAR_V_48)) (not (tptp.pred_attacker VAR_V_49)) (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_V_48 VAR_V_49))))) :rule resolution :premises (t74 t75 a58))
% 0.50/0.67  (step t77 (cl (or (not (tptp.pred_attacker tptp.constr_CONST_1)) (not (tptp.pred_attacker (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))) (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))) :rule resolution :premises (t73 t76))
% 0.50/0.67  (step t78 (cl (tptp.pred_attacker (tptp.tuple_T_in_3 tptp.constr_CONST_1 (tptp.constr_h (tptp.constr_xor tptp.constr_CONST_1 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki)))))) :rule resolution :premises (t24 a66 t66 t77))
% 0.50/0.67  (step t79 (cl (not (forall ((VAR_A_143 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_3 VAR_A_143 (tptp.constr_h (tptp.constr_xor VAR_A_143 (tptp.constr_xor tptp.name_k0x30 tptp.name_ki))))))))) :rule resolution :premises (t22 t78))
% 0.50/0.67  (step t80 (cl (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) :rule implies_neg1)
% 0.50/0.67  (anchor :step t81)
% 0.50/0.67  (assume t81.a0 (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))))
% 0.50/0.67  (step t81.t1 (cl (or (not (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule forall_inst :args ((:= VAR_R_144 tptp.constr_CONST_1)))
% 0.50/0.67  (step t81.t2 (cl (not (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule or :premises (t81.t1))
% 0.50/0.67  (step t81.t3 (cl (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule resolution :premises (t81.t2 t81.a0))
% 0.50/0.67  (step t81 (cl (not (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule subproof :discharge (t81.a0))
% 0.50/0.67  (step t82 (cl (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule resolution :premises (t80 t81))
% 0.50/0.67  (step t83 (cl (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (not (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule implies_neg2)
% 0.50/0.67  (step t84 (cl (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule resolution :premises (t82 t83))
% 0.50/0.67  (step t85 (cl (=> (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1))))) :rule contraction :premises (t84))
% 0.50/0.67  (step t86 (cl (not (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144))))) (not (tptp.pred_attacker (tptp.tuple_T_in_1 tptp.constr_CONST_1)))) :rule implies :premises (t85))
% 0.50/0.67  (step t87 (cl (not (forall ((VAR_R_144 $$unsorted)) (not (tptp.pred_attacker (tptp.tuple_T_in_1 VAR_R_144)))))) :rule resolution :premises (t86 t42))
% 0.50/0.67  (step t88 (cl (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) :rule resolution :premises (t15 t79 t87))
% 0.50/0.67  (step t89 (cl (not (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 tptp.name_objective))) (tptp.pred_attacker tptp.name_objective)))) :rule resolution :premises (t9 a75 t88))
% 0.50/0.67  (step t90 (cl (not (= (forall ((VAR_V_38 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38)) (tptp.pred_attacker VAR_V_38))) (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))))) (not (forall ((VAR_V_38 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38)) (tptp.pred_attacker VAR_V_38)))) (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) :rule equiv_pos2)
% 0.50/0.67  (step t91 (cl (= (forall ((VAR_V_38 $$unsorted)) (=> (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38)) (tptp.pred_attacker VAR_V_38))) (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38))))) :rule all_simplify)
% 0.50/0.67  (step t92 (cl (forall ((VAR_V_38 $$unsorted)) (or (not (tptp.pred_attacker (tptp.tuple_T_out_4 VAR_V_38))) (tptp.pred_attacker VAR_V_38)))) :rule resolution :premises (t90 t91 a55))
% 0.50/0.67  (step t93 (cl) :rule resolution :premises (t7 t89 t92))
% 0.50/0.67  
% 0.50/0.67  % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.lkMAvpJz3r/cvc5---1.0.5_32045.smt2
% 0.50/0.67  % cvc5---1.0.5 exiting
% 0.50/0.68  % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------