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