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