TSTP Solution File: KLE060+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : KLE060+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 : n032.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:44 EDT 2023
% Result : Theorem 0.14s 0.38s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.09 % Problem : KLE060+1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.10 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Tue Aug 29 11:05:46 EDT 2023
% 0.10/0.29 % CPUTime :
% 0.14/0.38 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.14/0.38
% 0.14/0.38 % SZS status Theorem
% 0.14/0.38
% 0.14/0.39 % SZS output start Proof
% 0.14/0.39 Take the following subset of the input axioms:
% 0.14/0.39 fof(additive_commutativity, axiom, ![A, B]: addition(A, B)=addition(B, A)).
% 0.14/0.39 fof(domain1, axiom, ![X0]: addition(X0, multiplication(domain(X0), X0))=multiplication(domain(X0), X0)).
% 0.14/0.39 fof(domain2, axiom, ![X1, X0_2]: domain(multiplication(X0_2, X1))=domain(multiplication(X0_2, domain(X1)))).
% 0.14/0.39 fof(domain3, axiom, ![X0_2]: addition(domain(X0_2), one)=one).
% 0.14/0.39 fof(domain5, axiom, ![X0_2, X1_2]: domain(addition(X0_2, X1_2))=addition(domain(X0_2), domain(X1_2))).
% 0.14/0.39 fof(goals, conjecture, ![X0_2, X1_2]: domain(multiplication(domain(X0_2), X1_2))=multiplication(domain(X0_2), domain(X1_2))).
% 0.14/0.39 fof(left_distributivity, axiom, ![C, A2, B2]: multiplication(addition(A2, B2), C)=addition(multiplication(A2, C), multiplication(B2, C))).
% 0.14/0.39 fof(multiplicative_left_identity, axiom, ![A2]: multiplication(one, A2)=A2).
% 0.14/0.39 fof(multiplicative_right_identity, axiom, ![A2]: multiplication(A2, one)=A2).
% 0.14/0.39 fof(right_distributivity, axiom, ![A2, B2, C2]: multiplication(A2, addition(B2, C2))=addition(multiplication(A2, B2), multiplication(A2, C2))).
% 0.14/0.39
% 0.14/0.39 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.14/0.39 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.14/0.39 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.14/0.39 fresh(y, y, x1...xn) = u
% 0.14/0.39 C => fresh(s, t, x1...xn) = v
% 0.14/0.39 where fresh is a fresh function symbol and x1..xn are the free
% 0.14/0.39 variables of u and v.
% 0.14/0.39 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.14/0.39 input problem has no model of domain size 1).
% 0.14/0.39
% 0.14/0.39 The encoding turns the above axioms into the following unit equations and goals:
% 0.14/0.39
% 0.14/0.39 Axiom 1 (additive_commutativity): addition(X, Y) = addition(Y, X).
% 0.14/0.39 Axiom 2 (multiplicative_right_identity): multiplication(X, one) = X.
% 0.14/0.39 Axiom 3 (multiplicative_left_identity): multiplication(one, X) = X.
% 0.14/0.39 Axiom 4 (domain3): addition(domain(X), one) = one.
% 0.14/0.39 Axiom 5 (domain2): domain(multiplication(X, Y)) = domain(multiplication(X, domain(Y))).
% 0.14/0.39 Axiom 6 (domain5): domain(addition(X, Y)) = addition(domain(X), domain(Y)).
% 0.14/0.39 Axiom 7 (domain1): addition(X, multiplication(domain(X), X)) = multiplication(domain(X), X).
% 0.14/0.39 Axiom 8 (right_distributivity): multiplication(X, addition(Y, Z)) = addition(multiplication(X, Y), multiplication(X, Z)).
% 0.14/0.39 Axiom 9 (left_distributivity): multiplication(addition(X, Y), Z) = addition(multiplication(X, Z), multiplication(Y, Z)).
% 0.14/0.39
% 0.14/0.39 Lemma 10: domain(domain(X)) = domain(X).
% 0.14/0.39 Proof:
% 0.14/0.39 domain(domain(X))
% 0.14/0.39 = { by axiom 3 (multiplicative_left_identity) R->L }
% 0.14/0.39 domain(multiplication(one, domain(X)))
% 0.14/0.39 = { by axiom 5 (domain2) R->L }
% 0.14/0.39 domain(multiplication(one, X))
% 0.14/0.39 = { by axiom 3 (multiplicative_left_identity) }
% 0.14/0.39 domain(X)
% 0.14/0.39
% 0.14/0.39 Lemma 11: addition(one, domain(X)) = one.
% 0.14/0.39 Proof:
% 0.14/0.39 addition(one, domain(X))
% 0.14/0.39 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.39 addition(domain(X), one)
% 0.14/0.39 = { by axiom 4 (domain3) }
% 0.14/0.39 one
% 0.14/0.39
% 0.14/0.39 Lemma 12: multiplication(X, addition(Y, one)) = addition(X, multiplication(X, Y)).
% 0.14/0.39 Proof:
% 0.14/0.39 multiplication(X, addition(Y, one))
% 0.14/0.39 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.39 multiplication(X, addition(one, Y))
% 0.14/0.39 = { by axiom 8 (right_distributivity) }
% 0.14/0.39 addition(multiplication(X, one), multiplication(X, Y))
% 0.14/0.39 = { by axiom 2 (multiplicative_right_identity) }
% 0.14/0.39 addition(X, multiplication(X, Y))
% 0.14/0.39
% 0.14/0.39 Lemma 13: multiplication(addition(X, one), Y) = addition(Y, multiplication(X, Y)).
% 0.14/0.39 Proof:
% 0.14/0.39 multiplication(addition(X, one), Y)
% 0.14/0.39 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.39 multiplication(addition(one, X), Y)
% 0.14/0.39 = { by axiom 9 (left_distributivity) }
% 0.14/0.39 addition(multiplication(one, Y), multiplication(X, Y))
% 0.14/0.39 = { by axiom 3 (multiplicative_left_identity) }
% 0.14/0.39 addition(Y, multiplication(X, Y))
% 0.14/0.39
% 0.14/0.39 Lemma 14: addition(X, multiplication(domain(Y), X)) = X.
% 0.14/0.39 Proof:
% 0.14/0.39 addition(X, multiplication(domain(Y), X))
% 0.14/0.39 = { by lemma 13 R->L }
% 0.14/0.39 multiplication(addition(domain(Y), one), X)
% 0.14/0.39 = { by axiom 1 (additive_commutativity) }
% 0.14/0.39 multiplication(addition(one, domain(Y)), X)
% 0.14/0.39 = { by lemma 11 }
% 0.14/0.39 multiplication(one, X)
% 0.14/0.39 = { by axiom 3 (multiplicative_left_identity) }
% 0.14/0.39 X
% 0.14/0.39
% 0.14/0.39 Lemma 15: multiplication(domain(X), addition(X, Y)) = addition(X, multiplication(domain(X), Y)).
% 0.14/0.39 Proof:
% 0.14/0.39 multiplication(domain(X), addition(X, Y))
% 0.14/0.39 = { by axiom 8 (right_distributivity) }
% 0.14/0.39 addition(multiplication(domain(X), X), multiplication(domain(X), Y))
% 0.14/0.39 = { by axiom 7 (domain1) R->L }
% 0.14/0.39 addition(addition(X, multiplication(domain(X), X)), multiplication(domain(X), Y))
% 0.14/0.39 = { by lemma 13 R->L }
% 0.14/0.39 addition(multiplication(addition(domain(X), one), X), multiplication(domain(X), Y))
% 0.14/0.39 = { by axiom 1 (additive_commutativity) }
% 0.14/0.39 addition(multiplication(addition(one, domain(X)), X), multiplication(domain(X), Y))
% 0.14/0.39 = { by lemma 11 }
% 0.14/0.39 addition(multiplication(one, X), multiplication(domain(X), Y))
% 0.14/0.39 = { by axiom 3 (multiplicative_left_identity) }
% 0.14/0.39 addition(X, multiplication(domain(X), Y))
% 0.14/0.39
% 0.14/0.39 Goal 1 (goals): domain(multiplication(domain(x0), x1)) = multiplication(domain(x0), domain(x1)).
% 0.14/0.39 Proof:
% 0.14/0.39 domain(multiplication(domain(x0), x1))
% 0.14/0.39 = { by axiom 2 (multiplicative_right_identity) R->L }
% 0.14/0.39 multiplication(domain(multiplication(domain(x0), x1)), one)
% 0.14/0.39 = { by lemma 11 R->L }
% 0.14/0.39 multiplication(domain(multiplication(domain(x0), x1)), addition(one, domain(x1)))
% 0.14/0.39 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.39 multiplication(domain(multiplication(domain(x0), x1)), addition(domain(x1), one))
% 0.14/0.39 = { by lemma 12 }
% 0.14/0.39 addition(domain(multiplication(domain(x0), x1)), multiplication(domain(multiplication(domain(x0), x1)), domain(x1)))
% 0.14/0.39 = { by lemma 10 R->L }
% 0.14/0.39 addition(domain(multiplication(domain(x0), x1)), multiplication(domain(domain(multiplication(domain(x0), x1))), domain(x1)))
% 0.14/0.39 = { by lemma 15 R->L }
% 0.14/0.39 multiplication(domain(domain(multiplication(domain(x0), x1))), addition(domain(multiplication(domain(x0), x1)), domain(x1)))
% 0.14/0.39 = { by axiom 6 (domain5) R->L }
% 0.14/0.39 multiplication(domain(domain(multiplication(domain(x0), x1))), domain(addition(multiplication(domain(x0), x1), x1)))
% 0.14/0.39 = { by lemma 10 }
% 0.14/0.39 multiplication(domain(multiplication(domain(x0), x1)), domain(addition(multiplication(domain(x0), x1), x1)))
% 0.14/0.39 = { by axiom 1 (additive_commutativity) }
% 0.14/0.39 multiplication(domain(multiplication(domain(x0), x1)), domain(addition(x1, multiplication(domain(x0), x1))))
% 0.14/0.40 = { by lemma 14 }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), x1)), domain(x1))
% 0.14/0.40 = { by axiom 5 (domain2) }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), domain(x1))), domain(x1))
% 0.14/0.40 = { by lemma 14 R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), domain(x1))), addition(domain(x1), multiplication(domain(x0), domain(x1))))
% 0.14/0.40 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), domain(x1))), addition(multiplication(domain(x0), domain(x1)), domain(x1)))
% 0.14/0.40 = { by lemma 15 }
% 0.14/0.40 addition(multiplication(domain(x0), domain(x1)), multiplication(domain(multiplication(domain(x0), domain(x1))), domain(x1)))
% 0.14/0.40 = { by axiom 9 (left_distributivity) R->L }
% 0.14/0.40 multiplication(addition(domain(x0), domain(multiplication(domain(x0), domain(x1)))), domain(x1))
% 0.14/0.40 = { by lemma 10 R->L }
% 0.14/0.40 multiplication(addition(domain(domain(x0)), domain(multiplication(domain(x0), domain(x1)))), domain(x1))
% 0.14/0.40 = { by axiom 6 (domain5) R->L }
% 0.14/0.40 multiplication(domain(addition(domain(x0), multiplication(domain(x0), domain(x1)))), domain(x1))
% 0.14/0.40 = { by lemma 12 R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(domain(x1), one))), domain(x1))
% 0.14/0.40 = { by axiom 5 (domain2) }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), domain(addition(domain(x1), one)))), domain(x1))
% 0.14/0.40 = { by axiom 1 (additive_commutativity) R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), domain(addition(one, domain(x1))))), domain(x1))
% 0.14/0.40 = { by axiom 6 (domain5) }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(domain(one), domain(domain(x1))))), domain(x1))
% 0.14/0.40 = { by axiom 2 (multiplicative_right_identity) R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(multiplication(domain(one), one), domain(domain(x1))))), domain(x1))
% 0.14/0.40 = { by axiom 7 (domain1) R->L }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(addition(one, multiplication(domain(one), one)), domain(domain(x1))))), domain(x1))
% 0.14/0.40 = { by axiom 2 (multiplicative_right_identity) }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(addition(one, domain(one)), domain(domain(x1))))), domain(x1))
% 0.14/0.40 = { by lemma 11 }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), addition(one, domain(domain(x1))))), domain(x1))
% 0.14/0.40 = { by lemma 11 }
% 0.14/0.40 multiplication(domain(multiplication(domain(x0), one)), domain(x1))
% 0.14/0.40 = { by axiom 2 (multiplicative_right_identity) }
% 0.14/0.40 multiplication(domain(domain(x0)), domain(x1))
% 0.14/0.40 = { by lemma 10 }
% 0.14/0.40 multiplication(domain(x0), domain(x1))
% 0.14/0.40 % SZS output end Proof
% 0.14/0.40
% 0.14/0.40 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------