TSTP Solution File: KLE040+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : KLE040+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 : n002.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:37 EDT 2023
% Result : Theorem 5.22s 1.09s
% Output : Proof 5.93s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KLE040+1 : TPTP v8.1.2. Released v4.0.0.
% 0.10/0.12 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.11/0.32 % Computer : n002.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Aug 29 12:52:05 EDT 2023
% 0.11/0.33 % CPUTime :
% 5.22/1.09 Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 5.22/1.09
% 5.22/1.09 % SZS status Theorem
% 5.22/1.09
% 5.93/1.10 % SZS output start Proof
% 5.93/1.10 Take the following subset of the input axioms:
% 5.93/1.10 fof(additive_associativity, axiom, ![A, B, C]: addition(A, addition(B, C))=addition(addition(A, B), C)).
% 5.93/1.10 fof(additive_commutativity, axiom, ![A3, B2]: addition(A3, B2)=addition(B2, A3)).
% 5.93/1.10 fof(additive_idempotence, axiom, ![A3]: addition(A3, A3)=A3).
% 5.93/1.10 fof(goals, conjecture, ![X0]: multiplication(star(X0), star(X0))=star(X0)).
% 5.93/1.10 fof(multiplicative_right_identity, axiom, ![A3]: multiplication(A3, one)=A3).
% 5.93/1.10 fof(order, axiom, ![A2, B2]: (leq(A2, B2) <=> addition(A2, B2)=B2)).
% 5.93/1.10 fof(right_distributivity, axiom, ![A3, B2, C2]: multiplication(A3, addition(B2, C2))=addition(multiplication(A3, B2), multiplication(A3, C2))).
% 5.93/1.10 fof(star_induction_left, axiom, ![B2, C2, A2_2]: (leq(addition(multiplication(A2_2, B2), C2), B2) => leq(multiplication(star(A2_2), C2), B2))).
% 5.93/1.10 fof(star_unfold_right, axiom, ![A3]: leq(addition(one, multiplication(A3, star(A3))), star(A3))).
% 5.93/1.10
% 5.93/1.10 Now clausify the problem and encode Horn clauses using encoding 3 of
% 5.93/1.10 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 5.93/1.10 We repeatedly replace C & s=t => u=v by the two clauses:
% 5.93/1.10 fresh(y, y, x1...xn) = u
% 5.93/1.10 C => fresh(s, t, x1...xn) = v
% 5.93/1.10 where fresh is a fresh function symbol and x1..xn are the free
% 5.93/1.10 variables of u and v.
% 5.93/1.10 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 5.93/1.10 input problem has no model of domain size 1).
% 5.93/1.10
% 5.93/1.10 The encoding turns the above axioms into the following unit equations and goals:
% 5.93/1.10
% 5.93/1.10 Axiom 1 (multiplicative_right_identity): multiplication(X, one) = X.
% 5.93/1.10 Axiom 2 (additive_idempotence): addition(X, X) = X.
% 5.93/1.10 Axiom 3 (additive_commutativity): addition(X, Y) = addition(Y, X).
% 5.93/1.10 Axiom 4 (additive_associativity): addition(X, addition(Y, Z)) = addition(addition(X, Y), Z).
% 5.93/1.10 Axiom 5 (order_1): fresh(X, X, Y, Z) = Z.
% 5.93/1.10 Axiom 6 (order): fresh3(X, X, Y, Z) = true.
% 5.93/1.10 Axiom 7 (star_induction_left): fresh4(X, X, Y, Z, W) = true.
% 5.93/1.10 Axiom 8 (right_distributivity): multiplication(X, addition(Y, Z)) = addition(multiplication(X, Y), multiplication(X, Z)).
% 5.93/1.10 Axiom 9 (order_1): fresh(leq(X, Y), true, X, Y) = addition(X, Y).
% 5.93/1.10 Axiom 10 (order): fresh3(addition(X, Y), Y, X, Y) = leq(X, Y).
% 5.93/1.10 Axiom 11 (star_unfold_right): leq(addition(one, multiplication(X, star(X))), star(X)) = true.
% 5.93/1.10 Axiom 12 (star_induction_left): fresh4(leq(addition(multiplication(X, Y), Z), Y), true, X, Y, Z) = leq(multiplication(star(X), Z), Y).
% 5.93/1.10
% 5.93/1.10 Lemma 13: addition(Z, addition(X, Y)) = addition(X, addition(Y, Z)).
% 5.93/1.10 Proof:
% 5.93/1.10 addition(Z, addition(X, Y))
% 5.93/1.10 = { by axiom 3 (additive_commutativity) R->L }
% 5.93/1.10 addition(addition(X, Y), Z)
% 5.93/1.10 = { by axiom 4 (additive_associativity) R->L }
% 5.93/1.10 addition(X, addition(Y, Z))
% 5.93/1.10
% 5.93/1.10 Lemma 14: addition(one, addition(multiplication(X, star(X)), star(X))) = star(X).
% 5.93/1.10 Proof:
% 5.93/1.10 addition(one, addition(multiplication(X, star(X)), star(X)))
% 5.93/1.10 = { by axiom 4 (additive_associativity) }
% 5.93/1.10 addition(addition(one, multiplication(X, star(X))), star(X))
% 5.93/1.10 = { by axiom 9 (order_1) R->L }
% 5.93/1.10 fresh(leq(addition(one, multiplication(X, star(X))), star(X)), true, addition(one, multiplication(X, star(X))), star(X))
% 5.93/1.10 = { by axiom 11 (star_unfold_right) }
% 5.93/1.10 fresh(true, true, addition(one, multiplication(X, star(X))), star(X))
% 5.93/1.10 = { by axiom 5 (order_1) }
% 5.93/1.10 star(X)
% 5.93/1.10
% 5.93/1.10 Goal 1 (goals): multiplication(star(x0), star(x0)) = star(x0).
% 5.93/1.10 Proof:
% 5.93/1.10 multiplication(star(x0), star(x0))
% 5.93/1.10 = { by lemma 14 R->L }
% 5.93/1.10 multiplication(star(x0), addition(one, addition(multiplication(x0, star(x0)), star(x0))))
% 5.93/1.10 = { by axiom 2 (additive_idempotence) R->L }
% 5.93/1.10 multiplication(star(x0), addition(addition(one, one), addition(multiplication(x0, star(x0)), star(x0))))
% 5.93/1.10 = { by axiom 4 (additive_associativity) R->L }
% 5.93/1.10 multiplication(star(x0), addition(one, addition(one, addition(multiplication(x0, star(x0)), star(x0)))))
% 5.93/1.10 = { by lemma 14 }
% 5.93/1.10 multiplication(star(x0), addition(one, star(x0)))
% 5.93/1.10 = { by axiom 8 (right_distributivity) }
% 5.93/1.10 addition(multiplication(star(x0), one), multiplication(star(x0), star(x0)))
% 5.93/1.10 = { by axiom 1 (multiplicative_right_identity) }
% 5.93/1.10 addition(star(x0), multiplication(star(x0), star(x0)))
% 5.93/1.10 = { by axiom 3 (additive_commutativity) }
% 5.93/1.10 addition(multiplication(star(x0), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 2 (additive_idempotence) R->L }
% 5.93/1.10 addition(multiplication(star(x0), star(x0)), addition(star(x0), star(x0)))
% 5.93/1.10 = { by axiom 4 (additive_associativity) }
% 5.93/1.10 addition(addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 9 (order_1) R->L }
% 5.93/1.10 fresh(leq(addition(multiplication(star(x0), star(x0)), star(x0)), star(x0)), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 3 (additive_commutativity) R->L }
% 5.93/1.10 fresh(leq(addition(star(x0), multiplication(star(x0), star(x0))), star(x0)), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 1 (multiplicative_right_identity) R->L }
% 5.93/1.10 fresh(leq(addition(multiplication(star(x0), one), multiplication(star(x0), star(x0))), star(x0)), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 8 (right_distributivity) R->L }
% 5.93/1.10 fresh(leq(multiplication(star(x0), addition(one, star(x0))), star(x0)), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.10 = { by axiom 12 (star_induction_left) R->L }
% 5.93/1.11 fresh(fresh4(leq(addition(multiplication(x0, star(x0)), addition(one, star(x0))), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by lemma 13 R->L }
% 5.93/1.11 fresh(fresh4(leq(addition(star(x0), addition(multiplication(x0, star(x0)), one)), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 3 (additive_commutativity) }
% 5.93/1.11 fresh(fresh4(leq(addition(star(x0), addition(one, multiplication(x0, star(x0)))), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 4 (additive_associativity) }
% 5.93/1.11 fresh(fresh4(leq(addition(addition(star(x0), one), multiplication(x0, star(x0))), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 3 (additive_commutativity) R->L }
% 5.93/1.11 fresh(fresh4(leq(addition(multiplication(x0, star(x0)), addition(star(x0), one)), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by lemma 13 R->L }
% 5.93/1.11 fresh(fresh4(leq(addition(one, addition(multiplication(x0, star(x0)), star(x0))), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by lemma 14 }
% 5.93/1.11 fresh(fresh4(leq(star(x0), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 10 (order) R->L }
% 5.93/1.11 fresh(fresh4(fresh3(addition(star(x0), star(x0)), star(x0), star(x0), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 2 (additive_idempotence) }
% 5.93/1.11 fresh(fresh4(fresh3(star(x0), star(x0), star(x0), star(x0)), true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 6 (order) }
% 5.93/1.11 fresh(fresh4(true, true, x0, star(x0), addition(one, star(x0))), true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 7 (star_induction_left) }
% 5.93/1.11 fresh(true, true, addition(multiplication(star(x0), star(x0)), star(x0)), star(x0))
% 5.93/1.11 = { by axiom 5 (order_1) }
% 5.93/1.11 star(x0)
% 5.93/1.11 % SZS output end Proof
% 5.93/1.11
% 5.93/1.11 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------