TSTP Solution File: COL011-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL011-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:29 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.03/0.13 % Problem : COL011-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : woody %s
% 0.14/0.34 % Computer : n018.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue May 31 08:35:28 EDT 2022
% 0.14/0.35 % 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: KombinatorlogikO
% 0.60/0.98 ********************************************************************************
% 0.60/0.98 ****************************** COMPLETION - PROOF ******************************
% 0.60/0.98 ********************************************************************************
% 0.60/0.98
% 0.63/1.04 joined goal: 1 x1 ?= apply(combinator,x1) to false
% 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,apply(X2,X3)) = apply(apply(apply(q1,X1),X3),X2) ),
% 0.63/1.04 file('/tmp/WALDMEISTER_23670_n018')).
% 0.63/1.04 cnf('0.1.1.0',plain,
% 0.63/1.04 ( apply(X1,apply(X2,X3)) = apply(apply(apply(q1,X1),X3),X2) ),
% 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(apply(q1,X1),X2),X3) = apply(X1,apply(X3,X2)) ),
% 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,X1)) = apply(apply(o,X2),X1) ),
% 0.63/1.04 file('/tmp/WALDMEISTER_23670_n018')).
% 0.63/1.04 cnf('0.2.1.0',plain,
% 0.63/1.04 ( apply(X1,apply(X2,X1)) = apply(apply(o,X2),X1) ),
% 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(X1,apply(X2,X1)) = apply(apply(o,X2),X1) ),
% 0.63/1.04 inference(activate,[status(thm)],['0.2.1.0']),
% 0.63/1.04 [equation_1]).
% 0.63/1.04 cnf('0.3.0.0',axiom,
% 0.63/1.04 ( eq(X1,X1) = true ),
% 0.63/1.04 file('/tmp/WALDMEISTER_23670_n018')).
% 0.63/1.04 cnf('0.3.1.0',plain,
% 0.63/1.04 ( eq(X1,X1) = true ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.63/1.04 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.63/1.04 cnf('0.3.2.0',plain,
% 0.63/1.04 ( eq(X1,X1) = true ),
% 0.63/1.04 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.63/1.04 [u,rule_2]).
% 0.63/1.04 cnf('0.4.0.0',axiom,
% 0.63/1.04 ( eq(X1,apply(combinator,X1)) = false ),
% 0.63/1.04 file('/tmp/WALDMEISTER_23670_n018')).
% 0.63/1.04 cnf('0.4.1.0',plain,
% 0.63/1.04 ( eq(X1,apply(combinator,X1)) = false ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.63/1.04 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.63/1.04 cnf('0.4.2.0',plain,
% 0.63/1.04 ( eq(X1,apply(combinator,X1)) = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.63/1.04 [u,rule_3]).
% 0.63/1.04 cnf('0.12.0.0',plain,
% 0.63/1.04 ( apply(apply(o,X1),apply(apply(q1,X2),X3)) = apply(X2,apply(apply(X1,apply(apply(q1,X2),X3)),X3)) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('0.12.1.0',plain,
% 0.63/1.04 ( apply(apply(o,X1),apply(apply(q1,X2),X3)) = apply(X2,apply(apply(X1,apply(apply(q1,X2),X3)),X3)) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.63/1.04 [weight('<20,2,1,[1,0,0,0]>')]).
% 0.63/1.04 cnf('0.12.2.0',plain,
% 0.63/1.04 ( apply(X1,apply(apply(X2,apply(apply(q1,X1),X3)),X3)) = apply(apply(o,X2),apply(apply(q1,X1),X3)) ),
% 0.63/1.04 inference(orient,[status(thm)],['0.12.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_6]).
% 0.63/1.04 cnf('0.13.0.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(X1,apply(apply(q1,combinator),X2)),X2),apply(apply(o,X1),apply(apply(q1,combinator),X2))) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.4.2.0','0.12.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.2','L')]).
% 0.63/1.04 cnf('0.13.1.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(X1,apply(apply(q1,combinator),X2)),X2),apply(apply(o,X1),apply(apply(q1,combinator),X2))) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.63/1.04 [weight('<198,12,4,[0,0,0,2]>')]).
% 0.63/1.04 cnf('0.13.2.0',plain,
% 0.63/1.04 ( eq(apply(apply(X1,apply(apply(q1,combinator),X2)),X2),apply(apply(o,X1),apply(apply(q1,combinator),X2))) = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.13.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_7]).
% 0.63/1.04 cnf('0.31.0.0',plain,
% 0.63/1.04 ( false = eq(apply(X1,apply(X2,apply(apply(q1,combinator),X2))),apply(apply(o,apply(q1,X1)),apply(apply(q1,combinator),X2))) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.13.2.0','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1','L')]).
% 0.63/1.04 cnf('0.31.1.0',plain,
% 0.63/1.04 ( false = eq(apply(X1,apply(X2,apply(apply(q1,combinator),X2))),apply(apply(o,apply(q1,X1)),apply(apply(q1,combinator),X2))) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.31.0.0']),
% 0.63/1.04 [weight('<240,13,1,[1,0,0,1]>')]).
% 0.63/1.04 cnf('0.31.2.0',plain,
% 0.63/1.04 ( eq(apply(X1,apply(X2,apply(apply(q1,combinator),X2))),apply(apply(o,apply(q1,X1)),apply(apply(q1,combinator),X2))) = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.31.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_20]).
% 0.63/1.04 cnf('0.33.0.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(o,X1),apply(apply(q1,combinator),X1)),apply(apply(o,apply(q1,apply(apply(q1,combinator),X1))),apply(apply(q1,combinator),X1))) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.31.2.0','0.2.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.1','L')]).
% 0.63/1.04 cnf('0.33.1.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(o,X1),apply(apply(q1,combinator),X1)),apply(apply(o,apply(q1,apply(apply(q1,combinator),X1))),apply(apply(q1,combinator),X1))) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.33.0.0']),
% 0.63/1.04 [weight('<192,31,2,[1,0,0,1]>')]).
% 0.63/1.04 cnf('0.33.2.0',plain,
% 0.63/1.04 ( eq(apply(apply(o,X1),apply(apply(q1,combinator),X1)),apply(apply(o,apply(q1,apply(apply(q1,combinator),X1))),apply(apply(q1,combinator),X1))) = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.33.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_22]).
% 0.63/1.04 cnf('0.60.0.0',plain,
% 0.63/1.04 ( apply(apply(o,apply(q1,X1)),apply(apply(q1,X2),X3)) = apply(X2,apply(X1,apply(X3,apply(apply(q1,X2),X3)))) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.12.2.0','0.1.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.2','L')]).
% 0.63/1.04 cnf('0.60.1.0',plain,
% 0.63/1.04 ( apply(apply(o,apply(q1,X1)),apply(apply(q1,X2),X3)) = apply(X2,apply(X1,apply(X3,apply(apply(q1,X2),X3)))) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.60.0.0']),
% 0.63/1.04 [weight('<22,12,1,[1,0,0,2]>')]).
% 0.63/1.04 cnf('0.60.2.0',plain,
% 0.63/1.04 ( apply(apply(o,apply(q1,X1)),apply(apply(q1,X2),X3)) = apply(X2,apply(X1,apply(X3,apply(apply(q1,X2),X3)))) ),
% 0.63/1.04 inference(activate,[status(thm)],['0.60.1.0']),
% 0.63/1.04 [equation_20]).
% 0.63/1.04 cnf('0.61.0.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(o,apply(X1,apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1)))),apply(apply(o,apply(apply(o,apply(q1,apply(q1,combinator))),apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1))))) ),
% 0.63/1.04 inference(cp,[status(thm)],['0.33.2.0','0.60.2.0',theory(equality)]),
% 0.63/1.04 [pos('L.2.1.2','R')]).
% 0.63/1.04 cnf('0.61.1.0',plain,
% 0.63/1.04 ( false = eq(apply(apply(o,apply(X1,apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1)))),apply(apply(o,apply(apply(o,apply(q1,apply(q1,combinator))),apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1))))) ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.61.0.0']),
% 0.63/1.04 [weight('<0,60,33,[0,1,0,13]>')]).
% 0.63/1.04 cnf('0.61.2.0',plain,
% 0.63/1.04 ( eq(apply(apply(o,apply(X1,apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1)))),apply(apply(o,apply(apply(o,apply(q1,apply(q1,combinator))),apply(apply(q1,q1),X1))),apply(apply(q1,combinator),apply(X1,apply(apply(q1,q1),X1))))) = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.61.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_41]).
% 0.63/1.04 cnf('0.62.0.0',plain,
% 0.63/1.04 ( false = true ),
% 0.63/1.04 inference(cp,[status(thm)],['0.61.2.0','0.3.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('0.62.1.0',plain,
% 0.63/1.04 ( false = true ),
% 0.63/1.04 inference(weigh,[status(thm)],['0.62.0.0']),
% 0.63/1.04 [weight('<2,61,3,[1,0,0,0]>')]).
% 0.63/1.04 cnf('0.62.2.0',plain,
% 0.63/1.04 ( true = false ),
% 0.63/1.04 inference(orient,[status(thm)],['0.62.1.0',theory(equality)]),
% 0.63/1.04 [x,rule_42]).
% 0.63/1.04 cnf('1.0.0.0',conjecture,
% 0.63/1.04 ( true = false ),
% 0.63/1.04 file('/tmp/WALDMEISTER_23670_n018',conjecture_1)).
% 0.63/1.04 cnf('1.0.0.1',plain,
% 0.63/1.04 ( false = false ),
% 0.63/1.04 inference(reduction,[status(thm)],['1.0.0.0','0.62.2.0',theory(equality)]),
% 0.63/1.04 [pos('L','L')]).
% 0.63/1.04 cnf('1.0.0.2',plain,
% 0.63/1.04 ( $true ),
% 0.63/1.04 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.63/1.04 [conjecture_1]).
% 0.63/1.04
% 0.63/1.04 Proved Goals:
% 0.63/1.04 No. 1: true ?= false, current false ?= false
% 0.63/1.04 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.63/1.04
% 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_23670_n018
% 0.63/1.04 CPs.gen 4441
% 0.63/1.04 CPs.reexp 0
% 0.63/1.04 Select 177
% 0.63/1.04 R 42
% 0.63/1.04 E 20
% 0.63/1.04 vsize 6.4M
% 0.63/1.04 rss 3.6M
% 0.63/1.04 process.time 0.064s
% 0.63/1.04 wallclock.time 0.064s
% 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
% 0.63/1.04
% 0.63/1.04 Problem WALDMEISTER_23670_n018
% 0.63/1.04 CPs.gen 0
% 0.63/1.04 CPs.reexp 0
% 0.63/1.04 Select 0
% 0.63/1.04 R 0
% 0.63/1.04 E 0
% 0.63/1.04 vsize 6.0M
% 0.63/1.04 rss 3.1M
% 0.63/1.04 process.time 0.001s
% 0.63/1.04 wallclock.time 0.064s
% 0.63/1.04 status S
%------------------------------------------------------------------------------