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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : COL046-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : woody %s

% Computer : n026.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:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL046-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : woody %s
% 0.13/0.34  % Computer : n026.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 : Tue May 31 13:59:56 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.59/1.00  ********************************************************************************
% 0.59/1.00  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.59/1.00  *                                                              |/  |    \/  |  *
% 0.59/1.00  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.59/1.00  *                             A. Jaeger and B. Loechner          |        |    *
% 0.59/1.00  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.59/1.00  ********************************************************************************
% 0.59/1.00  
% 0.59/1.00  
% 0.59/1.00  Goals:
% 0.59/1.00  ------
% 0.59/1.00  
% 0.59/1.00  (   1)  true ?= false
% 0.59/1.00          using narrowing to prove x1 ?= apply(const1,x1)
% 0.59/1.00  
% 0.59/1.00  Detected structure: KombinatorlogikB
% 0.59/1.00  ********************************************************************************
% 0.59/1.00  ****************************** COMPLETION - PROOF ******************************
% 0.59/1.00  ********************************************************************************
% 0.59/1.00  
% 0.64/1.17  joined goal:             3  apply(const2,const1) ?= apply(const1,apply(const2,const1)) to apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)))
% 0.64/1.17  goal joined
% 0.64/1.17  % SZS status Unsatisfiable
% 0.64/1.17  #START OF PROOF
% 0.64/1.17  % SZS output start CNFRefutation
% 0.64/1.17  cnf('0.99.0.0',axiom,
% 0.64/1.17      ( apply(X1,X1) = apply(m,X1) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.99.1.0',plain,
% 0.64/1.17      ( apply(X1,X1) = apply(m,X1) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.99.0.0']),
% 0.64/1.17      [weight('<7,0,0,[0,0,0,8]>')]).
% 0.64/1.17  cnf('0.99.2.0',plain,
% 0.64/1.17      ( apply(m,X1) = apply(X1,X1) ),
% 0.64/1.17      inference(orient,[status(thm)],['0.99.1.0',theory(equality)]),
% 0.64/1.17      [x,rule_96]).
% 0.64/1.17  cnf('0.100.0.0',axiom,
% 0.64/1.17      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.100.1.0',plain,
% 0.64/1.17      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.100.0.0']),
% 0.64/1.17      [weight('<8,0,0,[0,0,0,9]>')]).
% 0.64/1.17  cnf('0.100.2.0',plain,
% 0.64/1.17      ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.64/1.17      inference(orient,[status(thm)],['0.100.1.0',theory(equality)]),
% 0.64/1.17      [x,rule_97]).
% 0.64/1.17  cnf('0.101.0.0',axiom,
% 0.64/1.17      ( apply(apply(X1,X2),apply(X3,X2)) = apply(apply(apply(s,X1),X3),X2) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.101.1.0',plain,
% 0.64/1.17      ( apply(apply(X1,X2),apply(X3,X2)) = apply(apply(apply(s,X1),X3),X2) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.101.0.0']),
% 0.64/1.17      [weight('<9,0,0,[0,0,0,10]>')]).
% 0.64/1.17  cnf('0.101.2.0',plain,
% 0.64/1.17      ( apply(apply(apply(s,X1),X2),X3) = apply(apply(X1,X3),apply(X2,X3)) ),
% 0.64/1.17      inference(orient,[status(thm)],['0.101.1.0',theory(equality)]),
% 0.64/1.17      [x,rule_98]).
% 0.64/1.17  cnf('0.102.0.0',axiom,
% 0.64/1.17      ( const2 = apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.102.1.0',plain,
% 0.64/1.17      ( const2 = apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.102.0.0']),
% 0.64/1.17      [weight('<10,0,0,[0,0,0,11]>')]).
% 0.64/1.17  cnf('0.102.2.0',plain,
% 0.64/1.17      ( const2 = apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))) ),
% 0.64/1.17      inference(orient,[status(thm)],['0.102.1.0',theory(equality)]),
% 0.64/1.17      [u,rule_99]).
% 0.64/1.17  cnf('3.0.0.0',conjecture,
% 0.64/1.17      ( apply(const2,const1) = apply(const1,apply(const2,const1)) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026',conjecture_3)).
% 0.64/1.17  cnf('3.0.0.1',plain,
% 0.64/1.17      ( apply(apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))),const1) = apply(const1,apply(const2,const1)) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.0','0.102.2.0',theory(equality)]),
% 0.64/1.17      [pos('L.1','L')]).
% 0.64/1.17  cnf('3.0.0.2',plain,
% 0.64/1.17      ( apply(apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))),const1) = apply(const1,apply(apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))),const1)) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.1','0.102.2.0',theory(equality)]),
% 0.64/1.17      [pos('R.2.1','L')]).
% 0.64/1.17  cnf('3.0.0.3',plain,
% 0.64/1.17      ( apply(apply(apply(b,m),apply(m,apply(apply(b,apply(s,b)),m))),const1) = apply(const1,apply(m,apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.2','0.100.2.0',theory(equality)]),
% 0.64/1.17      [pos('R.2','L')]).
% 0.64/1.17  cnf('3.0.0.4',plain,
% 0.64/1.17      ( apply(m,apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(m,apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.3','0.100.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('3.0.0.5',plain,
% 0.64/1.17      ( apply(m,apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.4','0.99.2.0',theory(equality)]),
% 0.64/1.17      [pos('R.2','L')]).
% 0.64/1.17  cnf('3.0.0.6',plain,
% 0.64/1.17      ( apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.5','0.99.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('3.0.0.7',plain,
% 0.64/1.17      ( apply(apply(apply(apply(apply(b,apply(s,b)),m),apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.6','0.99.2.0',theory(equality)]),
% 0.64/1.17      [pos('L.1.1','L')]).
% 0.64/1.17  cnf('3.0.0.8',plain,
% 0.64/1.17      ( apply(apply(apply(apply(s,b),apply(m,apply(apply(b,apply(s,b)),m))),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.7','0.100.2.0',theory(equality)]),
% 0.64/1.17      [pos('L.1.1','L')]).
% 0.64/1.17  cnf('3.0.0.9',plain,
% 0.64/1.17      ( apply(apply(apply(b,const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.8','0.101.2.0',theory(equality)]),
% 0.64/1.17      [pos('L.1','L')]).
% 0.64/1.17  cnf('3.0.0.10',plain,
% 0.64/1.17      ( apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) ),
% 0.64/1.17      inference(reduction,[status(thm)],['3.0.0.9','0.100.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('3.0.0.11',plain,
% 0.64/1.17      ( $true ),
% 0.64/1.17      inference(trivial,[status(thm)],['3.0.0.10',theory(equality)]),
% 0.64/1.17      [conjecture_3]).
% 0.64/1.17  joined goal:           1  x1 ?= apply(const1,x1) to false
% 0.64/1.17  goal joined
% 0.64/1.17  #START OF PROOF
% 0.64/1.17  % SZS output start CNFRefutation
% 0.64/1.17  cnf('0.103.0.0',axiom,
% 0.64/1.17      ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.103.1.0',plain,
% 0.64/1.17      ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.103.0.0']),
% 0.64/1.17      [weight('<11,0,0,[0,0,0,12]>')]).
% 0.64/1.17  cnf('0.103.2.0',plain,
% 0.64/1.17      ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.64/1.17      inference(activate,[status(thm)],['0.103.1.0']),
% 0.64/1.17      [equation_4]).
% 0.64/1.17  cnf('0.104.0.0',axiom,
% 0.64/1.17      ( eq(X1,X1) = true ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.104.1.0',plain,
% 0.64/1.17      ( eq(X1,X1) = true ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.104.0.0']),
% 0.64/1.17      [weight('<12,0,0,[0,0,0,14]>')]).
% 0.64/1.17  cnf('0.104.2.0',plain,
% 0.64/1.17      ( eq(X1,X1) = true ),
% 0.64/1.17      inference(orient,[status(thm)],['0.104.1.0',theory(equality)]),
% 0.64/1.17      [u,rule_100]).
% 0.64/1.17  cnf('0.105.0.0',axiom,
% 0.64/1.17      ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026')).
% 0.64/1.17  cnf('0.105.1.0',plain,
% 0.64/1.17      ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.105.0.0']),
% 0.64/1.17      [weight('<13,0,0,[0,0,0,13]>')]).
% 0.64/1.17  cnf('0.105.2.0',plain,
% 0.64/1.17      ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.64/1.17      inference(orient,[status(thm)],['0.105.1.0',theory(equality)]),
% 0.64/1.17      [u,rule_101]).
% 0.64/1.17  cnf('0.106.0.0',plain,
% 0.64/1.17      ( false = eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) ),
% 0.64/1.17      inference(cp,[status(thm)],['0.105.2.0','0.103.2.0',theory(equality)]),
% 0.64/1.17      [pos('L.1','L')]).
% 0.64/1.17  cnf('0.106.1.0',plain,
% 0.64/1.17      ( false = eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.106.0.0']),
% 0.64/1.17      [weight('<0,105,103,[1,0,0,1]>')]).
% 0.64/1.17  cnf('0.106.2.0',plain,
% 0.64/1.17      ( eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) = false ),
% 0.64/1.17      inference(orient,[status(thm)],['0.106.1.0',theory(equality)]),
% 0.64/1.17      [x,rule_102]).
% 0.64/1.17  cnf('0.107.0.0',plain,
% 0.64/1.17      ( false = true ),
% 0.64/1.17      inference(cp,[status(thm)],['0.106.2.0','0.104.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('0.107.1.0',plain,
% 0.64/1.17      ( false = true ),
% 0.64/1.17      inference(weigh,[status(thm)],['0.107.0.0']),
% 0.64/1.17      [weight('<5,106,104,[1,0,0,0]>')]).
% 0.64/1.17  cnf('0.107.2.0',plain,
% 0.64/1.17      ( true = false ),
% 0.64/1.17      inference(orient,[status(thm)],['0.107.1.0',theory(equality)]),
% 0.64/1.17      [x,rule_103]).
% 0.64/1.17  cnf('1.0.0.0',conjecture,
% 0.64/1.17      ( true = false ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026',conjecture_1)).
% 0.64/1.17  cnf('1.0.0.1',plain,
% 0.64/1.17      ( false = false ),
% 0.64/1.17      inference(reduction,[status(thm)],['1.0.0.0','0.107.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('1.0.0.2',plain,
% 0.64/1.17      ( $true ),
% 0.64/1.17      inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.64/1.17      [conjecture_1]).
% 0.64/1.17  joined goal:           4  apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(x1))) to false
% 0.64/1.17  goal joined
% 0.64/1.17  #START OF PROOF
% 0.64/1.17  % SZS output start CNFRefutation
% 0.64/1.17  cnf('4.0.0.0',conjecture,
% 0.64/1.17      ( true = false ),
% 0.64/1.17      file('/tmp/WALDMEISTER_7582_n026',conjecture_4)).
% 0.64/1.17  cnf('4.0.0.1',plain,
% 0.64/1.17      ( false = false ),
% 0.64/1.17      inference(reduction,[status(thm)],['4.0.0.0','0.107.2.0',theory(equality)]),
% 0.64/1.17      [pos('L','L')]).
% 0.64/1.17  cnf('4.0.0.2',plain,
% 0.64/1.17      ( $true ),
% 0.64/1.17      inference(trivial,[status(thm)],['4.0.0.1',theory(equality)]),
% 0.64/1.17      [conjecture_4]).
% 0.64/1.17  
% 0.64/1.17  Proved Goals:
% 0.64/1.17  No.  1: true ?= false, current false ?= false
% 0.64/1.17          using narrowing to prove x1 ?= apply(const1,x1)
% 0.64/1.17  
% 0.64/1.17  No.  3:  apply(const2,const1) ?= apply(const1,apply(const2,const1)) joined, current: apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1))) = apply(const1,apply(apply(apply(m,apply(apply(b,apply(s,b)),m)),const1),apply(apply(m,apply(apply(b,apply(s,b)),m)),const1)))
% 0.64/1.17  No.  4: true ?= false, current false ?= false
% 0.64/1.17          using narrowing to prove apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(x1)))
% 0.64/1.17  
% 0.64/1.17  1 goal was specified, which was proved.
% 0.64/1.17  % SZS output end CNFRefutation
% 0.64/1.17  #END OF PROOF
% 0.64/1.17  
% 0.64/1.17  Problem         WALDMEISTER_7582_n026 
% 0.64/1.17  CPs.gen                  525 
% 0.64/1.17  CPs.reexp                  0 
% 0.64/1.17  Select                   538 
% 0.64/1.17  R                        103 
% 0.64/1.17  E                          4 
% 0.64/1.17  vsize                   6.5M 
% 0.64/1.17  rss                     3.8M 
% 0.64/1.17  process.time          0.013s 
% 0.64/1.17  wallclock.time        0.171s 
% 0.64/1.17  status                     S
% 0.64/1.17  
% 0.64/1.17  
% 0.64/1.17  Waldmeister states: Goal proved.
% 0.64/1.17  % SZS status Unsatisfiable
% 0.64/1.18  
% 0.64/1.18  Problem         WALDMEISTER_7582_n026 
% 0.64/1.18  CPs.gen                 8005 
% 0.64/1.18  CPs.reexp                  0 
% 0.64/1.18  Select                   459 
% 0.64/1.18  R                         88 
% 0.64/1.18  E                         27 
% 0.64/1.18  vsize                   6.5M 
% 0.64/1.18  rss                     3.6M 
% 0.64/1.18  process.time          0.159s 
% 0.64/1.18  wallclock.time        0.172s 
% 0.64/1.18  status                     S
%------------------------------------------------------------------------------