%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP176-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n017.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:07 EDT 2022
% Result : Unsatisfiable 0.60s 1.00s
% Output : CNFRefutation 0.60s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP176-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : woody %s
% 0.12/0.34 % Computer : n017.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 : Mon Jun 13 17:01:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.60/1.00 ********************************************************************************
% 0.60/1.00 * W A L D M E I S T E R \| \ / \|/ *
% 0.60/1.00 * |/ | \/ | *
% 0.60/1.00 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.60/1.00 * A. Jaeger and B. Loechner | | *
% 0.60/1.00 * <waldmeister@informatik.uni-kl.de> | *
% 0.60/1.00 ********************************************************************************
% 0.60/1.00
% 0.60/1.00
% 0.60/1.00 Goals:
% 0.60/1.00 ------
% 0.60/1.00
% 0.60/1.00 ( 1) multiply(c,multiply(least_upper_bound(a,b),d)) ?=? least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))
% 0.60/1.00
% 0.60/1.00 Detected structure: VerbandsgeordneteGruppe
% 0.60/1.00 ********************************************************************************
% 0.60/1.00 ****************************** COMPLETION - PROOF ******************************
% 0.60/1.00 ********************************************************************************
% 0.60/1.00
% 0.60/1.00 joined goal: 1 multiply(c,multiply(least_upper_bound(a,b),d)) ?= least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) to least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))
% 0.60/1.00 goal joined
% 0.60/1.00 % SZS status Unsatisfiable
% 0.60/1.00 #START OF PROOF
% 0.60/1.00 % SZS output start CNFRefutation
% 0.60/1.00 cnf('0.8.0.0',axiom,
% 0.60/1.00 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.60/1.00 file('/tmp/WALDMEISTER_12047_n017')).
% 0.60/1.00 cnf('0.8.1.0',plain,
% 0.60/1.00 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.60/1.00 inference(weigh,[status(thm)],['0.8.0.0']),
% 0.60/1.00 [weight('<7,0,0,[0,0,0,8]>')]).
% 0.60/1.00 cnf('0.8.2.0',plain,
% 0.60/1.00 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.60/1.00 inference(orient,[status(thm)],['0.8.1.0',theory(equality)]),
% 0.60/1.00 [u,rule_8]).
% 0.60/1.00 cnf('0.10.0.0',axiom,
% 0.60/1.00 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.60/1.00 file('/tmp/WALDMEISTER_12047_n017')).
% 0.60/1.00 cnf('0.10.1.0',plain,
% 0.60/1.00 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.60/1.00 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.60/1.00 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.60/1.00 cnf('0.10.2.0',plain,
% 0.60/1.00 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.60/1.00 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.60/1.00 [u,rule_10]).
% 0.60/1.00 cnf('1.0.0.0',conjecture,
% 0.60/1.00 ( multiply(c,multiply(least_upper_bound(a,b),d)) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) ),
% 0.60/1.00 file('/tmp/WALDMEISTER_12047_n017',conjecture_1)).
% 0.60/1.00 cnf('1.0.0.1',plain,
% 0.60/1.00 ( multiply(c,least_upper_bound(multiply(a,d),multiply(b,d))) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) ),
% 0.60/1.00 inference(reduction,[status(thm)],['1.0.0.0','0.10.2.0',theory(equality)]),
% 0.60/1.00 [pos('L.2','L')]).
% 0.60/1.00 cnf('1.0.0.2',plain,
% 0.60/1.00 ( least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) ),
% 0.60/1.00 inference(reduction,[status(thm)],['1.0.0.1','0.8.2.0',theory(equality)]),
% 0.60/1.00 [pos('L','L')]).
% 0.60/1.00 cnf('1.0.0.3',plain,
% 0.60/1.00 ( $true ),
% 0.60/1.00 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.60/1.00 [conjecture_1]).
% 0.60/1.00
% 0.60/1.00 Proved Goals:
% 0.60/1.00 No. 1: multiply(c,multiply(least_upper_bound(a,b),d)) ?= least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) joined, current: least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d))) = least_upper_bound(multiply(c,multiply(a,d)),multiply(c,multiply(b,d)))
% 0.60/1.00 1 goal was specified, which was proved.
% 0.60/1.00 % SZS output end CNFRefutation
% 0.60/1.00 #END OF PROOF
% 0.60/1.00
% 0.60/1.00 Problem WALDMEISTER_12047_n017
% 0.60/1.00 CPs.gen 21
% 0.60/1.00 CPs.reexp 0
% 0.60/1.00 Select 10
% 0.60/1.00 R 10
% 0.60/1.00 E 0
% 0.60/1.00 vsize 6.6M
% 0.60/1.00 rss 3.8M
% 0.60/1.00 process.time 0.002s
% 0.60/1.00 wallclock.time 0.003s
% 0.60/1.00 status S
% 0.60/1.00
% 0.60/1.00
% 0.60/1.00 Waldmeister states: Goal proved.
% 0.60/1.00 % SZS status Unsatisfiable
% 0.60/1.00
% 0.60/1.00 Problem WALDMEISTER_12047_n017
% 0.60/1.00 CPs.gen 0
% 0.60/1.00 CPs.reexp 0
% 0.60/1.00 Select 0
% 0.60/1.00 R 0
% 0.60/1.00 E 0
% 0.60/1.00 vsize 6.0M
% 0.60/1.00 rss 3.3M
% 0.60/1.00 process.time 0.001s
% 0.60/1.00 wallclock.time 0.002s
% 0.60/1.00 status S
%------------------------------------------------------------------------------