↑ Up

Waldmeister---710.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : COL063-6 : TPTP v8.1.0. Bugfixed v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : woody %s

% Computer : n020.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 : Fri Jul 15 00:47:39 EDT 2022

% Result   : Unsatisfiable 0.64s 1.03s
% Output   : CNFRefutation 0.64s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : COL063-6 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.06/0.12  % Command  : woody %s
% 0.12/0.33  % Computer : n020.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 May 31 13:08:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.64/1.03  ********************************************************************************
% 0.64/1.03  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.64/1.03  *                                                              |/  |    \/  |  *
% 0.64/1.03  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.64/1.03  *                             A. Jaeger and B. Loechner          |        |    *
% 0.64/1.03  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.64/1.03  ********************************************************************************
% 0.64/1.03  
% 0.64/1.03  
% 0.64/1.03  Goals:
% 0.64/1.03  ------
% 0.64/1.03  
% 0.64/1.03  (   1)  apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,t)),b)),b)),t),x),y),z) ?=? apply(apply(z,y),x)
% 0.64/1.03  
% 0.64/1.03  Detected structure: KombinatorlogikBT
% 0.64/1.03  ********************************************************************************
% 0.64/1.03  ****************************** COMPLETION - PROOF ******************************
% 0.64/1.03  ********************************************************************************
% 0.64/1.03  
% 0.64/1.03  joined goal:             1  apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,t)),b)),b)),t),x),y),z) ?= apply(apply(z,y),x) to apply(apply(z,y),x)
% 0.64/1.03  goal joined
% 0.64/1.03  % SZS status Unsatisfiable
% 0.64/1.03  #START OF PROOF
% 0.64/1.03  % SZS output start CNFRefutation
% 0.64/1.03  cnf('0.1.0.0',axiom,
% 0.64/1.03      ( apply(X1,X2) = apply(apply(t,X2),X1) ),
% 0.64/1.03      file('/tmp/WALDMEISTER_10554_n020')).
% 0.64/1.03  cnf('0.1.1.0',plain,
% 0.64/1.03      ( apply(X1,X2) = apply(apply(t,X2),X1) ),
% 0.64/1.03      inference(weigh,[status(thm)],['0.1.0.0']),
% 0.64/1.03      [weight('<0,0,0,[0,0,0,1]>')]).
% 0.64/1.03  cnf('0.1.2.0',plain,
% 0.64/1.03      ( apply(apply(t,X1),X2) = apply(X2,X1) ),
% 0.64/1.03      inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.64/1.03      [x,rule_1]).
% 0.64/1.03  cnf('0.2.0.0',axiom,
% 0.64/1.03      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.64/1.03      file('/tmp/WALDMEISTER_10554_n020')).
% 0.64/1.03  cnf('0.2.1.0',plain,
% 0.64/1.03      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.64/1.03      inference(weigh,[status(thm)],['0.2.0.0']),
% 0.64/1.03      [weight('<1,0,0,[0,0,0,2]>')]).
% 0.64/1.03  cnf('0.2.2.0',plain,
% 0.64/1.03      ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.64/1.03      inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.64/1.03      [x,rule_2]).
% 0.64/1.03  cnf('1.0.0.0',conjecture,
% 0.64/1.03      ( apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,t)),b)),b)),t),x),y),z) = apply(apply(z,y),x) ),
% 0.64/1.03      file('/tmp/WALDMEISTER_10554_n020',conjecture_1)).
% 0.64/1.03  cnf('1.0.0.1',plain,
% 0.64/1.03      ( apply(apply(apply(apply(apply(b,apply(apply(b,apply(t,t)),b)),b),apply(t,x)),y),z) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.0','0.2.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.1.1','L')]).
% 0.64/1.03  cnf('1.0.0.2',plain,
% 0.64/1.03      ( apply(apply(apply(apply(apply(b,apply(t,t)),b),apply(b,apply(t,x))),y),z) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.1','0.2.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.1.1','L')]).
% 0.64/1.03  cnf('1.0.0.3',plain,
% 0.64/1.03      ( apply(apply(apply(apply(t,t),apply(b,apply(b,apply(t,x)))),y),z) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.2','0.2.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.1.1','L')]).
% 0.64/1.03  cnf('1.0.0.4',plain,
% 0.64/1.03      ( apply(apply(apply(apply(b,apply(b,apply(t,x))),t),y),z) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.3','0.1.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.1.1','L')]).
% 0.64/1.03  cnf('1.0.0.5',plain,
% 0.64/1.03      ( apply(apply(apply(b,apply(t,x)),apply(t,y)),z) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.4','0.2.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.1','L')]).
% 0.64/1.03  cnf('1.0.0.6',plain,
% 0.64/1.03      ( apply(apply(t,x),apply(apply(t,y),z)) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.5','0.2.2.0',theory(equality)]),
% 0.64/1.03      [pos('L','L')]).
% 0.64/1.03  cnf('1.0.0.7',plain,
% 0.64/1.03      ( apply(apply(t,x),apply(z,y)) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.6','0.1.2.0',theory(equality)]),
% 0.64/1.03      [pos('L.2','L')]).
% 0.64/1.03  cnf('1.0.0.8',plain,
% 0.64/1.03      ( apply(apply(z,y),x) = apply(apply(z,y),x) ),
% 0.64/1.03      inference(reduction,[status(thm)],['1.0.0.7','0.1.2.0',theory(equality)]),
% 0.64/1.03      [pos('L','L')]).
% 0.64/1.03  cnf('1.0.0.9',plain,
% 0.64/1.03      ( $true ),
% 0.64/1.03      inference(trivial,[status(thm)],['1.0.0.8',theory(equality)]),
% 0.64/1.03      [conjecture_1]).
% 0.64/1.03  
% 0.64/1.03  Proved Goals:
% 0.64/1.03  No.  1:  apply(apply(apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(t,t)),b)),b)),t),x),y),z) ?= apply(apply(z,y),x) joined, current: apply(apply(z,y),x) = apply(apply(z,y),x)
% 0.64/1.03  1 goal was specified, which was proved.
% 0.64/1.03  % SZS output end CNFRefutation
% 0.64/1.03  #END OF PROOF
% 0.64/1.03  
% 0.64/1.03  Problem         WALDMEISTER_10554_n020 
% 0.64/1.03  CPs.gen                    0 
% 0.64/1.03  CPs.reexp                  0 
% 0.64/1.03  Select                     2 
% 0.64/1.03  R                          2 
% 0.64/1.03  E                          0 
% 0.64/1.03  vsize                   6.5M 
% 0.64/1.03  rss                     3.5M 
% 0.64/1.03  process.time          0.002s 
% 0.64/1.03  wallclock.time        0.002s 
% 0.64/1.03  status                     S
% 0.64/1.03  
% 0.64/1.03  
% 0.64/1.03  Waldmeister states: Goal proved.
% 0.64/1.03  % SZS status Unsatisfiable
%------------------------------------------------------------------------------