%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP530-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 : n021.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:48 EDT 2023

% Result   : Unsatisfiable 0.20s 0.38s
% Output   : Proof 0.20s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : GRP530-1 : TPTP v8.1.2. Released v2.6.0.
% 0.12/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 : n021.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 : Tue Aug 29 00:26:29 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.38  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.20/0.38  
% 0.20/0.38  % SZS status Unsatisfiable
% 0.20/0.38  
% 0.20/0.39  % SZS output start Proof
% 0.20/0.39  Axiom 1 (inverse): inverse(X) = divide(divide(Y, Y), X).
% 0.20/0.39  Axiom 2 (multiply): multiply(X, Y) = divide(X, divide(divide(Z, Z), Y)).
% 0.20/0.39  Axiom 3 (single_axiom): divide(divide(X, divide(Y, Z)), divide(X, Y)) = Z.
% 0.20/0.39  
% 0.20/0.39  Lemma 4: divide(X, inverse(Y)) = multiply(X, Y).
% 0.20/0.39  Proof:
% 0.20/0.39    divide(X, inverse(Y))
% 0.20/0.39  = { by axiom 1 (inverse) }
% 0.20/0.39    divide(X, divide(divide(Z, Z), Y))
% 0.20/0.39  = { by axiom 2 (multiply) R->L }
% 0.20/0.39    multiply(X, Y)
% 0.20/0.39  
% 0.20/0.39  Goal 1 (prove_these_axioms_2): multiply(multiply(inverse(b2), b2), a2) = a2.
% 0.20/0.39  Proof:
% 0.20/0.39    multiply(multiply(inverse(b2), b2), a2)
% 0.20/0.39  = { by lemma 4 R->L }
% 0.20/0.39    divide(multiply(inverse(b2), b2), inverse(a2))
% 0.20/0.39  = { by lemma 4 R->L }
% 0.20/0.39    divide(divide(inverse(b2), inverse(b2)), inverse(a2))
% 0.20/0.39  = { by axiom 1 (inverse) R->L }
% 0.20/0.39    inverse(inverse(a2))
% 0.20/0.39  = { by axiom 1 (inverse) }
% 0.20/0.39    inverse(divide(divide(a2, a2), a2))
% 0.20/0.39  = { by axiom 1 (inverse) }
% 0.20/0.39    divide(divide(divide(a2, a2), divide(a2, a2)), divide(divide(a2, a2), a2))
% 0.20/0.39  = { by axiom 3 (single_axiom) }
% 0.20/0.39    a2
% 0.20/0.39  % SZS output end Proof
% 0.20/0.39  
% 0.20/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------