%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n025.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:24:58 EDT 2022
% Result : Unsatisfiable 0.61s 1.01s
% Output : CNFRefutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP154-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.13 % Command : woody %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 09:24:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.61/1.01 ********************************************************************************
% 0.61/1.01 * W A L D M E I S T E R \| \ / \|/ *
% 0.61/1.01 * |/ | \/ | *
% 0.61/1.01 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.61/1.01 * A. Jaeger and B. Loechner | | *
% 0.61/1.01 * <waldmeister@informatik.uni-kl.de> | *
% 0.61/1.01 ********************************************************************************
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Goals:
% 0.61/1.01 ------
% 0.61/1.01
% 0.61/1.01 ( 1) multiply(b,c) ?=? least_upper_bound(multiply(a,c),multiply(b,c))
% 0.61/1.01
% 0.61/1.01 Detected structure: VerbandsgeordneteGruppe
% 0.61/1.01 ********************************************************************************
% 0.61/1.01 ****************************** COMPLETION - PROOF ******************************
% 0.61/1.01 ********************************************************************************
% 0.61/1.01
% 0.61/1.01 joined goal: 1 multiply(b,c) ?= least_upper_bound(multiply(a,c),multiply(b,c)) to least_upper_bound(multiply(a,c),multiply(b,c))
% 0.61/1.01 goal joined
% 0.61/1.01 % SZS status Unsatisfiable
% 0.61/1.01 #START OF PROOF
% 0.61/1.01 % SZS output start CNFRefutation
% 0.61/1.01 cnf('0.9.0.0',axiom,
% 0.61/1.01 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.61/1.01 file('/tmp/WALDMEISTER_17395_n025')).
% 0.61/1.01 cnf('0.9.1.0',plain,
% 0.61/1.01 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.61/1.01 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.61/1.01 [weight('<8,0,0,[0,0,0,9]>')]).
% 0.61/1.01 cnf('0.9.2.0',plain,
% 0.61/1.01 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.61/1.01 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.61/1.01 [u,rule_9]).
% 0.61/1.01 cnf('0.14.0.0',axiom,
% 0.61/1.01 ( least_upper_bound(a,b) = b ),
% 0.61/1.01 file('/tmp/WALDMEISTER_17395_n025')).
% 0.61/1.01 cnf('0.14.1.0',plain,
% 0.61/1.01 ( least_upper_bound(a,b) = b ),
% 0.61/1.01 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.61/1.01 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.61/1.01 cnf('0.14.2.0',plain,
% 0.61/1.01 ( least_upper_bound(a,b) = b ),
% 0.61/1.01 inference(orient,[status(thm)],['0.14.1.0',theory(equality)]),
% 0.61/1.01 [u,rule_13]).
% 0.61/1.01 cnf('1.0.0.0',conjecture,
% 0.61/1.01 ( multiply(b,c) = least_upper_bound(multiply(a,c),multiply(b,c)) ),
% 0.61/1.01 file('/tmp/WALDMEISTER_17395_n025',conjecture_1)).
% 0.61/1.01 cnf('1.0.0.1',plain,
% 0.61/1.01 ( multiply(least_upper_bound(a,b),c) = least_upper_bound(multiply(a,c),multiply(b,c)) ),
% 0.61/1.01 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.61/1.01 [pos('L.1','R')]).
% 0.61/1.01 cnf('1.0.0.2',plain,
% 0.61/1.01 ( least_upper_bound(multiply(a,c),multiply(b,c)) = least_upper_bound(multiply(a,c),multiply(b,c)) ),
% 0.61/1.01 inference(reduction,[status(thm)],['1.0.0.1','0.9.2.0',theory(equality)]),
% 0.61/1.01 [pos('L','L')]).
% 0.61/1.01 cnf('1.0.0.3',plain,
% 0.61/1.01 ( $true ),
% 0.61/1.01 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.61/1.01 [conjecture_1]).
% 0.61/1.01
% 0.61/1.01 Proved Goals:
% 0.61/1.01 No. 1: multiply(b,c) ?= least_upper_bound(multiply(a,c),multiply(b,c)) joined, current: least_upper_bound(multiply(a,c),multiply(b,c)) = least_upper_bound(multiply(a,c),multiply(b,c))
% 0.61/1.01 1 goal was specified, which was proved.
% 0.61/1.01 % SZS output end CNFRefutation
% 0.61/1.01 #END OF PROOF
% 0.61/1.01
% 0.61/1.01 Problem WALDMEISTER_17395_n025
% 0.61/1.01 CPs.gen 44
% 0.61/1.01 CPs.reexp 0
% 0.61/1.01 Select 14
% 0.61/1.01 R 13
% 0.61/1.01 E 1
% 0.61/1.01 vsize 6.4M
% 0.61/1.01 rss 3.7M
% 0.61/1.01 process.time 0.002s
% 0.61/1.01 wallclock.time 0.003s
% 0.61/1.01 status S
% 0.61/1.01
% 0.61/1.01
% 0.61/1.01 Waldmeister states: Goal proved.
% 0.61/1.01 % SZS status Unsatisfiable
% 0.61/1.01
% 0.61/1.01 Problem WALDMEISTER_17395_n025
% 0.61/1.01 CPs.gen 0
% 0.61/1.01 CPs.reexp 0
% 0.61/1.01 Select 0
% 0.61/1.01 R 0
% 0.61/1.01 E 0
% 0.61/1.01 vsize 6.0M
% 0.61/1.01 rss 3.3M
% 0.61/1.01 process.time 0.001s
% 0.61/1.01 wallclock.time 0.002s
% 0.61/1.01 status S
%------------------------------------------------------------------------------