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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : COL026-1 : TPTP v8.1.0. Released v1.0.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:31 EDT 2022

% Result   : Unsatisfiable 0.62s 1.04s
% Output   : CNFRefutation 0.62s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL026-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : woody %s
% 0.13/0.34  % Computer : n018.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:25:58 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.59/0.98  ********************************************************************************
% 0.59/0.98  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.59/0.98  *                                                              |/  |    \/  |  *
% 0.59/0.98  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.59/0.98  *                             A. Jaeger and B. Loechner          |        |    *
% 0.59/0.98  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.59/0.98  ********************************************************************************
% 0.59/0.98  
% 0.59/0.98  
% 0.59/0.98  Goals:
% 0.59/0.98  ------
% 0.59/0.98  
% 0.59/0.98  (   1)  true ?= false
% 0.59/0.98          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.59/0.98  
% 0.59/0.98  Detected structure: KombinatorlogikB
% 0.59/0.98  ********************************************************************************
% 0.59/0.98  ****************************** COMPLETION - PROOF ******************************
% 0.59/0.98  ********************************************************************************
% 0.59/0.98  
% 0.62/1.04  joined goal:           1  x1 ?= apply(combinator,x1) to false
% 0.62/1.04  goal joined
% 0.62/1.04  % SZS status Unsatisfiable
% 0.62/1.04  #START OF PROOF
% 0.62/1.04  % SZS output start CNFRefutation
% 0.62/1.04  cnf('0.1.0.0',axiom,
% 0.62/1.04      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.62/1.04      file('/tmp/WALDMEISTER_15098_n018')).
% 0.62/1.04  cnf('0.1.1.0',plain,
% 0.62/1.04      ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.1.0.0']),
% 0.62/1.04      [weight('<0,0,0,[0,0,0,1]>')]).
% 0.62/1.04  cnf('0.1.2.0',plain,
% 0.62/1.04      ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.62/1.04      inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_1]).
% 0.62/1.04  cnf('0.2.0.0',axiom,
% 0.62/1.04      ( apply(apply(X1,X2),X2) = apply(apply(w1,X2),X1) ),
% 0.62/1.04      file('/tmp/WALDMEISTER_15098_n018')).
% 0.62/1.04  cnf('0.2.1.0',plain,
% 0.62/1.04      ( apply(apply(X1,X2),X2) = apply(apply(w1,X2),X1) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.2.0.0']),
% 0.62/1.04      [weight('<1,0,0,[0,0,0,2]>')]).
% 0.62/1.04  cnf('0.2.2.0',plain,
% 0.62/1.04      ( apply(apply(X1,X2),X2) = apply(apply(w1,X2),X1) ),
% 0.62/1.04      inference(activate,[status(thm)],['0.2.1.0']),
% 0.62/1.04      [equation_1]).
% 0.62/1.04  cnf('0.3.0.0',axiom,
% 0.62/1.04      ( eq(X1,X1) = true ),
% 0.62/1.04      file('/tmp/WALDMEISTER_15098_n018')).
% 0.62/1.04  cnf('0.3.1.0',plain,
% 0.62/1.04      ( eq(X1,X1) = true ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.3.0.0']),
% 0.62/1.04      [weight('<2,0,0,[0,0,0,3]>')]).
% 0.62/1.04  cnf('0.3.2.0',plain,
% 0.62/1.04      ( eq(X1,X1) = true ),
% 0.62/1.04      inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.62/1.04      [u,rule_2]).
% 0.62/1.04  cnf('0.4.0.0',axiom,
% 0.62/1.04      ( eq(X1,apply(combinator,X1)) = false ),
% 0.62/1.04      file('/tmp/WALDMEISTER_15098_n018')).
% 0.62/1.04  cnf('0.4.1.0',plain,
% 0.62/1.04      ( eq(X1,apply(combinator,X1)) = false ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.4.0.0']),
% 0.62/1.04      [weight('<3,0,0,[0,0,0,4]>')]).
% 0.62/1.04  cnf('0.4.2.0',plain,
% 0.62/1.04      ( eq(X1,apply(combinator,X1)) = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.62/1.04      [u,rule_3]).
% 0.62/1.04  cnf('0.21.0.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1) ),
% 0.62/1.04      inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.62/1.04      [pos('L.1','L')]).
% 0.62/1.04  cnf('0.21.1.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.21.0.0']),
% 0.62/1.04      [weight('<16,2,1,[1,0,0,1]>')]).
% 0.62/1.04  cnf('0.21.2.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,X2),X3)) = apply(apply(X2,apply(X3,X1)),X1) ),
% 0.62/1.04      inference(activate,[status(thm)],['0.21.1.0']),
% 0.62/1.04      [equation_7]).
% 0.62/1.04  cnf('0.87.0.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)) ),
% 0.62/1.04      inference(cp,[status(thm)],['0.21.2.0','0.1.2.0',theory(equality)]),
% 0.62/1.04      [pos('R','L')]).
% 0.62/1.04  cnf('0.87.1.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.87.0.0']),
% 0.62/1.04      [weight('<18,21,1,[1,1,0,0]>')]).
% 0.62/1.04  cnf('0.87.2.0',plain,
% 0.62/1.04      ( apply(apply(w1,X1),apply(apply(b,apply(b,X2)),X3)) = apply(X2,apply(apply(X3,X1),X1)) ),
% 0.62/1.04      inference(activate,[status(thm)],['0.87.1.0']),
% 0.62/1.04      [equation_27]).
% 0.62/1.04  cnf('0.88.0.0',plain,
% 0.62/1.04      ( false = eq(apply(apply(X1,X2),X2),apply(apply(w1,X2),apply(apply(b,apply(b,combinator)),X1))) ),
% 0.62/1.04      inference(cp,[status(thm)],['0.4.2.0','0.87.2.0',theory(equality)]),
% 0.62/1.04      [pos('L.2','R')]).
% 0.62/1.04  cnf('0.88.1.0',plain,
% 0.62/1.04      ( false = eq(apply(apply(X1,X2),X2),apply(apply(w1,X2),apply(apply(b,apply(b,combinator)),X1))) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.88.0.0']),
% 0.62/1.04      [weight('<0,87,4,[0,1,0,2]>')]).
% 0.62/1.04  cnf('0.88.2.0',plain,
% 0.62/1.04      ( eq(apply(apply(X1,X2),X2),apply(apply(w1,X2),apply(apply(b,apply(b,combinator)),X1))) = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.88.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_61]).
% 0.62/1.04  cnf('0.89.0.0',plain,
% 0.62/1.04      ( false = true ),
% 0.62/1.04      inference(cp,[status(thm)],['0.88.2.0','0.3.2.0',theory(equality)]),
% 0.62/1.04      [pos('L','L')]).
% 0.62/1.04  cnf('0.89.1.0',plain,
% 0.62/1.04      ( false = true ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.89.0.0']),
% 0.62/1.04      [weight('<2,88,3,[1,0,0,0]>')]).
% 0.62/1.04  cnf('0.89.2.0',plain,
% 0.62/1.04      ( true = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.89.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_62]).
% 0.62/1.04  cnf('1.0.0.0',conjecture,
% 0.62/1.04      ( true = false ),
% 0.62/1.04      file('/tmp/WALDMEISTER_15098_n018',conjecture_1)).
% 0.62/1.04  cnf('1.0.0.1',plain,
% 0.62/1.04      ( false = false ),
% 0.62/1.04      inference(reduction,[status(thm)],['1.0.0.0','0.89.2.0',theory(equality)]),
% 0.62/1.04      [pos('L','L')]).
% 0.62/1.04  cnf('1.0.0.2',plain,
% 0.62/1.04      ( $true ),
% 0.62/1.04      inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.62/1.04      [conjecture_1]).
% 0.62/1.04  
% 0.62/1.04  Proved Goals:
% 0.62/1.04  No.  1: true ?= false, current false ?= false
% 0.62/1.04          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.62/1.04  
% 0.62/1.04  1 goal was specified, which was proved.
% 0.62/1.04  % SZS output end CNFRefutation
% 0.62/1.04  #END OF PROOF
% 0.62/1.04  
% 0.62/1.04  Problem         WALDMEISTER_15098_n018 
% 0.62/1.04  CPs.gen                 5779 
% 0.62/1.04  CPs.reexp                  0 
% 0.62/1.04  Select                   184 
% 0.62/1.04  R                         62 
% 0.62/1.04  E                         27 
% 0.62/1.04  vsize                   6.4M 
% 0.62/1.04  rss                     3.6M 
% 0.62/1.04  process.time          0.057s 
% 0.62/1.04  wallclock.time        0.058s 
% 0.62/1.04  status                     S
% 0.62/1.04  
% 0.62/1.04  
% 0.62/1.04  Waldmeister states: Goal proved.
% 0.62/1.04  % SZS status Unsatisfiable
% 0.62/1.04  
% 0.62/1.04  Problem         WALDMEISTER_15098_n018 
% 0.62/1.04  CPs.gen                    0 
% 0.62/1.04  CPs.reexp                  0 
% 0.62/1.04  Select                     0 
% 0.62/1.04  R                          0 
% 0.62/1.04  E                          0 
% 0.62/1.04  vsize                   6.0M 
% 0.62/1.04  rss                     3.1M 
% 0.62/1.04  process.time          0.001s 
% 0.62/1.04  wallclock.time        0.057s 
% 0.62/1.04  status                     S
%------------------------------------------------------------------------------