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

View Problem - Process Solution

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

% Computer : n021.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:29 EDT 2022

% Result   : Unsatisfiable 0.60s 0.98s
% Output   : CNFRefutation 0.60s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : COL012-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13  % Command  : woody %s
% 0.13/0.34  % Computer : n021.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 09:51:59 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.60/0.98  ********************************************************************************
% 0.60/0.98  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.60/0.98  *                                                              |/  |    \/  |  *
% 0.60/0.98  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.60/0.98  *                             A. Jaeger and B. Loechner          |        |    *
% 0.60/0.98  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.60/0.98  ********************************************************************************
% 0.60/0.98  
% 0.60/0.98  
% 0.60/0.98  Goals:
% 0.60/0.98  ------
% 0.60/0.98  
% 0.60/0.98  (   1)  true ?= false
% 0.60/0.98          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.60/0.98  
% 0.60/0.98  Detected structure: Orkus
% 0.60/0.98  ********************************************************************************
% 0.60/0.98  ****************************** COMPLETION - PROOF ******************************
% 0.60/0.98  ********************************************************************************
% 0.60/0.98  
% 0.60/0.98  joined goal:           1  x1 ?= apply(combinator,x1) to false
% 0.60/0.98  goal joined
% 0.60/0.98  % SZS status Unsatisfiable
% 0.60/0.98  #START OF PROOF
% 0.60/0.98  % SZS output start CNFRefutation
% 0.60/0.98  cnf('0.1.0.0',axiom,
% 0.60/0.98      ( apply(X1,apply(apply(X2,X2),X1)) = apply(apply(u,X2),X1) ),
% 0.60/0.98      file('/tmp/WALDMEISTER_26199_n021')).
% 0.60/0.98  cnf('0.1.1.0',plain,
% 0.60/0.98      ( apply(X1,apply(apply(X2,X2),X1)) = apply(apply(u,X2),X1) ),
% 0.60/0.98      inference(weigh,[status(thm)],['0.1.0.0']),
% 0.60/0.98      [weight('<0,0,0,[0,0,0,1]>')]).
% 0.60/0.98  cnf('0.1.2.0',plain,
% 0.60/0.98      ( apply(X1,apply(apply(X2,X2),X1)) = apply(apply(u,X2),X1) ),
% 0.60/0.98      inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.60/0.98      [u,rule_1]).
% 0.60/0.98  cnf('0.2.0.0',axiom,
% 0.60/0.98      ( eq(X1,X1) = true ),
% 0.60/0.98      file('/tmp/WALDMEISTER_26199_n021')).
% 0.60/0.98  cnf('0.2.1.0',plain,
% 0.60/0.98      ( eq(X1,X1) = true ),
% 0.60/0.98      inference(weigh,[status(thm)],['0.2.0.0']),
% 0.60/0.98      [weight('<1,0,0,[0,0,0,2]>')]).
% 0.60/0.98  cnf('0.2.2.0',plain,
% 0.60/0.98      ( eq(X1,X1) = true ),
% 0.60/0.98      inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.60/0.98      [u,rule_2]).
% 0.60/0.98  cnf('0.3.0.0',axiom,
% 0.60/0.98      ( eq(X1,apply(combinator,X1)) = false ),
% 0.60/0.98      file('/tmp/WALDMEISTER_26199_n021')).
% 0.60/0.98  cnf('0.3.1.0',plain,
% 0.60/0.98      ( eq(X1,apply(combinator,X1)) = false ),
% 0.60/0.98      inference(weigh,[status(thm)],['0.3.0.0']),
% 0.60/0.98      [weight('<2,0,0,[0,0,0,3]>')]).
% 0.60/0.98  cnf('0.3.2.0',plain,
% 0.60/0.98      ( eq(X1,apply(combinator,X1)) = false ),
% 0.60/0.98      inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.60/0.98      [u,rule_3]).
% 0.60/0.98  cnf('0.5.0.0',plain,
% 0.60/0.98      ( false = eq(apply(apply(X1,X1),combinator),apply(apply(u,X1),combinator)) ),
% 0.60/0.98      inference(cp,[status(thm)],['0.3.2.0','0.1.2.0',theory(equality)]),
% 0.60/0.98      [pos('L.2','L')]).
% 0.60/0.98  cnf('0.5.1.0',plain,
% 0.60/0.98      ( false = eq(apply(apply(X1,X1),combinator),apply(apply(u,X1),combinator)) ),
% 0.60/0.98      inference(weigh,[status(thm)],['0.5.0.0']),
% 0.60/0.98      [weight('<0,3,1,[1,0,0,2]>')]).
% 0.60/0.98  cnf('0.5.2.0',plain,
% 0.60/0.98      ( eq(apply(apply(X1,X1),combinator),apply(apply(u,X1),combinator)) = false ),
% 0.60/0.98      inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.60/0.98      [x,rule_5]).
% 0.60/0.98  cnf('0.6.0.0',plain,
% 0.60/0.98      ( false = true ),
% 0.60/0.98      inference(cp,[status(thm)],['0.5.2.0','0.2.2.0',theory(equality)]),
% 0.60/0.98      [pos('L','L')]).
% 0.60/0.98  cnf('0.6.1.0',plain,
% 0.60/0.98      ( false = true ),
% 0.60/0.98      inference(weigh,[status(thm)],['0.6.0.0']),
% 0.60/0.98      [weight('<5,5,2,[1,0,0,0]>')]).
% 0.60/0.98  cnf('0.6.2.0',plain,
% 0.60/0.98      ( true = false ),
% 0.60/0.98      inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.60/0.98      [x,rule_6]).
% 0.60/0.98  cnf('1.0.0.0',conjecture,
% 0.60/0.98      ( true = false ),
% 0.60/0.98      file('/tmp/WALDMEISTER_26199_n021',conjecture_1)).
% 0.60/0.98  cnf('1.0.0.1',plain,
% 0.60/0.98      ( false = false ),
% 0.60/0.98      inference(reduction,[status(thm)],['1.0.0.0','0.6.2.0',theory(equality)]),
% 0.60/0.98      [pos('L','L')]).
% 0.60/0.98  cnf('1.0.0.2',plain,
% 0.60/0.98      ( $true ),
% 0.60/0.98      inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.60/0.98      [conjecture_1]).
% 0.60/0.98  
% 0.60/0.98  Proved Goals:
% 0.60/0.98  No.  1: true ?= false, current false ?= false
% 0.60/0.98          using narrowing to prove x1 ?= apply(combinator,x1)
% 0.60/0.98  
% 0.60/0.98  1 goal was specified, which was proved.
% 0.60/0.98  % SZS output end CNFRefutation
% 0.60/0.98  #END OF PROOF
% 0.60/0.98  
% 0.60/0.98  Problem         WALDMEISTER_26199_n021 
% 0.60/0.98  CPs.gen                   14 
% 0.60/0.98  CPs.reexp                  0 
% 0.60/0.98  Select                     6 
% 0.60/0.98  R                          6 
% 0.60/0.98  E                          0 
% 0.60/0.98  vsize                   6.4M 
% 0.60/0.98  rss                     3.4M 
% 0.60/0.98  process.time          0.002s 
% 0.60/0.98  wallclock.time        0.002s 
% 0.60/0.98  status                     S
% 0.60/0.98  
% 0.60/0.98  
% 0.60/0.98  Waldmeister states: Goal proved.
% 0.60/0.98  % SZS status Unsatisfiable
%------------------------------------------------------------------------------