TSTP Solution File: CAT005-3 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : CAT005-3 : TPTP v8.1.2. Released v1.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 : n031.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 : Wed Aug 30 18:18:50 EDT 2023
% Result : Unsatisfiable 0.14s 0.41s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : CAT005-3 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.35 % Computer : n031.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Sun Aug 27 01:02:53 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.14/0.41 Command-line arguments: --kbo-weight0 --lhs-weight 5 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --goal-heuristic
% 0.14/0.41
% 0.14/0.41 % SZS status Unsatisfiable
% 0.14/0.41
% 0.14/0.41 % SZS output start Proof
% 0.14/0.41 Take the following subset of the input axioms:
% 0.14/0.41 fof(ad_exists, hypothesis, there_exists(compose(a, d))).
% 0.14/0.41 fof(codomain_has_elements, axiom, ![X]: (~there_exists(codomain(X)) | there_exists(X))).
% 0.14/0.41 fof(compose_codomain, axiom, ![X2]: compose(codomain(X2), X2)=X2).
% 0.14/0.41 fof(composition_implies_domain, axiom, ![Y, X2]: (~there_exists(compose(X2, Y)) | there_exists(domain(X2)))).
% 0.14/0.41 fof(domain_codomain_composition1, axiom, ![X2, Y2]: (~there_exists(compose(X2, Y2)) | domain(X2)=codomain(Y2))).
% 0.14/0.41 fof(prove_domain_of_a_is_d, negated_conjecture, domain(a)!=d).
% 0.14/0.41 fof(xd_equals_x, hypothesis, ![X2]: (~there_exists(compose(X2, d)) | compose(X2, d)=X2)).
% 0.14/0.41
% 0.14/0.41 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.14/0.41 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.14/0.41 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.14/0.41 fresh(y, y, x1...xn) = u
% 0.14/0.41 C => fresh(s, t, x1...xn) = v
% 0.14/0.41 where fresh is a fresh function symbol and x1..xn are the free
% 0.14/0.41 variables of u and v.
% 0.14/0.41 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.14/0.41 input problem has no model of domain size 1).
% 0.14/0.41
% 0.14/0.41 The encoding turns the above axioms into the following unit equations and goals:
% 0.14/0.41
% 0.14/0.41 Axiom 1 (ad_exists): there_exists(compose(a, d)) = true.
% 0.14/0.41 Axiom 2 (compose_codomain): compose(codomain(X), X) = X.
% 0.14/0.41 Axiom 3 (codomain_has_elements): fresh15(X, X, Y) = true.
% 0.14/0.41 Axiom 4 (composition_implies_domain): fresh14(X, X, Y) = true.
% 0.14/0.41 Axiom 5 (xd_equals_x): fresh3(X, X, Y) = Y.
% 0.14/0.41 Axiom 6 (domain_codomain_composition1): fresh13(X, X, Y, Z) = codomain(Z).
% 0.14/0.41 Axiom 7 (codomain_has_elements): fresh15(there_exists(codomain(X)), true, X) = there_exists(X).
% 0.14/0.41 Axiom 8 (composition_implies_domain): fresh14(there_exists(compose(X, Y)), true, X) = there_exists(domain(X)).
% 0.14/0.41 Axiom 9 (xd_equals_x): fresh3(there_exists(compose(X, d)), true, X) = compose(X, d).
% 0.14/0.41 Axiom 10 (domain_codomain_composition1): fresh13(there_exists(compose(X, Y)), true, X, Y) = domain(X).
% 0.14/0.41
% 0.14/0.41 Lemma 11: codomain(d) = domain(a).
% 0.14/0.41 Proof:
% 0.14/0.41 codomain(d)
% 0.14/0.41 = { by axiom 6 (domain_codomain_composition1) R->L }
% 0.14/0.41 fresh13(true, true, a, d)
% 0.14/0.41 = { by axiom 1 (ad_exists) R->L }
% 0.14/0.41 fresh13(there_exists(compose(a, d)), true, a, d)
% 0.14/0.41 = { by axiom 10 (domain_codomain_composition1) }
% 0.14/0.41 domain(a)
% 0.14/0.41
% 0.14/0.41 Lemma 12: compose(domain(a), d) = d.
% 0.14/0.41 Proof:
% 0.14/0.41 compose(domain(a), d)
% 0.14/0.41 = { by lemma 11 R->L }
% 0.14/0.41 compose(codomain(d), d)
% 0.14/0.41 = { by axiom 2 (compose_codomain) }
% 0.14/0.41 d
% 0.14/0.41
% 0.14/0.41 Goal 1 (prove_domain_of_a_is_d): domain(a) = d.
% 0.14/0.41 Proof:
% 0.14/0.41 domain(a)
% 0.14/0.41 = { by axiom 5 (xd_equals_x) R->L }
% 0.14/0.41 fresh3(true, true, domain(a))
% 0.14/0.41 = { by axiom 3 (codomain_has_elements) R->L }
% 0.14/0.41 fresh3(fresh15(true, true, d), true, domain(a))
% 0.14/0.41 = { by axiom 4 (composition_implies_domain) R->L }
% 0.14/0.41 fresh3(fresh15(fresh14(true, true, a), true, d), true, domain(a))
% 0.14/0.41 = { by axiom 1 (ad_exists) R->L }
% 0.14/0.41 fresh3(fresh15(fresh14(there_exists(compose(a, d)), true, a), true, d), true, domain(a))
% 0.14/0.41 = { by axiom 8 (composition_implies_domain) }
% 0.14/0.41 fresh3(fresh15(there_exists(domain(a)), true, d), true, domain(a))
% 0.14/0.41 = { by lemma 11 R->L }
% 0.14/0.41 fresh3(fresh15(there_exists(codomain(d)), true, d), true, domain(a))
% 0.14/0.41 = { by axiom 7 (codomain_has_elements) }
% 0.14/0.41 fresh3(there_exists(d), true, domain(a))
% 0.14/0.41 = { by lemma 12 R->L }
% 0.14/0.41 fresh3(there_exists(compose(domain(a), d)), true, domain(a))
% 0.14/0.41 = { by axiom 9 (xd_equals_x) }
% 0.14/0.41 compose(domain(a), d)
% 0.14/0.41 = { by lemma 12 }
% 0.14/0.41 d
% 0.14/0.41 % SZS output end Proof
% 0.14/0.41
% 0.14/0.41 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------