%------------------------------------------------------------------------------ % File : Moca---0.1 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1. % Transfm : none % Format : tptp:raw % Command : moca.sh %s % 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 : 600s % DateTime : Sat Jul 16 10:53:27 EDT 2022 % Result : Unsatisfiable 1.37s 1.49s % Output : Proof 1.37s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : GRP150-1 : TPTP v8.1.0. Bugfixed v1.2.1. % 0.12/0.13 % Command : moca.sh %s % 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 : 600 % 0.13/0.34 % DateTime : Tue Jun 14 06:03:39 EDT 2022 % 0.13/0.34 % CPUTime : % 1.37/1.49 % SZS status Unsatisfiable % 1.37/1.49 % SZS output start Proof % 1.37/1.49 The input problem is unsatisfiable because % 1.37/1.49 % 1.37/1.49 [1] the following set of Horn clauses is unsatisfiable: % 1.37/1.49 % 1.37/1.49 multiply(identity, X) = X % 1.37/1.49 multiply(inverse(X), X) = identity % 1.37/1.49 multiply(multiply(X, Y), Z) = multiply(X, multiply(Y, Z)) % 1.37/1.49 greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X) % 1.37/1.49 least_upper_bound(X, Y) = least_upper_bound(Y, X) % 1.37/1.49 greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z) % 1.37/1.49 least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z) % 1.37/1.49 least_upper_bound(X, X) = X % 1.37/1.49 greatest_lower_bound(X, X) = X % 1.37/1.49 least_upper_bound(X, greatest_lower_bound(X, Y)) = X % 1.37/1.49 greatest_lower_bound(X, least_upper_bound(X, Y)) = X % 1.37/1.49 multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z)) % 1.37/1.49 multiply(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(multiply(X, Y), multiply(X, Z)) % 1.37/1.49 multiply(least_upper_bound(Y, Z), X) = least_upper_bound(multiply(Y, X), multiply(Z, X)) % 1.37/1.50 multiply(greatest_lower_bound(Y, Z), X) = greatest_lower_bound(multiply(Y, X), multiply(Z, X)) % 1.37/1.50 least_upper_bound(a, least_upper_bound(a, b)) = least_upper_bound(a, b) ==> \bottom % 1.37/1.50 % 1.37/1.50 This holds because % 1.37/1.50 % 1.37/1.50 [2] the following E entails the following G (Claessen-Smallbone's transformation (2018)): % 1.37/1.50 % 1.37/1.50 E: % 1.37/1.50 f1(least_upper_bound(a, b)) = false__ % 1.37/1.50 f1(least_upper_bound(a, least_upper_bound(a, b))) = true__ % 1.37/1.50 greatest_lower_bound(X, X) = X % 1.37/1.50 greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X) % 1.37/1.50 greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z) % 1.37/1.50 greatest_lower_bound(X, least_upper_bound(X, Y)) = X % 1.37/1.50 least_upper_bound(X, X) = X % 1.37/1.50 least_upper_bound(X, Y) = least_upper_bound(Y, X) % 1.37/1.50 least_upper_bound(X, greatest_lower_bound(X, Y)) = X % 1.37/1.50 least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z) % 1.37/1.50 multiply(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(multiply(X, Y), multiply(X, Z)) % 1.37/1.50 multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z)) % 1.37/1.50 multiply(greatest_lower_bound(Y, Z), X) = greatest_lower_bound(multiply(Y, X), multiply(Z, X)) % 1.37/1.50 multiply(identity, X) = X % 1.37/1.50 multiply(inverse(X), X) = identity % 1.37/1.50 multiply(least_upper_bound(Y, Z), X) = least_upper_bound(multiply(Y, X), multiply(Z, X)) % 1.37/1.50 multiply(multiply(X, Y), Z) = multiply(X, multiply(Y, Z)) % 1.37/1.50 G: % 1.37/1.50 true__ = false__ % 1.37/1.50 % 1.37/1.50 This holds because % 1.37/1.50 % 1.37/1.50 [3] E entails the following ordered TRS and the lhs and rhs of G join by the TRS: % 1.37/1.50 % 1.37/1.50 greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X) % 1.37/1.50 greatest_lower_bound(Y0, greatest_lower_bound(Y2, Y1)) = greatest_lower_bound(Y1, greatest_lower_bound(Y2, Y0)) % 1.37/1.50 greatest_lower_bound(Y0, greatest_lower_bound(Y2, Y1)) = greatest_lower_bound(Y2, greatest_lower_bound(Y0, Y1)) % 1.37/1.50 greatest_lower_bound(Y2, greatest_lower_bound(Y0, Y1)) = greatest_lower_bound(Y0, greatest_lower_bound(Y1, Y2)) % 1.37/1.50 least_upper_bound(X, Y) = least_upper_bound(Y, X) % 1.37/1.50 f1(least_upper_bound(a, b)) -> false__ % 1.37/1.50 f1(least_upper_bound(a, least_upper_bound(a, b))) -> true__ % 1.37/1.50 greatest_lower_bound(X, X) -> X % 1.37/1.50 greatest_lower_bound(X, least_upper_bound(X, Y)) -> X % 1.37/1.50 greatest_lower_bound(Y0, greatest_lower_bound(Y1, Y0)) -> greatest_lower_bound(Y0, Y1) % 1.37/1.50 greatest_lower_bound(Y0, greatest_lower_bound(Y1, greatest_lower_bound(Y0, Y1))) -> greatest_lower_bound(Y0, Y1) % 1.37/1.50 greatest_lower_bound(Y0, least_upper_bound(Y1, Y0)) -> Y0 % 1.37/1.50 greatest_lower_bound(Y1, greatest_lower_bound(X1, Y1)) -> greatest_lower_bound(X1, Y1) % 1.37/1.50 greatest_lower_bound(Y1, greatest_lower_bound(Y1, Y2)) -> greatest_lower_bound(Y1, Y2) % 1.37/1.50 greatest_lower_bound(greatest_lower_bound(X, Y), Z) -> greatest_lower_bound(X, greatest_lower_bound(Y, Z)) % 1.37/1.50 greatest_lower_bound(multiply(X, Y), multiply(X, Z)) -> multiply(X, greatest_lower_bound(Y, Z)) % 1.37/1.50 greatest_lower_bound(multiply(Y, X), multiply(Z, X)) -> multiply(greatest_lower_bound(Y, Z), X) % 1.37/1.50 least_upper_bound(X, X) -> X % 1.37/1.50 least_upper_bound(X, greatest_lower_bound(X, Y)) -> X % 1.37/1.50 least_upper_bound(Y0, greatest_lower_bound(X1, greatest_lower_bound(X2, Y0))) -> Y0 % 1.37/1.50 least_upper_bound(Y0, greatest_lower_bound(Y1, Y0)) -> Y0 % 1.37/1.50 least_upper_bound(Y0, least_upper_bound(Y1, Y0)) -> least_upper_bound(Y0, Y1) % 1.37/1.50 least_upper_bound(Y0, least_upper_bound(Y1, least_upper_bound(Y0, Y1))) -> least_upper_bound(Y0, Y1) % 1.37/1.50 least_upper_bound(Y1, least_upper_bound(X1, Y1)) -> least_upper_bound(X1, Y1) % 1.37/1.50 least_upper_bound(Y1, least_upper_bound(Y1, Y2)) -> least_upper_bound(Y1, Y2) % 1.37/1.50 least_upper_bound(least_upper_bound(X, Y), Z) -> least_upper_bound(X, least_upper_bound(Y, Z)) % 1.37/1.50 least_upper_bound(multiply(X, Y), multiply(X, Z)) -> multiply(X, least_upper_bound(Y, Z)) % 1.37/1.50 least_upper_bound(multiply(Y, X), multiply(Z, X)) -> multiply(least_upper_bound(Y, Z), X) % 1.37/1.50 multiply(identity, X) -> X % 1.37/1.50 multiply(inverse(X), X) -> identity % 1.37/1.50 multiply(inverse(Y1), multiply(Y1, Y2)) -> Y2 % 1.37/1.50 multiply(inverse(identity), Y1) -> Y1 % 1.37/1.50 multiply(inverse(inverse(X0)), X1) -> multiply(X0, X1) % 1.37/1.50 multiply(inverse(inverse(Y1)), identity) -> Y1 % 1.37/1.50 multiply(inverse(inverse(identity)), Y1) -> Y1 % 1.37/1.50 multiply(inverse(inverse(inverse(X0))), X0) -> identity % 1.37/1.50 multiply(multiply(X, Y), Z) -> multiply(X, multiply(Y, Z)) % 1.37/1.50 true__ -> false__ % 1.37/1.50 with the LPO induced by % 1.37/1.50 f1 > b > a > inverse > identity > greatest_lower_bound > least_upper_bound > multiply > true__ > false__ % 1.37/1.50 % 1.37/1.50 % SZS output end Proof % 1.37/1.50 %------------------------------------------------------------------------------