↑ Up

Waldmeister---710.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Waldmeister---710
% Problem  : COL039-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : woody %s

% Computer : n023.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:32 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.00/0.12  % Problem  : COL039-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.12  % Command  : woody %s
% 0.12/0.33  % Computer : n023.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 12:15:56 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.62/1.03  ********************************************************************************
% 0.62/1.03  *                             W A L D M E I S T E R           \|  \ /      \|/ *
% 0.62/1.03  *                                                              |/  |    \/  |  *
% 0.62/1.03  *              (C) 1994-2010  A. Buch and Th. Hillenbrand,      \ /      \ /   *
% 0.62/1.03  *                             A. Jaeger and B. Loechner          |        |    *
% 0.62/1.03  *                             <waldmeister@informatik.uni-kl.de>          |    *
% 0.62/1.03  ********************************************************************************
% 0.62/1.03  
% 0.62/1.03  
% 0.62/1.03  Goals:
% 0.62/1.03  ------
% 0.62/1.03  
% 0.62/1.03  (   1)  true ?= false
% 0.62/1.03          using narrowing to prove x1 ?= apply(const1,x1)
% 0.62/1.03  
% 0.62/1.03  Detected structure: KombinatorlogikB
% 0.62/1.03  ********************************************************************************
% 0.62/1.03  ****************************** COMPLETION - PROOF ******************************
% 0.62/1.03  ********************************************************************************
% 0.62/1.03  
% 0.62/1.04  joined goal:           1  apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(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,X1) = apply(m,X1) ),
% 0.62/1.04      file('/tmp/WALDMEISTER_31426_n023')).
% 0.62/1.04  cnf('0.1.1.0',plain,
% 0.62/1.04      ( apply(X1,X1) = apply(m,X1) ),
% 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(X1,X1) = apply(m,X1) ),
% 0.62/1.04      inference(activate,[status(thm)],['0.1.1.0']),
% 0.62/1.04      [equation_1]).
% 0.62/1.04  cnf('0.2.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_31426_n023')).
% 0.62/1.04  cnf('0.2.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.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(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.62/1.04      inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_1]).
% 0.62/1.04  cnf('0.3.0.0',axiom,
% 0.62/1.04      ( apply(X1,apply(X2,X1)) = apply(apply(o,X2),X1) ),
% 0.62/1.04      file('/tmp/WALDMEISTER_31426_n023')).
% 0.62/1.04  cnf('0.3.1.0',plain,
% 0.62/1.04      ( apply(X1,apply(X2,X1)) = apply(apply(o,X2),X1) ),
% 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      ( apply(X1,apply(X2,X1)) = apply(apply(o,X2),X1) ),
% 0.62/1.04      inference(activate,[status(thm)],['0.3.1.0']),
% 0.62/1.04      [equation_2]).
% 0.62/1.04  cnf('0.4.0.0',axiom,
% 0.62/1.04      ( eq(X1,X1) = true ),
% 0.62/1.04      file('/tmp/WALDMEISTER_31426_n023')).
% 0.62/1.04  cnf('0.4.1.0',plain,
% 0.62/1.04      ( eq(X1,X1) = true ),
% 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,X1) = true ),
% 0.62/1.04      inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.62/1.04      [u,rule_2]).
% 0.62/1.04  cnf('0.5.0.0',axiom,
% 0.62/1.04      ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.62/1.04      file('/tmp/WALDMEISTER_31426_n023')).
% 0.62/1.04  cnf('0.5.1.0',plain,
% 0.62/1.04      ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.5.0.0']),
% 0.62/1.04      [weight('<4,0,0,[0,0,0,5]>')]).
% 0.62/1.04  cnf('0.5.1.1',plain,
% 0.62/1.04      ( eq(apply(X1,f(X1)),apply(apply(o,X1),f(X1))) = false ),
% 0.62/1.04      inference(reduction,[status(thm)],['0.5.1.0','0.3.2.0',theory(equality)]),
% 0.62/1.04      [pos('L.2','L')]).
% 0.62/1.04  cnf('0.5.2.0',plain,
% 0.62/1.04      ( eq(apply(X1,f(X1)),apply(apply(o,X1),f(X1))) = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.5.1.1',theory(equality)]),
% 0.62/1.04      [u,rule_3]).
% 0.62/1.04  cnf('0.22.0.0',plain,
% 0.62/1.04      ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.62/1.04      inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.62/1.04      [pos('L','L')]).
% 0.62/1.04  cnf('0.22.1.0',plain,
% 0.62/1.04      ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.22.0.0']),
% 0.62/1.04      [weight('<16,2,1,[1,0,0,0]>')]).
% 0.62/1.04  cnf('0.22.2.0',plain,
% 0.62/1.04      ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.62/1.04      inference(orient,[status(thm)],['0.22.1.0',theory(equality)]),
% 0.62/1.04      [u,rule_15]).
% 0.62/1.04  cnf('0.23.0.0',plain,
% 0.62/1.04      ( false = eq(apply(apply(X1,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1)))),apply(apply(m,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1))))) ),
% 0.62/1.04      inference(cp,[status(thm)],['0.5.2.0','0.22.2.0',theory(equality)]),
% 0.62/1.04      [pos('L.2.1','L')]).
% 0.62/1.04  cnf('0.23.1.0',plain,
% 0.62/1.04      ( false = eq(apply(apply(X1,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1)))),apply(apply(m,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1))))) ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.23.0.0']),
% 0.62/1.04      [weight('<0,22,5,[0,0,0,6]>')]).
% 0.62/1.04  cnf('0.23.2.0',plain,
% 0.62/1.04      ( eq(apply(apply(X1,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1)))),apply(apply(m,apply(apply(b,o),X1)),f(apply(X1,apply(apply(b,o),X1))))) = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.23.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_16]).
% 0.62/1.04  cnf('0.24.0.0',plain,
% 0.62/1.04      ( false = true ),
% 0.62/1.04      inference(cp,[status(thm)],['0.23.2.0','0.4.2.0',theory(equality)]),
% 0.62/1.04      [pos('L','L')]).
% 0.62/1.04  cnf('0.24.1.0',plain,
% 0.62/1.04      ( false = true ),
% 0.62/1.04      inference(weigh,[status(thm)],['0.24.0.0']),
% 0.62/1.04      [weight('<2,23,4,[1,0,0,0]>')]).
% 0.62/1.04  cnf('0.24.2.0',plain,
% 0.62/1.04      ( true = false ),
% 0.62/1.04      inference(orient,[status(thm)],['0.24.1.0',theory(equality)]),
% 0.62/1.04      [x,rule_17]).
% 0.62/1.04  cnf('1.0.0.0',conjecture,
% 0.62/1.04      ( true = false ),
% 0.62/1.04      file('/tmp/WALDMEISTER_31426_n023',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.24.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 apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(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_31426_n023 
% 0.62/1.04  CPs.gen                  279 
% 0.62/1.04  CPs.reexp                  0 
% 0.62/1.04  Select                    48 
% 0.62/1.04  R                         17 
% 0.62/1.04  E                          7 
% 0.62/1.04  vsize                   6.5M 
% 0.62/1.04  rss                     3.7M 
% 0.62/1.04  process.time          0.007s 
% 0.62/1.04  wallclock.time        0.008s 
% 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_31426_n023 
% 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.2M 
% 0.62/1.04  process.time          0.001s 
% 0.62/1.04  wallclock.time        0.007s 
% 0.62/1.04  status                     S
%------------------------------------------------------------------------------