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