%------------------------------------------------------------------------------
% File : Twee---2.7
% Problem : GRP089-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 10:09:14 AM UTC 2026
% Result : Unsatisfiable 0.41s 0.52s
% Output : Proof 0.41s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP089-1 : TPTP v9.3.1. Bugfixed v2.7.0.
% 0.00/0.03 % Command : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35 % Computer : n010.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 27 09:18:46 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.41/0.52 Command-line arguments: --no-flatten-goal
% 0.41/0.52
% 0.41/0.52 % SZS status Unsatisfiable
% 0.41/0.52
% 0.41/0.54 % SZS output start Proof
% 0.41/0.54 Axiom 1 (inverse): inverse(X) = divide(divide(Y, Y), X).
% 0.41/0.54 Axiom 2 (multiply): multiply(X, Y) = divide(X, divide(divide(Z, Z), Y)).
% 0.41/0.55 Axiom 3 (single_axiom): divide(X, divide(divide(X, Y), divide(Z, Y))) = Z.
% 0.41/0.55
% 0.41/0.55 Lemma 4: divide(X, inverse(divide(Y, X))) = Y.
% 0.41/0.55 Proof:
% 0.41/0.55 divide(X, inverse(divide(Y, X)))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(X, divide(divide(X, X), divide(Y, X)))
% 0.41/0.55 = { by axiom 3 (single_axiom) }
% 0.41/0.55 Y
% 0.41/0.55
% 0.41/0.55 Lemma 5: divide(Y, Y) = divide(X, X).
% 0.41/0.55 Proof:
% 0.41/0.55 divide(Y, Y)
% 0.41/0.55 = { by lemma 4 R->L }
% 0.41/0.55 divide(Z, inverse(divide(divide(Y, Y), Z)))
% 0.41/0.55 = { by axiom 1 (inverse) R->L }
% 0.41/0.55 divide(Z, inverse(inverse(Z)))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(Z, inverse(divide(divide(X, X), Z)))
% 0.41/0.55 = { by lemma 4 }
% 0.41/0.55 divide(X, X)
% 0.41/0.55
% 0.41/0.55 Lemma 6: multiply(X, Y) = divide(X, inverse(Y)).
% 0.41/0.55 Proof:
% 0.41/0.55 multiply(X, Y)
% 0.41/0.55 = { by axiom 2 (multiply) }
% 0.41/0.55 divide(X, divide(divide(Z, Z), Y))
% 0.41/0.55 = { by axiom 1 (inverse) R->L }
% 0.41/0.55 divide(X, inverse(Y))
% 0.41/0.55
% 0.41/0.55 Lemma 7: divide(X, divide(Y, Y)) = X.
% 0.41/0.55 Proof:
% 0.41/0.55 divide(X, divide(Y, Y))
% 0.41/0.55 = { by lemma 5 }
% 0.41/0.55 divide(X, divide(divide(X, Z), divide(X, Z)))
% 0.41/0.55 = { by axiom 3 (single_axiom) }
% 0.41/0.55 X
% 0.41/0.55
% 0.41/0.55 Lemma 8: divide(divide(X, X), inverse(Y)) = Y.
% 0.41/0.55 Proof:
% 0.41/0.55 divide(divide(X, X), inverse(Y))
% 0.41/0.55 = { by lemma 7 R->L }
% 0.41/0.55 divide(divide(X, X), inverse(divide(Y, divide(X, X))))
% 0.41/0.55 = { by lemma 4 }
% 0.41/0.55 Y
% 0.41/0.55
% 0.41/0.55 Lemma 9: inverse(inverse(X)) = X.
% 0.41/0.55 Proof:
% 0.41/0.55 inverse(inverse(X))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(divide(Y, Y), inverse(X))
% 0.41/0.55 = { by lemma 8 }
% 0.41/0.55 X
% 0.41/0.55
% 0.41/0.55 Lemma 10: inverse(divide(X, Y)) = divide(Y, X).
% 0.41/0.55 Proof:
% 0.41/0.55 inverse(divide(X, Y))
% 0.41/0.55 = { by axiom 3 (single_axiom) R->L }
% 0.41/0.55 divide(Y, divide(divide(Y, divide(Z, Z)), divide(inverse(divide(X, Y)), divide(Z, Z))))
% 0.41/0.55 = { by lemma 7 }
% 0.41/0.55 divide(Y, divide(Y, divide(inverse(divide(X, Y)), divide(Z, Z))))
% 0.41/0.55 = { by lemma 7 }
% 0.41/0.55 divide(Y, divide(Y, inverse(divide(X, Y))))
% 0.41/0.55 = { by lemma 4 }
% 0.41/0.55 divide(Y, X)
% 0.41/0.55
% 0.41/0.55 Lemma 11: divide(divide(X, Y), inverse(Y)) = X.
% 0.41/0.55 Proof:
% 0.41/0.55 divide(divide(X, Y), inverse(Y))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(divide(X, Y), divide(divide(Z, Z), Y))
% 0.41/0.55 = { by lemma 10 R->L }
% 0.41/0.55 inverse(divide(divide(divide(Z, Z), Y), divide(X, Y)))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(divide(Z, Z), divide(divide(divide(Z, Z), Y), divide(X, Y)))
% 0.41/0.55 = { by axiom 3 (single_axiom) }
% 0.41/0.55 X
% 0.41/0.55
% 0.41/0.55 Lemma 12: divide(inverse(Y), inverse(X)) = divide(X, Y).
% 0.41/0.55 Proof:
% 0.41/0.55 divide(inverse(Y), inverse(X))
% 0.41/0.55 = { by lemma 11 R->L }
% 0.41/0.55 divide(inverse(Y), inverse(divide(divide(X, Y), inverse(Y))))
% 0.41/0.55 = { by lemma 4 }
% 0.41/0.55 divide(X, Y)
% 0.41/0.55
% 0.41/0.55 Lemma 13: divide(inverse(X), divide(inverse(Y), divide(X, Z))) = divide(Y, Z).
% 0.41/0.55 Proof:
% 0.41/0.55 divide(inverse(X), divide(inverse(Y), divide(X, Z)))
% 0.41/0.55 = { by lemma 10 R->L }
% 0.41/0.55 divide(inverse(X), divide(inverse(Y), inverse(divide(Z, X))))
% 0.41/0.55 = { by lemma 12 }
% 0.41/0.55 divide(inverse(X), divide(divide(Z, X), Y))
% 0.41/0.55 = { by lemma 10 R->L }
% 0.41/0.55 divide(inverse(X), inverse(divide(Y, divide(Z, X))))
% 0.41/0.55 = { by lemma 12 }
% 0.41/0.55 divide(divide(Y, divide(Z, X)), X)
% 0.41/0.55 = { by axiom 3 (single_axiom) R->L }
% 0.41/0.55 divide(Y, divide(divide(Y, divide(Z, X)), divide(divide(divide(Y, divide(Z, X)), X), divide(Z, X))))
% 0.41/0.55 = { by axiom 3 (single_axiom) }
% 0.41/0.55 divide(Y, Z)
% 0.41/0.55
% 0.41/0.55 Lemma 14: divide(Y, inverse(X)) = divide(X, inverse(Y)).
% 0.41/0.55 Proof:
% 0.41/0.55 divide(Y, inverse(X))
% 0.41/0.55 = { by lemma 10 R->L }
% 0.41/0.55 inverse(divide(inverse(X), Y))
% 0.41/0.55 = { by axiom 1 (inverse) }
% 0.41/0.55 divide(divide(divide(Z, Z), divide(Z, Z)), divide(inverse(X), Y))
% 0.41/0.55 = { by axiom 1 (inverse) R->L }
% 0.41/0.55 divide(inverse(divide(Z, Z)), divide(inverse(X), Y))
% 0.41/0.55 = { by lemma 8 R->L }
% 0.41/0.55 divide(inverse(divide(Z, Z)), divide(inverse(X), divide(divide(Z, Z), inverse(Y))))
% 0.41/0.55 = { by lemma 13 }
% 0.41/0.56 divide(X, inverse(Y))
% 0.41/0.56
% 0.41/0.56 Lemma 15: divide(inverse(Y), divide(inverse(X), Z)) = divide(X, divide(Y, Z)).
% 0.41/0.56 Proof:
% 0.41/0.56 divide(inverse(Y), divide(inverse(X), Z))
% 0.41/0.56 = { by lemma 10 R->L }
% 0.41/0.56 divide(inverse(Y), inverse(divide(Z, inverse(X))))
% 0.41/0.56 = { by lemma 12 }
% 0.41/0.56 divide(divide(Z, inverse(X)), Y)
% 0.41/0.56 = { by lemma 10 R->L }
% 0.41/0.56 divide(inverse(divide(inverse(X), Z)), Y)
% 0.41/0.56 = { by axiom 3 (single_axiom) R->L }
% 0.41/0.56 divide(inverse(divide(inverse(X), Z)), divide(inverse(X), divide(divide(inverse(X), Z), divide(Y, Z))))
% 0.41/0.56 = { by lemma 13 }
% 0.41/0.56 divide(X, divide(Y, Z))
% 0.41/0.56
% 0.41/0.56 Lemma 16: divide(divide(X, Y), Z) = divide(X, divide(Y, inverse(Z))).
% 0.41/0.56 Proof:
% 0.41/0.56 divide(divide(X, Y), Z)
% 0.41/0.56 = { by lemma 12 R->L }
% 0.41/0.56 divide(divide(inverse(Y), inverse(X)), Z)
% 0.41/0.56 = { by lemma 9 R->L }
% 0.41/0.56 divide(divide(inverse(Y), inverse(X)), inverse(inverse(Z)))
% 0.41/0.56 = { by lemma 10 R->L }
% 0.41/0.56 divide(inverse(divide(inverse(X), inverse(Y))), inverse(inverse(Z)))
% 0.41/0.56 = { by lemma 12 }
% 0.41/0.56 divide(inverse(Z), divide(inverse(X), inverse(Y)))
% 0.41/0.56 = { by lemma 15 }
% 0.41/0.56 divide(X, divide(Z, inverse(Y)))
% 0.41/0.56 = { by lemma 14 R->L }
% 0.41/0.56 divide(X, divide(Y, inverse(Z)))
% 0.41/0.56
% 0.41/0.56 Lemma 17: divide(inverse(Y), divide(Z, X)) = divide(X, divide(Y, inverse(Z))).
% 0.41/0.56 Proof:
% 0.41/0.56 divide(inverse(Y), divide(Z, X))
% 0.41/0.56 = { by lemma 12 R->L }
% 0.41/0.56 divide(inverse(Y), divide(inverse(X), inverse(Z)))
% 0.41/0.56 = { by lemma 15 }
% 0.41/0.56 divide(X, divide(Y, inverse(Z)))
% 0.41/0.56
% 0.41/0.56 Goal 1 (prove_these_axioms): tuple(multiply(multiply(inverse(b2), b2), a2), multiply(multiply(a3, b3), c3), multiply(inverse(a1), a1), multiply(a4, b4)) = tuple(a2, multiply(a3, multiply(b3, c3)), multiply(inverse(b1), b1), multiply(b4, a4)).
% 0.41/0.56 Proof:
% 0.41/0.56 tuple(multiply(multiply(inverse(b2), b2), a2), multiply(multiply(a3, b3), c3), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(multiply(divide(inverse(b2), inverse(b2)), a2), multiply(multiply(a3, b3), c3), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(divide(divide(inverse(b2), inverse(b2)), inverse(a2)), multiply(multiply(a3, b3), c3), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by axiom 1 (inverse) R->L }
% 0.41/0.56 tuple(inverse(inverse(a2)), multiply(multiply(a3, b3), c3), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(inverse(inverse(a2)), multiply(divide(a3, inverse(b3)), c3), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(inverse(inverse(a2)), divide(divide(a3, inverse(b3)), inverse(c3)), multiply(inverse(a1), a1), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(inverse(inverse(a2)), divide(divide(a3, inverse(b3)), inverse(c3)), divide(inverse(a1), inverse(a1)), multiply(a4, b4))
% 0.41/0.56 = { by lemma 6 }
% 0.41/0.56 tuple(inverse(inverse(a2)), divide(divide(a3, inverse(b3)), inverse(c3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 }
% 0.41/0.56 tuple(a2, divide(divide(a3, inverse(b3)), inverse(c3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 12 R->L }
% 0.41/0.56 tuple(a2, divide(inverse(inverse(c3)), inverse(divide(a3, inverse(b3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 }
% 0.41/0.56 tuple(a2, divide(c3, inverse(divide(a3, inverse(b3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 10 }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(b3), a3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 12 R->L }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(a3), inverse(inverse(b3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(a3), b3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 11 R->L }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(a3), divide(divide(b3, inverse(X)), inverse(inverse(X))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 17 R->L }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(divide(b3, inverse(X))), divide(inverse(X), inverse(a3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 10 }
% 0.41/0.56 tuple(a2, divide(c3, divide(divide(inverse(X), b3), divide(inverse(X), inverse(a3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 16 }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(X), divide(b3, inverse(divide(inverse(X), inverse(a3)))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 10 }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(X), divide(b3, divide(inverse(a3), inverse(X))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 R->L }
% 0.41/0.56 tuple(a2, divide(c3, divide(inverse(X), divide(b3, inverse(inverse(divide(inverse(a3), inverse(X))))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 16 R->L }
% 0.41/0.56 tuple(a2, divide(c3, divide(divide(inverse(X), b3), inverse(divide(inverse(a3), inverse(X))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 16 R->L }
% 0.41/0.56 tuple(a2, divide(divide(c3, divide(inverse(X), b3)), divide(inverse(a3), inverse(X))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 12 }
% 0.41/0.56 tuple(a2, divide(divide(c3, divide(inverse(X), b3)), divide(X, a3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 15 R->L }
% 0.41/0.56 tuple(a2, divide(inverse(X), divide(inverse(divide(c3, divide(inverse(X), b3))), a3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 17 }
% 0.41/0.56 tuple(a2, divide(a3, divide(X, inverse(inverse(divide(c3, divide(inverse(X), b3)))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 }
% 0.41/0.56 tuple(a2, divide(a3, divide(X, divide(c3, divide(inverse(X), b3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 10 R->L }
% 0.41/0.56 tuple(a2, divide(a3, divide(X, divide(c3, inverse(divide(b3, inverse(X)))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 15 R->L }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(c3), divide(inverse(X), inverse(divide(b3, inverse(X)))))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 4 }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(c3), b3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 12 R->L }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(b3), inverse(inverse(c3)))), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 9 }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(b3), c3)), divide(inverse(a1), inverse(a1)), divide(a4, inverse(b4)))
% 0.41/0.56 = { by lemma 14 }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(b3), c3)), divide(inverse(a1), inverse(a1)), divide(b4, inverse(a4)))
% 0.41/0.56 = { by lemma 9 R->L }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(b3), inverse(inverse(c3)))), divide(inverse(a1), inverse(a1)), divide(b4, inverse(a4)))
% 0.41/0.56 = { by lemma 12 }
% 0.41/0.56 tuple(a2, divide(a3, divide(inverse(c3), b3)), divide(inverse(a1), inverse(a1)), divide(b4, inverse(a4)))
% 0.41/0.56 = { by lemma 10 R->L }
% 0.41/0.56 tuple(a2, divide(a3, inverse(divide(b3, inverse(c3)))), divide(inverse(a1), inverse(a1)), divide(b4, inverse(a4)))
% 0.41/0.56 = { by lemma 5 }
% 0.41/0.56 tuple(a2, divide(a3, inverse(divide(b3, inverse(c3)))), divide(inverse(b1), inverse(b1)), divide(b4, inverse(a4)))
% 0.41/0.56 = { by lemma 6 R->L }
% 0.41/0.56 tuple(a2, divide(a3, inverse(divide(b3, inverse(c3)))), divide(inverse(b1), inverse(b1)), multiply(b4, a4))
% 0.41/0.56 = { by lemma 6 R->L }
% 0.41/0.56 tuple(a2, divide(a3, inverse(divide(b3, inverse(c3)))), multiply(inverse(b1), b1), multiply(b4, a4))
% 0.41/0.56 = { by lemma 6 R->L }
% 0.41/0.56 tuple(a2, multiply(a3, divide(b3, inverse(c3))), multiply(inverse(b1), b1), multiply(b4, a4))
% 0.41/0.56 = { by lemma 6 R->L }
% 0.41/0.56 tuple(a2, multiply(a3, multiply(b3, c3)), multiply(inverse(b1), b1), multiply(b4, a4))
% 0.41/0.56 % SZS output end Proof
% 0.41/0.56
% 0.41/0.56 RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------