TSTP Solution File: COL038-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL038-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n032.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.49s 1.02s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : COL038-1 : TPTP v8.1.0. Released v1.0.0.
% 0.05/0.11 % Command : woody %s
% 0.10/0.30 % Computer : n032.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 600
% 0.10/0.30 % DateTime : Tue May 31 15:19:28 EDT 2022
% 0.10/0.30 % CPUTime :
% 0.46/0.86 ********************************************************************************
% 0.46/0.86 * W A L D M E I S T E R \| \ / \|/ *
% 0.46/0.86 * |/ | \/ | *
% 0.46/0.86 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.46/0.86 * A. Jaeger and B. Loechner | | *
% 0.46/0.86 * <waldmeister@informatik.uni-kl.de> | *
% 0.46/0.86 ********************************************************************************
% 0.46/0.86
% 0.46/0.86
% 0.46/0.86 Goals:
% 0.46/0.86 ------
% 0.46/0.86
% 0.46/0.86 ( 1) true ?= false
% 0.46/0.86 using narrowing to prove x1 ?= apply(const1,x1)
% 0.46/0.86
% 0.46/0.86 Detected structure: KombinatorlogikB
% 0.46/0.86 ********************************************************************************
% 0.46/0.86 ****************************** COMPLETION - PROOF ******************************
% 0.46/0.86 ********************************************************************************
% 0.46/0.86
% 0.49/1.02 joined goal: 3 apply(const2,const1) ?= apply(const1,apply(const2,const1)) to apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1))))
% 0.49/1.02 goal joined
% 0.49/1.02 % SZS status Unsatisfiable
% 0.49/1.02 #START OF PROOF
% 0.49/1.02 % SZS output start CNFRefutation
% 0.49/1.02 cnf('0.329.0.0',axiom,
% 0.49/1.02 ( apply(X1,X1) = apply(m,X1) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.329.1.0',plain,
% 0.49/1.02 ( apply(X1,X1) = apply(m,X1) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.329.0.0']),
% 0.49/1.02 [weight('<7,0,0,[0,0,0,8]>')]).
% 0.49/1.02 cnf('0.329.2.0',plain,
% 0.49/1.02 ( apply(m,X1) = apply(X1,X1) ),
% 0.49/1.02 inference(orient,[status(thm)],['0.329.1.0',theory(equality)]),
% 0.49/1.02 [x,rule_326]).
% 0.49/1.02 cnf('0.330.0.0',axiom,
% 0.49/1.02 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.330.1.0',plain,
% 0.49/1.02 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.330.0.0']),
% 0.49/1.02 [weight('<8,0,0,[0,0,0,9]>')]).
% 0.49/1.02 cnf('0.330.2.0',plain,
% 0.49/1.02 ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.49/1.02 inference(orient,[status(thm)],['0.330.1.0',theory(equality)]),
% 0.49/1.02 [x,rule_327]).
% 0.49/1.02 cnf('0.331.0.0',axiom,
% 0.49/1.02 ( apply(apply(X1,X2),X3) = apply(apply(apply(v,X2),X3),X1) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.331.1.0',plain,
% 0.49/1.02 ( apply(apply(X1,X2),X3) = apply(apply(apply(v,X2),X3),X1) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.331.0.0']),
% 0.49/1.02 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.49/1.02 cnf('0.331.2.0',plain,
% 0.49/1.02 ( apply(apply(apply(v,X1),X2),X3) = apply(apply(X3,X1),X2) ),
% 0.49/1.02 inference(orient,[status(thm)],['0.331.1.0',theory(equality)]),
% 0.49/1.02 [x,rule_328]).
% 0.49/1.02 cnf('0.332.0.0',axiom,
% 0.49/1.02 ( const2 = apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.332.1.0',plain,
% 0.49/1.02 ( const2 = apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.332.0.0']),
% 0.49/1.02 [weight('<10,0,0,[0,0,0,11]>')]).
% 0.49/1.02 cnf('0.332.2.0',plain,
% 0.49/1.02 ( const2 = apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v) ),
% 0.49/1.02 inference(orient,[status(thm)],['0.332.1.0',theory(equality)]),
% 0.49/1.02 [u,rule_329]).
% 0.49/1.02 cnf('3.0.0.0',conjecture,
% 0.49/1.02 ( apply(const2,const1) = apply(const1,apply(const2,const1)) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032',conjecture_3)).
% 0.49/1.02 cnf('3.0.0.1',plain,
% 0.49/1.02 ( apply(apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v),const1) = apply(const1,apply(const2,const1)) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.0','0.332.2.0',theory(equality)]),
% 0.49/1.02 [pos('L.1','L')]).
% 0.49/1.02 cnf('3.0.0.2',plain,
% 0.49/1.02 ( apply(apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v),const1) = apply(const1,apply(apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v),const1)) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.1','0.332.2.0',theory(equality)]),
% 0.49/1.02 [pos('R.2.1','L')]).
% 0.49/1.02 cnf('3.0.0.3',plain,
% 0.49/1.02 ( apply(apply(apply(b,apply(apply(b,m),apply(apply(v,m),b))),v),const1) = apply(const1,apply(apply(apply(b,m),apply(apply(v,m),b)),apply(v,const1))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.2','0.330.2.0',theory(equality)]),
% 0.49/1.02 [pos('R.2','L')]).
% 0.49/1.02 cnf('3.0.0.4',plain,
% 0.49/1.02 ( apply(apply(apply(b,m),apply(apply(v,m),b)),apply(v,const1)) = apply(const1,apply(apply(apply(b,m),apply(apply(v,m),b)),apply(v,const1))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.3','0.330.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('3.0.0.5',plain,
% 0.49/1.02 ( apply(apply(apply(b,m),apply(apply(v,m),b)),apply(v,const1)) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.4','0.330.2.0',theory(equality)]),
% 0.49/1.02 [pos('R.2','L')]).
% 0.49/1.02 cnf('3.0.0.6',plain,
% 0.49/1.02 ( apply(m,apply(apply(apply(v,m),b),apply(v,const1))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.5','0.330.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('3.0.0.7',plain,
% 0.49/1.02 ( apply(apply(apply(apply(v,m),b),apply(v,const1)),apply(apply(apply(v,m),b),apply(v,const1))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.6','0.329.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('3.0.0.8',plain,
% 0.49/1.02 ( apply(apply(apply(apply(v,const1),m),b),apply(apply(apply(v,m),b),apply(v,const1))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.7','0.331.2.0',theory(equality)]),
% 0.49/1.02 [pos('L.1','L')]).
% 0.49/1.02 cnf('3.0.0.9',plain,
% 0.49/1.02 ( apply(apply(apply(b,const1),m),apply(apply(apply(v,m),b),apply(v,const1))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.8','0.331.2.0',theory(equality)]),
% 0.49/1.02 [pos('L.1','L')]).
% 0.49/1.02 cnf('3.0.0.10',plain,
% 0.49/1.02 ( apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) ),
% 0.49/1.02 inference(reduction,[status(thm)],['3.0.0.9','0.330.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('3.0.0.11',plain,
% 0.49/1.02 ( $true ),
% 0.49/1.02 inference(trivial,[status(thm)],['3.0.0.10',theory(equality)]),
% 0.49/1.02 [conjecture_3]).
% 0.49/1.02 joined goal: 1 x1 ?= apply(const1,x1) to false
% 0.49/1.02 goal joined
% 0.49/1.02 #START OF PROOF
% 0.49/1.02 % SZS output start CNFRefutation
% 0.49/1.02 cnf('0.333.0.0',axiom,
% 0.49/1.02 ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.333.1.0',plain,
% 0.49/1.02 ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.333.0.0']),
% 0.49/1.02 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.49/1.02 cnf('0.333.2.0',plain,
% 0.49/1.02 ( apply(const2,X1) = apply(X1,apply(const2,X1)) ),
% 0.49/1.02 inference(activate,[status(thm)],['0.333.1.0']),
% 0.49/1.02 [equation_4]).
% 0.49/1.02 cnf('0.334.0.0',axiom,
% 0.49/1.02 ( eq(X1,X1) = true ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.334.1.0',plain,
% 0.49/1.02 ( eq(X1,X1) = true ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.334.0.0']),
% 0.49/1.02 [weight('<12,0,0,[0,0,0,14]>')]).
% 0.49/1.02 cnf('0.334.2.0',plain,
% 0.49/1.02 ( eq(X1,X1) = true ),
% 0.49/1.02 inference(orient,[status(thm)],['0.334.1.0',theory(equality)]),
% 0.49/1.02 [u,rule_330]).
% 0.49/1.02 cnf('0.335.0.0',axiom,
% 0.49/1.02 ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032')).
% 0.49/1.02 cnf('0.335.1.0',plain,
% 0.49/1.02 ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.335.0.0']),
% 0.49/1.02 [weight('<13,0,0,[0,0,0,13]>')]).
% 0.49/1.02 cnf('0.335.2.0',plain,
% 0.49/1.02 ( eq(apply(X1,f(X1)),apply(f(X1),apply(X1,f(X1)))) = false ),
% 0.49/1.02 inference(orient,[status(thm)],['0.335.1.0',theory(equality)]),
% 0.49/1.02 [u,rule_331]).
% 0.49/1.02 cnf('0.336.0.0',plain,
% 0.49/1.02 ( false = eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) ),
% 0.49/1.02 inference(cp,[status(thm)],['0.335.2.0','0.333.2.0',theory(equality)]),
% 0.49/1.02 [pos('L.1','L')]).
% 0.49/1.02 cnf('0.336.1.0',plain,
% 0.49/1.02 ( false = eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.336.0.0']),
% 0.49/1.02 [weight('<0,335,333,[1,0,0,1]>')]).
% 0.49/1.02 cnf('0.336.2.0',plain,
% 0.49/1.02 ( eq(apply(f(const2),apply(const2,f(const2))),apply(f(const2),apply(const2,f(const2)))) = false ),
% 0.49/1.02 inference(orient,[status(thm)],['0.336.1.0',theory(equality)]),
% 0.49/1.02 [x,rule_332]).
% 0.49/1.02 cnf('0.337.0.0',plain,
% 0.49/1.02 ( false = true ),
% 0.49/1.02 inference(cp,[status(thm)],['0.336.2.0','0.334.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('0.337.1.0',plain,
% 0.49/1.02 ( false = true ),
% 0.49/1.02 inference(weigh,[status(thm)],['0.337.0.0']),
% 0.49/1.02 [weight('<5,336,334,[1,0,0,0]>')]).
% 0.49/1.02 cnf('0.337.2.0',plain,
% 0.49/1.02 ( true = false ),
% 0.49/1.02 inference(orient,[status(thm)],['0.337.1.0',theory(equality)]),
% 0.49/1.02 [x,rule_333]).
% 0.49/1.02 cnf('1.0.0.0',conjecture,
% 0.49/1.02 ( true = false ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032',conjecture_1)).
% 0.49/1.02 cnf('1.0.0.1',plain,
% 0.49/1.02 ( false = false ),
% 0.49/1.02 inference(reduction,[status(thm)],['1.0.0.0','0.337.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('1.0.0.2',plain,
% 0.49/1.02 ( $true ),
% 0.49/1.02 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.49/1.02 [conjecture_1]).
% 0.49/1.02 joined goal: 4 apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(x1))) to false
% 0.49/1.02 goal joined
% 0.49/1.02 #START OF PROOF
% 0.49/1.02 % SZS output start CNFRefutation
% 0.49/1.02 cnf('4.0.0.0',conjecture,
% 0.49/1.02 ( true = false ),
% 0.49/1.02 file('/tmp/WALDMEISTER_9020_n032',conjecture_4)).
% 0.49/1.02 cnf('4.0.0.1',plain,
% 0.49/1.02 ( false = false ),
% 0.49/1.02 inference(reduction,[status(thm)],['4.0.0.0','0.337.2.0',theory(equality)]),
% 0.49/1.02 [pos('L','L')]).
% 0.49/1.02 cnf('4.0.0.2',plain,
% 0.49/1.02 ( $true ),
% 0.49/1.02 inference(trivial,[status(thm)],['4.0.0.1',theory(equality)]),
% 0.49/1.02 [conjecture_4]).
% 0.49/1.02
% 0.49/1.02 Proved Goals:
% 0.49/1.02 No. 1: true ?= false, current false ?= false
% 0.49/1.02 using narrowing to prove x1 ?= apply(const1,x1)
% 0.49/1.02
% 0.49/1.02 No. 3: apply(const2,const1) ?= apply(const1,apply(const2,const1)) joined, current: apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1)))) = apply(const1,apply(m,apply(apply(apply(v,m),b),apply(v,const1))))
% 0.49/1.02 No. 4: true ?= false, current false ?= false
% 0.49/1.02 using narrowing to prove apply(x1,f(x1)) ?= apply(f(x1),apply(x1,f(x1)))
% 0.49/1.02
% 0.49/1.02 1 goal was specified, which was proved.
% 0.49/1.02 % SZS output end CNFRefutation
% 0.49/1.02 #END OF PROOF
% 0.49/1.02
% 0.49/1.02 Problem WALDMEISTER_9020_n032
% 0.49/1.02 CPs.gen 2496
% 0.49/1.02 CPs.reexp 0
% 0.49/1.02 Select 2509
% 0.49/1.02 R 333
% 0.49/1.02 E 4
% 0.49/1.02 vsize 6.9M
% 0.49/1.02 rss 4.1M
% 0.49/1.02 process.time 0.028s
% 0.49/1.02 wallclock.time 0.152s
% 0.49/1.02 status S
% 0.49/1.02
% 0.49/1.02
% 0.49/1.02 Waldmeister states: Goal proved.
% 0.49/1.02 % SZS status Unsatisfiable
% 0.49/1.02
% 0.49/1.02 Problem WALDMEISTER_9020_n032
% 0.49/1.02 CPs.gen 9044
% 0.49/1.02 CPs.reexp 0
% 0.49/1.02 Select 512
% 0.49/1.02 R 130
% 0.49/1.02 E 42
% 0.49/1.02 vsize 6.6M
% 0.49/1.02 rss 3.6M
% 0.49/1.02 process.time 0.125s
% 0.49/1.02 wallclock.time 0.153s
% 0.49/1.02 status S
%------------------------------------------------------------------------------