TSTP Solution File: COL017-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL017-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:30 EDT 2022
% Result : Unsatisfiable 0.42s 0.84s
% Output : CNFRefutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : COL017-1 : TPTP v8.1.0. Released v1.0.0.
% 0.00/0.11 % Command : woody %s
% 0.11/0.30 % Computer : n032.cluster.edu
% 0.11/0.30 % Model : x86_64 x86_64
% 0.11/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.30 % Memory : 8042.1875MB
% 0.11/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.30 % CPULimit : 300
% 0.11/0.30 % WCLimit : 600
% 0.11/0.30 % DateTime : Tue May 31 10:20:43 EDT 2022
% 0.11/0.30 % CPUTime :
% 0.42/0.84 ********************************************************************************
% 0.42/0.84 * W A L D M E I S T E R \| \ / \|/ *
% 0.42/0.84 * |/ | \/ | *
% 0.42/0.84 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.42/0.84 * A. Jaeger and B. Loechner | | *
% 0.42/0.84 * <waldmeister@informatik.uni-kl.de> | *
% 0.42/0.84 ********************************************************************************
% 0.42/0.84
% 0.42/0.84
% 0.42/0.84 Goals:
% 0.42/0.84 ------
% 0.42/0.84
% 0.42/0.84 ( 1) true ?= false
% 0.42/0.84 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.42/0.84
% 0.42/0.84 Detected structure: KombinatorlogikBT
% 0.42/0.84 ********************************************************************************
% 0.42/0.84 ****************************** COMPLETION - PROOF ******************************
% 0.42/0.84 ********************************************************************************
% 0.42/0.84
% 0.42/0.84 joined goal: 1 x1 ?= apply(combinator,x1) to false
% 0.42/0.84 goal joined
% 0.42/0.84 % SZS status Unsatisfiable
% 0.42/0.84 #START OF PROOF
% 0.42/0.84 % SZS output start CNFRefutation
% 0.42/0.84 cnf('0.2.0.0',axiom,
% 0.42/0.84 ( apply(X1,X1) = apply(m,X1) ),
% 0.42/0.84 file('/tmp/WALDMEISTER_24990_n032')).
% 0.42/0.84 cnf('0.2.1.0',plain,
% 0.42/0.84 ( apply(X1,X1) = apply(m,X1) ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.42/0.84 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.42/0.84 cnf('0.2.2.0',plain,
% 0.42/0.84 ( apply(X1,X1) = apply(m,X1) ),
% 0.42/0.84 inference(activate,[status(thm)],['0.2.1.0']),
% 0.42/0.84 [equation_1]).
% 0.42/0.84 cnf('0.3.0.0',axiom,
% 0.42/0.84 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.42/0.84 file('/tmp/WALDMEISTER_24990_n032')).
% 0.42/0.84 cnf('0.3.1.0',plain,
% 0.42/0.84 ( apply(X1,apply(X2,X3)) = apply(apply(apply(b,X1),X2),X3) ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.42/0.84 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.42/0.84 cnf('0.3.2.0',plain,
% 0.42/0.84 ( apply(apply(apply(b,X1),X2),X3) = apply(X1,apply(X2,X3)) ),
% 0.42/0.84 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.42/0.84 [x,rule_2]).
% 0.42/0.84 cnf('0.4.0.0',axiom,
% 0.42/0.84 ( eq(X1,X1) = true ),
% 0.42/0.84 file('/tmp/WALDMEISTER_24990_n032')).
% 0.42/0.84 cnf('0.4.1.0',plain,
% 0.42/0.84 ( eq(X1,X1) = true ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.42/0.84 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.42/0.84 cnf('0.4.2.0',plain,
% 0.42/0.84 ( eq(X1,X1) = true ),
% 0.42/0.84 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.42/0.84 [u,rule_3]).
% 0.42/0.84 cnf('0.5.0.0',axiom,
% 0.42/0.84 ( eq(X1,apply(combinator,X1)) = false ),
% 0.42/0.84 file('/tmp/WALDMEISTER_24990_n032')).
% 0.42/0.84 cnf('0.5.1.0',plain,
% 0.42/0.84 ( eq(X1,apply(combinator,X1)) = false ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.42/0.84 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.42/0.84 cnf('0.5.2.0',plain,
% 0.42/0.84 ( eq(X1,apply(combinator,X1)) = false ),
% 0.42/0.84 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.42/0.84 [u,rule_4]).
% 0.42/0.84 cnf('0.8.0.0',plain,
% 0.42/0.84 ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.42/0.84 inference(cp,[status(thm)],['0.3.2.0','0.2.2.0',theory(equality)]),
% 0.42/0.84 [pos('L','L')]).
% 0.42/0.84 cnf('0.8.1.0',plain,
% 0.42/0.84 ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.8.0.0']),
% 0.42/0.84 [weight('<169,3,2,[1,0,0,0]>')]).
% 0.42/0.84 cnf('0.8.2.0',plain,
% 0.42/0.84 ( apply(X1,apply(X2,apply(apply(b,X1),X2))) = apply(m,apply(apply(b,X1),X2)) ),
% 0.42/0.84 inference(orient,[status(thm)],['0.8.1.0',theory(equality)]),
% 0.42/0.84 [u,rule_6]).
% 0.42/0.84 cnf('0.9.0.0',plain,
% 0.42/0.84 ( false = eq(apply(X1,apply(apply(b,combinator),X1)),apply(m,apply(apply(b,combinator),X1))) ),
% 0.42/0.84 inference(cp,[status(thm)],['0.5.2.0','0.8.2.0',theory(equality)]),
% 0.42/0.84 [pos('L.2','L')]).
% 0.42/0.84 cnf('0.9.1.0',plain,
% 0.42/0.84 ( false = eq(apply(X1,apply(apply(b,combinator),X1)),apply(m,apply(apply(b,combinator),X1))) ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.42/0.84 [weight('<14,8,5,[0,0,0,2]>')]).
% 0.42/0.84 cnf('0.9.2.0',plain,
% 0.42/0.84 ( eq(apply(X1,apply(apply(b,combinator),X1)),apply(m,apply(apply(b,combinator),X1))) = false ),
% 0.42/0.84 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.42/0.84 [x,rule_7]).
% 0.42/0.84 cnf('0.10.0.0',plain,
% 0.42/0.84 ( false = true ),
% 0.42/0.84 inference(cp,[status(thm)],['0.9.2.0','0.4.2.0',theory(equality)]),
% 0.42/0.84 [pos('L','L')]).
% 0.42/0.84 cnf('0.10.1.0',plain,
% 0.42/0.84 ( false = true ),
% 0.42/0.84 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.42/0.84 [weight('<5,9,4,[1,0,0,0]>')]).
% 0.42/0.84 cnf('0.10.2.0',plain,
% 0.42/0.84 ( true = false ),
% 0.42/0.84 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.42/0.84 [x,rule_8]).
% 0.42/0.84 cnf('1.0.0.0',conjecture,
% 0.42/0.84 ( true = false ),
% 0.42/0.84 file('/tmp/WALDMEISTER_24990_n032',conjecture_1)).
% 0.42/0.84 cnf('1.0.0.1',plain,
% 0.42/0.84 ( false = false ),
% 0.42/0.84 inference(reduction,[status(thm)],['1.0.0.0','0.10.2.0',theory(equality)]),
% 0.42/0.84 [pos('L','L')]).
% 0.42/0.84 cnf('1.0.0.2',plain,
% 0.42/0.84 ( $true ),
% 0.42/0.84 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.42/0.84 [conjecture_1]).
% 0.42/0.84
% 0.42/0.84 Proved Goals:
% 0.42/0.84 No. 1: true ?= false, current false ?= false
% 0.42/0.84 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.42/0.84
% 0.42/0.84 1 goal was specified, which was proved.
% 0.42/0.84 % SZS output end CNFRefutation
% 0.42/0.84 #END OF PROOF
% 0.42/0.84
% 0.42/0.84 Problem WALDMEISTER_24990_n032
% 0.42/0.84 CPs.gen 23
% 0.42/0.84 CPs.reexp 0
% 0.42/0.84 Select 11
% 0.42/0.84 R 8
% 0.42/0.84 E 2
% 0.42/0.84 vsize 6.5M
% 0.42/0.84 rss 3.8M
% 0.42/0.84 process.time 0.002s
% 0.42/0.84 wallclock.time 0.002s
% 0.42/0.84 status S
% 0.42/0.84
% 0.42/0.84
% 0.42/0.84 Waldmeister states: Goal proved.
% 0.42/0.84 % SZS status Unsatisfiable
%------------------------------------------------------------------------------