TSTP Solution File: SWW970+1 by lazyCoP---0.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : lazyCoP---0.1
% Problem : SWW970+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 : n019.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:45 EDT 2022
% Result : Theorem 14.69s 2.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : SWW970+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.11/0.33 % Computer : n019.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Sun Jun 5 11:01:40 EDT 2022
% 0.11/0.33 % CPUTime :
% 14.69/2.44 % SZS status Theorem
% 14.69/2.44 % SZS output begin IncompleteProof
% 14.69/2.44 cnf(c0, axiom,
% 14.69/2.44 ~pred_attacker(name_objective)).
% 14.69/2.44 cnf(c1, plain,
% 14.69/2.44 ~pred_attacker(name_objective),
% 14.69/2.44 inference(start, [], [c0])).
% 14.69/2.44
% 14.69/2.44 cnf(c2, axiom,
% 14.69/2.44 pred_attacker(X0) | ~pred_attacker(tuple_client_B_out_2(X0))).
% 14.69/2.44 cnf(a0, assumption,
% 14.69/2.44 name_objective = X0).
% 14.69/2.44 cnf(c3, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 14.69/2.44 cnf(c4, plain,
% 14.69/2.44 ~pred_attacker(tuple_client_B_out_2(X0)),
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a0])], [c1, c2])).
% 14.69/2.44
% 14.69/2.44 cnf(c5, axiom,
% 14.69/2.44 pred_attacker(tuple_client_B_out_2(name_objective)) | ~pred_attacker(tuple_client_B_in_1(X1)) | ~pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs)))).
% 14.69/2.44 cnf(a1, assumption,
% 14.69/2.44 tuple_client_B_out_2(X0) = tuple_client_B_out_2(name_objective)).
% 14.69/2.44 cnf(c6, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 14.69/2.44 cnf(c7, plain,
% 14.69/2.44 ~pred_attacker(tuple_client_B_in_1(X1)) | ~pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs))),
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a1])], [c4, c5])).
% 14.69/2.44
% 14.69/2.44 cnf(c8, axiom,
% 14.69/2.44 pred_attacker(tuple_client_B_in_1(X2)) | ~pred_attacker(X2)).
% 14.69/2.44 cnf(a2, assumption,
% 14.69/2.44 tuple_client_B_in_1(X1) = tuple_client_B_in_1(X2)).
% 14.69/2.44 cnf(c9, plain,
% 14.69/2.44 ~pred_eq_bitstring_bitstring(name_A,constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs))),
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 14.69/2.44 cnf(c10, plain,
% 14.69/2.44 ~pred_attacker(X2),
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a2])], [c7, c8])).
% 14.69/2.44
% 14.69/2.44 cnf(c11, axiom,
% 14.69/2.44 pred_attacker(tuple_true)).
% 14.69/2.44 cnf(a3, assumption,
% 14.69/2.44 X2 = tuple_true).
% 14.69/2.44 cnf(c12, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 14.69/2.44 cnf(c13, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a3])], [c10, c11])).
% 14.69/2.44
% 14.69/2.44 cnf(c14, axiom,
% 14.69/2.44 pred_eq_bitstring_bitstring(X3,X4)).
% 14.69/2.44 cnf(a4, assumption,
% 14.69/2.44 name_A = X3).
% 14.69/2.44 cnf(a5, assumption,
% 14.69/2.44 constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs)) = X4).
% 14.69/2.44 cnf(c15, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c14])).
% 14.69/2.44 cnf(c16, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(strict_predicate_extension, [assumptions([a4, a5])], [c9, c14])).
% 14.69/2.44
% 14.69/2.44 cnf(c17, plain,
% 14.69/2.44 $false,
% 14.69/2.44 inference(constraint_solving, [
% 14.69/2.44 bind(X0, name_objective),
% 14.69/2.44 bind(X1, tuple_true),
% 14.69/2.44 bind(X2, tuple_true),
% 14.69/2.44 bind(X3, name_A),
% 14.69/2.44 bind(X4, constr_tuple_3_get_0x30(constr_cbc_dec_3(X1,name_Kbs)))
% 14.69/2.44 ],
% 14.69/2.44 [a0, a1, a2, a3, a4, a5])).
% 14.69/2.44
% 14.69/2.44 % SZS output end IncompleteProof
%------------------------------------------------------------------------------