TSTP Solution File: GRP163-1 by Toma---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Toma---0.4
% Problem : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : toma --casc %s
% Computer : n005.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:12 EDT 2023
% Result : Unsatisfiable 0.63s 0.86s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP163-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.13 % Command : toma --casc %s
% 0.13/0.34 % Computer : n005.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 : Tue Aug 29 01:49:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.63/0.86 % SZS status Unsatisfiable
% 0.63/0.86 % SZS output start Proof
% 0.63/0.86 original problem:
% 0.63/0.86 axioms:
% 0.63/0.86 multiply(identity(), X) = X
% 0.63/0.86 multiply(inverse(X), X) = identity()
% 0.63/0.86 multiply(multiply(X, Y), Z) = multiply(X, multiply(Y, Z))
% 0.63/0.86 greatest_lower_bound(X, Y) = greatest_lower_bound(Y, X)
% 0.63/0.86 least_upper_bound(X, Y) = least_upper_bound(Y, X)
% 0.63/0.86 greatest_lower_bound(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(greatest_lower_bound(X, Y), Z)
% 0.63/0.86 least_upper_bound(X, least_upper_bound(Y, Z)) = least_upper_bound(least_upper_bound(X, Y), Z)
% 0.63/0.86 least_upper_bound(X, X) = X
% 0.63/0.86 greatest_lower_bound(X, X) = X
% 0.63/0.86 least_upper_bound(X, greatest_lower_bound(X, Y)) = X
% 0.63/0.86 greatest_lower_bound(X, least_upper_bound(X, Y)) = X
% 0.63/0.86 multiply(X, least_upper_bound(Y, Z)) = least_upper_bound(multiply(X, Y), multiply(X, Z))
% 0.63/0.86 multiply(X, greatest_lower_bound(Y, Z)) = greatest_lower_bound(multiply(X, Y), multiply(X, Z))
% 0.63/0.86 multiply(least_upper_bound(Y, Z), X) = least_upper_bound(multiply(Y, X), multiply(Z, X))
% 0.63/0.86 multiply(greatest_lower_bound(Y, Z), X) = greatest_lower_bound(multiply(Y, X), multiply(Z, X))
% 0.63/0.86 greatest_lower_bound(a(), b()) = a()
% 0.63/0.86 greatest_lower_bound(b(), c()) = b()
% 0.63/0.86 goal:
% 0.63/0.86 greatest_lower_bound(a(), c()) != a()
% 0.63/0.86 To show the unsatisfiability of the original goal,
% 0.63/0.86 it suffices to show that greatest_lower_bound(a(), c()) = a() (skolemized goal) is valid under the axioms.
% 0.63/0.86 Here is an equational proof:
% 0.63/0.86 3: greatest_lower_bound(X0, X1) = greatest_lower_bound(X1, X0).
% 0.63/0.86 Proof: Axiom.
% 0.63/0.86
% 0.63/0.86 5: greatest_lower_bound(X0, greatest_lower_bound(X1, X2)) = greatest_lower_bound(greatest_lower_bound(X0, X1), X2).
% 0.63/0.86 Proof: Axiom.
% 0.63/0.86
% 0.63/0.86 15: greatest_lower_bound(a(), b()) = a().
% 0.63/0.86 Proof: Axiom.
% 0.63/0.86
% 0.63/0.86 16: greatest_lower_bound(b(), c()) = b().
% 0.63/0.86 Proof: Axiom.
% 0.63/0.86
% 0.63/0.86 17: greatest_lower_bound(b(), a()) = a().
% 0.63/0.86 Proof: Rewrite equation 15,
% 0.63/0.86 lhs with equations [3]
% 0.63/0.86 rhs with equations [].
% 0.63/0.86
% 0.63/0.86 18: greatest_lower_bound(c(), b()) = b().
% 0.63/0.86 Proof: Rewrite equation 16,
% 0.63/0.86 lhs with equations [3]
% 0.63/0.86 rhs with equations [].
% 0.63/0.86
% 0.63/0.86 25: greatest_lower_bound(c(), greatest_lower_bound(b(), X2)) = greatest_lower_bound(b(), X2).
% 0.63/0.86 Proof: A critical pair between equations 5 and 18.
% 0.63/0.86
% 0.63/0.86 35: greatest_lower_bound(b(), a()) = greatest_lower_bound(c(), a()).
% 0.63/0.86 Proof: A critical pair between equations 25 and 17.
% 0.63/0.86
% 0.63/0.86 47: a() = greatest_lower_bound(a(), c()).
% 0.63/0.86 Proof: Rewrite equation 35,
% 0.63/0.86 lhs with equations [17]
% 0.63/0.86 rhs with equations [3].
% 0.63/0.86
% 0.63/0.86 55: greatest_lower_bound(a(), c()) = a().
% 0.63/0.86 Proof: Rewrite lhs with equations [47]
% 0.63/0.86 rhs with equations [].
% 0.63/0.86
% 0.63/0.86 % SZS output end Proof
%------------------------------------------------------------------------------