TSTP Solution File: BOO011-2 by Waldmeister---710

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm  : none
% Format   : tptp:raw
% Command  : woody %s

% Computer : n019.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  : 600s
% DateTime : Thu Jul 14 23:52:49 EDT 2022

% Result   : Unsatisfiable 0.65s 1.02s
% Output   : CNFRefutation 0.65s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : BOO011-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13  % Command  : woody %s
% 0.13/0.34  % Computer : n019.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Wed Jun  1 22:42:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.62/1.02  ********************************************************************************
% 0.62/1.02  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.62/1.02  *                                                              |/  |    \/  |  *
% 0.62/1.02  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.62/1.02  *                             A. Jaeger and B. Loechner          |        |    *
% 0.62/1.02  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.62/1.02  ********************************************************************************
% 0.62/1.02  
% 0.62/1.02  
% 0.62/1.02  Goals:
% 0.62/1.02  ------
% 0.62/1.02  
% 0.62/1.02  (   1)  multiplicative_identity ?=? inverse(additive_identity)
% 0.62/1.02  
% 0.62/1.02  Detected structure: BoolescheAlgebra
% 0.62/1.02  ********************************************************************************
% 0.62/1.02  ****************************** COMPLETION - PROOF ******************************
% 0.62/1.02  ********************************************************************************
% 0.62/1.02  
% 0.65/1.02  joined goal:           1  multiplicative_identity ?= inverse(additive_identity) to multiplicative_identity
% 0.65/1.02  goal joined
% 0.65/1.02  % SZS status Unsatisfiable
% 0.65/1.02  #START OF PROOF
% 0.65/1.02  % SZS output start CNFRefutation
% 0.65/1.02  cnf('0.4.0.0',axiom,
% 0.65/1.02      ( X1 = add(additive_identity,X1) ),
% 0.65/1.02      file('/tmp/WALDMEISTER_13356_n019')).
% 0.65/1.02  cnf('0.4.1.0',plain,
% 0.65/1.02      ( X1 = add(additive_identity,X1) ),
% 0.65/1.02      inference(weigh,[status(thm)],['0.4.0.0']),
% 0.65/1.02      [weight('<3,0,0,[0,0,0,4]>')]).
% 0.65/1.02  cnf('0.4.2.0',plain,
% 0.65/1.02      ( add(additive_identity,X1) = X1 ),
% 0.65/1.02      inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.65/1.02      [x,rule_4]).
% 0.65/1.02  cnf('0.12.0.0',axiom,
% 0.65/1.02      ( add(X1,inverse(X1)) = multiplicative_identity ),
% 0.65/1.02      file('/tmp/WALDMEISTER_13356_n019')).
% 0.65/1.02  cnf('0.12.1.0',plain,
% 0.65/1.02      ( add(X1,inverse(X1)) = multiplicative_identity ),
% 0.65/1.02      inference(weigh,[status(thm)],['0.12.0.0']),
% 0.65/1.02      [weight('<12,0,0,[0,0,0,13]>')]).
% 0.65/1.02  cnf('0.12.2.0',plain,
% 0.65/1.02      ( add(X1,inverse(X1)) = multiplicative_identity ),
% 0.65/1.02      inference(orient,[status(thm)],['0.12.1.0',theory(equality)]),
% 0.65/1.02      [u,rule_10]).
% 0.65/1.02  cnf('0.14.0.0',plain,
% 0.65/1.02      ( multiplicative_identity = inverse(additive_identity) ),
% 0.65/1.02      inference(cp,[status(thm)],['0.12.2.0','0.4.2.0',theory(equality)]),
% 0.65/1.02      [pos('L','L')]).
% 0.65/1.02  cnf('0.14.1.0',plain,
% 0.65/1.02      ( multiplicative_identity = inverse(additive_identity) ),
% 0.65/1.02      inference(weigh,[status(thm)],['0.14.0.0']),
% 0.65/1.02      [weight('<2,12,4,[1,0,0,0]>')]).
% 0.65/1.02  cnf('0.14.2.0',plain,
% 0.65/1.02      ( inverse(additive_identity) = multiplicative_identity ),
% 0.65/1.02      inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.65/1.02      [x,rule_12]).
% 0.65/1.02  cnf('1.0.0.0',conjecture,
% 0.65/1.02      ( multiplicative_identity = inverse(additive_identity) ),
% 0.65/1.02      file('/tmp/WALDMEISTER_13356_n019',conjecture_1)).
% 0.65/1.02  cnf('1.0.0.1',plain,
% 0.65/1.02      ( multiplicative_identity = multiplicative_identity ),
% 0.65/1.02      inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.65/1.02      [pos('R','L')]).
% 0.65/1.02  cnf('1.0.0.2',plain,
% 0.65/1.02      ( $true ),
% 0.65/1.02      inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.65/1.02      [conjecture_1]).
% 0.65/1.02  
% 0.65/1.02  Proved Goals:
% 0.65/1.02  No.  1:  multiplicative_identity ?= inverse(additive_identity) joined, current: multiplicative_identity = multiplicative_identity
% 0.65/1.02  1 goal was specified, which was proved.
% 0.65/1.02  % SZS output end CNFRefutation
% 0.65/1.02  #END OF PROOF
% 0.65/1.02  
% 0.65/1.02  Problem         WALDMEISTER_13356_n019 
% 0.65/1.02  CPs.gen                   66 
% 0.65/1.02  CPs.reexp                  0 
% 0.65/1.02  Select                    16 
% 0.65/1.02  R                         12 
% 0.65/1.02  E                          2 
% 0.65/1.02  vsize                   6.5M 
% 0.65/1.02  rss                     3.5M 
% 0.65/1.02  process.time          0.002s 
% 0.65/1.02  wallclock.time        0.002s 
% 0.65/1.02  status                     S
% 0.65/1.02  
% 0.65/1.02  
% 0.65/1.02  Waldmeister states: Goal proved.
% 0.65/1.02  % SZS status Unsatisfiable
%------------------------------------------------------------------------------