%------------------------------------------------------------------------------ % File : lazyCoP---0.1 % Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0. % Transfm : none % Format : tptp:raw % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 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 : 600s % DateTime : Thu Jul 21 00:46:43 EDT 2022 % Result : Theorem 181.69s 25.45s % Output : Assurance 0s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWW950+1 : TPTP v8.1.0. Released v7.4.0. % 0.07/0.12 % Command : vampire -t 0 --mode clausify %d -updr off -nm 2 -erd input_only -icip on | lazycop % 0.13/0.33 % Computer : n028.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 : 600 % 0.13/0.33 % DateTime : Sat Jun 4 14:25:56 EDT 2022 % 0.13/0.33 % CPUTime : % 181.69/25.45 % SZS status Theorem % 181.69/25.45 % SZS output begin IncompleteProof % 181.69/25.45 cnf(c0, axiom, % 181.69/25.45 ~pred_attacker(name_objective)). % 181.69/25.45 cnf(c1, plain, % 181.69/25.45 ~pred_attacker(name_objective), % 181.69/25.45 inference(start, [], [c0])). % 181.69/25.45 % 181.69/25.45 cnf(c2, axiom, % 181.69/25.45 pred_attacker(X0) | ~pred_attacker(tuple_T_out_4(X0))). % 181.69/25.45 cnf(a0, assumption, % 181.69/25.45 name_objective = X0). % 181.69/25.45 cnf(c3, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 181.69/25.45 cnf(c4, plain, % 181.69/25.45 ~pred_attacker(tuple_T_out_4(X0)), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])). % 181.69/25.45 % 181.69/25.45 cnf(c5, axiom, % 181.69/25.45 pred_attacker(tuple_T_out_4(name_objective)) | ~pred_attacker(tuple_T_in_1(X1)) | ~pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki)))))). % 181.69/25.45 cnf(a1, assumption, % 181.69/25.45 tuple_T_out_4(X0) = tuple_T_out_4(name_objective)). % 181.69/25.45 cnf(c6, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 181.69/25.45 cnf(c7, plain, % 181.69/25.45 ~pred_attacker(tuple_T_in_1(X1)) | ~pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki))))), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])). % 181.69/25.45 % 181.69/25.45 cnf(c8, axiom, % 181.69/25.45 pred_attacker(tuple_T_in_1(X3)) | ~pred_attacker(X3)). % 181.69/25.45 cnf(a2, assumption, % 181.69/25.45 tuple_T_in_1(X1) = tuple_T_in_1(X3)). % 181.69/25.45 cnf(c9, plain, % 181.69/25.45 ~pred_attacker(tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki))))), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 181.69/25.45 cnf(c10, plain, % 181.69/25.45 ~pred_attacker(X3), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])). % 181.69/25.45 % 181.69/25.45 cnf(c11, axiom, % 181.69/25.45 pred_attacker(constr_CONST_0x30)). % 181.69/25.45 cnf(a3, assumption, % 181.69/25.45 X3 = constr_CONST_0x30). % 181.69/25.45 cnf(c12, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 181.69/25.45 cnf(c13, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])). % 181.69/25.45 % 181.69/25.45 cnf(c14, axiom, % 181.69/25.45 pred_attacker(tuple_T_in_3(X4,X5)) | ~pred_attacker(X5) | ~pred_attacker(X4)). % 181.69/25.45 cnf(a4, assumption, % 181.69/25.45 tuple_T_in_3(X2,constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki)))) = tuple_T_in_3(X4,X5)). % 181.69/25.45 cnf(c15, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 181.69/25.45 cnf(c16, plain, % 181.69/25.45 ~pred_attacker(X5) | ~pred_attacker(X4), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a4])], [c9, c14])). % 181.69/25.45 % 181.69/25.45 cnf(c17, axiom, % 181.69/25.45 pred_attacker(X6) | ~pred_attacker(tuple_T_out_2(X6))). % 181.69/25.45 cnf(a5, assumption, % 181.69/25.45 X5 = X6). % 181.69/25.45 cnf(c18, plain, % 181.69/25.45 ~pred_attacker(X4), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 181.69/25.45 cnf(c19, plain, % 181.69/25.45 ~pred_attacker(tuple_T_out_2(X6)), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a5])], [c16, c17])). % 181.69/25.45 % 181.69/25.45 cnf(c20, axiom, % 181.69/25.45 pred_attacker(tuple_T_out_2(constr_h(constr_xor(X7,constr_xor(name_k0x30,name_ki))))) | ~pred_attacker(tuple_T_in_1(X7))). % 181.69/25.45 cnf(a6, assumption, % 181.69/25.45 tuple_T_out_2(X6) = tuple_T_out_2(constr_h(constr_xor(X7,constr_xor(name_k0x30,name_ki))))). % 181.69/25.45 cnf(c21, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 181.69/25.45 cnf(c22, plain, % 181.69/25.45 ~pred_attacker(tuple_T_in_1(X7)), % 181.69/25.45 inference(strict_predicate_extension, [assumptions([a6])], [c19, c20])). % 181.69/25.45 % 181.69/25.45 cnf(c23, plain, % 181.69/25.45 pred_attacker(tuple_T_in_1(X1))). % 181.69/25.45 cnf(a7, assumption, % 181.69/25.45 tuple_T_in_1(X7) = tuple_T_in_1(X1)). % 181.69/25.45 cnf(c24, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(predicate_reduction, [assumptions([a7])], [c22, c23])). % 181.69/25.45 % 181.69/25.45 cnf(c25, plain, % 181.69/25.45 pred_attacker(X3)). % 181.69/25.45 cnf(a8, assumption, % 181.69/25.45 X4 = X3). % 181.69/25.45 cnf(c26, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(predicate_reduction, [assumptions([a8])], [c18, c25])). % 181.69/25.45 % 181.69/25.45 cnf(c27, plain, % 181.69/25.45 $false, % 181.69/25.45 inference(constraint_solving, [ % 181.69/25.45 bind(X0, name_objective), % 181.69/25.45 bind(X1, constr_CONST_0x30), % 181.69/25.45 bind(X2, constr_CONST_0x30), % 181.69/25.45 bind(X3, constr_CONST_0x30), % 181.69/25.45 bind(X4, constr_CONST_0x30), % 181.69/25.45 bind(X5, constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki)))), % 181.69/25.45 bind(X6, constr_h(constr_xor(X2,constr_xor(name_k0x30,name_ki)))), % 181.69/25.45 bind(X7, constr_CONST_0x30) % 181.69/25.45 ], % 181.69/25.45 [a0, a1, a2, a3, a4, a5, a6, a7, a8])). % 181.69/25.45 % 181.69/25.45 % SZS output end IncompleteProof %------------------------------------------------------------------------------