%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP657-10 : TPTP v8.1.2. Released v8.1.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 : n017.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:19:30 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : GRP657-10 : TPTP v8.1.2. Released v8.1.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.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 300
% 0.12/0.34  % DateTime : Tue Aug 29 01:47:28 EDT 2023
% 0.12/0.34  % CPUTime  : 
% 0.19/0.38  Command-line arguments: --lhs-weight 9 --flip-ordering --complete-subsets --normalise-queue-percent 10 --cp-renormalise-threshold 10
% 0.19/0.38  
% 0.19/0.38  % SZS status Unsatisfiable
% 0.19/0.38  
% 0.19/0.38  % SZS output start Proof
% 0.19/0.38  Axiom 1 (f01): mult(X, ld(X, Y)) = Y.
% 0.19/0.38  Axiom 2 (f02): ld(X, mult(X, Y)) = Y.
% 0.19/0.38  Axiom 3 (f04): rd(mult(X, Y), Y) = X.
% 0.19/0.38  Axiom 4 (f05): mult(mult(X, Y), mult(Z, X)) = mult(X, mult(mult(Y, Z), X)).
% 0.19/0.38  
% 0.19/0.38  Lemma 5: mult(ld(X, X), Y) = Y.
% 0.19/0.38  Proof:
% 0.19/0.38    mult(ld(X, X), Y)
% 0.19/0.39  = { by axiom 3 (f04) R->L }
% 0.19/0.39    rd(mult(mult(ld(X, X), Y), X), X)
% 0.19/0.39  = { by axiom 2 (f02) R->L }
% 0.19/0.39    rd(ld(X, mult(X, mult(mult(ld(X, X), Y), X))), X)
% 0.19/0.39  = { by axiom 4 (f05) R->L }
% 0.19/0.39    rd(ld(X, mult(mult(X, ld(X, X)), mult(Y, X))), X)
% 0.19/0.39  = { by axiom 1 (f01) }
% 0.19/0.39    rd(ld(X, mult(X, mult(Y, X))), X)
% 0.19/0.39  = { by axiom 2 (f02) }
% 0.19/0.39    rd(mult(Y, X), X)
% 0.19/0.39  = { by axiom 3 (f04) }
% 0.19/0.39    Y
% 0.19/0.39  
% 0.19/0.39  Goal 1 (goal): tuple(mult(X, x1(X)), mult(x1_2(X), X)) = tuple(x1(X), x1_2(X)).
% 0.19/0.39  The goal is true when:
% 0.19/0.39    X = ld(X, X)
% 0.19/0.39  
% 0.19/0.39  Proof:
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), mult(x1_2(ld(X, X)), ld(X, X)))
% 0.19/0.39  = { by axiom 3 (f04) R->L }
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), mult(x1_2(ld(X, X)), rd(mult(ld(X, X), Y), Y)))
% 0.19/0.39  = { by lemma 5 }
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), mult(x1_2(ld(X, X)), rd(Y, Y)))
% 0.19/0.39  = { by lemma 5 R->L }
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), mult(x1_2(ld(X, X)), rd(mult(ld(x1_2(ld(X, X)), x1_2(ld(X, X))), Y), Y)))
% 0.19/0.39  = { by axiom 3 (f04) }
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), mult(x1_2(ld(X, X)), ld(x1_2(ld(X, X)), x1_2(ld(X, X)))))
% 0.19/0.39  = { by axiom 1 (f01) }
% 0.19/0.39    tuple(mult(ld(X, X), x1(ld(X, X))), x1_2(ld(X, X)))
% 0.19/0.39  = { by lemma 5 }
% 0.19/0.39    tuple(x1(ld(X, X)), x1_2(ld(X, X)))
% 0.19/0.39  % SZS output end Proof
% 0.19/0.39  
% 0.19/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------