TSTP Solution File: RNG021-7 by Toma---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Toma---0.4
% Problem : RNG021-7 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : toma --casc %s
% Computer : n013.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 13:58:10 EDT 2023
% Result : Unsatisfiable 0.66s 0.99s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : RNG021-7 : TPTP v8.1.2. Released v1.0.0.
% 0.11/0.16 % Command : toma --casc %s
% 0.13/0.39 % Computer : n013.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8042.1875MB
% 0.13/0.39 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Sun Aug 27 02:22:32 EDT 2023
% 0.13/0.39 % CPUTime :
% 0.66/0.99 % SZS status Unsatisfiable
% 0.66/0.99 % SZS output start Proof
% 0.66/0.99 original problem:
% 0.66/0.99 axioms:
% 0.66/0.99 add(additive_identity(), X) = X
% 0.66/0.99 add(X, additive_identity()) = X
% 0.66/0.99 multiply(additive_identity(), X) = additive_identity()
% 0.66/0.99 multiply(X, additive_identity()) = additive_identity()
% 0.66/0.99 add(additive_inverse(X), X) = additive_identity()
% 0.66/0.99 add(X, additive_inverse(X)) = additive_identity()
% 0.66/0.99 additive_inverse(additive_inverse(X)) = X
% 0.66/0.99 multiply(X, add(Y, Z)) = add(multiply(X, Y), multiply(X, Z))
% 0.66/0.99 multiply(add(X, Y), Z) = add(multiply(X, Z), multiply(Y, Z))
% 0.66/0.99 add(X, Y) = add(Y, X)
% 0.66/0.99 add(X, add(Y, Z)) = add(add(X, Y), Z)
% 0.66/0.99 multiply(multiply(X, Y), Y) = multiply(X, multiply(Y, Y))
% 0.66/0.99 multiply(multiply(X, X), Y) = multiply(X, multiply(X, Y))
% 0.66/0.99 associator(X, Y, Z) = add(multiply(multiply(X, Y), Z), additive_inverse(multiply(X, multiply(Y, Z))))
% 0.66/0.99 commutator(X, Y) = add(multiply(Y, X), additive_inverse(multiply(X, Y)))
% 0.66/0.99 multiply(additive_inverse(X), additive_inverse(Y)) = multiply(X, Y)
% 0.66/0.99 multiply(additive_inverse(X), Y) = additive_inverse(multiply(X, Y))
% 0.66/0.99 multiply(X, additive_inverse(Y)) = additive_inverse(multiply(X, Y))
% 0.66/0.99 multiply(X, add(Y, additive_inverse(Z))) = add(multiply(X, Y), additive_inverse(multiply(X, Z)))
% 0.66/0.99 multiply(add(X, additive_inverse(Y)), Z) = add(multiply(X, Z), additive_inverse(multiply(Y, Z)))
% 0.66/0.99 multiply(additive_inverse(X), add(Y, Z)) = add(additive_inverse(multiply(X, Y)), additive_inverse(multiply(X, Z)))
% 0.66/0.99 multiply(add(X, Y), additive_inverse(Z)) = add(additive_inverse(multiply(X, Z)), additive_inverse(multiply(Y, Z)))
% 0.66/0.99 goal:
% 0.66/0.99 associator(add(u(), v()), x(), y()) != add(associator(u(), x(), y()), associator(v(), x(), y()))
% 0.66/0.99 To show the unsatisfiability of the original goal,
% 0.66/0.99 it suffices to show that associator(add(u(), v()), x(), y()) = add(associator(u(), x(), y()), associator(v(), x(), y())) (skolemized goal) is valid under the axioms.
% 0.66/0.99 Here is an equational proof:
% 0.66/0.99 8: multiply(add(X0, X1), X2) = add(multiply(X0, X2), multiply(X1, X2)).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 9: add(X0, X1) = add(X1, X0).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 10: add(X0, add(X1, X2)) = add(add(X0, X1), X2).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 13: associator(X0, X1, X2) = add(multiply(multiply(X0, X1), X2), additive_inverse(multiply(X0, multiply(X1, X2)))).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 16: multiply(additive_inverse(X0), X1) = additive_inverse(multiply(X0, X1)).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 17: multiply(X0, additive_inverse(X1)) = additive_inverse(multiply(X0, X1)).
% 0.66/0.99 Proof: Axiom.
% 0.66/0.99
% 0.66/0.99 22: associator(X0, X1, X2) = add(multiply(multiply(X0, X1), X2), multiply(additive_inverse(X0), multiply(X1, X2))).
% 0.66/0.99 Proof: Rewrite equation 13,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [16].
% 0.66/0.99
% 0.66/0.99 24: multiply(additive_inverse(X0), X1) = multiply(X0, additive_inverse(X1)).
% 0.66/0.99 Proof: Rewrite equation 16,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [17].
% 0.66/0.99
% 0.66/0.99 36: add(X3, add(X4, X2)) = add(add(X4, X3), X2).
% 0.66/0.99 Proof: A critical pair between equations 10 and 9.
% 0.66/0.99
% 0.66/0.99 39: add(X3, add(X4, X2)) = add(X4, add(X3, X2)).
% 0.66/0.99 Proof: Rewrite equation 36,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [10].
% 0.66/0.99
% 0.66/0.99 42: associator(X0, X1, X2) = add(additive_inverse(multiply(X0, multiply(X1, X2))), multiply(multiply(X0, X1), X2)).
% 0.66/0.99 Proof: Rewrite equation 22,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [24,17,9].
% 0.66/0.99
% 0.66/0.99 43: multiply(additive_inverse(X0), X1) = additive_inverse(multiply(X0, X1)).
% 0.66/0.99 Proof: Rewrite equation 24,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [17].
% 0.66/0.99
% 0.66/0.99 58: multiply(additive_inverse(X0), X1) = multiply(X0, additive_inverse(X1)).
% 0.66/0.99 Proof: Rewrite equation 43,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [17].
% 0.66/0.99
% 0.66/0.99 59: associator(X0, X1, X2) = add(multiply(X0, multiply(X1, additive_inverse(X2))), multiply(multiply(X0, X1), X2)).
% 0.66/0.99 Proof: Rewrite equation 42,
% 0.66/0.99 lhs with equations []
% 0.66/0.99 rhs with equations [17,17].
% 0.66/0.99
% 0.66/0.99 66: associator(add(u(), v()), x(), y()) = add(associator(u(), x(), y()), associator(v(), x(), y())).
% 0.66/0.99 Proof: Rewrite lhs with equations [59,58,8,8,8,10,39,9,39,39]
% 0.66/0.99 rhs with equations [59,58,9,59,58,9,10,39].
% 0.66/0.99
% 0.66/0.99 % SZS output end Proof
%------------------------------------------------------------------------------