%------------------------------------------------------------------------------ % File : Moca---0.1 % Problem : CAT016-4 : TPTP v8.1.0. Released v1.0.0. % Transfm : none % Format : tptp:raw % Command : moca.sh %s % Computer : n029.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 : 600s % DateTime : Fri Jul 15 00:05:00 EDT 2022 % Result : Unsatisfiable 1.50s 1.61s % Output : Proof 1.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : CAT016-4 : TPTP v8.1.0. Released v1.0.0. % 0.03/0.12 % Command : moca.sh %s % 0.12/0.33 % Computer : n029.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % Memory : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % WCLimit : 600 % 0.12/0.33 % DateTime : Sun May 29 23:31:58 EDT 2022 % 0.12/0.33 % CPUTime : % 1.50/1.61 % SZS status Unsatisfiable % 1.50/1.61 % SZS output start Proof % 1.50/1.61 The input problem is unsatisfiable because % 1.50/1.61 % 1.50/1.61 [1] the following set of Horn clauses is unsatisfiable: % 1.50/1.61 % 1.50/1.61 equivalent(X, Y) ==> there_exists(X) % 1.50/1.61 equivalent(X, Y) ==> X = Y % 1.50/1.61 there_exists(X) & X = Y ==> equivalent(X, Y) % 1.50/1.61 there_exists(domain(X)) ==> there_exists(X) % 1.50/1.61 there_exists(codomain(X)) ==> there_exists(X) % 1.50/1.61 there_exists(compose(X, Y)) ==> there_exists(domain(X)) % 1.50/1.61 there_exists(compose(X, Y)) ==> domain(X) = codomain(Y) % 1.50/1.61 there_exists(domain(X)) & domain(X) = codomain(Y) ==> there_exists(compose(X, Y)) % 1.50/1.61 compose(X, compose(Y, Z)) = compose(compose(X, Y), Z) % 1.50/1.61 compose(X, domain(X)) = X % 1.50/1.61 compose(codomain(X), X) = X % 1.50/1.61 there_exists(a) % 1.50/1.61 there_exists(domain(a)) ==> \bottom % 1.50/1.61 % 1.50/1.61 This holds because % 1.50/1.61 % 1.50/1.61 [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)): % 1.50/1.61 % 1.50/1.61 E: % 1.50/1.61 compose(X, compose(Y, Z)) = compose(compose(X, Y), Z) % 1.50/1.61 compose(X, domain(X)) = X % 1.50/1.61 compose(codomain(X), X) = X % 1.50/1.61 f1(equivalent(X, Y), X) = true__ % 1.50/1.61 f1(true__, X) = there_exists(X) % 1.50/1.61 f10(codomain(Y), Y, X) = f9(there_exists(domain(X)), X, Y) % 1.50/1.61 f10(domain(X), Y, X) = true__ % 1.50/1.61 f11(there_exists(domain(a))) = true__ % 1.50/1.61 f11(true__) = false__ % 1.50/1.61 f2(equivalent(X, Y), X, Y) = Y % 1.50/1.61 f2(true__, X, Y) = X % 1.50/1.61 f3(true__, X, Y) = equivalent(X, Y) % 1.50/1.61 f4(X, Y, X) = true__ % 1.50/1.61 f4(Y, Y, X) = f3(there_exists(X), X, Y) % 1.50/1.61 f5(there_exists(domain(X)), X) = true__ % 1.50/1.61 f5(true__, X) = there_exists(X) % 1.50/1.61 f6(there_exists(codomain(X)), X) = true__ % 1.50/1.61 f6(true__, X) = there_exists(X) % 1.50/1.61 f7(there_exists(compose(X, Y)), X) = true__ % 1.50/1.61 f7(true__, X) = there_exists(domain(X)) % 1.50/1.61 f8(there_exists(compose(X, Y)), X, Y) = codomain(Y) % 1.50/1.61 f8(true__, X, Y) = domain(X) % 1.50/1.61 f9(true__, X, Y) = there_exists(compose(X, Y)) % 1.50/1.61 there_exists(a) = true__ % 1.50/1.61 G: % 1.50/1.61 true__ = false__ % 1.50/1.61 % 1.50/1.61 This holds because % 1.50/1.61 % 1.50/1.61 [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS: % 1.50/1.61 % 1.50/1.61 % 1.50/1.61 codomain(domain(a)) -> domain(a) % 1.50/1.61 compose(X, domain(X)) -> X % 1.50/1.61 compose(Y0, compose(Y1, domain(compose(Y0, Y1)))) -> compose(Y0, Y1) % 1.50/1.61 compose(Y0, compose(domain(Y0), Y2)) -> compose(Y0, Y2) % 1.50/1.61 compose(codomain(X), X) -> X % 1.50/1.61 compose(compose(X, Y), Z) -> compose(X, compose(Y, Z)) % 1.50/1.61 compose(domain(a), domain(a)) -> domain(a) % 1.50/1.61 equivalent(a, a) -> true__ % 1.50/1.61 equivalent(domain(a), domain(a)) -> true__ % 1.50/1.61 f1(equivalent(X, Y), X) -> true__ % 1.50/1.61 f1(true__, a) -> true__ % 1.50/1.61 f1(true__, domain(a)) -> true__ % 1.50/1.61 f1(true__, domain(codomain(a))) -> true__ % 1.50/1.61 f1(true__, domain(domain(a))) -> true__ % 1.50/1.61 f10(codomain(Y), Y, X) -> f9(there_exists(domain(X)), X, Y) % 1.50/1.61 f10(domain(X), Y, X) -> true__ % 1.50/1.61 f11(f1(true__, domain(a))) -> true__ % 1.50/1.61 f11(there_exists(domain(a))) -> true__ % 1.50/1.61 f11(true__) -> false__ % 1.50/1.61 f2(equivalent(X, Y), X, Y) -> Y % 1.50/1.61 f2(true__, X, Y) -> X % 1.50/1.61 f3(f1(true__, Y1), Y1, Y1) -> true__ % 1.50/1.61 f3(true__, X, Y) -> equivalent(X, Y) % 1.50/1.61 f4(X, Y, X) -> true__ % 1.50/1.61 f4(Y, Y, X) -> f3(there_exists(X), X, Y) % 1.50/1.61 f5(f1(true__, domain(Y0)), Y0) -> true__ % 1.50/1.61 f5(there_exists(domain(X)), X) -> true__ % 1.50/1.61 f5(true__, X) -> there_exists(X) % 1.50/1.61 f6(f1(true__, codomain(Y0)), Y0) -> true__ % 1.50/1.61 f6(there_exists(codomain(X)), X) -> true__ % 1.50/1.61 f6(true__, X) -> there_exists(X) % 1.50/1.61 f7(f1(true__, Y0), Y0) -> true__ % 1.50/1.62 f7(f1(true__, Y1), codomain(Y1)) -> true__ % 1.50/1.62 f7(f1(true__, compose(Y0, Y1)), Y0) -> true__ % 1.50/1.62 f7(there_exists(compose(X, Y)), X) -> true__ % 1.50/1.62 f7(true__, X) -> there_exists(domain(X)) % 1.50/1.62 f8(f1(true__, Y0), Y0, domain(Y0)) -> codomain(domain(Y0)) % 1.50/1.62 f8(f1(true__, Y1), codomain(Y1), Y1) -> codomain(Y1) % 1.50/1.62 f8(f1(true__, compose(Y0, Y1)), Y0, Y1) -> codomain(Y1) % 1.50/1.62 f8(there_exists(compose(X, Y)), X, Y) -> codomain(Y) % 1.50/1.62 f8(true__, X, Y) -> domain(X) % 1.50/1.62 f9(true__, X, Y) -> there_exists(compose(X, Y)) % 1.50/1.62 false__ -> true__ % 1.50/1.62 there_exists(X) -> f1(true__, X) % 1.50/1.62 there_exists(a) -> true__ % 1.50/1.62 with the LPO induced by % 1.50/1.62 f11 > f7 > f10 > f9 > a > f2 > f8 > domain > f6 > f5 > f4 > f3 > there_exists > f1 > compose > codomain > equivalent > false__ > true__ % 1.50/1.62 % 1.50/1.62 % SZS output end Proof % 1.50/1.62 %------------------------------------------------------------------------------