TSTP Solution File: KLE014+2 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : KLE014+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n024.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 : Thu Aug 31 05:35:28 EDT 2023
% Result : Theorem 17.18s 2.59s
% Output : Proof 17.18s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KLE014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Tue Aug 29 11:38:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 17.18/2.59 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 17.18/2.59
% 17.18/2.59 % SZS status Theorem
% 17.18/2.59
% 17.18/2.62 % SZS output start Proof
% 17.18/2.62 Take the following subset of the input axioms:
% 17.18/2.63 fof(additive_associativity, axiom, ![A, B, C]: addition(A, addition(B, C))=addition(addition(A, B), C)).
% 17.18/2.63 fof(additive_commutativity, axiom, ![A2, B2]: addition(A2, B2)=addition(B2, A2)).
% 17.18/2.63 fof(additive_idempotence, axiom, ![A2]: addition(A2, A2)=A2).
% 17.18/2.63 fof(additive_identity, axiom, ![A2]: addition(A2, zero)=A2).
% 17.18/2.63 fof(goals, conjecture, ![X0, X1]: ((test(X1) & test(X0)) => c(addition(X0, X1))=multiplication(c(X0), c(X1)))).
% 17.18/2.63 fof(left_annihilation, axiom, ![A2]: multiplication(zero, A2)=zero).
% 17.18/2.63 fof(left_distributivity, axiom, ![A2, B2, C2]: multiplication(addition(A2, B2), C2)=addition(multiplication(A2, C2), multiplication(B2, C2))).
% 17.18/2.63 fof(multiplicative_associativity, axiom, ![A2, B2, C2]: multiplication(A2, multiplication(B2, C2))=multiplication(multiplication(A2, B2), C2)).
% 17.18/2.63 fof(multiplicative_left_identity, axiom, ![A2]: multiplication(one, A2)=A2).
% 17.18/2.63 fof(multiplicative_right_identity, axiom, ![A2]: multiplication(A2, one)=A2).
% 17.18/2.63 fof(right_annihilation, axiom, ![A2]: multiplication(A2, zero)=zero).
% 17.18/2.63 fof(right_distributivity, axiom, ![A2, B2, C2]: multiplication(A2, addition(B2, C2))=addition(multiplication(A2, B2), multiplication(A2, C2))).
% 17.18/2.63 fof(test_1, axiom, ![X0_2]: (test(X0_2) <=> ?[X1_2]: complement(X1_2, X0_2))).
% 17.18/2.63 fof(test_2, axiom, ![X0_2, X1_2]: (complement(X1_2, X0_2) <=> (multiplication(X0_2, X1_2)=zero & (multiplication(X1_2, X0_2)=zero & addition(X0_2, X1_2)=one)))).
% 17.18/2.63 fof(test_3, axiom, ![X0_2, X1_2]: (test(X0_2) => (c(X0_2)=X1_2 <=> complement(X0_2, X1_2)))).
% 17.18/2.63
% 17.18/2.63 Now clausify the problem and encode Horn clauses using encoding 3 of
% 17.18/2.63 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 17.18/2.63 We repeatedly replace C & s=t => u=v by the two clauses:
% 17.18/2.63 fresh(y, y, x1...xn) = u
% 17.18/2.63 C => fresh(s, t, x1...xn) = v
% 17.18/2.63 where fresh is a fresh function symbol and x1..xn are the free
% 17.18/2.63 variables of u and v.
% 17.18/2.63 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 17.18/2.63 input problem has no model of domain size 1).
% 17.18/2.63
% 17.18/2.63 The encoding turns the above axioms into the following unit equations and goals:
% 17.18/2.63
% 17.18/2.63 Axiom 1 (goals): test(x1) = true.
% 17.18/2.63 Axiom 2 (goals_1): test(x0) = true.
% 17.18/2.63 Axiom 3 (right_annihilation): multiplication(X, zero) = zero.
% 17.18/2.63 Axiom 4 (multiplicative_right_identity): multiplication(X, one) = X.
% 17.18/2.63 Axiom 5 (left_annihilation): multiplication(zero, X) = zero.
% 17.18/2.63 Axiom 6 (multiplicative_left_identity): multiplication(one, X) = X.
% 17.18/2.63 Axiom 7 (additive_idempotence): addition(X, X) = X.
% 17.18/2.63 Axiom 8 (additive_commutativity): addition(X, Y) = addition(Y, X).
% 17.18/2.63 Axiom 9 (additive_identity): addition(X, zero) = X.
% 17.18/2.63 Axiom 10 (test_1): fresh12(X, X, Y) = true.
% 17.18/2.63 Axiom 11 (test_1_1): fresh10(X, X, Y) = true.
% 17.18/2.63 Axiom 12 (multiplicative_associativity): multiplication(X, multiplication(Y, Z)) = multiplication(multiplication(X, Y), Z).
% 17.18/2.63 Axiom 13 (additive_associativity): addition(X, addition(Y, Z)) = addition(addition(X, Y), Z).
% 17.18/2.63 Axiom 14 (test_2): fresh14(X, X, Y, Z) = true.
% 17.18/2.63 Axiom 15 (test_1): fresh12(test(X), true, X) = complement(x1_2(X), X).
% 17.18/2.63 Axiom 16 (test_2): fresh9(X, X, Y, Z) = complement(Z, Y).
% 17.18/2.63 Axiom 17 (test_2_1): fresh8(X, X, Y, Z) = one.
% 17.18/2.63 Axiom 18 (test_2_2): fresh7(X, X, Y, Z) = zero.
% 17.18/2.63 Axiom 19 (test_2_3): fresh6(X, X, Y, Z) = zero.
% 17.18/2.63 Axiom 20 (test_3): fresh5(X, X, Y, Z) = complement(Y, Z).
% 17.18/2.63 Axiom 21 (test_3): fresh4(X, X, Y, Z) = true.
% 17.18/2.63 Axiom 22 (test_1_1): fresh10(complement(X, Y), true, Y) = test(Y).
% 17.18/2.63 Axiom 23 (test_3): fresh5(test(X), true, X, Y) = fresh4(c(X), Y, X, Y).
% 17.18/2.63 Axiom 24 (right_distributivity): multiplication(X, addition(Y, Z)) = addition(multiplication(X, Y), multiplication(X, Z)).
% 17.18/2.63 Axiom 25 (left_distributivity): multiplication(addition(X, Y), Z) = addition(multiplication(X, Z), multiplication(Y, Z)).
% 17.18/2.63 Axiom 26 (test_2): fresh13(X, X, Y, Z) = fresh14(addition(Y, Z), one, Y, Z).
% 17.18/2.63 Axiom 27 (test_2): fresh13(multiplication(X, Y), zero, Y, X) = fresh9(multiplication(Y, X), zero, Y, X).
% 17.18/2.63 Axiom 28 (test_2_1): fresh8(complement(X, Y), true, Y, X) = addition(Y, X).
% 17.18/2.63 Axiom 29 (test_2_2): fresh7(complement(X, Y), true, Y, X) = multiplication(Y, X).
% 17.18/2.63 Axiom 30 (test_2_3): fresh6(complement(X, Y), true, Y, X) = multiplication(X, Y).
% 17.18/2.63
% 17.18/2.63 Lemma 31: addition(zero, X) = X.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(zero, X)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(X, zero)
% 17.18/2.63 = { by axiom 9 (additive_identity) }
% 17.18/2.63 X
% 17.18/2.63
% 17.18/2.63 Lemma 32: complement(x1, c(x1)) = true.
% 17.18/2.63 Proof:
% 17.18/2.63 complement(x1, c(x1))
% 17.18/2.63 = { by axiom 20 (test_3) R->L }
% 17.18/2.63 fresh5(true, true, x1, c(x1))
% 17.18/2.63 = { by axiom 1 (goals) R->L }
% 17.18/2.63 fresh5(test(x1), true, x1, c(x1))
% 17.18/2.63 = { by axiom 23 (test_3) }
% 17.18/2.63 fresh4(c(x1), c(x1), x1, c(x1))
% 17.18/2.63 = { by axiom 21 (test_3) }
% 17.18/2.63 true
% 17.18/2.63
% 17.18/2.63 Lemma 33: complement(x0, c(x0)) = true.
% 17.18/2.63 Proof:
% 17.18/2.63 complement(x0, c(x0))
% 17.18/2.63 = { by axiom 20 (test_3) R->L }
% 17.18/2.63 fresh5(true, true, x0, c(x0))
% 17.18/2.63 = { by axiom 2 (goals_1) R->L }
% 17.18/2.63 fresh5(test(x0), true, x0, c(x0))
% 17.18/2.63 = { by axiom 23 (test_3) }
% 17.18/2.63 fresh4(c(x0), c(x0), x0, c(x0))
% 17.18/2.63 = { by axiom 21 (test_3) }
% 17.18/2.63 true
% 17.18/2.63
% 17.18/2.63 Lemma 34: addition(x0, c(x0)) = one.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(x0, c(x0))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(c(x0), x0)
% 17.18/2.63 = { by axiom 28 (test_2_1) R->L }
% 17.18/2.63 fresh8(complement(x0, c(x0)), true, c(x0), x0)
% 17.18/2.63 = { by lemma 33 }
% 17.18/2.63 fresh8(true, true, c(x0), x0)
% 17.18/2.63 = { by axiom 17 (test_2_1) }
% 17.18/2.63 one
% 17.18/2.63
% 17.18/2.63 Lemma 35: addition(X, addition(X, Y)) = addition(X, Y).
% 17.18/2.63 Proof:
% 17.18/2.63 addition(X, addition(X, Y))
% 17.18/2.63 = { by axiom 13 (additive_associativity) }
% 17.18/2.63 addition(addition(X, X), Y)
% 17.18/2.63 = { by axiom 7 (additive_idempotence) }
% 17.18/2.63 addition(X, Y)
% 17.18/2.63
% 17.18/2.63 Lemma 36: addition(X, addition(Y, X)) = addition(X, Y).
% 17.18/2.63 Proof:
% 17.18/2.63 addition(X, addition(Y, X))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(X, addition(X, Y))
% 17.18/2.63 = { by lemma 35 }
% 17.18/2.63 addition(X, Y)
% 17.18/2.63
% 17.18/2.63 Lemma 37: addition(one, c(x0)) = one.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(one, c(x0))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(c(x0), one)
% 17.18/2.63 = { by lemma 34 R->L }
% 17.18/2.63 addition(c(x0), addition(x0, c(x0)))
% 17.18/2.63 = { by lemma 36 }
% 17.18/2.63 addition(c(x0), x0)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 addition(x0, c(x0))
% 17.18/2.63 = { by lemma 34 }
% 17.18/2.63 one
% 17.18/2.63
% 17.18/2.63 Lemma 38: addition(x1, c(x1)) = one.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(x1, c(x1))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(c(x1), x1)
% 17.18/2.63 = { by axiom 28 (test_2_1) R->L }
% 17.18/2.63 fresh8(complement(x1, c(x1)), true, c(x1), x1)
% 17.18/2.63 = { by lemma 32 }
% 17.18/2.63 fresh8(true, true, c(x1), x1)
% 17.18/2.63 = { by axiom 17 (test_2_1) }
% 17.18/2.63 one
% 17.18/2.63
% 17.18/2.63 Lemma 39: addition(x1, x1_2(x1)) = one.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(x1, x1_2(x1))
% 17.18/2.63 = { by axiom 28 (test_2_1) R->L }
% 17.18/2.63 fresh8(complement(x1_2(x1), x1), true, x1, x1_2(x1))
% 17.18/2.63 = { by axiom 15 (test_1) R->L }
% 17.18/2.63 fresh8(fresh12(test(x1), true, x1), true, x1, x1_2(x1))
% 17.18/2.63 = { by axiom 1 (goals) }
% 17.18/2.63 fresh8(fresh12(true, true, x1), true, x1, x1_2(x1))
% 17.18/2.63 = { by axiom 10 (test_1) }
% 17.18/2.63 fresh8(true, true, x1, x1_2(x1))
% 17.18/2.63 = { by axiom 17 (test_2_1) }
% 17.18/2.63 one
% 17.18/2.63
% 17.18/2.63 Lemma 40: multiplication(x1, c(x1)) = zero.
% 17.18/2.63 Proof:
% 17.18/2.63 multiplication(x1, c(x1))
% 17.18/2.63 = { by axiom 30 (test_2_3) R->L }
% 17.18/2.63 fresh6(complement(x1, c(x1)), true, c(x1), x1)
% 17.18/2.63 = { by lemma 32 }
% 17.18/2.63 fresh6(true, true, c(x1), x1)
% 17.18/2.63 = { by axiom 19 (test_2_3) }
% 17.18/2.63 zero
% 17.18/2.63
% 17.18/2.63 Lemma 41: multiplication(c(x1), x1) = zero.
% 17.18/2.63 Proof:
% 17.18/2.63 multiplication(c(x1), x1)
% 17.18/2.63 = { by axiom 29 (test_2_2) R->L }
% 17.18/2.63 fresh7(complement(x1, c(x1)), true, c(x1), x1)
% 17.18/2.63 = { by lemma 32 }
% 17.18/2.63 fresh7(true, true, c(x1), x1)
% 17.18/2.63 = { by axiom 18 (test_2_2) }
% 17.18/2.63 zero
% 17.18/2.63
% 17.18/2.63 Lemma 42: multiplication(c(x0), x0) = zero.
% 17.18/2.63 Proof:
% 17.18/2.63 multiplication(c(x0), x0)
% 17.18/2.63 = { by axiom 29 (test_2_2) R->L }
% 17.18/2.63 fresh7(complement(x0, c(x0)), true, c(x0), x0)
% 17.18/2.63 = { by lemma 33 }
% 17.18/2.63 fresh7(true, true, c(x0), x0)
% 17.18/2.63 = { by axiom 18 (test_2_2) }
% 17.18/2.63 zero
% 17.18/2.63
% 17.18/2.63 Lemma 43: addition(Y, addition(Z, X)) = addition(X, addition(Y, Z)).
% 17.18/2.63 Proof:
% 17.18/2.63 addition(Y, addition(Z, X))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(addition(Z, X), Y)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 addition(addition(X, Z), Y)
% 17.18/2.63 = { by axiom 13 (additive_associativity) R->L }
% 17.18/2.63 addition(X, addition(Z, Y))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 addition(X, addition(Y, Z))
% 17.18/2.63
% 17.18/2.63 Lemma 44: addition(multiplication(X, Y), multiplication(X, Z)) = multiplication(X, addition(Z, Y)).
% 17.18/2.63 Proof:
% 17.18/2.63 addition(multiplication(X, Y), multiplication(X, Z))
% 17.18/2.63 = { by axiom 24 (right_distributivity) R->L }
% 17.18/2.63 multiplication(X, addition(Y, Z))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 multiplication(X, addition(Z, Y))
% 17.18/2.63
% 17.18/2.63 Lemma 45: multiplication(multiplication(c(x0), c(x1)), x0) = zero.
% 17.18/2.63 Proof:
% 17.18/2.63 multiplication(multiplication(c(x0), c(x1)), x0)
% 17.18/2.63 = { by lemma 31 R->L }
% 17.18/2.63 addition(zero, multiplication(multiplication(c(x0), c(x1)), x0))
% 17.18/2.63 = { by lemma 42 R->L }
% 17.18/2.63 addition(multiplication(c(x0), x0), multiplication(multiplication(c(x0), c(x1)), x0))
% 17.18/2.63 = { by axiom 25 (left_distributivity) R->L }
% 17.18/2.63 multiplication(addition(c(x0), multiplication(c(x0), c(x1))), x0)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 multiplication(addition(multiplication(c(x0), c(x1)), c(x0)), x0)
% 17.18/2.63 = { by axiom 4 (multiplicative_right_identity) R->L }
% 17.18/2.63 multiplication(addition(multiplication(c(x0), c(x1)), multiplication(c(x0), one)), x0)
% 17.18/2.63 = { by lemma 44 }
% 17.18/2.63 multiplication(multiplication(c(x0), addition(one, c(x1))), x0)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 multiplication(multiplication(c(x0), addition(c(x1), one)), x0)
% 17.18/2.63 = { by lemma 38 R->L }
% 17.18/2.63 multiplication(multiplication(c(x0), addition(c(x1), addition(x1, c(x1)))), x0)
% 17.18/2.63 = { by lemma 36 }
% 17.18/2.63 multiplication(multiplication(c(x0), addition(c(x1), x1)), x0)
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 multiplication(multiplication(c(x0), addition(x1, c(x1))), x0)
% 17.18/2.63 = { by lemma 38 }
% 17.18/2.63 multiplication(multiplication(c(x0), one), x0)
% 17.18/2.63 = { by axiom 4 (multiplicative_right_identity) }
% 17.18/2.63 multiplication(c(x0), x0)
% 17.18/2.63 = { by lemma 42 }
% 17.18/2.63 zero
% 17.18/2.63
% 17.18/2.63 Lemma 46: addition(addition(x0, x1), multiplication(c(x0), c(x1))) = one.
% 17.18/2.63 Proof:
% 17.18/2.63 addition(addition(x0, x1), multiplication(c(x0), c(x1)))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(x0, x1))
% 17.18/2.63 = { by axiom 6 (multiplicative_left_identity) R->L }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), multiplication(one, addition(x0, x1)))
% 17.18/2.63 = { by lemma 37 R->L }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), multiplication(addition(one, c(x0)), addition(x0, x1)))
% 17.18/2.63 = { by axiom 25 (left_distributivity) }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(multiplication(one, addition(x0, x1)), multiplication(c(x0), addition(x0, x1))))
% 17.18/2.63 = { by axiom 6 (multiplicative_left_identity) }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(addition(x0, x1), multiplication(c(x0), addition(x0, x1))))
% 17.18/2.63 = { by axiom 24 (right_distributivity) }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(addition(x0, x1), addition(multiplication(c(x0), x0), multiplication(c(x0), x1))))
% 17.18/2.63 = { by lemma 42 }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(addition(x0, x1), addition(zero, multiplication(c(x0), x1))))
% 17.18/2.63 = { by lemma 31 }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(addition(x0, x1), multiplication(c(x0), x1)))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(multiplication(c(x0), c(x1)), addition(multiplication(c(x0), x1), addition(x0, x1)))
% 17.18/2.63 = { by axiom 13 (additive_associativity) }
% 17.18/2.63 addition(addition(multiplication(c(x0), c(x1)), multiplication(c(x0), x1)), addition(x0, x1))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 addition(addition(x0, x1), addition(multiplication(c(x0), c(x1)), multiplication(c(x0), x1)))
% 17.18/2.63 = { by lemma 44 }
% 17.18/2.63 addition(addition(x0, x1), multiplication(c(x0), addition(x1, c(x1))))
% 17.18/2.63 = { by lemma 38 }
% 17.18/2.63 addition(addition(x0, x1), multiplication(c(x0), one))
% 17.18/2.63 = { by axiom 4 (multiplicative_right_identity) }
% 17.18/2.63 addition(addition(x0, x1), c(x0))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.63 addition(c(x0), addition(x0, x1))
% 17.18/2.63 = { by lemma 43 }
% 17.18/2.63 addition(x1, addition(c(x0), x0))
% 17.18/2.63 = { by axiom 8 (additive_commutativity) }
% 17.18/2.63 addition(x1, addition(x0, c(x0)))
% 17.18/2.63 = { by lemma 34 }
% 17.18/2.63 addition(x1, one)
% 17.18/2.63 = { by lemma 39 R->L }
% 17.18/2.63 addition(x1, addition(x1, x1_2(x1)))
% 17.18/2.63 = { by lemma 35 }
% 17.18/2.63 addition(x1, x1_2(x1))
% 17.18/2.63 = { by lemma 39 }
% 17.18/2.64 one
% 17.18/2.64
% 17.18/2.64 Lemma 47: complement(addition(x0, x1), c(addition(x0, x1))) = true.
% 17.18/2.64 Proof:
% 17.18/2.64 complement(addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 20 (test_3) R->L }
% 17.18/2.64 fresh5(true, true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 11 (test_1_1) R->L }
% 17.18/2.64 fresh5(fresh10(true, true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 14 (test_2) R->L }
% 17.18/2.64 fresh5(fresh10(fresh14(one, one, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 46 R->L }
% 17.18/2.64 fresh5(fresh10(fresh14(addition(addition(x0, x1), multiplication(c(x0), c(x1))), one, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 26 (test_2) R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(zero, zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 45 R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(multiplication(c(x0), c(x1)), x0), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 12 (multiplicative_associativity) R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(c(x0), multiplication(c(x1), x0)), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 31 R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(c(x0), addition(zero, multiplication(c(x1), x0))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 41 R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(c(x0), addition(multiplication(c(x1), x1), multiplication(c(x1), x0))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 24 (right_distributivity) R->L }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(c(x0), multiplication(c(x1), addition(x1, x0))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 8 (additive_commutativity) }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(c(x0), multiplication(c(x1), addition(x0, x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 12 (multiplicative_associativity) }
% 17.18/2.64 fresh5(fresh10(fresh13(multiplication(multiplication(c(x0), c(x1)), addition(x0, x1)), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 27 (test_2) }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(addition(x0, x1), multiplication(c(x0), c(x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 25 (left_distributivity) }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(x0, multiplication(c(x0), c(x1))), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 12 (multiplicative_associativity) }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(multiplication(x0, c(x0)), c(x1)), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 30 (test_2_3) R->L }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(fresh6(complement(x0, c(x0)), true, c(x0), x0), c(x1)), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 33 }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(fresh6(true, true, c(x0), x0), c(x1)), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 19 (test_2_3) }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(zero, c(x1)), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 5 (left_annihilation) }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(zero, multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 40 R->L }
% 17.18/2.64 fresh5(fresh10(fresh9(addition(multiplication(x1, c(x1)), multiplication(x1, multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 24 (right_distributivity) R->L }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, addition(c(x1), multiplication(c(x0), c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 8 (additive_commutativity) }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, addition(multiplication(c(x0), c(x1)), c(x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 6 (multiplicative_left_identity) R->L }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, addition(multiplication(c(x0), c(x1)), multiplication(one, c(x1)))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 25 (left_distributivity) R->L }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, multiplication(addition(c(x0), one), c(x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 8 (additive_commutativity) }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, multiplication(addition(one, c(x0)), c(x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 37 }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, multiplication(one, c(x1))), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 6 (multiplicative_left_identity) }
% 17.18/2.64 fresh5(fresh10(fresh9(multiplication(x1, c(x1)), zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 40 }
% 17.18/2.64 fresh5(fresh10(fresh9(zero, zero, addition(x0, x1), multiplication(c(x0), c(x1))), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 16 (test_2) }
% 17.18/2.64 fresh5(fresh10(complement(multiplication(c(x0), c(x1)), addition(x0, x1)), true, addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 22 (test_1_1) }
% 17.18/2.64 fresh5(test(addition(x0, x1)), true, addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 23 (test_3) }
% 17.18/2.64 fresh4(c(addition(x0, x1)), c(addition(x0, x1)), addition(x0, x1), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 21 (test_3) }
% 17.18/2.64 true
% 17.18/2.64
% 17.18/2.64 Goal 1 (goals_2): c(addition(x0, x1)) = multiplication(c(x0), c(x1)).
% 17.18/2.64 Proof:
% 17.18/2.64 c(addition(x0, x1))
% 17.18/2.64 = { by axiom 6 (multiplicative_left_identity) R->L }
% 17.18/2.64 multiplication(one, c(addition(x0, x1)))
% 17.18/2.64 = { by lemma 46 R->L }
% 17.18/2.64 multiplication(addition(addition(x0, x1), multiplication(c(x0), c(x1))), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 8 (additive_commutativity) R->L }
% 17.18/2.64 multiplication(addition(multiplication(c(x0), c(x1)), addition(x0, x1)), c(addition(x0, x1)))
% 17.18/2.64 = { by axiom 25 (left_distributivity) }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), c(addition(x0, x1))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 31 R->L }
% 17.18/2.64 addition(addition(zero, multiplication(multiplication(c(x0), c(x1)), c(addition(x0, x1)))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 45 R->L }
% 17.18/2.64 addition(addition(multiplication(multiplication(c(x0), c(x1)), x0), multiplication(multiplication(c(x0), c(x1)), c(addition(x0, x1)))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 24 (right_distributivity) R->L }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), addition(x0, c(addition(x0, x1)))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 8 (additive_commutativity) }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), x0)), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 31 R->L }
% 17.18/2.64 addition(addition(zero, multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), x0))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 3 (right_annihilation) R->L }
% 17.18/2.64 addition(addition(multiplication(c(x0), zero), multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), x0))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 41 R->L }
% 17.18/2.64 addition(addition(multiplication(c(x0), multiplication(c(x1), x1)), multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), x0))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 12 (multiplicative_associativity) }
% 17.18/2.64 addition(addition(multiplication(multiplication(c(x0), c(x1)), x1), multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), x0))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 24 (right_distributivity) R->L }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), addition(x1, addition(c(addition(x0, x1)), x0))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 43 R->L }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), addition(c(addition(x0, x1)), addition(x0, x1))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 28 (test_2_1) R->L }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), fresh8(complement(addition(x0, x1), c(addition(x0, x1))), true, c(addition(x0, x1)), addition(x0, x1))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by lemma 47 }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), fresh8(true, true, c(addition(x0, x1)), addition(x0, x1))), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 17 (test_2_1) }
% 17.18/2.64 addition(multiplication(multiplication(c(x0), c(x1)), one), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 4 (multiplicative_right_identity) }
% 17.18/2.64 addition(multiplication(c(x0), c(x1)), multiplication(addition(x0, x1), c(addition(x0, x1))))
% 17.18/2.64 = { by axiom 30 (test_2_3) R->L }
% 17.18/2.64 addition(multiplication(c(x0), c(x1)), fresh6(complement(addition(x0, x1), c(addition(x0, x1))), true, c(addition(x0, x1)), addition(x0, x1)))
% 17.18/2.64 = { by lemma 47 }
% 17.18/2.64 addition(multiplication(c(x0), c(x1)), fresh6(true, true, c(addition(x0, x1)), addition(x0, x1)))
% 17.18/2.64 = { by axiom 19 (test_2_3) }
% 17.18/2.64 addition(multiplication(c(x0), c(x1)), zero)
% 17.18/2.64 = { by axiom 9 (additive_identity) }
% 17.18/2.64 multiplication(c(x0), c(x1))
% 17.18/2.64 % SZS output end Proof
% 17.18/2.64
% 17.18/2.64 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------