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

View Problem - Process Solution

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

% Computer : n028.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:58 EDT 2022

% Result   : Unsatisfiable 0.59s 1.00s
% Output   : CNFRefutation 0.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13  % Problem  : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.13/0.13  % Command  : woody %s
% 0.13/0.35  % Computer : n028.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  : 600
% 0.13/0.35  % DateTime : Mon Jun 13 10:56:07 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.59/0.99  ********************************************************************************
% 0.59/0.99  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.59/0.99  *                                                              |/  |    \/  |  *
% 0.59/0.99  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.59/0.99  *                             A. Jaeger and B. Loechner          |        |    *
% 0.59/0.99  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.59/0.99  ********************************************************************************
% 0.59/0.99  
% 0.59/0.99  
% 0.59/0.99  Goals:
% 0.59/0.99  ------
% 0.59/0.99  
% 0.59/0.99  (   1)  multiply(a,c) ?=? greatest_lower_bound(multiply(a,c),multiply(b,c))
% 0.59/0.99  
% 0.59/0.99  Detected structure: VerbandsgeordneteGruppe
% 0.59/0.99  ********************************************************************************
% 0.59/0.99  ****************************** COMPLETION - PROOF ******************************
% 0.59/0.99  ********************************************************************************
% 0.59/0.99  
% 0.59/1.00  joined goal:             1  multiply(a,c) ?= greatest_lower_bound(multiply(a,c),multiply(b,c)) to greatest_lower_bound(multiply(b,c),multiply(a,c))
% 0.59/1.00  goal joined
% 0.59/1.00  % SZS status Unsatisfiable
% 0.59/1.00  #START OF PROOF
% 0.59/1.00  % SZS output start CNFRefutation
% 0.59/1.00  cnf('0.9.0.0',axiom,
% 0.59/1.00      ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.59/1.00      file('/tmp/WALDMEISTER_864_n028')).
% 0.59/1.00  cnf('0.9.1.0',plain,
% 0.59/1.00      ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.59/1.00      inference(weigh,[status(thm)],['0.9.0.0']),
% 0.59/1.00      [weight('<8,0,0,[0,0,0,9]>')]).
% 0.59/1.00  cnf('0.9.2.0',plain,
% 0.59/1.00      ( multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.59/1.00      inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.59/1.00      [u,rule_9]).
% 0.59/1.00  cnf('0.12.0.0',axiom,
% 0.59/1.00      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.00      file('/tmp/WALDMEISTER_864_n028')).
% 0.59/1.00  cnf('0.12.1.0',plain,
% 0.59/1.00      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.00      inference(weigh,[status(thm)],['0.12.0.0']),
% 0.59/1.00      [weight('<11,0,0,[0,0,0,12]>')]).
% 0.59/1.00  cnf('0.12.2.0',plain,
% 0.59/1.00      ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.59/1.00      inference(activate,[status(thm)],['0.12.1.0']),
% 0.59/1.00      [equation_1]).
% 0.59/1.00  cnf('0.14.0.0',axiom,
% 0.59/1.00      ( greatest_lower_bound(a,b) = a ),
% 0.59/1.00      file('/tmp/WALDMEISTER_864_n028')).
% 0.59/1.00  cnf('0.14.1.0',plain,
% 0.59/1.00      ( greatest_lower_bound(a,b) = a ),
% 0.59/1.00      inference(weigh,[status(thm)],['0.14.0.0']),
% 0.59/1.00      [weight('<13,0,0,[0,0,0,14]>')]).
% 0.59/1.00  cnf('0.14.1.1',plain,
% 0.59/1.00      ( greatest_lower_bound(b,a) = a ),
% 0.59/1.00      inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.59/1.00      [pos('L','L')]).
% 0.59/1.00  cnf('0.14.2.0',plain,
% 0.59/1.00      ( greatest_lower_bound(b,a) = a ),
% 0.59/1.00      inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.59/1.00      [u,rule_13]).
% 0.59/1.00  cnf('1.0.0.0',conjecture,
% 0.59/1.00      ( multiply(a,c) = greatest_lower_bound(multiply(a,c),multiply(b,c)) ),
% 0.59/1.00      file('/tmp/WALDMEISTER_864_n028',conjecture_1)).
% 0.59/1.00  cnf('1.0.0.1',plain,
% 0.59/1.00      ( multiply(a,c) = greatest_lower_bound(multiply(b,c),multiply(a,c)) ),
% 0.59/1.00      inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.59/1.00      [pos('R','L')]).
% 0.59/1.00  cnf('1.0.0.2',plain,
% 0.59/1.00      ( multiply(greatest_lower_bound(b,a),c) = greatest_lower_bound(multiply(b,c),multiply(a,c)) ),
% 0.59/1.00      inference(reduction,[status(thm)],['1.0.0.1','0.14.2.0',theory(equality)]),
% 0.59/1.00      [pos('L.1','R')]).
% 0.59/1.00  cnf('1.0.0.3',plain,
% 0.59/1.00      ( greatest_lower_bound(multiply(b,c),multiply(a,c)) = greatest_lower_bound(multiply(b,c),multiply(a,c)) ),
% 0.59/1.00      inference(reduction,[status(thm)],['1.0.0.2','0.9.2.0',theory(equality)]),
% 0.59/1.00      [pos('L','L')]).
% 0.59/1.00  cnf('1.0.0.4',plain,
% 0.59/1.00      ( $true ),
% 0.59/1.00      inference(trivial,[status(thm)],['1.0.0.3',theory(equality)]),
% 0.59/1.00      [conjecture_1]).
% 0.59/1.00  
% 0.59/1.00  Proved Goals:
% 0.59/1.00  No.  1:  multiply(a,c) ?= greatest_lower_bound(multiply(a,c),multiply(b,c)) joined, current: greatest_lower_bound(multiply(b,c),multiply(a,c)) = greatest_lower_bound(multiply(b,c),multiply(a,c))
% 0.59/1.00  1 goal was specified, which was proved.
% 0.59/1.00  % SZS output end CNFRefutation
% 0.59/1.00  #END OF PROOF
% 0.59/1.00  
% 0.59/1.00  Problem         WALDMEISTER_864_n028 
% 0.59/1.00  CPs.gen                   44 
% 0.59/1.00  CPs.reexp                  0 
% 0.59/1.00  Select                    14 
% 0.59/1.00  R                         13 
% 0.59/1.00  E                          1 
% 0.59/1.00  vsize                   6.4M 
% 0.59/1.00  rss                     3.7M 
% 0.59/1.00  process.time          0.002s 
% 0.59/1.00  wallclock.time        0.003s 
% 0.59/1.00  status                     S
% 0.59/1.00  
% 0.59/1.00  
% 0.59/1.00  Waldmeister states: Goal proved.
% 0.59/1.00  % SZS status Unsatisfiable
% 0.59/1.00  
% 0.59/1.00  Problem         WALDMEISTER_864_n028 
% 0.59/1.00  CPs.gen                    0 
% 0.59/1.00  CPs.reexp                  0 
% 0.59/1.00  Select                     0 
% 0.59/1.00  R                          0 
% 0.59/1.00  E                          0 
% 0.59/1.00  vsize                   6.0M 
% 0.59/1.00  rss                     3.3M 
% 0.59/1.00  process.time          0.001s 
% 0.59/1.00  wallclock.time        0.002s 
% 0.59/1.00  status                     S
%------------------------------------------------------------------------------