TSTP Solution File: GRP158-1 by Waldmeister---710

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : GRP158-1 : 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:24:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : GRP158-1 : 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 : Mon Jun 13 08:24:27 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.55/0.96  ********************************************************************************
% 0.55/0.96  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.55/0.96  *                                                              |/  |    \/  |  *
% 0.55/0.96  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.55/0.96  *                             A. Jaeger and B. Loechner          |        |    *
% 0.55/0.96  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.55/0.96  ********************************************************************************
% 0.55/0.96  
% 0.55/0.96  
% 0.55/0.96  Goals:
% 0.55/0.96  ------
% 0.55/0.96  
% 0.55/0.96  (   1)  multiply(c,a) ?=? greatest_lower_bound(multiply(c,a),multiply(c,b))
% 0.55/0.96  
% 0.55/0.96  Detected structure: VerbandsgeordneteGruppe
% 0.55/0.96  ********************************************************************************
% 0.55/0.96  ****************************** COMPLETION - PROOF ******************************
% 0.55/0.96  ********************************************************************************
% 0.55/0.96  
% 0.55/0.96  joined goal:             1  multiply(c,a) ?= greatest_lower_bound(multiply(c,a),multiply(c,b)) to greatest_lower_bound(multiply(c,b),multiply(c,a))
% 0.55/0.96  goal joined
% 0.55/0.96  % SZS status Unsatisfiable
% 0.55/0.96  #START OF PROOF
% 0.55/0.96  % SZS output start CNFRefutation
% 0.55/0.96  cnf('0.7.0.0',axiom,
% 0.55/0.96      ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.55/0.96      file('/tmp/WALDMEISTER_24691_n018')).
% 0.55/0.96  cnf('0.7.1.0',plain,
% 0.55/0.96      ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.55/0.96      inference(weigh,[status(thm)],['0.7.0.0']),
% 0.55/0.96      [weight('<6,0,0,[0,0,0,7]>')]).
% 0.55/0.96  cnf('0.7.2.0',plain,
% 0.55/0.96      ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.55/0.96      inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.55/0.96      [u,rule_7]).
% 0.55/0.96  cnf('0.12.0.0',axiom,
% 0.55/0.96      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.96      file('/tmp/WALDMEISTER_24691_n018')).
% 0.55/0.96  cnf('0.12.1.0',plain,
% 0.55/0.96      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.96      inference(weigh,[status(thm)],['0.12.0.0']),
% 0.55/0.96      [weight('<11,0,0,[0,0,0,12]>')]).
% 0.55/0.96  cnf('0.12.2.0',plain,
% 0.55/0.96      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.55/0.96      inference(activate,[status(thm)],['0.12.1.0']),
% 0.55/0.96      [equation_1]).
% 0.55/0.96  cnf('0.14.0.0',axiom,
% 0.55/0.96      ( greatest_lower_bound(a,b) = a ),
% 0.55/0.96      file('/tmp/WALDMEISTER_24691_n018')).
% 0.55/0.96  cnf('0.14.1.0',plain,
% 0.55/0.96      ( greatest_lower_bound(a,b) = a ),
% 0.55/0.96      inference(weigh,[status(thm)],['0.14.0.0']),
% 0.55/0.96      [weight('<13,0,0,[0,0,0,14]>')]).
% 0.55/0.96  cnf('0.14.1.1',plain,
% 0.55/0.96      ( greatest_lower_bound(b,a) = a ),
% 0.55/0.96      inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.55/0.96      [pos('L','L')]).
% 0.55/0.96  cnf('0.14.2.0',plain,
% 0.55/0.96      ( greatest_lower_bound(b,a) = a ),
% 0.55/0.96      inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.55/0.96      [u,rule_13]).
% 0.55/0.96  cnf('1.0.0.0',conjecture,
% 0.55/0.96      ( multiply(c,a) = greatest_lower_bound(multiply(c,a),multiply(c,b)) ),
% 0.55/0.96      file('/tmp/WALDMEISTER_24691_n018',conjecture_1)).
% 0.55/0.96  cnf('1.0.0.1',plain,
% 0.55/0.96      ( multiply(c,a) = greatest_lower_bound(multiply(c,b),multiply(c,a)) ),
% 0.55/0.96      inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.55/0.96      [pos('R','L')]).
% 0.55/0.96  cnf('1.0.0.2',plain,
% 0.55/0.96      ( multiply(c,greatest_lower_bound(b,a)) = greatest_lower_bound(multiply(c,b),multiply(c,a)) ),
% 0.55/0.96      inference(reduction,[status(thm)],['1.0.0.1','0.14.2.0',theory(equality)]),
% 0.55/0.96      [pos('L.2','R')]).
% 0.55/0.96  cnf('1.0.0.3',plain,
% 0.55/0.96      ( greatest_lower_bound(multiply(c,b),multiply(c,a)) = greatest_lower_bound(multiply(c,b),multiply(c,a)) ),
% 0.55/0.96      inference(reduction,[status(thm)],['1.0.0.2','0.7.2.0',theory(equality)]),
% 0.55/0.96      [pos('L','L')]).
% 0.55/0.96  cnf('1.0.0.4',plain,
% 0.55/0.96      ( $true ),
% 0.55/0.96      inference(trivial,[status(thm)],['1.0.0.3',theory(equality)]),
% 0.55/0.96      [conjecture_1]).
% 0.55/0.96  
% 0.55/0.96  Proved Goals:
% 0.55/0.96  No.  1:  multiply(c,a) ?= greatest_lower_bound(multiply(c,a),multiply(c,b)) joined, current: greatest_lower_bound(multiply(c,b),multiply(c,a)) = greatest_lower_bound(multiply(c,b),multiply(c,a))
% 0.55/0.96  1 goal was specified, which was proved.
% 0.55/0.96  % SZS output end CNFRefutation
% 0.55/0.96  #END OF PROOF
% 0.55/0.96  
% 0.55/0.96  Problem         WALDMEISTER_24691_n018 
% 0.55/0.96  CPs.gen                   44 
% 0.55/0.96  CPs.reexp                  0 
% 0.55/0.96  Select                    14 
% 0.55/0.96  R                         13 
% 0.55/0.96  E                          1 
% 0.55/0.96  vsize                   6.4M 
% 0.55/0.96  rss                     3.7M 
% 0.55/0.96  process.time          0.002s 
% 0.55/0.96  wallclock.time        0.003s 
% 0.55/0.96  status                     S
% 0.55/0.96  
% 0.55/0.96  
% 0.55/0.96  Waldmeister states: Goal proved.
% 0.55/0.96  % SZS status Unsatisfiable
% 0.55/0.96  
% 0.55/0.96  Problem         WALDMEISTER_24691_n018 
% 0.55/0.96  CPs.gen                    0 
% 0.55/0.96  CPs.reexp                  0 
% 0.55/0.96  Select                     0 
% 0.55/0.96  R                          0 
% 0.55/0.96  E                          0 
% 0.55/0.96  vsize                   6.0M 
% 0.55/0.96  rss                     3.3M 
% 0.55/0.96  process.time          0.001s 
% 0.55/0.96  wallclock.time        0.002s 
% 0.55/0.96  status                     S
%------------------------------------------------------------------------------