%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP153-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n006.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.66s 1.05s
% Output : CNFRefutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP153-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n006.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 : Mon Jun 13 07:48:42 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/1.04 ********************************************************************************
% 0.66/1.04 * W A L D M E I S T E R \| \ / \|/ *
% 0.66/1.04 * |/ | \/ | *
% 0.66/1.04 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.66/1.04 * A. Jaeger and B. Loechner | | *
% 0.66/1.04 * <waldmeister@informatik.uni-kl.de> | *
% 0.66/1.04 ********************************************************************************
% 0.66/1.04
% 0.66/1.04
% 0.66/1.04 Goals:
% 0.66/1.04 ------
% 0.66/1.04
% 0.66/1.04 ( 1) greatest_lower_bound(b,least_upper_bound(a,b)) ?=? b
% 0.66/1.04
% 0.66/1.04 Detected structure: VerbandsgeordneteGruppe
% 0.66/1.04 ********************************************************************************
% 0.66/1.04 ****************************** COMPLETION - PROOF ******************************
% 0.66/1.04 ********************************************************************************
% 0.66/1.04
% 0.66/1.05 joined goal: 1 greatest_lower_bound(b,least_upper_bound(a,b)) ?= b to b
% 0.66/1.05 goal joined
% 0.66/1.05 % SZS status Unsatisfiable
% 0.66/1.05 #START OF PROOF
% 0.66/1.05 % SZS output start CNFRefutation
% 0.66/1.05 cnf('0.3.0.0',axiom,
% 0.66/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.66/1.05 file('/tmp/WALDMEISTER_2975_n006')).
% 0.66/1.05 cnf('0.3.1.0',plain,
% 0.66/1.05 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.66/1.05 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.66/1.05 cnf('0.3.2.0',plain,
% 0.66/1.05 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.66/1.05 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.66/1.05 [x,rule_3]).
% 0.66/1.05 cnf('0.14.0.0',axiom,
% 0.66/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.66/1.05 file('/tmp/WALDMEISTER_2975_n006')).
% 0.66/1.05 cnf('0.14.1.0',plain,
% 0.66/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.66/1.05 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.66/1.05 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.66/1.05 cnf('0.14.2.0',plain,
% 0.66/1.05 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.66/1.05 inference(activate,[status(thm)],['0.14.1.0']),
% 0.66/1.05 [equation_2]).
% 0.66/1.05 cnf('1.0.0.0',conjecture,
% 0.66/1.05 ( greatest_lower_bound(b,least_upper_bound(a,b)) = b ),
% 0.66/1.05 file('/tmp/WALDMEISTER_2975_n006',conjecture_1)).
% 0.66/1.05 cnf('1.0.0.1',plain,
% 0.66/1.05 ( greatest_lower_bound(b,least_upper_bound(b,a)) = b ),
% 0.66/1.05 inference(reduction,[status(thm)],['1.0.0.0','0.14.2.0',theory(equality)]),
% 0.66/1.05 [pos('L.2','L')]).
% 0.66/1.05 cnf('1.0.0.2',plain,
% 0.66/1.05 ( b = b ),
% 0.66/1.05 inference(reduction,[status(thm)],['1.0.0.1','0.3.2.0',theory(equality)]),
% 0.66/1.05 [pos('L','L')]).
% 0.66/1.05 cnf('1.0.0.3',plain,
% 0.66/1.05 ( $true ),
% 0.66/1.05 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.66/1.05 [conjecture_1]).
% 0.66/1.05
% 0.66/1.05 Proved Goals:
% 0.66/1.05 No. 1: greatest_lower_bound(b,least_upper_bound(a,b)) ?= b joined, current: b = b
% 0.66/1.05 1 goal was specified, which was proved.
% 0.66/1.05 % SZS output end CNFRefutation
% 0.66/1.05 #END OF PROOF
% 0.66/1.05
% 0.66/1.05 Problem WALDMEISTER_2975_n006
% 0.66/1.05 CPs.gen 44
% 0.66/1.05 CPs.reexp 0
% 0.66/1.05 Select 14
% 0.66/1.05 R 12
% 0.66/1.05 E 2
% 0.66/1.05 vsize 6.5M
% 0.66/1.05 rss 3.7M
% 0.66/1.05 process.time 0.002s
% 0.66/1.05 wallclock.time 0.003s
% 0.66/1.05 status S
% 0.66/1.05
% 0.66/1.05
% 0.66/1.05 Waldmeister states: Goal proved.
% 0.66/1.05 % SZS status Unsatisfiable
% 0.66/1.05
% 0.66/1.05 Problem WALDMEISTER_2975_n006
% 0.66/1.05 CPs.gen 0
% 0.66/1.05 CPs.reexp 0
% 0.66/1.05 Select 0
% 0.66/1.05 R 0
% 0.66/1.05 E 0
% 0.66/1.05 vsize 6.0M
% 0.66/1.05 rss 3.2M
% 0.66/1.05 process.time 0.001s
% 0.66/1.05 wallclock.time 0.002s
% 0.66/1.05 status S
%------------------------------------------------------------------------------