TSTP Solution File: GRP569-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP569-1 : TPTP v8.1.2. Released v2.6.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 : n004.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:18:57 EDT 2023
% Result : Unsatisfiable 0.20s 0.39s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP569-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon Aug 28 22:18:37 EDT 2023
% 0.13/0.35 % CPUTime :
% 0.20/0.39 Command-line arguments: --no-flatten-goal
% 0.20/0.39
% 0.20/0.39 % SZS status Unsatisfiable
% 0.20/0.39
% 0.20/0.40 % SZS output start Proof
% 0.20/0.40 Axiom 1 (inverse): inverse(X) = double_divide(X, identity).
% 0.20/0.40 Axiom 2 (identity): identity = double_divide(X, inverse(X)).
% 0.20/0.40 Axiom 3 (multiply): multiply(X, Y) = double_divide(double_divide(Y, X), identity).
% 0.20/0.40 Axiom 4 (single_axiom): double_divide(double_divide(X, double_divide(double_divide(Y, double_divide(X, Z)), double_divide(Z, identity))), double_divide(identity, identity)) = Y.
% 0.20/0.40
% 0.20/0.40 Lemma 5: inverse(double_divide(X, Y)) = multiply(Y, X).
% 0.20/0.40 Proof:
% 0.20/0.40 inverse(double_divide(X, Y))
% 0.20/0.40 = { by axiom 1 (inverse) }
% 0.20/0.40 double_divide(double_divide(X, Y), identity)
% 0.20/0.40 = { by axiom 3 (multiply) R->L }
% 0.20/0.40 multiply(Y, X)
% 0.20/0.40
% 0.20/0.40 Lemma 6: double_divide(double_divide(X, double_divide(double_divide(Y, inverse(X)), inverse(identity))), inverse(identity)) = Y.
% 0.20/0.40 Proof:
% 0.20/0.40 double_divide(double_divide(X, double_divide(double_divide(Y, inverse(X)), inverse(identity))), inverse(identity))
% 0.20/0.40 = { by axiom 1 (inverse) }
% 0.20/0.40 double_divide(double_divide(X, double_divide(double_divide(Y, double_divide(X, identity)), inverse(identity))), inverse(identity))
% 0.20/0.40 = { by axiom 1 (inverse) }
% 0.20/0.40 double_divide(double_divide(X, double_divide(double_divide(Y, double_divide(X, identity)), inverse(identity))), double_divide(identity, identity))
% 0.20/0.40 = { by axiom 1 (inverse) }
% 0.20/0.40 double_divide(double_divide(X, double_divide(double_divide(Y, double_divide(X, identity)), double_divide(identity, identity))), double_divide(identity, identity))
% 0.20/0.40 = { by axiom 4 (single_axiom) }
% 0.20/0.40 Y
% 0.20/0.40
% 0.20/0.40 Lemma 7: double_divide(inverse(X), inverse(identity)) = X.
% 0.20/0.40 Proof:
% 0.20/0.40 double_divide(inverse(X), inverse(identity))
% 0.20/0.40 = { by axiom 1 (inverse) }
% 0.20/0.40 double_divide(double_divide(X, identity), inverse(identity))
% 0.20/0.40 = { by axiom 2 (identity) }
% 0.20/0.40 double_divide(double_divide(X, double_divide(identity, inverse(identity))), inverse(identity))
% 0.20/0.40 = { by axiom 2 (identity) }
% 0.20/0.40 double_divide(double_divide(X, double_divide(double_divide(X, inverse(X)), inverse(identity))), inverse(identity))
% 0.20/0.40 = { by lemma 6 }
% 0.20/0.40 X
% 0.20/0.40
% 0.20/0.40 Lemma 8: double_divide(multiply(identity, X), inverse(identity)) = inverse(X).
% 0.20/0.40 Proof:
% 0.20/0.40 double_divide(multiply(identity, X), inverse(identity))
% 0.20/0.40 = { by lemma 5 R->L }
% 0.20/0.40 double_divide(inverse(double_divide(X, identity)), inverse(identity))
% 0.20/0.40 = { by axiom 1 (inverse) R->L }
% 0.20/0.40 double_divide(inverse(inverse(X)), inverse(identity))
% 0.20/0.40 = { by lemma 7 }
% 0.20/0.40 inverse(X)
% 0.20/0.40
% 0.20/0.40 Goal 1 (prove_these_axioms_1): multiply(inverse(a1), a1) = identity.
% 0.20/0.40 Proof:
% 0.20/0.40 multiply(inverse(a1), a1)
% 0.20/0.40 = { by lemma 5 R->L }
% 0.20/0.40 inverse(double_divide(a1, inverse(a1)))
% 0.20/0.40 = { by axiom 2 (identity) R->L }
% 0.20/0.40 inverse(identity)
% 0.20/0.40 = { by lemma 8 R->L }
% 0.20/0.40 double_divide(multiply(identity, identity), inverse(identity))
% 0.20/0.40 = { by lemma 6 R->L }
% 0.20/0.40 double_divide(double_divide(double_divide(identity, double_divide(double_divide(multiply(identity, identity), inverse(identity)), inverse(identity))), inverse(identity)), inverse(identity))
% 0.20/0.40 = { by lemma 8 }
% 0.20/0.40 double_divide(double_divide(double_divide(identity, double_divide(inverse(identity), inverse(identity))), inverse(identity)), inverse(identity))
% 0.20/0.40 = { by lemma 7 }
% 0.20/0.40 double_divide(double_divide(double_divide(identity, identity), inverse(identity)), inverse(identity))
% 0.20/0.40 = { by axiom 1 (inverse) R->L }
% 0.20/0.40 double_divide(double_divide(inverse(identity), inverse(identity)), inverse(identity))
% 0.20/0.40 = { by lemma 7 }
% 0.20/0.40 double_divide(identity, inverse(identity))
% 0.20/0.40 = { by axiom 2 (identity) R->L }
% 0.20/0.40 identity
% 0.20/0.40 % SZS output end Proof
% 0.20/0.40
% 0.20/0.40 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------