TSTP Solution File: GRP521-1 by Twee---2.4.2
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Twee---2.4.2
% Problem : GRP521-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 : 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:18:45 EDT 2023
% Result : Unsatisfiable 0.13s 0.37s
% Output : Proof 0.20s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : GRP521-1 : TPTP v8.1.2. Released v2.6.0.
% 0.11/0.14 % Command : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 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 : Mon Aug 28 20:31:38 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.13/0.37 Command-line arguments: --no-flatten-goal
% 0.13/0.37
% 0.13/0.37 % SZS status Unsatisfiable
% 0.13/0.37
% 0.20/0.38 % SZS output start Proof
% 0.20/0.38 Axiom 1 (inverse): inverse(X) = divide(divide(Y, Y), X).
% 0.20/0.38 Axiom 2 (multiply): multiply(X, Y) = divide(X, divide(divide(Z, Z), Y)).
% 0.20/0.38 Axiom 3 (single_axiom): divide(X, divide(Y, divide(Z, divide(X, Y)))) = Z.
% 0.20/0.38
% 0.20/0.38 Lemma 4: divide(X, inverse(Y)) = multiply(X, Y).
% 0.20/0.38 Proof:
% 0.20/0.38 divide(X, inverse(Y))
% 0.20/0.38 = { by axiom 1 (inverse) }
% 0.20/0.38 divide(X, divide(divide(Z, Z), Y))
% 0.20/0.38 = { by axiom 2 (multiply) R->L }
% 0.20/0.38 multiply(X, Y)
% 0.20/0.38
% 0.20/0.38 Lemma 5: inverse(divide(X, multiply(Y, X))) = Y.
% 0.20/0.38 Proof:
% 0.20/0.38 inverse(divide(X, multiply(Y, X)))
% 0.20/0.38 = { by lemma 4 R->L }
% 0.20/0.38 inverse(divide(X, divide(Y, inverse(X))))
% 0.20/0.38 = { by axiom 1 (inverse) }
% 0.20/0.38 inverse(divide(X, divide(Y, divide(divide(Z, Z), X))))
% 0.20/0.38 = { by axiom 1 (inverse) }
% 0.20/0.38 divide(divide(Z, Z), divide(X, divide(Y, divide(divide(Z, Z), X))))
% 0.20/0.38 = { by axiom 3 (single_axiom) }
% 0.20/0.38 Y
% 0.20/0.38
% 0.20/0.38 Lemma 6: multiply(divide(X, X), Y) = inverse(inverse(Y)).
% 0.20/0.38 Proof:
% 0.20/0.38 multiply(divide(X, X), Y)
% 0.20/0.38 = { by lemma 4 R->L }
% 0.20/0.38 divide(divide(X, X), inverse(Y))
% 0.20/0.38 = { by axiom 1 (inverse) R->L }
% 0.20/0.38 inverse(inverse(Y))
% 0.20/0.38
% 0.20/0.38 Lemma 7: multiply(inverse(X), X) = divide(Y, Y).
% 0.20/0.38 Proof:
% 0.20/0.38 multiply(inverse(X), X)
% 0.20/0.38 = { by lemma 4 R->L }
% 0.20/0.38 divide(inverse(X), inverse(X))
% 0.20/0.38 = { by lemma 5 R->L }
% 0.20/0.38 inverse(divide(Z, multiply(divide(inverse(X), inverse(X)), Z)))
% 0.20/0.38 = { by lemma 6 }
% 0.20/0.38 inverse(divide(Z, inverse(inverse(Z))))
% 0.20/0.38 = { by lemma 6 R->L }
% 0.20/0.38 inverse(divide(Z, multiply(divide(Y, Y), Z)))
% 0.20/0.38 = { by lemma 5 }
% 0.20/0.38 divide(Y, Y)
% 0.20/0.38
% 0.20/0.38 Goal 1 (prove_these_axioms_1): multiply(inverse(a1), a1) = multiply(inverse(b1), b1).
% 0.20/0.38 Proof:
% 0.20/0.38 multiply(inverse(a1), a1)
% 0.20/0.38 = { by lemma 7 }
% 0.20/0.38 divide(X, X)
% 0.20/0.38 = { by lemma 7 R->L }
% 0.20/0.38 multiply(inverse(b1), b1)
% 0.20/0.38 % SZS output end Proof
% 0.20/0.38
% 0.20/0.38 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------