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