%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : COL050-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n020.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:36 EDT 2022
% Result : Unsatisfiable 0.62s 1.02s
% Output : CNFRefutation 0.62s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : COL050-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : woody %s
% 0.12/0.34 % Computer : n020.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 07:28:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.62/1.02 ********************************************************************************
% 0.62/1.02 * W A L D M E I S T E R \| \ / \|/ *
% 0.62/1.02 * |/ | \/ | *
% 0.62/1.02 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.62/1.02 * A. Jaeger and B. Loechner | | *
% 0.62/1.02 * <waldmeister@informatik.uni-kl.de> | *
% 0.62/1.02 ********************************************************************************
% 0.62/1.02
% 0.62/1.02
% 0.62/1.02 Goals:
% 0.62/1.02 ------
% 0.62/1.02
% 0.62/1.02 ( 1) true ?= false
% 0.62/1.02 using narrowing to prove x1 ?= response(a,x1)
% 0.62/1.02
% 0.62/1.02 Detected structure: Orkus
% 0.62/1.02 ********************************************************************************
% 0.62/1.02 ****************************** COMPLETION - PROOF ******************************
% 0.62/1.02 ********************************************************************************
% 0.62/1.02
% 0.62/1.02 joined goal: 1 x1 ?= response(a,x1) to false
% 0.62/1.02 goal joined
% 0.62/1.02 % SZS status Unsatisfiable
% 0.62/1.02 #START OF PROOF
% 0.62/1.02 % SZS output start CNFRefutation
% 0.62/1.02 cnf('0.1.0.0',axiom,
% 0.62/1.02 ( response(X1,X1) = response(mocking_bird,X1) ),
% 0.62/1.02 file('/tmp/WALDMEISTER_31697_n020')).
% 0.62/1.02 cnf('0.1.1.0',plain,
% 0.62/1.02 ( response(X1,X1) = response(mocking_bird,X1) ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.62/1.02 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.62/1.02 cnf('0.1.2.0',plain,
% 0.62/1.02 ( response(X1,X1) = response(mocking_bird,X1) ),
% 0.62/1.02 inference(activate,[status(thm)],['0.1.1.0']),
% 0.62/1.02 [equation_1]).
% 0.62/1.02 cnf('0.2.0.0',axiom,
% 0.62/1.02 ( response(X1,response(X2,X3)) = response(compose(X1,X2),X3) ),
% 0.62/1.02 file('/tmp/WALDMEISTER_31697_n020')).
% 0.62/1.02 cnf('0.2.1.0',plain,
% 0.62/1.02 ( response(X1,response(X2,X3)) = response(compose(X1,X2),X3) ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.62/1.02 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.62/1.02 cnf('0.2.2.0',plain,
% 0.62/1.02 ( response(compose(X1,X2),X3) = response(X1,response(X2,X3)) ),
% 0.62/1.02 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.62/1.02 [x,rule_1]).
% 0.62/1.02 cnf('0.3.0.0',axiom,
% 0.62/1.02 ( eq(X1,X1) = true ),
% 0.62/1.02 file('/tmp/WALDMEISTER_31697_n020')).
% 0.62/1.02 cnf('0.3.1.0',plain,
% 0.62/1.02 ( eq(X1,X1) = true ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.62/1.02 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.62/1.02 cnf('0.3.2.0',plain,
% 0.62/1.02 ( eq(X1,X1) = true ),
% 0.62/1.02 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.62/1.02 [u,rule_2]).
% 0.62/1.02 cnf('0.4.0.0',axiom,
% 0.62/1.02 ( eq(X1,response(a,X1)) = false ),
% 0.62/1.02 file('/tmp/WALDMEISTER_31697_n020')).
% 0.62/1.02 cnf('0.4.1.0',plain,
% 0.62/1.02 ( eq(X1,response(a,X1)) = false ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.4.0.0']),
% 0.62/1.02 [weight('<3,0,0,[0,0,0,4]>')]).
% 0.62/1.02 cnf('0.4.2.0',plain,
% 0.62/1.02 ( eq(X1,response(a,X1)) = false ),
% 0.62/1.02 inference(orient,[status(thm)],['0.4.1.0',theory(equality)]),
% 0.62/1.02 [u,rule_3]).
% 0.62/1.02 cnf('0.5.0.0',plain,
% 0.62/1.02 ( response(X1,response(X2,compose(X1,X2))) = response(mocking_bird,compose(X1,X2)) ),
% 0.62/1.02 inference(cp,[status(thm)],['0.2.2.0','0.1.2.0',theory(equality)]),
% 0.62/1.02 [pos('L','L')]).
% 0.62/1.02 cnf('0.5.1.0',plain,
% 0.62/1.02 ( response(X1,response(X2,compose(X1,X2))) = response(mocking_bird,compose(X1,X2)) ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.62/1.02 [weight('<103,2,1,[1,0,0,0]>')]).
% 0.62/1.02 cnf('0.5.2.0',plain,
% 0.62/1.02 ( response(X1,response(X2,compose(X1,X2))) = response(mocking_bird,compose(X1,X2)) ),
% 0.62/1.02 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.62/1.02 [u,rule_4]).
% 0.62/1.02 cnf('0.6.0.0',plain,
% 0.62/1.02 ( false = eq(response(X1,compose(a,X1)),response(mocking_bird,compose(a,X1))) ),
% 0.62/1.02 inference(cp,[status(thm)],['0.4.2.0','0.5.2.0',theory(equality)]),
% 0.62/1.02 [pos('L.2','L')]).
% 0.62/1.02 cnf('0.6.1.0',plain,
% 0.62/1.02 ( false = eq(response(X1,compose(a,X1)),response(mocking_bird,compose(a,X1))) ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.62/1.02 [weight('<0,5,4,[0,0,0,2]>')]).
% 0.62/1.02 cnf('0.6.2.0',plain,
% 0.62/1.02 ( eq(response(X1,compose(a,X1)),response(mocking_bird,compose(a,X1))) = false ),
% 0.62/1.02 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.62/1.02 [x,rule_5]).
% 0.62/1.02 cnf('0.7.0.0',plain,
% 0.62/1.02 ( false = true ),
% 0.62/1.02 inference(cp,[status(thm)],['0.6.2.0','0.3.2.0',theory(equality)]),
% 0.62/1.02 [pos('L','L')]).
% 0.62/1.02 cnf('0.7.1.0',plain,
% 0.62/1.02 ( false = true ),
% 0.62/1.02 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.62/1.02 [weight('<5,6,3,[1,0,0,0]>')]).
% 0.62/1.02 cnf('0.7.2.0',plain,
% 0.62/1.02 ( true = false ),
% 0.62/1.02 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.62/1.02 [x,rule_6]).
% 0.62/1.02 cnf('1.0.0.0',conjecture,
% 0.62/1.02 ( true = false ),
% 0.62/1.02 file('/tmp/WALDMEISTER_31697_n020',conjecture_1)).
% 0.62/1.02 cnf('1.0.0.1',plain,
% 0.62/1.02 ( false = false ),
% 0.62/1.02 inference(reduction,[status(thm)],['1.0.0.0','0.7.2.0',theory(equality)]),
% 0.62/1.02 [pos('L','L')]).
% 0.62/1.02 cnf('1.0.0.2',plain,
% 0.62/1.02 ( $true ),
% 0.62/1.02 inference(trivial,[status(thm)],['1.0.0.1',theory(equality)]),
% 0.62/1.02 [conjecture_1]).
% 0.62/1.02
% 0.62/1.02 Proved Goals:
% 0.62/1.02 No. 1: true ?= false, current false ?= false
% 0.62/1.02 using narrowing to prove x1 ?= response(a,x1)
% 0.62/1.02
% 0.62/1.02 1 goal was specified, which was proved.
% 0.62/1.02 % SZS output end CNFRefutation
% 0.62/1.02 #END OF PROOF
% 0.62/1.02
% 0.62/1.02 Problem WALDMEISTER_31697_n020
% 0.62/1.02 CPs.gen 9
% 0.62/1.02 CPs.reexp 0
% 0.62/1.02 Select 7
% 0.62/1.02 R 6
% 0.62/1.02 E 1
% 0.62/1.02 vsize 6.4M
% 0.62/1.02 rss 3.7M
% 0.62/1.02 process.time 0.002s
% 0.62/1.02 wallclock.time 0.002s
% 0.62/1.02 status S
% 0.62/1.02
% 0.62/1.02
% 0.62/1.02 Waldmeister states: Goal proved.
% 0.62/1.02 % SZS status Unsatisfiable
%------------------------------------------------------------------------------