TSTP Solution File: GRP155-1 by Toma---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Toma---0.4
% Problem : GRP155-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : toma --casc %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 : 300s
% DateTime : Thu Aug 31 01:14:10 EDT 2023
% Result : Unsatisfiable 0.20s 0.47s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : GRP155-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.06/0.13 % Command : toma --casc %s
% 0.14/0.34 % Computer : n029.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 21:16:41 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.47 % SZS status Unsatisfiable
% 0.20/0.47 % SZS output start Proof
% 0.20/0.47 original problem:
% 0.20/0.47 axioms:
% 0.20/0.47 multiply(identity(), X) = X
% 0.20/0.47 multiply(inverse(X), X) = identity()
% 0.20/0.47 multiply(multiply(X, Y), Z) = multiply(X, multiply(Y, Z))
% 0.20/0.47 greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X)
% 0.20/0.47 least_upper_bound(X, Y) = least_upper_bound(Y, X)
% 0.20/0.47 greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z)
% 0.20/0.47 least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z)
% 0.20/0.47 least_upper_bound(X, X) = X
% 0.20/0.47 greatest_lower_bound(X, X) = X
% 0.20/0.47 least_upper_bound(X, greatest_lower_bound(X, Y)) = X
% 0.20/0.47 greatest_lower_bound(X, least_upper_bound(X, Y)) = X
% 0.20/0.47 multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z))
% 0.20/0.47 multiply(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(multiply(X, Y), multiply(X, Z))
% 0.20/0.47 multiply(least_upper_bound(Y, Z), X) = least_upper_bound(multiply(Y, X), multiply(Z, X))
% 0.20/0.47 multiply(greatest_lower_bound(Y, Z), X) = greatest_lower_bound(multiply(Y, X), multiply(Z, X))
% 0.20/0.47 greatest_lower_bound(a(), b()) = a()
% 0.20/0.47 goal:
% 0.20/0.47 greatest_lower_bound(multiply(a(), c()), multiply(b(), c())) != multiply(a(), c())
% 0.20/0.47 To show the unsatisfiability of the original goal,
% 0.20/0.47 it suffices to show that greatest_lower_bound(multiply(a(), c()), multiply(b(), c())) = multiply(a(), c()) (skolemized goal) is valid under the axioms.
% 0.20/0.47 Here is an equational proof:
% 0.20/0.47 3: greatest_lower_bound(X0, X1) = greatest_lower_bound(X1, X0).
% 0.20/0.47 Proof: Axiom.
% 0.20/0.47
% 0.20/0.47 14: multiply(greatest_lower_bound(X1, X2), X0) = greatest_lower_bound(multiply(X1, X0), multiply(X2, X0)).
% 0.20/0.47 Proof: Axiom.
% 0.20/0.47
% 0.20/0.47 15: greatest_lower_bound(a(), b()) = a().
% 0.20/0.47 Proof: Axiom.
% 0.20/0.47
% 0.20/0.47 16: greatest_lower_bound(b(), a()) = a().
% 0.20/0.47 Proof: Rewrite equation 15,
% 0.20/0.47 lhs with equations [3]
% 0.20/0.47 rhs with equations [].
% 0.20/0.47
% 0.20/0.47 17: greatest_lower_bound(multiply(a(), c()), multiply(b(), c())) = multiply(a(), c()).
% 0.20/0.47 Proof: Rewrite lhs with equations [14,3,16]
% 0.20/0.47 rhs with equations [].
% 0.20/0.47
% 0.20/0.47 % SZS output end Proof
%------------------------------------------------------------------------------