TSTP Solution File: KLE067+1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : KLE067+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 : n019.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:45 EDT 2023
% Result : Theorem 0.21s 0.41s
% Output : Proof 0.21s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : KLE067+1 : 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.15/0.35 % Computer : n019.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Tue Aug 29 12:19:58 EDT 2023
% 0.15/0.35 % CPUTime :
% 0.21/0.41 Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.21/0.41
% 0.21/0.41 % SZS status Theorem
% 0.21/0.41
% 0.21/0.41 % SZS output start Proof
% 0.21/0.41 Take the following subset of the input axioms:
% 0.21/0.41 fof(domain2, axiom, ![X0, X1]: domain(multiplication(X0, X1))=domain(multiplication(X0, domain(X1)))).
% 0.21/0.41 fof(domain5, axiom, ![X0_2, X1_2]: domain(addition(X0_2, X1_2))=addition(domain(X0_2), domain(X1_2))).
% 0.21/0.41 fof(goals, conjecture, ![X0_2, X1_2]: domain(addition(domain(X0_2), domain(X1_2)))=addition(domain(X0_2), domain(X1_2))).
% 0.21/0.41 fof(multiplicative_left_identity, axiom, ![A]: multiplication(one, A)=A).
% 0.21/0.41
% 0.21/0.41 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.21/0.41 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.21/0.41 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.21/0.41 fresh(y, y, x1...xn) = u
% 0.21/0.41 C => fresh(s, t, x1...xn) = v
% 0.21/0.41 where fresh is a fresh function symbol and x1..xn are the free
% 0.21/0.41 variables of u and v.
% 0.21/0.41 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.21/0.41 input problem has no model of domain size 1).
% 0.21/0.41
% 0.21/0.41 The encoding turns the above axioms into the following unit equations and goals:
% 0.21/0.41
% 0.21/0.41 Axiom 1 (multiplicative_left_identity): multiplication(one, X) = X.
% 0.21/0.41 Axiom 2 (domain2): domain(multiplication(X, Y)) = domain(multiplication(X, domain(Y))).
% 0.21/0.41 Axiom 3 (domain5): domain(addition(X, Y)) = addition(domain(X), domain(Y)).
% 0.21/0.41
% 0.21/0.41 Goal 1 (goals): domain(addition(domain(x0), domain(x1))) = addition(domain(x0), domain(x1)).
% 0.21/0.41 Proof:
% 0.21/0.41 domain(addition(domain(x0), domain(x1)))
% 0.21/0.41 = { by axiom 3 (domain5) R->L }
% 0.21/0.41 domain(domain(addition(x0, x1)))
% 0.21/0.41 = { by axiom 1 (multiplicative_left_identity) R->L }
% 0.21/0.41 domain(multiplication(one, domain(addition(x0, x1))))
% 0.21/0.41 = { by axiom 2 (domain2) R->L }
% 0.21/0.41 domain(multiplication(one, addition(x0, x1)))
% 0.21/0.41 = { by axiom 1 (multiplicative_left_identity) }
% 0.21/0.41 domain(addition(x0, x1))
% 0.21/0.41 = { by axiom 3 (domain5) }
% 0.21/0.41 addition(domain(x0), domain(x1))
% 0.21/0.41 % SZS output end Proof
% 0.21/0.41
% 0.21/0.41 RESULT: Theorem (the conjecture is true).
%------------------------------------------------------------------------------