TSTP Solution File: COL064-2 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL064-2 : TPTP v8.1.0. Bugfixed v1.2.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:39 EDT 2022
% Result : Unsatisfiable 0.63s 1.04s
% Output : CNFRefutation 0.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : COL064-2 : TPTP v8.1.0. Bugfixed v1.2.0.
% 0.07/0.12 % Command : woody %s
% 0.13/0.31 % Computer : n026.cluster.edu
% 0.13/0.31 % Model : x86_64 x86_64
% 0.13/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.31 % Memory : 8042.1875MB
% 0.13/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.31 % CPULimit : 300
% 0.13/0.31 % WCLimit : 600
% 0.13/0.31 % DateTime : Tue May 31 08:27:11 EDT 2022
% 0.13/0.31 % CPUTime :
% 0.63/1.04 ********************************************************************************
% 0.63/1.04 * W A L D M E I S T E R \| \ / \|/ *
% 0.63/1.04 * |/ | \/ | *
% 0.63/1.04 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.63/1.04 * A. Jaeger and B. Loechner | | *
% 0.63/1.04 * <waldmeister@informatik.uni-kl.de> | *
% 0.63/1.04 ********************************************************************************
% 0.63/1.04
% 0.63/1.04
% 0.63/1.04 Goals:
% 0.63/1.04 ------
% 0.63/1.04
% 0.63/1.04 ( 1) apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),apply(apply(b,b),t))),x),y),z) ?=? apply(apply(z,x),y)
% 0.63/1.04
% 0.63/1.04 Detected structure: KombinatorlogikBT
% 0.63/1.04 ********************************************************************************
% 0.63/1.04 ****************************** COMPLETION - PROOF ******************************
% 0.63/1.04 ********************************************************************************
% 0.63/1.04
% 0.63/1.04 joined goal: 1 apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),apply(apply(b,b),t))),x),y),z) ?= apply(apply(z,x),y) to apply(apply(z,x),y)
% 0.63/1.04 goal joined
% 0.63/1.04 % SZS status Unsatisfiable
% 0.63/1.04 #START OF PROOF
% 0.63/1.04 % SZS output start CNFRefutation
% 0.63/1.04 cnf('0.1.0.0',axiom,
% 0.63/1.04 ( apply(X1,X2) = apply(apply(t,X2),X1) ),
% 0.63/1.04 file('/tmp/WALDMEISTER_26898_n026')).
% 0.63/1.04 cnf('0.1.1.0',plain,
% 0.63/1.04 ( apply(X1,X2) = apply(apply(t,X2),X1) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.63/1.04 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.63/1.04 cnf('0.1.2.0',plain,
% 0.63/1.04 ( apply(apply(t,X1),X2) = apply(X2,X1) ),
% 0.63/1.04 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_1]).
% 0.63/1.04 cnf('0.2.0.0',axiom,
% 0.63/1.04 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.63/1.04 file('/tmp/WALDMEISTER_26898_n026')).
% 0.63/1.04 cnf('0.2.1.0',plain,
% 0.63/1.04 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.63/1.04 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.63/1.04 cnf('0.2.2.0',plain,
% 0.63/1.04 ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.63/1.04 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_2]).
% 0.63/1.04 cnf('1.0.0.0',conjecture,
% 0.63/1.04 ( apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),apply(apply(b,b),t))),x),y),z) = apply(apply(z,x),y) ),
% 0.63/1.04 file('/tmp/WALDMEISTER_26898_n026',conjecture_1)).
% 0.63/1.04 cnf('1.0.0.1',plain,
% 0.63/1.04 ( apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(apply(apply(b,b),apply(apply(b,b),t)),x)),y),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.0','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1.1','L')]).
% 0.63/1.04 cnf('1.0.0.2',plain,
% 0.63/1.04 ( apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(apply(apply(b,b),t),x))),y),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.1','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1.1.2','L')]).
% 0.63/1.04 cnf('1.0.0.3',plain,
% 0.63/1.04 ( apply(apply(apply(apply(t,apply(apply(b,b),t)),apply(b,apply(b,apply(t,x)))),y),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.2','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1.1.2.2','L')]).
% 0.63/1.04 cnf('1.0.0.4',plain,
% 0.63/1.04 ( apply(apply(apply(apply(b,apply(b,apply(t,x))),apply(apply(b,b),t)),y),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.3','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1.1','L')]).
% 0.63/1.04 cnf('1.0.0.5',plain,
% 0.63/1.04 ( apply(apply(apply(b,apply(t,x)),apply(apply(apply(b,b),t),y)),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.4','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1','L')]).
% 0.63/1.04 cnf('1.0.0.6',plain,
% 0.63/1.04 ( apply(apply(apply(b,apply(t,x)),apply(b,apply(t,y))),z) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.5','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1.2','L')]).
% 0.63/1.04 cnf('1.0.0.7',plain,
% 0.63/1.04 ( apply(apply(t,x),apply(apply(b,apply(t,y)),z)) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.6','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('1.0.0.8',plain,
% 0.63/1.04 ( apply(apply(apply(b,apply(t,y)),z),x) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.7','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('1.0.0.9',plain,
% 0.63/1.04 ( apply(apply(t,y),apply(z,x)) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.8','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('1.0.0.10',plain,
% 0.63/1.04 ( apply(apply(z,x),y) = apply(apply(z,x),y) ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.9','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('1.0.0.11',plain,
% 0.63/1.04 ( $true ),
% 0.63/1.04 inference(trivial,[status(thm)],['1.0.0.10',theory(equality)]),
% 0.63/1.04 [conjecture_1]).
% 0.63/1.04
% 0.63/1.04 Proved Goals:
% 0.63/1.04 No. 1: apply(apply(apply(apply(apply(b,apply(t,apply(apply(b,b),t))),apply(apply(b,b),apply(apply(b,b),t))),x),y),z) ?= apply(apply(z,x),y) joined, current: apply(apply(z,x),y) = apply(apply(z,x),y)
% 0.63/1.04 1 goal was specified, which was proved.
% 0.63/1.04 % SZS output end CNFRefutation
% 0.63/1.04 #END OF PROOF
% 0.63/1.04
% 0.63/1.04 Problem WALDMEISTER_26898_n026
% 0.63/1.04 CPs.gen 0
% 0.63/1.04 CPs.reexp 0
% 0.63/1.04 Select 2
% 0.63/1.04 R 2
% 0.63/1.04 E 0
% 0.63/1.04 vsize 6.5M
% 0.63/1.04 rss 3.5M
% 0.63/1.04 process.time 0.002s
% 0.63/1.04 wallclock.time 0.002s
% 0.63/1.04 status S
% 0.63/1.04
% 0.63/1.04
% 0.63/1.04 Waldmeister states: Goal proved.
% 0.63/1.04 % SZS status Unsatisfiable
%------------------------------------------------------------------------------