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

View Problem - Process Solution

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

% Computer : n018.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 : Sat Jul 16 12:25:18 EDT 2022

% Result   : Unsatisfiable 0.57s 0.96s
% Output   : CNFRefutation 0.57s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12  % Command  : woody %s
% 0.12/0.33  % Computer : n018.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Tue Jun 14 06:15:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.57/0.96  ********************************************************************************
% 0.57/0.96  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.57/0.96  *                                                              |/  |    \/  |  *
% 0.57/0.96  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.57/0.96  *                             A. Jaeger and B. Loechner          |        |    *
% 0.57/0.96  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.57/0.96  ********************************************************************************
% 0.57/0.96  
% 0.57/0.96  
% 0.57/0.96  Goals:
% 0.57/0.96  ------
% 0.57/0.96  
% 0.57/0.96  (   1)  greatest_lower_bound(b,least_upper_bound(a,b)) ?=? b
% 0.57/0.96  
% 0.57/0.96  Detected structure: VerbandsgeordneteGruppe
% 0.57/0.96  ********************************************************************************
% 0.57/0.96  ****************************** COMPLETION - PROOF ******************************
% 0.57/0.96  ********************************************************************************
% 0.57/0.96  
% 0.57/0.96  joined goal:             1  greatest_lower_bound(b,least_upper_bound(a,b)) ?= b to b
% 0.57/0.96  goal joined
% 0.57/0.96  % SZS status Unsatisfiable
% 0.57/0.96  #START OF PROOF
% 0.57/0.96  % SZS output start CNFRefutation
% 0.57/0.96  cnf('0.3.0.0',axiom,
% 0.57/0.96      ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.57/0.96      file('/tmp/WALDMEISTER_9370_n018')).
% 0.57/0.96  cnf('0.3.1.0',plain,
% 0.57/0.96      ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.57/0.96      inference(weigh,[status(thm)],['0.3.0.0']),
% 0.57/0.96      [weight('<2,0,0,[0,0,0,3]>')]).
% 0.57/0.96  cnf('0.3.2.0',plain,
% 0.57/0.96      ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.57/0.96      inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.57/0.96      [x,rule_3]).
% 0.57/0.96  cnf('0.16.0.0',axiom,
% 0.57/0.96      ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.57/0.96      file('/tmp/WALDMEISTER_9370_n018')).
% 0.57/0.96  cnf('0.16.1.0',plain,
% 0.57/0.96      ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.57/0.96      inference(weigh,[status(thm)],['0.16.0.0']),
% 0.57/0.96      [weight('<15,0,0,[0,0,0,16]>')]).
% 0.57/0.96  cnf('0.16.2.0',plain,
% 0.57/0.96      ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.57/0.96      inference(activate,[status(thm)],['0.16.1.0']),
% 0.57/0.96      [equation_3]).
% 0.57/0.96  cnf('1.0.0.0',conjecture,
% 0.57/0.96      ( greatest_lower_bound(b,least_upper_bound(a,b)) = b ),
% 0.57/0.96      file('/tmp/WALDMEISTER_9370_n018',conjecture_1)).
% 0.57/0.96  cnf('1.0.0.1',plain,
% 0.57/0.96      ( greatest_lower_bound(b,least_upper_bound(b,a)) = b ),
% 0.57/0.96      inference(reduction,[status(thm)],['1.0.0.0','0.16.2.0',theory(equality)]),
% 0.57/0.96      [pos('L.2','L')]).
% 0.57/0.96  cnf('1.0.0.2',plain,
% 0.57/0.96      ( b = b ),
% 0.57/0.96      inference(reduction,[status(thm)],['1.0.0.1','0.3.2.0',theory(equality)]),
% 0.57/0.96      [pos('L','L')]).
% 0.57/0.96  cnf('1.0.0.3',plain,
% 0.57/0.96      ( $true ),
% 0.57/0.96      inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.57/0.96      [conjecture_1]).
% 0.57/0.96  
% 0.57/0.96  Proved Goals:
% 0.57/0.96  No.  1:  greatest_lower_bound(b,least_upper_bound(a,b)) ?= b joined, current: b = b
% 0.57/0.96  1 goal was specified, which was proved.
% 0.57/0.96  % SZS output end CNFRefutation
% 0.57/0.96  #END OF PROOF
% 0.57/0.96  
% 0.57/0.96  Problem         WALDMEISTER_9370_n018 
% 0.57/0.96  CPs.gen                   62 
% 0.57/0.96  CPs.reexp                  0 
% 0.57/0.96  Select                    16 
% 0.57/0.96  R                         13 
% 0.57/0.96  E                          3 
% 0.57/0.96  vsize                   6.5M 
% 0.57/0.96  rss                     3.7M 
% 0.57/0.96  process.time          0.002s 
% 0.57/0.96  wallclock.time        0.003s 
% 0.57/0.96  status                     S
% 0.57/0.96  
% 0.57/0.96  
% 0.57/0.96  Waldmeister states: Goal proved.
% 0.57/0.96  % SZS status Unsatisfiable
% 0.57/0.96  
% 0.57/0.96  Problem         WALDMEISTER_9370_n018 
% 0.57/0.96  CPs.gen                    0 
% 0.57/0.96  CPs.reexp                  0 
% 0.57/0.96  Select                     0 
% 0.57/0.96  R                          0 
% 0.57/0.96  E                          0 
% 0.57/0.96  vsize                   6.0M 
% 0.57/0.96  rss                     3.2M 
% 0.57/0.96  process.time          0.001s 
% 0.57/0.96  wallclock.time        0.002s 
% 0.57/0.96  status                     S
%------------------------------------------------------------------------------