%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n007.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 : Sat Jul 16 12:25:06 EDT 2022
% Result : Unsatisfiable 0.47s 0.87s
% Output : CNFRefutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.11 % Command : woody %s
% 0.11/0.32 % Computer : n007.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Mon Jun 13 11:23:53 EDT 2022
% 0.11/0.32 % CPUTime :
% 0.47/0.87 ********************************************************************************
% 0.47/0.87 * W A L D M E I S T E R \| \ / \|/ *
% 0.47/0.87 * |/ | \/ | *
% 0.47/0.87 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.47/0.87 * A. Jaeger and B. Loechner | | *
% 0.47/0.87 * <waldmeister@informatik.uni-kl.de> | *
% 0.47/0.87 ********************************************************************************
% 0.47/0.87
% 0.47/0.87
% 0.47/0.87 Goals:
% 0.47/0.87 ------
% 0.47/0.87
% 0.47/0.87 ( 1) multiply(inverse(a),multiply(b,a)) ?=? least_upper_bound(identity,multiply(inverse(a),multiply(b,a)))
% 0.47/0.87
% 0.47/0.87 Detected structure: VerbandsgeordneteGruppe
% 0.47/0.87 ********************************************************************************
% 0.47/0.87 ****************************** COMPLETION - PROOF ******************************
% 0.47/0.87 ********************************************************************************
% 0.47/0.87
% 0.47/0.87 joined goal: 1 multiply(inverse(a),multiply(b,a)) ?= least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) to least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
% 0.47/0.87 goal joined
% 0.47/0.87 % SZS status Unsatisfiable
% 0.47/0.87 #START OF PROOF
% 0.47/0.87 % SZS output start CNFRefutation
% 0.47/0.87 cnf('0.1.0.0',axiom,
% 0.47/0.87 ( X1 = multiply(identity,X1) ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.1.1.0',plain,
% 0.47/0.87 ( X1 = multiply(identity,X1) ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.47/0.87 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.47/0.87 cnf('0.1.2.0',plain,
% 0.47/0.87 ( multiply(identity,X1) = X1 ),
% 0.47/0.87 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.47/0.87 [x,rule_1]).
% 0.47/0.87 cnf('0.7.0.0',axiom,
% 0.47/0.87 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.7.1.0',plain,
% 0.47/0.87 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.47/0.87 [weight('<6,0,0,[0,0,0,7]>')]).
% 0.47/0.87 cnf('0.7.2.0',plain,
% 0.47/0.87 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.47/0.87 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.47/0.87 [u,rule_7]).
% 0.47/0.87 cnf('0.9.0.0',axiom,
% 0.47/0.87 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.9.1.0',plain,
% 0.47/0.87 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.47/0.87 [weight('<8,0,0,[0,0,0,9]>')]).
% 0.47/0.87 cnf('0.9.2.0',plain,
% 0.47/0.87 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.47/0.87 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.47/0.87 [u,rule_9]).
% 0.47/0.87 cnf('0.11.0.0',axiom,
% 0.47/0.87 ( multiply(inverse(X1),X1) = identity ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.11.1.0',plain,
% 0.47/0.87 ( multiply(inverse(X1),X1) = identity ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.11.0.0']),
% 0.47/0.87 [weight('<10,0,0,[0,0,0,11]>')]).
% 0.47/0.87 cnf('0.11.2.0',plain,
% 0.47/0.87 ( multiply(inverse(X1),X1) = identity ),
% 0.47/0.87 inference(orient,[status(thm)],['0.11.1.0',theory(equality)]),
% 0.47/0.87 [u,rule_11]).
% 0.47/0.87 cnf('0.12.0.0',axiom,
% 0.47/0.87 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.12.1.0',plain,
% 0.47/0.87 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.47/0.87 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.47/0.87 cnf('0.12.2.0',plain,
% 0.47/0.87 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.47/0.87 inference(activate,[status(thm)],['0.12.1.0']),
% 0.47/0.87 [equation_1]).
% 0.47/0.87 cnf('0.14.0.0',axiom,
% 0.47/0.87 ( least_upper_bound(identity,b) = b ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007')).
% 0.47/0.87 cnf('0.14.1.0',plain,
% 0.47/0.87 ( least_upper_bound(identity,b) = b ),
% 0.47/0.87 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.47/0.87 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.47/0.87 cnf('0.14.1.1',plain,
% 0.47/0.87 ( least_upper_bound(b,identity) = b ),
% 0.47/0.87 inference(reduction,[status(thm)],['0.14.1.0','0.12.2.0',theory(equality)]),
% 0.47/0.87 [pos('L','L')]).
% 0.47/0.87 cnf('0.14.2.0',plain,
% 0.47/0.87 ( least_upper_bound(b,identity) = b ),
% 0.47/0.87 inference(orient,[status(thm)],['0.14.1.1',theory(equality)]),
% 0.47/0.87 [u,rule_13]).
% 0.47/0.87 cnf('1.0.0.0',conjecture,
% 0.47/0.87 ( multiply(inverse(a),multiply(b,a)) = least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) ),
% 0.47/0.87 file('/tmp/WALDMEISTER_9557_n007',conjecture_1)).
% 0.47/0.87 cnf('1.0.0.1',plain,
% 0.47/0.87 ( multiply(inverse(a),multiply(b,a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.0','0.12.2.0',theory(equality)]),
% 0.47/0.87 [pos('R','L')]).
% 0.47/0.87 cnf('1.0.0.2',plain,
% 0.47/0.87 ( multiply(inverse(a),multiply(least_upper_bound(b,identity),a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.1','0.14.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2.1','R')]).
% 0.47/0.87 cnf('1.0.0.3',plain,
% 0.47/0.87 ( multiply(inverse(a),multiply(least_upper_bound(identity,b),a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.2','0.12.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2.1','L')]).
% 0.47/0.87 cnf('1.0.0.4',plain,
% 0.47/0.87 ( multiply(inverse(a),least_upper_bound(multiply(identity,a),multiply(b,a))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.3','0.9.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2','L')]).
% 0.47/0.87 cnf('1.0.0.5',plain,
% 0.47/0.87 ( multiply(inverse(a),least_upper_bound(a,multiply(b,a))) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.4','0.1.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2.1','L')]).
% 0.47/0.87 cnf('1.0.0.6',plain,
% 0.47/0.87 ( multiply(inverse(a),least_upper_bound(multiply(b,a),a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.5','0.12.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2','L')]).
% 0.47/0.87 cnf('1.0.0.7',plain,
% 0.47/0.87 ( least_upper_bound(multiply(inverse(a),multiply(b,a)),multiply(inverse(a),a)) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.6','0.7.2.0',theory(equality)]),
% 0.47/0.87 [pos('L','L')]).
% 0.47/0.87 cnf('1.0.0.8',plain,
% 0.47/0.87 ( least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) ),
% 0.47/0.87 inference(reduction,[status(thm)],['1.0.0.7','0.11.2.0',theory(equality)]),
% 0.47/0.87 [pos('L.2','L')]).
% 0.47/0.87 cnf('1.0.0.9',plain,
% 0.47/0.87 ( $true ),
% 0.47/0.87 inference(trivial,[status(thm)],['1.0.0.8',theory(equality)]),
% 0.47/0.87 [conjecture_1]).
% 0.47/0.87
% 0.47/0.87 Proved Goals:
% 0.47/0.87 No. 1: multiply(inverse(a),multiply(b,a)) ?= least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) joined, current: least_upper_bound(multiply(inverse(a),multiply(b,a)),identity) = least_upper_bound(multiply(inverse(a),multiply(b,a)),identity)
% 0.47/0.87 1 goal was specified, which was proved.
% 0.47/0.87 % SZS output end CNFRefutation
% 0.47/0.87 #END OF PROOF
% 0.47/0.87
% 0.47/0.87 Problem WALDMEISTER_9557_n007
% 0.47/0.87 CPs.gen 44
% 0.47/0.87 CPs.reexp 0
% 0.47/0.87 Select 14
% 0.47/0.87 R 13
% 0.47/0.87 E 1
% 0.47/0.87 vsize 6.5M
% 0.47/0.87 rss 3.7M
% 0.47/0.87 process.time 0.002s
% 0.47/0.87 wallclock.time 0.003s
% 0.47/0.87 status S
% 0.47/0.87
% 0.47/0.87
% 0.47/0.87 Waldmeister states: Goal proved.
% 0.47/0.87 % SZS status Unsatisfiable
% 0.47/0.87
% 0.47/0.87 Problem WALDMEISTER_9557_n007
% 0.47/0.87 CPs.gen 0
% 0.47/0.87 CPs.reexp 0
% 0.47/0.87 Select 0
% 0.47/0.87 R 0
% 0.47/0.87 E 0
% 0.47/0.87 vsize 6.0M
% 0.47/0.87 rss 3.2M
% 0.47/0.87 process.time 0.001s
% 0.47/0.87 wallclock.time 0.002s
% 0.47/0.87 status S
%------------------------------------------------------------------------------