TSTP Solution File: RNG023-7 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : RNG023-7 : TPTP v8.1.2. Released v1.0.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 : n022.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 13:58:51 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.00/0.12  % Problem  : RNG023-7 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.17/0.34  % Computer : n022.cluster.edu
% 0.17/0.34  % Model    : x86_64 x86_64
% 0.17/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.34  % Memory   : 8042.1875MB
% 0.17/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.17/0.34  % CPULimit : 300
% 0.17/0.34  % WCLimit  : 300
% 0.17/0.34  % DateTime : Sun Aug 27 03:09:10 EDT 2023
% 0.17/0.34  % CPUTime  : 
% 0.20/0.39  Command-line arguments: --set-join --lhs-weight 1 --no-flatten-goal --complete-subsets --goal-heuristic
% 0.20/0.39  
% 0.20/0.39  % SZS status Unsatisfiable
% 0.20/0.39  
% 0.20/0.39  % SZS output start Proof
% 0.20/0.39  Axiom 1 (right_multiplicative_zero): multiply(X, additive_identity) = additive_identity.
% 0.20/0.39  Axiom 2 (right_additive_inverse): add(X, additive_inverse(X)) = additive_identity.
% 0.20/0.39  Axiom 3 (left_alternative): multiply(multiply(X, X), Y) = multiply(X, multiply(X, Y)).
% 0.20/0.39  Axiom 4 (distributivity_of_difference1): multiply(X, add(Y, additive_inverse(Z))) = add(multiply(X, Y), additive_inverse(multiply(X, Z))).
% 0.20/0.39  Axiom 5 (associator): associator(X, Y, Z) = add(multiply(multiply(X, Y), Z), additive_inverse(multiply(X, multiply(Y, Z)))).
% 0.20/0.39  
% 0.20/0.39  Goal 1 (prove_left_alternative): associator(x, x, y) = additive_identity.
% 0.20/0.39  Proof:
% 0.20/0.39    associator(x, x, y)
% 0.20/0.39  = { by axiom 5 (associator) }
% 0.20/0.39    add(multiply(multiply(x, x), y), additive_inverse(multiply(x, multiply(x, y))))
% 0.20/0.39  = { by axiom 3 (left_alternative) }
% 0.20/0.39    add(multiply(x, multiply(x, y)), additive_inverse(multiply(x, multiply(x, y))))
% 0.20/0.39  = { by axiom 4 (distributivity_of_difference1) R->L }
% 0.20/0.39    multiply(x, add(multiply(x, y), additive_inverse(multiply(x, y))))
% 0.20/0.39  = { by axiom 4 (distributivity_of_difference1) R->L }
% 0.20/0.39    multiply(x, multiply(x, add(y, additive_inverse(y))))
% 0.20/0.39  = { by axiom 2 (right_additive_inverse) }
% 0.20/0.39    multiply(x, multiply(x, additive_identity))
% 0.20/0.39  = { by axiom 1 (right_multiplicative_zero) }
% 0.20/0.39    multiply(x, additive_identity)
% 0.20/0.39  = { by axiom 1 (right_multiplicative_zero) }
% 0.20/0.39    additive_identity
% 0.20/0.39  % SZS output end Proof
% 0.20/0.39  
% 0.20/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------