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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Twee---2.4.2
% Problem  : ROB009-1 : 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 : n009.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 14:09:07 EDT 2023

% Result   : Unsatisfiable 0.21s 0.39s
% Output   : Proof 0.21s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : ROB009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.07/0.13  % Command  : parallel-twee %s --tstp --conditional-encoding if --smaller --drop-non-horn --give-up-on-saturation --explain-encoding --formal-proof
% 0.14/0.35  % Computer : n009.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 300
% 0.14/0.35  % DateTime : Mon Aug 28 06:46:35 EDT 2023
% 0.14/0.35  % CPUTime  : 
% 0.21/0.39  Command-line arguments: --flip-ordering --lhs-weight 1 --depth-weight 60 --distributivity-heuristic
% 0.21/0.39  
% 0.21/0.39  % SZS status Unsatisfiable
% 0.21/0.39  
% 0.21/0.39  % SZS output start Proof
% 0.21/0.39  Axiom 1 (commutativity_of_add): add(X, Y) = add(Y, X).
% 0.21/0.39  Axiom 2 (associativity_of_add): add(add(X, Y), Z) = add(X, add(Y, Z)).
% 0.21/0.39  Axiom 3 (condition): negate(add(a, negate(add(b, c)))) = negate(add(b, negate(add(a, c)))).
% 0.21/0.39  Axiom 4 (robbins_axiom): negate(add(negate(add(X, Y)), negate(add(X, negate(Y))))) = X.
% 0.21/0.39  
% 0.21/0.39  Goal 1 (prove_result): a = b.
% 0.21/0.39  Proof:
% 0.21/0.39    a
% 0.21/0.39  = { by axiom 4 (robbins_axiom) R->L }
% 0.21/0.39    negate(add(negate(add(a, add(b, c))), negate(add(a, negate(add(b, c))))))
% 0.21/0.39  = { by axiom 1 (commutativity_of_add) R->L }
% 0.21/0.39    negate(add(negate(add(a, add(c, b))), negate(add(a, negate(add(b, c))))))
% 0.21/0.39  = { by axiom 2 (associativity_of_add) R->L }
% 0.21/0.39    negate(add(negate(add(add(a, c), b)), negate(add(a, negate(add(b, c))))))
% 0.21/0.39  = { by axiom 1 (commutativity_of_add) }
% 0.21/0.39    negate(add(negate(add(b, add(a, c))), negate(add(a, negate(add(b, c))))))
% 0.21/0.39  = { by axiom 3 (condition) }
% 0.21/0.39    negate(add(negate(add(b, add(a, c))), negate(add(b, negate(add(a, c))))))
% 0.21/0.39  = { by axiom 4 (robbins_axiom) }
% 0.21/0.39    b
% 0.21/0.39  % SZS output end Proof
% 0.21/0.39  
% 0.21/0.39  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------