%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL015-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n024.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.55s 0.95s
% Output : CNFRefutation 0.55s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL015-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n024.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue May 31 04:13:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.55/0.95 ********************************************************************************
% 0.55/0.95 * W A L D M E I S T E R \| \ / \|/ *
% 0.55/0.95 * |/ | \/ | *
% 0.55/0.95 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.55/0.95 * A. Jaeger and B. Loechner | | *
% 0.55/0.95 * <waldmeister@informatik.uni-kl.de> | *
% 0.55/0.95 ********************************************************************************
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Goals:
% 0.55/0.95 ------
% 0.55/0.95
% 0.55/0.95 ( 1) true ?= false
% 0.55/0.95 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.55/0.95
% 0.55/0.95 Detected structure: KombinatorlogikQ
% 0.55/0.95 ********************************************************************************
% 0.55/0.95 ****************************** COMPLETION - PROOF ******************************
% 0.55/0.95 ********************************************************************************
% 0.55/0.95
% 0.55/0.95 joined goal: 1 x1 ?= apply(combinator,x1) to false
% 0.55/0.95 goal joined
% 0.55/0.95 % SZS status Unsatisfiable
% 0.55/0.95 #START OF PROOF
% 0.55/0.95 % SZS output start CNFRefutation
% 0.55/0.95 cnf('0.1.0.0',axiom,
% 0.55/0.95 ( apply(X1,X1) = apply(m,X1) ),
% 0.55/0.95 file('/tmp/WALDMEISTER_27416_n024')).
% 0.55/0.95 cnf('0.1.1.0',plain,
% 0.55/0.95 ( apply(X1,X1) = apply(m,X1) ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.55/0.95 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.55/0.95 cnf('0.1.2.0',plain,
% 0.55/0.95 ( apply(X1,X1) = apply(m,X1) ),
% 0.55/0.95 inference(activate,[status(thm)],['0.1.1.0']),
% 0.55/0.95 [equation_1]).
% 0.55/0.95 cnf('0.2.0.0',axiom,
% 0.55/0.95 ( apply(X1,apply(X2,X3)) = apply(apply(apply(q,X2),X1),X3) ),
% 0.55/0.95 file('/tmp/WALDMEISTER_27416_n024')).
% 0.55/0.95 cnf('0.2.1.0',plain,
% 0.55/0.95 ( apply(X1,apply(X2,X3)) = apply(apply(apply(q,X2),X1),X3) ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.55/0.95 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.55/0.95 cnf('0.2.2.0',plain,
% 0.55/0.95 ( apply(apply(apply(q,X1),X2),X3) = apply(X2,apply(X1,X3)) ),
% 0.55/0.95 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.55/0.95 [x,rule_1]).
% 0.55/0.95 cnf('0.3.0.0',axiom,
% 0.55/0.95 ( eq(X1,X1) = true ),
% 0.55/0.95 file('/tmp/WALDMEISTER_27416_n024')).
% 0.55/0.95 cnf('0.3.1.0',plain,
% 0.55/0.95 ( eq(X1,X1) = true ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.55/0.95 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.55/0.95 cnf('0.3.2.0',plain,
% 0.55/0.95 ( eq(X1,X1) = true ),
% 0.55/0.95 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.55/0.95 [u,rule_2]).
% 0.55/0.95 cnf('0.4.0.0',axiom,
% 0.55/0.95 ( eq(X1,apply(combinator,X1)) = false ),
% 0.55/0.95 file('/tmp/WALDMEISTER_27416_n024')).
% 0.55/0.95 cnf('0.4.1.0',plain,
% 0.55/0.95 ( eq(X1,apply(combinator,X1)) = false ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.55/0.95 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.55/0.95 cnf('0.4.2.0',plain,
% 0.55/0.95 ( eq(X1,apply(combinator,X1)) = false ),
% 0.55/0.95 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.55/0.95 [u,rule_3]).
% 0.55/0.95 cnf('0.7.0.0',plain,
% 0.55/0.95 ( apply(X1,apply(X2,apply(apply(q,X2),X1))) = apply(m,apply(apply(q,X2),X1)) ),
% 0.55/0.95 inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.55/0.95 [pos('L','L')]).
% 0.55/0.95 cnf('0.7.1.0',plain,
% 0.55/0.95 ( apply(X1,apply(X2,apply(apply(q,X2),X1))) = apply(m,apply(apply(q,X2),X1)) ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.55/0.95 [weight('<16,2,1,[1,0,0,0]>')]).
% 0.55/0.95 cnf('0.7.2.0',plain,
% 0.55/0.95 ( apply(X1,apply(X2,apply(apply(q,X2),X1))) = apply(m,apply(apply(q,X2),X1)) ),
% 0.55/0.95 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.55/0.95 [u,rule_5]).
% 0.55/0.95 cnf('0.8.0.0',plain,
% 0.55/0.95 ( false = eq(apply(X1,apply(apply(q,X1),combinator)),apply(m,apply(apply(q,X1),combinator))) ),
% 0.55/0.95 inference(cp,[status(thm)],['0.4.2.0','0.7.2.0',theory(equality)]),
% 0.55/0.95 [pos('L.2','L')]).
% 0.55/0.95 cnf('0.8.1.0',plain,
% 0.55/0.95 ( false = eq(apply(X1,apply(apply(q,X1),combinator)),apply(m,apply(apply(q,X1),combinator))) ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.8.0.0']),
% 0.55/0.95 [weight('<0,7,4,[0,0,0,2]>')]).
% 0.55/0.95 cnf('0.8.2.0',plain,
% 0.55/0.95 ( eq(apply(X1,apply(apply(q,X1),combinator)),apply(m,apply(apply(q,X1),combinator))) = false ),
% 0.55/0.95 inference(orient,[status(thm)],['0.8.1.0',theory(equality)]),
% 0.55/0.95 [x,rule_6]).
% 0.55/0.95 cnf('0.9.0.0',plain,
% 0.55/0.95 ( false = true ),
% 0.55/0.95 inference(cp,[status(thm)],['0.8.2.0','0.3.2.0',theory(equality)]),
% 0.55/0.95 [pos('L','L')]).
% 0.55/0.95 cnf('0.9.1.0',plain,
% 0.55/0.95 ( false = true ),
% 0.55/0.95 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.55/0.95 [weight('<2,8,3,[1,0,0,0]>')]).
% 0.55/0.95 cnf('0.9.2.0',plain,
% 0.55/0.95 ( true = false ),
% 0.55/0.95 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.55/0.95 [x,rule_7]).
% 0.55/0.95 cnf('1.0.0.0',conjecture,
% 0.55/0.95 ( true = false ),
% 0.55/0.95 file('/tmp/WALDMEISTER_27416_n024',conjecture_1)).
% 0.55/0.95 cnf('1.0.0.1',plain,
% 0.55/0.95 ( false = false ),
% 0.55/0.95 inference(reduction,[status(thm)],['1.0.0.0','0.9.2.0',theory(equality)]),
% 0.55/0.95 [pos('L','L')]).
% 0.55/0.95 cnf('1.0.0.2',plain,
% 0.55/0.95 ( $true ),
% 0.55/0.95 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.55/0.95 [conjecture_1]).
% 0.55/0.95
% 0.55/0.95 Proved Goals:
% 0.55/0.95 No. 1: true ?= false, current false ?= false
% 0.55/0.95 using narrowing to prove x1 ?= apply(combinator,x1)
% 0.55/0.95
% 0.55/0.95 1 goal was specified, which was proved.
% 0.55/0.95 % SZS output end CNFRefutation
% 0.55/0.95 #END OF PROOF
% 0.55/0.95
% 0.55/0.95 Problem WALDMEISTER_27416_n024
% 0.55/0.95 CPs.gen 37
% 0.55/0.95 CPs.reexp 0
% 0.55/0.95 Select 10
% 0.55/0.95 R 7
% 0.55/0.95 E 2
% 0.55/0.95 vsize 6.4M
% 0.55/0.95 rss 3.6M
% 0.55/0.95 process.time 0.002s
% 0.55/0.95 wallclock.time 0.003s
% 0.55/0.95 status S
% 0.55/0.95
% 0.55/0.95
% 0.55/0.95 Waldmeister states: Goal proved.
% 0.55/0.95 % SZS status Unsatisfiable
% 0.55/0.95
% 0.55/0.95 Problem WALDMEISTER_27416_n024
% 0.55/0.95 CPs.gen 0
% 0.55/0.95 CPs.reexp 0
% 0.55/0.95 Select 0
% 0.55/0.95 R 0
% 0.55/0.95 E 0
% 0.55/0.95 vsize 6.0M
% 0.55/0.95 rss 3.1M
% 0.55/0.95 process.time 0.001s
% 0.55/0.95 wallclock.time 0.002s
% 0.55/0.95 status S
%------------------------------------------------------------------------------