TSTP Solution File: KLE020+2 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : KLE020+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 : n025.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:30 EDT 2023

% Result   : Theorem 5.14s 1.03s
% Output   : Proof 5.14s
% Verified : 
% SZS Type : -

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