TSTP Solution File: CAT013-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : CAT013-1 : 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 : n004.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:55 EDT 2023
% Result : Unsatisfiable 0.20s 0.45s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : CAT013-1 : TPTP v8.1.2. Released v1.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.13/0.34 % Computer : n004.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun Aug 27 00:39:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.44 Command-line arguments: --flatten
% 0.20/0.45
% 0.20/0.45 % SZS status Unsatisfiable
% 0.20/0.45
% 0.20/0.45 % SZS output start Proof
% 0.20/0.45 Take the following subset of the input axioms:
% 0.20/0.45 fof(codomain_is_an_identity_map, axiom, ![X]: identity_map(codomain(X))).
% 0.20/0.45 fof(composition_is_well_defined, axiom, ![Y, Z, W, X2]: (~product(X2, Y, Z) | (~product(X2, Y, W) | Z=W))).
% 0.20/0.45 fof(identity1, axiom, ![X2, Y2]: (~defined(X2, Y2) | (~identity_map(X2) | product(X2, Y2, Y2)))).
% 0.20/0.45 fof(mapping_from_x_to_its_domain, axiom, ![X2]: defined(X2, domain(X2))).
% 0.20/0.45 fof(product_on_domain, axiom, ![X2]: product(X2, domain(X2), X2)).
% 0.20/0.45 fof(prove_domain_of_codomain_is_codomain, negated_conjecture, domain(codomain(a))!=codomain(a)).
% 0.20/0.45
% 0.20/0.45 Now clausify the problem and encode Horn clauses using encoding 3 of
% 0.20/0.45 http://www.cse.chalmers.se/~nicsma/papers/horn.pdf.
% 0.20/0.45 We repeatedly replace C & s=t => u=v by the two clauses:
% 0.20/0.45 fresh(y, y, x1...xn) = u
% 0.20/0.45 C => fresh(s, t, x1...xn) = v
% 0.20/0.45 where fresh is a fresh function symbol and x1..xn are the free
% 0.20/0.45 variables of u and v.
% 0.20/0.45 A predicate p(X) is encoded as p(X)=true (this is sound, because the
% 0.20/0.45 input problem has no model of domain size 1).
% 0.20/0.45
% 0.20/0.45 The encoding turns the above axioms into the following unit equations and goals:
% 0.20/0.45
% 0.20/0.45 Axiom 1 (codomain_is_an_identity_map): identity_map(codomain(X)) = true.
% 0.20/0.45 Axiom 2 (mapping_from_x_to_its_domain): defined(X, domain(X)) = true.
% 0.20/0.45 Axiom 3 (composition_is_well_defined): fresh(X, X, Y, Z) = Z.
% 0.20/0.45 Axiom 4 (identity1): fresh6(X, X, Y, Z) = product(Y, Z, Z).
% 0.20/0.45 Axiom 5 (identity1): fresh5(X, X, Y, Z) = true.
% 0.20/0.45 Axiom 6 (product_on_domain): product(X, domain(X), X) = true.
% 0.20/0.45 Axiom 7 (identity1): fresh6(identity_map(X), true, X, Y) = fresh5(defined(X, Y), true, X, Y).
% 0.20/0.45 Axiom 8 (composition_is_well_defined): fresh2(X, X, Y, Z, W, V) = W.
% 0.20/0.45 Axiom 9 (composition_is_well_defined): fresh2(product(X, Y, Z), true, X, Y, W, Z) = fresh(product(X, Y, W), true, W, Z).
% 0.20/0.45
% 0.20/0.45 Goal 1 (prove_domain_of_codomain_is_codomain): domain(codomain(a)) = codomain(a).
% 0.20/0.45 Proof:
% 0.20/0.45 domain(codomain(a))
% 0.20/0.45 = { by axiom 8 (composition_is_well_defined) R->L }
% 0.20/0.45 fresh2(true, true, codomain(a), domain(codomain(a)), domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 6 (product_on_domain) R->L }
% 0.20/0.45 fresh2(product(codomain(a), domain(codomain(a)), codomain(a)), true, codomain(a), domain(codomain(a)), domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 9 (composition_is_well_defined) }
% 0.20/0.45 fresh(product(codomain(a), domain(codomain(a)), domain(codomain(a))), true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 4 (identity1) R->L }
% 0.20/0.45 fresh(fresh6(true, true, codomain(a), domain(codomain(a))), true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 1 (codomain_is_an_identity_map) R->L }
% 0.20/0.45 fresh(fresh6(identity_map(codomain(a)), true, codomain(a), domain(codomain(a))), true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 7 (identity1) }
% 0.20/0.45 fresh(fresh5(defined(codomain(a), domain(codomain(a))), true, codomain(a), domain(codomain(a))), true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 2 (mapping_from_x_to_its_domain) }
% 0.20/0.45 fresh(fresh5(true, true, codomain(a), domain(codomain(a))), true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 5 (identity1) }
% 0.20/0.45 fresh(true, true, domain(codomain(a)), codomain(a))
% 0.20/0.45 = { by axiom 3 (composition_is_well_defined) }
% 0.20/0.45 codomain(a)
% 0.20/0.45 % SZS output end Proof
% 0.20/0.45
% 0.20/0.45 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------