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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 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 : Fri Jul 15 00:47:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13  % Problem  : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 0.07/0.14  % Command  : woody %s
% 0.14/0.35  % Computer : n018.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Tue May 31 12:46:28 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.66/1.02  ********************************************************************************
% 0.66/1.02  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.66/1.02  *                                                              |/  |    \/  |  *
% 0.66/1.02  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.66/1.02  *                             A. Jaeger and B. Loechner          |        |    *
% 0.66/1.02  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.66/1.02  ********************************************************************************
% 0.66/1.02  
% 0.66/1.02  
% 0.66/1.02  Goals:
% 0.66/1.02  ------
% 0.66/1.02  
% 0.66/1.02  (   1)  true ?= false
% 0.66/1.02          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.66/1.02  
% 0.66/1.02  Detected structure: KombinatorlogikB
% 0.66/1.02  ********************************************************************************
% 0.66/1.02  ****************************** COMPLETION - PROOF ******************************
% 0.66/1.02  ********************************************************************************
% 0.66/1.02  
% 0.66/1.03  joined goal:           1  x1 ?= apply(combinator,x1) to false
% 0.66/1.03  goal joined
% 0.66/1.03  % SZS status Unsatisfiable
% 0.66/1.03  #START OF PROOF
% 0.66/1.03  % SZS output start CNFRefutation
% 0.66/1.03  cnf('0.1.0.0',axiom,
% 0.66/1.03      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.66/1.03      file('/tmp/WALDMEISTER_29805_n018')).
% 0.66/1.03  cnf('0.1.1.0',plain,
% 0.66/1.03      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.1.0.0']),
% 0.66/1.03      [weight('<0,0,0,[0,0,0,1]>')]).
% 0.66/1.03  cnf('0.1.2.0',plain,
% 0.66/1.03      ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.66/1.03      inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.66/1.03      [x,rule_1]).
% 0.66/1.03  cnf('0.2.0.0',axiom,
% 0.66/1.03      ( apply(apply(apply(X1,X2),X2),X3) = apply(apply(apply(n1,X1),X2),X3) ),
% 0.66/1.03      file('/tmp/WALDMEISTER_29805_n018')).
% 0.66/1.03  cnf('0.2.1.0',plain,
% 0.66/1.03      ( apply(apply(apply(X1,X2),X2),X3) = apply(apply(apply(n1,X1),X2),X3) ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.2.0.0']),
% 0.66/1.03      [weight('<1,0,0,[0,0,0,2]>')]).
% 0.66/1.03  cnf('0.2.2.0',plain,
% 0.66/1.03      ( apply(apply(apply(X1,X2),X2),X3) = apply(apply(apply(n1,X1),X2),X3) ),
% 0.66/1.03      inference(activate,[status(thm)],['0.2.1.0']),
% 0.66/1.03      [equation_1]).
% 0.66/1.03  cnf('0.3.0.0',axiom,
% 0.66/1.03      ( eq(X1,X1) = true ),
% 0.66/1.03      file('/tmp/WALDMEISTER_29805_n018')).
% 0.66/1.03  cnf('0.3.1.0',plain,
% 0.66/1.03      ( eq(X1,X1) = true ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.3.0.0']),
% 0.66/1.03      [weight('<2,0,0,[0,0,0,3]>')]).
% 0.66/1.03  cnf('0.3.2.0',plain,
% 0.66/1.03      ( eq(X1,X1) = true ),
% 0.66/1.03      inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.66/1.03      [u,rule_2]).
% 0.66/1.03  cnf('0.4.0.0',axiom,
% 0.66/1.03      ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.03      file('/tmp/WALDMEISTER_29805_n018')).
% 0.66/1.03  cnf('0.4.1.0',plain,
% 0.66/1.03      ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.4.0.0']),
% 0.66/1.03      [weight('<3,0,0,[0,0,0,4]>')]).
% 0.66/1.03  cnf('0.4.2.0',plain,
% 0.66/1.03      ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.03      inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.66/1.03      [u,rule_3]).
% 0.66/1.03  cnf('0.8.0.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X2,X2)),X3) ),
% 0.66/1.03      inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.66/1.03      [pos('L.1','L')]).
% 0.66/1.03  cnf('0.8.1.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X2,X2)),X3) ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.8.0.0']),
% 0.66/1.03      [weight('<16,2,1,[1,0,0,1]>')]).
% 0.66/1.03  cnf('0.8.2.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,X1)),X2),X3) = apply(apply(X1,apply(X2,X2)),X3) ),
% 0.66/1.03      inference(activate,[status(thm)],['0.8.1.0']),
% 0.66/1.03      [equation_4]).
% 0.66/1.03  cnf('0.17.0.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X2),X3)) ),
% 0.66/1.03      inference(cp,[status(thm)],['0.8.2.0','0.1.2.0',theory(equality)]),
% 0.66/1.03      [pos('R','L')]).
% 0.66/1.03  cnf('0.17.1.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X2),X3)) ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.17.0.0']),
% 0.66/1.03      [weight('<18,8,1,[1,1,0,0]>')]).
% 0.66/1.03  cnf('0.17.2.0',plain,
% 0.66/1.03      ( apply(apply(apply(n1,apply(b,apply(b,X1))),X2),X3) = apply(X1,apply(apply(X2,X2),X3)) ),
% 0.66/1.03      inference(activate,[status(thm)],['0.17.1.0']),
% 0.66/1.03      [equation_11]).
% 0.66/1.03  cnf('0.18.0.0',plain,
% 0.66/1.03      ( false = eq(apply(apply(X1,X1),X2),apply(apply(apply(n1,apply(b,apply(b,combinator))),X1),X2)) ),
% 0.66/1.03      inference(cp,[status(thm)],['0.4.2.0','0.17.2.0',theory(equality)]),
% 0.66/1.03      [pos('L.2','R')]).
% 0.66/1.03  cnf('0.18.1.0',plain,
% 0.66/1.03      ( false = eq(apply(apply(X1,X1),X2),apply(apply(apply(n1,apply(b,apply(b,combinator))),X1),X2)) ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.18.0.0']),
% 0.66/1.03      [weight('<0,17,4,[0,1,0,2]>')]).
% 0.66/1.03  cnf('0.18.2.0',plain,
% 0.66/1.03      ( eq(apply(apply(X1,X1),X2),apply(apply(apply(n1,apply(b,apply(b,combinator))),X1),X2)) = false ),
% 0.66/1.03      inference(orient,[status(thm)],['0.18.1.0',theory(equality)]),
% 0.66/1.03      [x,rule_7]).
% 0.66/1.03  cnf('0.19.0.0',plain,
% 0.66/1.03      ( false = true ),
% 0.66/1.03      inference(cp,[status(thm)],['0.18.2.0','0.3.2.0',theory(equality)]),
% 0.66/1.03      [pos('L','L')]).
% 0.66/1.03  cnf('0.19.1.0',plain,
% 0.66/1.03      ( false = true ),
% 0.66/1.03      inference(weigh,[status(thm)],['0.19.0.0']),
% 0.66/1.03      [weight('<2,18,3,[1,0,0,0]>')]).
% 0.66/1.03  cnf('0.19.2.0',plain,
% 0.66/1.03      ( true = false ),
% 0.66/1.03      inference(orient,[status(thm)],['0.19.1.0',theory(equality)]),
% 0.66/1.03      [x,rule_8]).
% 0.66/1.03  cnf('1.0.0.0',conjecture,
% 0.66/1.03      ( true = false ),
% 0.66/1.03      file('/tmp/WALDMEISTER_29805_n018',conjecture_1)).
% 0.66/1.03  cnf('1.0.0.1',plain,
% 0.66/1.03      ( false = false ),
% 0.66/1.03      inference(reduction,[status(thm)],['1.0.0.0','0.19.2.0',theory(equality)]),
% 0.66/1.03      [pos('L','L')]).
% 0.66/1.03  cnf('1.0.0.2',plain,
% 0.66/1.03      ( $true ),
% 0.66/1.03      inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.66/1.03      [conjecture_1]).
% 0.66/1.03  
% 0.66/1.03  Proved Goals:
% 0.66/1.03  No.  1: true ?= false, current false ?= false
% 0.66/1.03          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.66/1.03  
% 0.66/1.03  1 goal was specified, which was proved.
% 0.66/1.03  % SZS output end CNFRefutation
% 0.66/1.03  #END OF PROOF
% 0.66/1.03  
% 0.66/1.03  Problem         WALDMEISTER_29805_n018 
% 0.66/1.03  CPs.gen                  650 
% 0.66/1.03  CPs.reexp                  0 
% 0.66/1.03  Select                    26 
% 0.66/1.03  R                          8 
% 0.66/1.03  E                         11 
% 0.66/1.03  vsize                   6.4M 
% 0.66/1.03  rss                     3.6M 
% 0.66/1.03  process.time          0.006s 
% 0.66/1.03  wallclock.time        0.007s 
% 0.66/1.03  status                     S
% 0.66/1.03  
% 0.66/1.03  
% 0.66/1.03  Waldmeister states: Goal proved.
% 0.66/1.03  % SZS status Unsatisfiable
% 0.66/1.03  
% 0.66/1.03  Problem         WALDMEISTER_29805_n018 
% 0.66/1.03  CPs.gen                    0 
% 0.66/1.03  CPs.reexp                  0 
% 0.66/1.03  Select                     0 
% 0.66/1.03  R                          0 
% 0.66/1.03  E                          0 
% 0.66/1.03  vsize                   6.0M 
% 0.66/1.03  rss                     3.1M 
% 0.66/1.03  process.time          0.001s 
% 0.66/1.03  wallclock.time        0.006s 
% 0.66/1.03  status                     S
%------------------------------------------------------------------------------