TSTP Solution File: GRP708-1 by Twee---2.4.2

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : GRP708-1 : TPTP v8.1.2. Released v4.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 : n014.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:50 EDT 2023

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : GRP708-1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/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 : n014.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 : Mon Aug 28 21:12:31 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.42  Command-line arguments: --no-flatten-goal
% 0.20/0.42  
% 0.20/0.42  % SZS status Unsatisfiable
% 0.20/0.42  
% 0.20/0.42  % SZS output start Proof
% 0.20/0.42  Axiom 1 (c06): mult(unit, X) = X.
% 0.20/0.42  Axiom 2 (c08): mult(op_c, X) = mult(X, op_c).
% 0.20/0.42  Axiom 3 (c02): ld(X, mult(X, Y)) = Y.
% 0.20/0.42  Axiom 4 (c07): mult(X, mult(Y, mult(X, Z))) = mult(mult(X, mult(Y, X)), Z).
% 0.20/0.42  Axiom 5 (c09): mult(mult(op_c, op_c), mult(X, Y)) = mult(mult(mult(op_c, op_c), X), Y).
% 0.20/0.42  
% 0.20/0.42  Lemma 6: mult(mult(X, X), Y) = mult(X, mult(X, Y)).
% 0.20/0.42  Proof:
% 0.20/0.42    mult(mult(X, X), Y)
% 0.20/0.42  = { by axiom 1 (c06) R->L }
% 0.20/0.42    mult(mult(X, mult(unit, X)), Y)
% 0.20/0.42  = { by axiom 4 (c07) R->L }
% 0.20/0.42    mult(X, mult(unit, mult(X, Y)))
% 0.20/0.42  = { by axiom 1 (c06) }
% 0.20/0.43    mult(X, mult(X, Y))
% 0.20/0.43  
% 0.20/0.43  Goal 1 (goals): mult(a, mult(b, op_c)) = mult(mult(a, b), op_c).
% 0.20/0.43  Proof:
% 0.20/0.43    mult(a, mult(b, op_c))
% 0.20/0.43  = { by axiom 3 (c02) R->L }
% 0.20/0.43    ld(op_c, mult(op_c, mult(a, mult(b, op_c))))
% 0.20/0.43  = { by axiom 2 (c08) R->L }
% 0.20/0.43    ld(op_c, mult(op_c, mult(a, mult(op_c, b))))
% 0.20/0.43  = { by axiom 4 (c07) }
% 0.20/0.43    ld(op_c, mult(mult(op_c, mult(a, op_c)), b))
% 0.20/0.43  = { by axiom 2 (c08) R->L }
% 0.20/0.43    ld(op_c, mult(mult(op_c, mult(op_c, a)), b))
% 0.20/0.43  = { by lemma 6 R->L }
% 0.20/0.43    ld(op_c, mult(mult(mult(op_c, op_c), a), b))
% 0.20/0.43  = { by axiom 5 (c09) R->L }
% 0.20/0.43    ld(op_c, mult(mult(op_c, op_c), mult(a, b)))
% 0.20/0.43  = { by lemma 6 }
% 0.20/0.43    ld(op_c, mult(op_c, mult(op_c, mult(a, b))))
% 0.20/0.43  = { by axiom 3 (c02) }
% 0.20/0.43    mult(op_c, mult(a, b))
% 0.20/0.43  = { by axiom 2 (c08) }
% 0.20/0.43    mult(mult(a, b), op_c)
% 0.20/0.43  % SZS output end Proof
% 0.20/0.43  
% 0.20/0.43  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------