TSTP Solution File: COL016-1 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL016-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:30 EDT 2022
% Result : Unsatisfiable 0.66s 1.05s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : COL016-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.12 % Command : woody %s
% 0.12/0.34 % Computer : n023.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue May 31 14:30:56 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.66/1.05 ********************************************************************************
% 0.66/1.05 * W A L D M E I S T E R \| \ / \|/ *
% 0.66/1.05 * |/ | \/ | *
% 0.66/1.05 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.66/1.05 * A. Jaeger and B. Loechner | | *
% 0.66/1.05 * <waldmeister@informatik.uni-kl.de> | *
% 0.66/1.05 ********************************************************************************
% 0.66/1.05
% 0.66/1.05
% 0.66/1.05 Goals:
% 0.66/1.05 ------
% 0.66/1.05
% 0.66/1.05 ( 1) true ?= false
% 0.66/1.05 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.66/1.05
% 0.66/1.05 Detected structure: KombinatorlogikB
% 0.66/1.05 ********************************************************************************
% 0.66/1.05 ****************************** COMPLETION - PROOF ******************************
% 0.66/1.05 ********************************************************************************
% 0.66/1.05
% 0.66/1.05 joined goal: 1 x1 ?= apply(combinator,x1) to false
% 0.66/1.05 goal joined
% 0.66/1.05 % SZS status Unsatisfiable
% 0.66/1.05 #START OF PROOF
% 0.66/1.05 % SZS output start CNFRefutation
% 0.66/1.05 cnf('0.1.0.0',axiom,
% 0.66/1.05 ( apply(X1,X1) = apply(m,X1) ),
% 0.66/1.05 file('/tmp/WALDMEISTER_6227_n023')).
% 0.66/1.05 cnf('0.1.1.0',plain,
% 0.66/1.05 ( apply(X1,X1) = apply(m,X1) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.66/1.05 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.66/1.05 cnf('0.1.2.0',plain,
% 0.66/1.05 ( apply(X1,X1) = apply(m,X1) ),
% 0.66/1.05 inference(activate,[status(thm)],['0.1.1.0']),
% 0.66/1.05 [equation_1]).
% 0.66/1.05 cnf('0.3.0.0',axiom,
% 0.66/1.05 ( apply(X1,apply(X2,X2)) = apply(apply(l,X1),X2) ),
% 0.66/1.05 file('/tmp/WALDMEISTER_6227_n023')).
% 0.66/1.05 cnf('0.3.1.0',plain,
% 0.66/1.05 ( apply(X1,apply(X2,X2)) = apply(apply(l,X1),X2) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.66/1.05 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.66/1.05 cnf('0.3.2.0',plain,
% 0.66/1.05 ( apply(X1,apply(X2,X2)) = apply(apply(l,X1),X2) ),
% 0.66/1.05 inference(activate,[status(thm)],['0.3.1.0']),
% 0.66/1.05 [equation_2]).
% 0.66/1.05 cnf('0.4.0.0',axiom,
% 0.66/1.05 ( eq(X1,X1) = true ),
% 0.66/1.05 file('/tmp/WALDMEISTER_6227_n023')).
% 0.66/1.05 cnf('0.4.1.0',plain,
% 0.66/1.05 ( eq(X1,X1) = true ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.66/1.05 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.66/1.05 cnf('0.4.2.0',plain,
% 0.66/1.05 ( eq(X1,X1) = true ),
% 0.66/1.05 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.66/1.05 [u,rule_2]).
% 0.66/1.05 cnf('0.5.0.0',axiom,
% 0.66/1.05 ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.05 file('/tmp/WALDMEISTER_6227_n023')).
% 0.66/1.05 cnf('0.5.1.0',plain,
% 0.66/1.05 ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.66/1.05 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.66/1.05 cnf('0.5.2.0',plain,
% 0.66/1.05 ( eq(X1,apply(combinator,X1)) = false ),
% 0.66/1.05 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.66/1.05 [u,rule_3]).
% 0.66/1.05 cnf('0.6.0.0',plain,
% 0.66/1.05 ( apply(apply(l,X1),X2) = apply(X1,apply(m,X2)) ),
% 0.66/1.05 inference(cp,[status(thm)],['0.3.2.0','0.1.2.0',theory(equality)]),
% 0.66/1.05 [pos('L.2','L')]).
% 0.66/1.05 cnf('0.6.1.0',plain,
% 0.66/1.05 ( apply(apply(l,X1),X2) = apply(X1,apply(m,X2)) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.66/1.05 [weight('<10,3,1,[1,0,0,2]>')]).
% 0.66/1.05 cnf('0.6.2.0',plain,
% 0.66/1.05 ( apply(apply(l,X1),X2) = apply(X1,apply(m,X2)) ),
% 0.66/1.05 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.66/1.05 [u,rule_4]).
% 0.66/1.05 cnf('0.7.0.0',plain,
% 0.66/1.05 ( apply(X1,apply(m,apply(l,X1))) = apply(m,apply(l,X1)) ),
% 0.66/1.05 inference(cp,[status(thm)],['0.6.2.0','0.1.2.0',theory(equality)]),
% 0.66/1.05 [pos('L','L')]).
% 0.66/1.05 cnf('0.7.1.0',plain,
% 0.66/1.05 ( apply(X1,apply(m,apply(l,X1))) = apply(m,apply(l,X1)) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.66/1.05 [weight('<12,6,1,[1,0,0,0]>')]).
% 0.66/1.05 cnf('0.7.2.0',plain,
% 0.66/1.05 ( apply(X1,apply(m,apply(l,X1))) = apply(m,apply(l,X1)) ),
% 0.66/1.05 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.66/1.05 [u,rule_5]).
% 0.66/1.05 cnf('0.8.0.0',plain,
% 0.66/1.05 ( false = eq(apply(m,apply(l,combinator)),apply(m,apply(l,combinator))) ),
% 0.66/1.05 inference(cp,[status(thm)],['0.5.2.0','0.7.2.0',theory(equality)]),
% 0.66/1.05 [pos('L.2','L')]).
% 0.66/1.05 cnf('0.8.0.1',plain,
% 0.66/1.05 ( false = true ),
% 0.66/1.05 inference(reduction,[status(thm)],['0.8.0.0','0.4.2.0',theory(equality)]),
% 0.66/1.05 [pos('R','L')]).
% 0.66/1.05 cnf('0.8.1.0',plain,
% 0.66/1.05 ( false = true ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.8.0.1']),
% 0.66/1.05 [weight('<2,7,5,[0,0,0,2]>')]).
% 0.66/1.05 cnf('0.8.2.0',plain,
% 0.66/1.05 ( true = false ),
% 0.66/1.05 inference(orient,[status(thm)],['0.8.1.0',theory(equality)]),
% 0.66/1.05 [x,rule_6]).
% 0.66/1.05 cnf('1.0.0.0',conjecture,
% 0.66/1.05 ( true = false ),
% 0.66/1.05 file('/tmp/WALDMEISTER_6227_n023',conjecture_1)).
% 0.66/1.05 cnf('1.0.0.1',plain,
% 0.66/1.05 ( false = false ),
% 0.66/1.05 inference(reduction,[status(thm)],['1.0.0.0','0.8.2.0',theory(equality)]),
% 0.66/1.05 [pos('L','L')]).
% 0.66/1.05 cnf('1.0.0.2',plain,
% 0.66/1.05 ( $true ),
% 0.66/1.05 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.66/1.05 [conjecture_1]).
% 0.66/1.05
% 0.66/1.05 Proved Goals:
% 0.66/1.05 No. 1: true ?= false, current false ?= false
% 0.66/1.05 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.66/1.05
% 0.66/1.05 1 goal was specified, which was proved.
% 0.66/1.05 % SZS output end CNFRefutation
% 0.66/1.05 #END OF PROOF
% 0.66/1.05
% 0.66/1.05 Problem WALDMEISTER_6227_n023
% 0.66/1.05 CPs.gen 24
% 0.66/1.05 CPs.reexp 0
% 0.66/1.05 Select 9
% 0.66/1.05 R 6
% 0.66/1.05 E 2
% 0.66/1.05 vsize 6.5M
% 0.66/1.05 rss 3.4M
% 0.66/1.05 process.time 0.002s
% 0.66/1.05 wallclock.time 0.003s
% 0.66/1.05 status S
% 0.66/1.05
% 0.66/1.05
% 0.66/1.05 Waldmeister states: Goal proved.
% 0.66/1.05 % SZS status Unsatisfiable
% 0.66/1.05
% 0.66/1.05 Problem WALDMEISTER_6227_n023
% 0.66/1.05 CPs.gen 0
% 0.66/1.05 CPs.reexp 0
% 0.66/1.05 Select 0
% 0.66/1.05 R 0
% 0.66/1.05 E 0
% 0.66/1.05 vsize 6.0M
% 0.66/1.05 rss 3.2M
% 0.66/1.05 process.time 0.001s
% 0.66/1.05 wallclock.time 0.002s
% 0.66/1.05 status S
%------------------------------------------------------------------------------