TSTP Solution File: RNG008-4 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : RNG008-4 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% Computer : n016.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:46 EDT 2023
% Result : Unsatisfiable 0.20s 0.40s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : RNG008-4 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.17/0.34 % Computer : n016.cluster.edu
% 0.17/0.34 % Model : x86_64 x86_64
% 0.17/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34 % Memory : 8042.1875MB
% 0.17/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34 % CPULimit : 300
% 0.17/0.34 % WCLimit : 300
% 0.17/0.34 % DateTime : Sun Aug 27 02:42:58 EDT 2023
% 0.17/0.34 % CPUTime :
% 0.20/0.40 Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.20/0.40
% 0.20/0.40 % SZS status Unsatisfiable
% 0.20/0.40
% 0.20/0.41 % SZS output start Proof
% 0.20/0.41 Axiom 1 (boolean_ring): multiply(X, X) = X.
% 0.20/0.41 Axiom 2 (a_times_b_is_c): multiply(a, b) = c.
% 0.20/0.41 Axiom 3 (commutative_addition): add(X, Y) = add(Y, X).
% 0.20/0.41 Axiom 4 (left_identity): add(additive_identity, X) = X.
% 0.20/0.41 Axiom 5 (additive_inverse_additive_inverse): additive_inverse(additive_inverse(X)) = X.
% 0.20/0.41 Axiom 6 (left_additive_inverse): add(additive_inverse(X), X) = additive_identity.
% 0.20/0.41 Axiom 7 (multiply_additive_inverse1): multiply(X, additive_inverse(Y)) = additive_inverse(multiply(X, Y)).
% 0.20/0.41 Axiom 8 (multiply_additive_inverse2): multiply(additive_inverse(X), Y) = additive_inverse(multiply(X, Y)).
% 0.20/0.41 Axiom 9 (associative_addition): add(add(X, Y), Z) = add(X, add(Y, Z)).
% 0.20/0.41 Axiom 10 (distribute1): multiply(X, add(Y, Z)) = add(multiply(X, Y), multiply(X, Z)).
% 0.20/0.41 Axiom 11 (distribute2): multiply(add(X, Y), Z) = add(multiply(X, Z), multiply(Y, Z)).
% 0.20/0.41
% 0.20/0.41 Lemma 12: add(X, X) = additive_identity.
% 0.20/0.41 Proof:
% 0.20/0.41 add(X, X)
% 0.20/0.41 = { by axiom 1 (boolean_ring) R->L }
% 0.20/0.41 add(X, multiply(X, X))
% 0.20/0.41 = { by axiom 5 (additive_inverse_additive_inverse) R->L }
% 0.20/0.41 add(X, multiply(X, additive_inverse(additive_inverse(X))))
% 0.20/0.41 = { by axiom 7 (multiply_additive_inverse1) }
% 0.20/0.41 add(X, additive_inverse(multiply(X, additive_inverse(X))))
% 0.20/0.41 = { by axiom 8 (multiply_additive_inverse2) R->L }
% 0.20/0.41 add(X, multiply(additive_inverse(X), additive_inverse(X)))
% 0.20/0.41 = { by axiom 1 (boolean_ring) }
% 0.20/0.41 add(X, additive_inverse(X))
% 0.20/0.41 = { by axiom 3 (commutative_addition) R->L }
% 0.20/0.41 add(additive_inverse(X), X)
% 0.20/0.41 = { by axiom 6 (left_additive_inverse) }
% 0.20/0.41 additive_identity
% 0.20/0.41
% 0.20/0.41 Lemma 13: add(X, add(X, Y)) = Y.
% 0.20/0.41 Proof:
% 0.20/0.41 add(X, add(X, Y))
% 0.20/0.41 = { by axiom 9 (associative_addition) R->L }
% 0.20/0.41 add(add(X, X), Y)
% 0.20/0.41 = { by lemma 12 }
% 0.20/0.41 add(additive_identity, Y)
% 0.20/0.41 = { by axiom 4 (left_identity) }
% 0.20/0.41 Y
% 0.20/0.41
% 0.20/0.41 Lemma 14: add(X, multiply(X, Y)) = multiply(X, add(X, Y)).
% 0.20/0.41 Proof:
% 0.20/0.41 add(X, multiply(X, Y))
% 0.20/0.41 = { by axiom 1 (boolean_ring) R->L }
% 0.20/0.41 add(multiply(X, X), multiply(X, Y))
% 0.20/0.41 = { by axiom 10 (distribute1) R->L }
% 0.20/0.41 multiply(X, add(X, Y))
% 0.20/0.41
% 0.20/0.41 Goal 1 (prove_commutativity): multiply(b, a) = c.
% 0.20/0.41 Proof:
% 0.20/0.41 multiply(b, a)
% 0.20/0.41 = { by lemma 13 R->L }
% 0.20/0.41 add(a, add(a, multiply(b, a)))
% 0.20/0.41 = { by lemma 13 R->L }
% 0.20/0.41 add(a, add(a, add(b, add(b, multiply(b, a)))))
% 0.20/0.41 = { by axiom 9 (associative_addition) R->L }
% 0.20/0.41 add(a, add(add(a, b), add(b, multiply(b, a))))
% 0.20/0.41 = { by lemma 14 }
% 0.20/0.41 add(a, add(add(a, b), multiply(b, add(b, a))))
% 0.20/0.41 = { by axiom 3 (commutative_addition) }
% 0.20/0.41 add(a, add(add(a, b), multiply(b, add(a, b))))
% 0.20/0.41 = { by axiom 1 (boolean_ring) R->L }
% 0.20/0.41 add(a, add(multiply(add(a, b), add(a, b)), multiply(b, add(a, b))))
% 0.20/0.41 = { by axiom 11 (distribute2) R->L }
% 0.20/0.41 add(a, multiply(add(add(a, b), b), add(a, b)))
% 0.20/0.41 = { by axiom 9 (associative_addition) }
% 0.20/0.41 add(a, multiply(add(a, add(b, b)), add(a, b)))
% 0.20/0.41 = { by lemma 12 }
% 0.20/0.41 add(a, multiply(add(a, additive_identity), add(a, b)))
% 0.20/0.41 = { by axiom 3 (commutative_addition) R->L }
% 0.20/0.41 add(a, multiply(add(additive_identity, a), add(a, b)))
% 0.20/0.41 = { by axiom 4 (left_identity) }
% 0.20/0.41 add(a, multiply(a, add(a, b)))
% 0.20/0.41 = { by lemma 14 R->L }
% 0.20/0.41 add(a, add(a, multiply(a, b)))
% 0.20/0.41 = { by axiom 2 (a_times_b_is_c) }
% 0.20/0.41 add(a, add(a, c))
% 0.20/0.41 = { by lemma 13 }
% 0.20/0.41 c
% 0.20/0.41 % SZS output end Proof
% 0.20/0.41
% 0.20/0.41 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------