0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.10 % Command : twee %s --tstp --casc --quiet --explain-encoding --conditional-encoding if --smaller --drop-non-horn 0.10/0.31 % Computer : n032.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 960 0.10/0.31 % WCLimit : 120 0.10/0.31 % DateTime : Thu Jul 2 07:42:34 EDT 2020 0.10/0.31 % CPUTime : 0.15/0.48 % SZS status Theorem 0.15/0.48 0.15/0.48 % SZS output start Proof 0.15/0.48 Take the following subset of the input axioms: 0.15/0.49 fof(ax0, axiom, constr_CONST_0x30!=constr_CONST_1). 0.15/0.49 fof(ax1, axiom, constr_CONST_2!=constr_CONST_0x30). 0.15/0.49 fof(ax10, axiom, name_skB!=constr_CONST_0x30). 0.15/0.49 fof(ax11, axiom, constr_CONST_0x30!=name_skS). 0.15/0.49 fof(ax12, axiom, constr_CONST_2!=constr_CONST_1). 0.15/0.49 fof(ax13, axiom, constr_CONST_1!=constr_CONST_3). 0.15/0.49 fof(ax14, axiom, constr_CONST_1!=constr_CONST_4). 0.15/0.49 fof(ax15, axiom, name_A!=constr_CONST_1). 0.15/0.49 fof(ax16, axiom, name_B!=constr_CONST_1). 0.15/0.49 fof(ax17, axiom, constr_CONST_1!=name_I). 0.15/0.49 fof(ax18, axiom, constr_CONST_1!=name_c). 0.15/0.49 fof(ax19, axiom, constr_CONST_1!=name_objective). 0.15/0.49 fof(ax2, axiom, constr_CONST_3!=constr_CONST_0x30). 0.15/0.49 fof(ax20, axiom, name_skA!=constr_CONST_1). 0.15/0.49 fof(ax21, axiom, name_skB!=constr_CONST_1). 0.15/0.49 fof(ax22, axiom, name_skS!=constr_CONST_1). 0.15/0.49 fof(ax23, axiom, constr_CONST_3!=constr_CONST_2). 0.15/0.49 fof(ax24, axiom, constr_CONST_2!=constr_CONST_4). 0.15/0.49 fof(ax25, axiom, constr_CONST_2!=name_A). 0.15/0.49 fof(ax26, axiom, name_B!=constr_CONST_2). 0.15/0.49 fof(ax27, axiom, name_I!=constr_CONST_2). 0.15/0.49 fof(ax28, axiom, name_c!=constr_CONST_2). 0.15/0.49 fof(ax29, axiom, constr_CONST_2!=name_objective). 0.15/0.49 fof(ax3, axiom, constr_CONST_4!=constr_CONST_0x30). 0.15/0.49 fof(ax30, axiom, name_skA!=constr_CONST_2). 0.15/0.49 fof(ax31, axiom, constr_CONST_2!=name_skB). 0.15/0.49 fof(ax32, axiom, constr_CONST_2!=name_skS). 0.15/0.49 fof(ax33, axiom, constr_CONST_4!=constr_CONST_3). 0.15/0.49 fof(ax34, axiom, constr_CONST_3!=name_A). 0.15/0.49 fof(ax35, axiom, constr_CONST_3!=name_B). 0.15/0.49 fof(ax36, axiom, constr_CONST_3!=name_I). 0.15/0.49 fof(ax37, axiom, constr_CONST_3!=name_c). 0.15/0.49 fof(ax38, axiom, constr_CONST_3!=name_objective). 0.15/0.49 fof(ax39, axiom, name_skA!=constr_CONST_3). 0.15/0.49 fof(ax4, axiom, constr_CONST_0x30!=name_A). 0.15/0.49 fof(ax40, axiom, constr_CONST_3!=name_skB). 0.15/0.49 fof(ax41, axiom, constr_CONST_3!=name_skS). 0.15/0.49 fof(ax42, axiom, name_A!=constr_CONST_4). 0.15/0.49 fof(ax43, axiom, constr_CONST_4!=name_B). 0.15/0.49 fof(ax44, axiom, constr_CONST_4!=name_I). 0.15/0.49 fof(ax45, axiom, name_c!=constr_CONST_4). 0.15/0.49 fof(ax46, axiom, name_objective!=constr_CONST_4). 0.15/0.49 fof(ax47, axiom, name_skA!=constr_CONST_4). 0.15/0.49 fof(ax48, axiom, constr_CONST_4!=name_skB). 0.15/0.49 fof(ax49, axiom, constr_CONST_4!=name_skS). 0.15/0.49 fof(ax5, axiom, constr_CONST_0x30!=name_B). 0.15/0.49 fof(ax50, axiom, name_B!=name_A). 0.15/0.49 fof(ax51, axiom, name_I!=name_A). 0.15/0.49 fof(ax52, axiom, name_c!=name_A). 0.15/0.49 fof(ax53, axiom, name_objective!=name_A). 0.15/0.49 fof(ax54, axiom, name_A!=name_skA). 0.15/0.49 fof(ax55, axiom, name_A!=name_skB). 0.15/0.49 fof(ax56, axiom, name_A!=name_skS). 0.15/0.49 fof(ax57, axiom, name_I!=name_B). 0.15/0.49 fof(ax58, axiom, name_B!=name_c). 0.15/0.49 fof(ax59, axiom, name_B!=name_objective). 0.15/0.49 fof(ax6, axiom, constr_CONST_0x30!=name_I). 0.15/0.49 fof(ax60, axiom, name_B!=name_skA). 0.15/0.49 fof(ax61, axiom, name_B!=name_skB). 0.15/0.49 fof(ax62, axiom, name_B!=name_skS). 0.15/0.49 fof(ax63, axiom, name_c!=name_I). 0.15/0.49 fof(ax64, axiom, name_objective!=name_I). 0.15/0.49 fof(ax65, axiom, name_I!=name_skA). 0.15/0.49 fof(ax66, axiom, name_I!=name_skB). 0.15/0.49 fof(ax67, axiom, name_skS!=name_I). 0.15/0.49 fof(ax68, axiom, name_c!=name_objective). 0.15/0.49 fof(ax69, axiom, name_skA!=name_c). 0.15/0.49 fof(ax7, axiom, name_c!=constr_CONST_0x30). 0.15/0.49 fof(ax70, axiom, name_c!=name_skB). 0.15/0.49 fof(ax71, axiom, name_skS!=name_c). 0.15/0.49 fof(ax72, axiom, name_objective!=name_skA). 0.15/0.49 fof(ax73, axiom, name_skB!=name_objective). 0.15/0.49 fof(ax74, axiom, name_skS!=name_objective). 0.15/0.49 fof(ax75, axiom, name_skB!=name_skA). 0.15/0.49 fof(ax76, axiom, name_skA!=name_skS). 0.15/0.49 fof(ax77, axiom, name_skB!=name_skS). 0.15/0.49 fof(ax8, axiom, name_objective!=constr_CONST_0x30). 0.15/0.49 fof(ax82, axiom, ![VAR_X_17, VAR_Y_18, VAR_Z_0X30]: tuple_assoc_pair(tuple_assoc_pair(VAR_X_17, VAR_Y_18), VAR_Z_0X30)=tuple_assoc_pair(VAR_X_17, tuple_assoc_pair(VAR_Y_18, VAR_Z_0X30))). 0.15/0.49 fof(ax84, axiom, ![VAR_X0X30_13, VAR_X1_14]: VAR_X0X30_13=constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(VAR_X0X30_13, VAR_X1_14))). 0.15/0.49 fof(ax85, axiom, ![VAR_X0X30_11, VAR_X1_12]: VAR_X1_12=constr_assoc_pair_2_get_1(tuple_assoc_pair(VAR_X0X30_11, VAR_X1_12))). 0.15/0.49 fof(ax9, axiom, name_skA!=constr_CONST_0x30). 0.15/0.49 fof(co0, conjecture, ![VAR_V_711]: pred_attacker(tuple_2(name_Nb(VAR_V_711), name_objective))). 0.15/0.49 0.15/0.49 Now clausify the problem and encode Horn clauses using encoding 3 of 0.15/0.49 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf. 0.15/0.49 We repeatedly replace C & s=t => u=v by the two clauses: 0.15/0.49 fresh(y, y, x1...xn) = u 0.15/0.49 C => fresh(s, t, x1...xn) = v 0.15/0.49 where fresh is a fresh function symbol and x1..xn are the free 0.15/0.49 variables of u and v. 0.15/0.49 A predicate p(X) is encoded as p(X)=true (this is sound, because the 0.15/0.49 input problem has no model of domain size 1). 0.15/0.49 0.15/0.49 The encoding turns the above axioms into the following unit equations and goals: 0.15/0.49 0.15/0.49 Axiom 1 (ax85): X = constr_assoc_pair_2_get_1(tuple_assoc_pair(Y, X)). 0.15/0.49 Axiom 2 (ax82): tuple_assoc_pair(tuple_assoc_pair(X, Y), Z) = tuple_assoc_pair(X, tuple_assoc_pair(Y, Z)). 0.15/0.49 Axiom 3 (ax84): X = constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(X, Y)). 0.15/0.49 0.15/0.49 Lemma 4: tuple_assoc_pair(X, Z) = Z. 0.15/0.49 Proof: 0.15/0.49 tuple_assoc_pair(X, Z) 0.15/0.49 = { by axiom 1 (ax85) } 0.15/0.49 constr_assoc_pair_2_get_1(tuple_assoc_pair(?, tuple_assoc_pair(X, Z))) 0.15/0.49 = { by axiom 2 (ax82) } 0.15/0.49 constr_assoc_pair_2_get_1(tuple_assoc_pair(tuple_assoc_pair(?, X), Z)) 0.15/0.49 = { by axiom 1 (ax85) } 0.15/0.49 Z 0.15/0.49 0.15/0.49 Lemma 5: Y = ?. 0.15/0.49 Proof: 0.15/0.49 Y 0.15/0.49 = { by axiom 3 (ax84) } 0.15/0.49 constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(Y, X)) 0.15/0.49 = { by lemma 4 } 0.15/0.49 constr_assoc_pair_2_get_0x30_bitstring(X) 0.15/0.49 = { by lemma 4 } 0.15/0.49 constr_assoc_pair_2_get_0x30_bitstring(tuple_assoc_pair(?, X)) 0.15/0.49 = { by axiom 3 (ax84) } 0.15/0.49 ? 0.15/0.49 0.15/0.49 Goal 1 (co0): pred_attacker(tuple_2(name_Nb(sK1_co0_VAR_V_711), name_objective)) = true. 0.15/0.49 Proof: 0.15/0.49 pred_attacker(tuple_2(name_Nb(sK1_co0_VAR_V_711), name_objective)) 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 true 0.15/0.49 0.15/0.49 Goal 2 (ax19): constr_CONST_1 = name_objective. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_1 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_objective 0.15/0.49 0.15/0.49 Goal 3 (ax20): name_skA = constr_CONST_1. 0.15/0.49 Proof: 0.15/0.49 name_skA 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_1 0.15/0.49 0.15/0.49 Goal 4 (ax2): constr_CONST_3 = constr_CONST_0x30. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_3 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_0x30 0.15/0.49 0.15/0.49 Goal 5 (ax57): name_I = name_B. 0.15/0.49 Proof: 0.15/0.49 name_I 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_B 0.15/0.49 0.15/0.49 Goal 6 (ax6): constr_CONST_0x30 = name_I. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_0x30 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_I 0.15/0.49 0.15/0.49 Goal 7 (ax53): name_objective = name_A. 0.15/0.49 Proof: 0.15/0.49 name_objective 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_A 0.15/0.49 0.15/0.49 Goal 8 (ax60): name_B = name_skA. 0.15/0.49 Proof: 0.15/0.49 name_B 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_skA 0.15/0.49 0.15/0.49 Goal 9 (ax24): constr_CONST_2 = constr_CONST_4. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_2 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_4 0.15/0.49 0.15/0.49 Goal 10 (ax8): name_objective = constr_CONST_0x30. 0.15/0.49 Proof: 0.15/0.49 name_objective 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_0x30 0.15/0.49 0.15/0.49 Goal 11 (ax26): name_B = constr_CONST_2. 0.15/0.49 Proof: 0.15/0.49 name_B 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_2 0.15/0.49 0.15/0.49 Goal 12 (ax67): name_skS = name_I. 0.15/0.49 Proof: 0.15/0.49 name_skS 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_I 0.15/0.49 0.15/0.49 Goal 13 (ax3): constr_CONST_4 = constr_CONST_0x30. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_4 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_0x30 0.15/0.49 0.15/0.49 Goal 14 (ax31): constr_CONST_2 = name_skB. 0.15/0.49 Proof: 0.15/0.49 constr_CONST_2 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_skB 0.15/0.49 0.15/0.49 Goal 15 (ax46): name_objective = constr_CONST_4. 0.15/0.49 Proof: 0.15/0.49 name_objective 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 constr_CONST_4 0.15/0.49 0.15/0.49 Goal 16 (ax55): name_A = name_skB. 0.15/0.49 Proof: 0.15/0.49 name_A 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_skB 0.15/0.49 0.15/0.49 Goal 17 (ax58): name_B = name_c. 0.15/0.49 Proof: 0.15/0.49 name_B 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_c 0.15/0.49 0.15/0.49 Goal 18 (ax76): name_skA = name_skS. 0.15/0.49 Proof: 0.15/0.49 name_skA 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_skS 0.15/0.49 0.15/0.49 Goal 19 (ax66): name_I = name_skB. 0.15/0.49 Proof: 0.15/0.49 name_I 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_skB 0.15/0.49 0.15/0.49 Goal 20 (ax63): name_c = name_I. 0.15/0.49 Proof: 0.15/0.49 name_c 0.15/0.49 = { by lemma 5 } 0.15/0.49 ? 0.15/0.49 = { by lemma 5 } 0.15/0.49 name_I 0.15/0.49 0.15/0.49 Goal 21 (ax32): constr_CONST_2 = name_skS. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_2 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 22 (ax21): name_skB = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 name_skB 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 23 (ax4): constr_CONST_0x30 = name_A. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_0x30 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 24 (ax12): constr_CONST_2 = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_2 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 25 (ax30): name_skA = constr_CONST_2. 0.15/0.50 Proof: 0.15/0.50 name_skA 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_2 0.15/0.50 0.15/0.50 Goal 26 (ax17): constr_CONST_1 = name_I. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_1 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_I 0.15/0.50 0.15/0.50 Goal 27 (ax18): constr_CONST_1 = name_c. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_1 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_c 0.15/0.50 0.15/0.50 Goal 28 (ax11): constr_CONST_0x30 = name_skS. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_0x30 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 29 (ax77): name_skB = name_skS. 0.15/0.50 Proof: 0.15/0.50 name_skB 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 30 (ax22): name_skS = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 name_skS 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 31 (ax68): name_c = name_objective. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 32 (ax54): name_A = name_skA. 0.15/0.50 Proof: 0.15/0.50 name_A 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skA 0.15/0.50 0.15/0.50 Goal 33 (ax1): constr_CONST_2 = constr_CONST_0x30. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_2 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_0x30 0.15/0.50 0.15/0.50 Goal 34 (ax41): constr_CONST_3 = name_skS. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 35 (ax16): name_B = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 name_B 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 36 (ax15): name_A = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 name_A 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 37 (ax49): constr_CONST_4 = name_skS. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_4 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 38 (ax36): constr_CONST_3 = name_I. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_I 0.15/0.50 0.15/0.50 Goal 39 (ax45): name_c = constr_CONST_4. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_4 0.15/0.50 0.15/0.50 Goal 40 (ax56): name_A = name_skS. 0.15/0.50 Proof: 0.15/0.50 name_A 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 41 (ax75): name_skB = name_skA. 0.15/0.50 Proof: 0.15/0.50 name_skB 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skA 0.15/0.50 0.15/0.50 Goal 42 (ax42): name_A = constr_CONST_4. 0.15/0.50 Proof: 0.15/0.50 name_A 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_4 0.15/0.50 0.15/0.50 Goal 43 (ax13): constr_CONST_1 = constr_CONST_3. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_1 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_3 0.15/0.50 0.15/0.50 Goal 44 (ax69): name_skA = name_c. 0.15/0.50 Proof: 0.15/0.50 name_skA 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_c 0.15/0.50 0.15/0.50 Goal 45 (ax33): constr_CONST_4 = constr_CONST_3. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_4 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_3 0.15/0.50 0.15/0.50 Goal 46 (ax5): constr_CONST_0x30 = name_B. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_0x30 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_B 0.15/0.50 0.15/0.50 Goal 47 (ax72): name_objective = name_skA. 0.15/0.50 Proof: 0.15/0.50 name_objective 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skA 0.15/0.50 0.15/0.50 Goal 48 (ax73): name_skB = name_objective. 0.15/0.50 Proof: 0.15/0.50 name_skB 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 49 (ax61): name_B = name_skB. 0.15/0.50 Proof: 0.15/0.50 name_B 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skB 0.15/0.50 0.15/0.50 Goal 50 (ax35): constr_CONST_3 = name_B. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_B 0.15/0.50 0.15/0.50 Goal 51 (ax14): constr_CONST_1 = constr_CONST_4. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_1 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_4 0.15/0.50 0.15/0.50 Goal 52 (ax29): constr_CONST_2 = name_objective. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_2 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 53 (ax62): name_B = name_skS. 0.15/0.50 Proof: 0.15/0.50 name_B 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skS 0.15/0.50 0.15/0.50 Goal 54 (ax28): name_c = constr_CONST_2. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_2 0.15/0.50 0.15/0.50 Goal 55 (ax25): constr_CONST_2 = name_A. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_2 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 56 (ax44): constr_CONST_4 = name_I. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_4 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_I 0.15/0.50 0.15/0.50 Goal 57 (ax27): name_I = constr_CONST_2. 0.15/0.50 Proof: 0.15/0.50 name_I 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_2 0.15/0.50 0.15/0.50 Goal 58 (ax47): name_skA = constr_CONST_4. 0.15/0.50 Proof: 0.15/0.50 name_skA 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_4 0.15/0.50 0.15/0.50 Goal 59 (ax39): name_skA = constr_CONST_3. 0.15/0.50 Proof: 0.15/0.50 name_skA 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_3 0.15/0.50 0.15/0.50 Goal 60 (ax37): constr_CONST_3 = name_c. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_c 0.15/0.50 0.15/0.50 Goal 61 (ax52): name_c = name_A. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 62 (ax74): name_skS = name_objective. 0.15/0.50 Proof: 0.15/0.50 name_skS 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 63 (ax23): constr_CONST_3 = constr_CONST_2. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_2 0.15/0.50 0.15/0.50 Goal 64 (ax51): name_I = name_A. 0.15/0.50 Proof: 0.15/0.50 name_I 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 65 (ax65): name_I = name_skA. 0.15/0.50 Proof: 0.15/0.50 name_I 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skA 0.15/0.50 0.15/0.50 Goal 66 (ax7): name_c = constr_CONST_0x30. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_0x30 0.15/0.50 0.15/0.50 Goal 67 (ax43): constr_CONST_4 = name_B. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_4 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_B 0.15/0.50 0.15/0.50 Goal 68 (ax64): name_objective = name_I. 0.15/0.50 Proof: 0.15/0.50 name_objective 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_I 0.15/0.50 0.15/0.50 Goal 69 (ax50): name_B = name_A. 0.15/0.50 Proof: 0.15/0.50 name_B 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 70 (ax71): name_skS = name_c. 0.15/0.50 Proof: 0.15/0.50 name_skS 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_c 0.15/0.50 0.15/0.50 Goal 71 (ax9): name_skA = constr_CONST_0x30. 0.15/0.50 Proof: 0.15/0.50 name_skA 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_0x30 0.15/0.50 0.15/0.50 Goal 72 (ax38): constr_CONST_3 = name_objective. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 73 (ax34): constr_CONST_3 = name_A. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_A 0.15/0.50 0.15/0.50 Goal 74 (ax0): constr_CONST_0x30 = constr_CONST_1. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_0x30 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_1 0.15/0.50 0.15/0.50 Goal 75 (ax59): name_B = name_objective. 0.15/0.50 Proof: 0.15/0.50 name_B 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_objective 0.15/0.50 0.15/0.50 Goal 76 (ax40): constr_CONST_3 = name_skB. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_3 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skB 0.15/0.50 0.15/0.50 Goal 77 (ax10): name_skB = constr_CONST_0x30. 0.15/0.50 Proof: 0.15/0.50 name_skB 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 constr_CONST_0x30 0.15/0.50 0.15/0.50 Goal 78 (ax70): name_c = name_skB. 0.15/0.50 Proof: 0.15/0.50 name_c 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skB 0.15/0.50 0.15/0.50 Goal 79 (ax48): constr_CONST_4 = name_skB. 0.15/0.50 Proof: 0.15/0.50 constr_CONST_4 0.15/0.50 = { by lemma 5 } 0.15/0.50 ? 0.15/0.50 = { by lemma 5 } 0.15/0.50 name_skB 0.15/0.50 % SZS output end Proof 0.15/0.50 0.15/0.50 RESULT: Theorem (the conjecture is true). 0.15/0.51 EOF