TSTP Solution File: GRP167-2 by Waldmeister---710
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Waldmeister---710
% Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : woody %s
% Computer : n012.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:02 EDT 2022
% Result : Unsatisfiable 0.85s 1.32s
% Output : CNFRefutation 0.85s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP167-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : woody %s
% 0.12/0.33 % Computer : n012.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 04:02:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.57/0.97 ********************************************************************************
% 0.57/0.97 * W A L D M E I S T E R \| \ / \|/ *
% 0.57/0.97 * |/ | \/ | *
% 0.57/0.97 * (C) 1994-2010 A. Buch and Th. Hillenbrand, \ / \ / *
% 0.57/0.97 * A. Jaeger and B. Loechner | | *
% 0.57/0.97 * <waldmeister@informatik.uni-kl.de> | *
% 0.57/0.97 ********************************************************************************
% 0.57/0.97
% 0.57/0.97
% 0.57/0.97 Goals:
% 0.57/0.97 ------
% 0.57/0.97
% 0.57/0.97 ( 1) multiply(positive_part(a),negative_part(a)) ?=? a
% 0.57/0.97
% 0.57/0.97 Detected structure: VerbandsgeordneteGruppe
% 0.57/0.97 ********************************************************************************
% 0.57/0.97 ****************************** COMPLETION - PROOF ******************************
% 0.57/0.97 ********************************************************************************
% 0.57/0.97
% 0.85/1.32 joined goal: 1 multiply(positive_part(a),negative_part(a)) ?= a to a
% 0.85/1.32 goal joined
% 0.85/1.32 % SZS status Unsatisfiable
% 0.85/1.32 #START OF PROOF
% 0.85/1.32 % SZS output start CNFRefutation
% 0.85/1.32 cnf('0.1.0.0',axiom,
% 0.85/1.32 ( X1 = multiply(identity,X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.1.1.0',plain,
% 0.85/1.32 ( X1 = multiply(identity,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.1.0.0']),
% 0.85/1.32 [weight('<0,0,0,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.1.2.0',plain,
% 0.85/1.32 ( multiply(identity,X1) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.1.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_1]).
% 0.85/1.32 cnf('0.2.0.0',axiom,
% 0.85/1.32 ( X1 = least_upper_bound(X1,X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.2.1.0',plain,
% 0.85/1.32 ( X1 = least_upper_bound(X1,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.2.0.0']),
% 0.85/1.32 [weight('<1,0,0,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.2.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,X1) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.2.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_2]).
% 0.85/1.32 cnf('0.3.0.0',axiom,
% 0.85/1.32 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.3.1.0',plain,
% 0.85/1.32 ( X1 = least_upper_bound(X1,greatest_lower_bound(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.3.0.0']),
% 0.85/1.32 [weight('<2,0,0,[0,0,0,3]>')]).
% 0.85/1.32 cnf('0.3.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.3.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_3]).
% 0.85/1.32 cnf('0.5.0.0',axiom,
% 0.85/1.32 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.5.1.0',plain,
% 0.85/1.32 ( X1 = greatest_lower_bound(X1,least_upper_bound(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.5.0.0']),
% 0.85/1.32 [weight('<4,0,0,[0,0,0,5]>')]).
% 0.85/1.32 cnf('0.5.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.5.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_5]).
% 0.85/1.32 cnf('0.6.0.0',axiom,
% 0.85/1.32 ( X1 = inverse(inverse(X1)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.6.1.0',plain,
% 0.85/1.32 ( X1 = inverse(inverse(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.6.0.0']),
% 0.85/1.32 [weight('<5,0,0,[0,0,0,6]>')]).
% 0.85/1.32 cnf('0.6.2.0',plain,
% 0.85/1.32 ( inverse(inverse(X1)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.6.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_6]).
% 0.85/1.32 cnf('0.7.0.0',axiom,
% 0.85/1.32 ( multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.7.1.0',plain,
% 0.85/1.32 ( multiply(X1,multiply(X2,X3)) = multiply(multiply(X1,X2),X3) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.7.0.0']),
% 0.85/1.32 [weight('<6,0,0,[0,0,0,7]>')]).
% 0.85/1.32 cnf('0.7.2.0',plain,
% 0.85/1.32 ( multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.7.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_7]).
% 0.85/1.32 cnf('0.8.0.0',axiom,
% 0.85/1.32 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.8.1.0',plain,
% 0.85/1.32 ( multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.8.0.0']),
% 0.85/1.32 [weight('<7,0,0,[0,0,0,8]>')]).
% 0.85/1.32 cnf('0.8.2.0',plain,
% 0.85/1.32 ( least_upper_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,least_upper_bound(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.8.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_8]).
% 0.85/1.32 cnf('0.9.0.0',axiom,
% 0.85/1.32 ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.9.1.0',plain,
% 0.85/1.32 ( multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.9.0.0']),
% 0.85/1.32 [weight('<8,0,0,[0,0,0,9]>')]).
% 0.85/1.32 cnf('0.9.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)) = multiply(X1,greatest_lower_bound(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.9.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_9]).
% 0.85/1.32 cnf('0.10.0.0',axiom,
% 0.85/1.32 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.10.1.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.10.0.0']),
% 0.85/1.32 [weight('<9,0,0,[0,0,0,10]>')]).
% 0.85/1.32 cnf('0.10.2.0',plain,
% 0.85/1.32 ( least_upper_bound(multiply(X1,X2),multiply(X3,X2)) = multiply(least_upper_bound(X1,X3),X2) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.10.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_10]).
% 0.85/1.32 cnf('0.12.0.0',axiom,
% 0.85/1.32 ( multiply(inverse(X1),X1) = identity ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.12.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),X1) = identity ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.12.0.0']),
% 0.85/1.32 [weight('<11,0,0,[0,0,0,12]>')]).
% 0.85/1.32 cnf('0.12.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),X1) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.12.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_12]).
% 0.85/1.32 cnf('0.13.0.0',axiom,
% 0.85/1.32 ( multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.13.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.13.0.0']),
% 0.85/1.32 [weight('<12,0,0,[0,0,0,13]>')]).
% 0.85/1.32 cnf('0.13.2.0',plain,
% 0.85/1.32 ( inverse(multiply(X1,X2)) = multiply(inverse(X2),inverse(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.13.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_13]).
% 0.85/1.32 cnf('0.14.0.0',axiom,
% 0.85/1.32 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.14.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.14.0.0']),
% 0.85/1.32 [weight('<13,0,0,[0,0,0,14]>')]).
% 0.85/1.32 cnf('0.14.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,X2) = least_upper_bound(X2,X1) ),
% 0.85/1.32 inference(activate,[status(thm)],['0.14.1.0']),
% 0.85/1.32 [equation_1]).
% 0.85/1.32 cnf('0.15.0.0',axiom,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.15.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.15.0.0']),
% 0.85/1.32 [weight('<14,0,0,[0,0,0,15]>')]).
% 0.85/1.32 cnf('0.15.2.0',plain,
% 0.85/1.32 ( least_upper_bound(least_upper_bound(X1,X2),X3) = least_upper_bound(X1,least_upper_bound(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.15.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_14]).
% 0.85/1.32 cnf('0.16.0.0',axiom,
% 0.85/1.32 ( least_upper_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.16.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.16.0.0']),
% 0.85/1.32 [weight('<15,0,0,[0,0,0,16]>')]).
% 0.85/1.32 cnf('0.16.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3)) = least_upper_bound(X1,greatest_lower_bound(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.16.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_15]).
% 0.85/1.32 cnf('0.17.0.0',axiom,
% 0.85/1.32 ( least_upper_bound(X1,identity) = positive_part(X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.17.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,identity) = positive_part(X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.17.0.0']),
% 0.85/1.32 [weight('<16,0,0,[0,0,0,17]>')]).
% 0.85/1.32 cnf('0.17.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,identity) = positive_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.17.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_16]).
% 0.85/1.32 cnf('0.18.0.0',axiom,
% 0.85/1.32 ( least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3)) = greatest_lower_bound(X1,least_upper_bound(X2,X3)) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.18.1.0',plain,
% 0.85/1.32 ( least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3)) = greatest_lower_bound(X1,least_upper_bound(X2,X3)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.18.0.0']),
% 0.85/1.32 [weight('<17,0,0,[0,0,0,18]>')]).
% 0.85/1.32 cnf('0.18.2.0',plain,
% 0.85/1.32 ( least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3)) = greatest_lower_bound(X1,least_upper_bound(X2,X3)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.18.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_17]).
% 0.85/1.32 cnf('0.19.0.0',axiom,
% 0.85/1.32 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.19.1.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.19.0.0']),
% 0.85/1.32 [weight('<18,0,0,[0,0,0,19]>')]).
% 0.85/1.32 cnf('0.19.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1) ),
% 0.85/1.32 inference(activate,[status(thm)],['0.19.1.0']),
% 0.85/1.32 [equation_2]).
% 0.85/1.32 cnf('0.21.0.0',axiom,
% 0.85/1.32 ( greatest_lower_bound(X1,identity) = negative_part(X1) ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.21.1.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,identity) = negative_part(X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.21.0.0']),
% 0.85/1.32 [weight('<20,0,0,[0,0,0,21]>')]).
% 0.85/1.32 cnf('0.21.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,identity) = negative_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.21.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_19]).
% 0.85/1.32 cnf('0.22.0.0',axiom,
% 0.85/1.32 ( inverse(identity) = identity ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012')).
% 0.85/1.32 cnf('0.22.1.0',plain,
% 0.85/1.32 ( inverse(identity) = identity ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.22.0.0']),
% 0.85/1.32 [weight('<21,0,0,[0,0,0,22]>')]).
% 0.85/1.32 cnf('0.22.2.0',plain,
% 0.85/1.32 ( inverse(identity) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.22.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_20]).
% 0.85/1.32 cnf('0.25.0.0',plain,
% 0.85/1.32 ( positive_part(X1) = least_upper_bound(identity,X1) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.17.2.0','0.14.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.25.1.0',plain,
% 0.85/1.32 ( positive_part(X1) = least_upper_bound(identity,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.25.0.0']),
% 0.85/1.32 [weight('<3,17,14,[1,0,0,0]>')]).
% 0.85/1.32 cnf('0.25.2.0',plain,
% 0.85/1.32 ( least_upper_bound(identity,X1) = positive_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.25.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_23]).
% 0.85/1.32 cnf('0.26.0.0',plain,
% 0.85/1.32 ( negative_part(X1) = greatest_lower_bound(identity,X1) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.21.2.0','0.19.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.26.1.0',plain,
% 0.85/1.32 ( negative_part(X1) = greatest_lower_bound(identity,X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.26.0.0']),
% 0.85/1.32 [weight('<3,21,19,[1,0,0,0]>')]).
% 0.85/1.32 cnf('0.26.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(identity,X1) = negative_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.26.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_24]).
% 0.85/1.32 cnf('0.27.0.0',plain,
% 0.85/1.32 ( identity = least_upper_bound(identity,negative_part(X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.3.2.0','0.26.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.27.0.1',plain,
% 0.85/1.32 ( identity = positive_part(negative_part(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.27.0.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.27.1.0',plain,
% 0.85/1.32 ( identity = positive_part(negative_part(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.27.0.1']),
% 0.85/1.32 [weight('<3,26,3,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.27.2.0',plain,
% 0.85/1.32 ( positive_part(negative_part(X1)) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.27.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_25]).
% 0.85/1.32 cnf('0.28.0.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(identity,X1)) = identity ),
% 0.85/1.32 inference(cp,[status(thm)],['0.26.2.0','0.5.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.28.0.1',plain,
% 0.85/1.32 ( negative_part(positive_part(X1)) = identity ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.28.0.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.28.1.0',plain,
% 0.85/1.32 ( negative_part(positive_part(X1)) = identity ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.28.0.1']),
% 0.85/1.32 [weight('<3,26,5,[1,0,0,0]>')]).
% 0.85/1.32 cnf('0.28.2.0',plain,
% 0.85/1.32 ( negative_part(positive_part(X1)) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.28.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_26]).
% 0.85/1.32 cnf('0.30.0.0',plain,
% 0.85/1.32 ( X1 = greatest_lower_bound(X1,positive_part(X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.5.2.0','0.17.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.30.1.0',plain,
% 0.85/1.32 ( X1 = greatest_lower_bound(X1,positive_part(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.30.0.0']),
% 0.85/1.32 [weight('<4,17,5,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.30.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,positive_part(X1)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.30.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_28]).
% 0.85/1.32 cnf('0.31.0.0',plain,
% 0.85/1.32 ( negative_part(X1) = greatest_lower_bound(negative_part(X1),identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.30.2.0','0.27.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.31.0.1',plain,
% 0.85/1.32 ( negative_part(X1) = negative_part(negative_part(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.31.0.0','0.21.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.31.1.0',plain,
% 0.85/1.32 ( negative_part(X1) = negative_part(negative_part(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.31.0.1']),
% 0.85/1.32 [weight('<3,30,27,[1,0,0,2]>')]).
% 0.85/1.32 cnf('0.31.2.0',plain,
% 0.85/1.32 ( negative_part(negative_part(X1)) = negative_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.31.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_29]).
% 0.85/1.32 cnf('0.34.0.0',plain,
% 0.85/1.32 ( X1 = least_upper_bound(X1,negative_part(X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.3.2.0','0.21.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.34.1.0',plain,
% 0.85/1.32 ( X1 = least_upper_bound(X1,negative_part(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.34.0.0']),
% 0.85/1.32 [weight('<4,21,3,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.34.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X1)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.34.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_32]).
% 0.85/1.32 cnf('0.38.0.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),inverse(identity)) = inverse(X1) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.13.2.0','0.1.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.38.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),inverse(identity)) = inverse(X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.38.0.0']),
% 0.85/1.32 [weight('<5,13,1,[1,0,0,1]>')]).
% 0.85/1.32 cnf('0.38.1.1',plain,
% 0.85/1.32 ( multiply(inverse(X1),identity) = inverse(X1) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.38.1.0','0.22.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.38.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),identity) = inverse(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.38.1.1',theory(equality)]),
% 0.85/1.32 [u,rule_36]).
% 0.85/1.32 cnf('0.39.0.0',plain,
% 0.85/1.32 ( inverse(inverse(X1)) = multiply(X1,identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.38.2.0','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.39.0.1',plain,
% 0.85/1.32 ( X1 = multiply(X1,identity) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.39.0.0','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.39.1.0',plain,
% 0.85/1.32 ( X1 = multiply(X1,identity) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.39.0.1']),
% 0.85/1.32 [weight('<3,38,6,[1,0,0,1]>')]).
% 0.85/1.32 cnf('0.39.2.0',plain,
% 0.85/1.32 ( multiply(X1,identity) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.39.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_37]).
% 0.85/1.32 cnf('0.41.0.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.15.2.0','0.2.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.41.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.41.0.0']),
% 0.85/1.32 [weight('<5,15,2,[1,0,0,1]>')]).
% 0.85/1.32 cnf('0.41.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.41.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_39]).
% 0.85/1.32 cnf('0.44.0.0',plain,
% 0.85/1.32 ( least_upper_bound(identity,greatest_lower_bound(X1,X2)) = greatest_lower_bound(positive_part(X1),least_upper_bound(identity,X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.16.2.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.44.0.1',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,X2)) = greatest_lower_bound(positive_part(X1),least_upper_bound(identity,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.44.0.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.44.0.2',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,X2)) = greatest_lower_bound(positive_part(X1),positive_part(X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.44.0.1','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.2','L')]).
% 0.85/1.32 cnf('0.44.1.0',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,X2)) = greatest_lower_bound(positive_part(X1),positive_part(X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.44.0.2']),
% 0.85/1.32 [weight('<5,25,16,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.44.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(positive_part(X1),positive_part(X2)) = positive_part(greatest_lower_bound(X1,X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.44.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_42]).
% 0.85/1.32 cnf('0.45.0.0',plain,
% 0.85/1.32 ( greatest_lower_bound(identity,least_upper_bound(X1,X2)) = least_upper_bound(negative_part(X1),greatest_lower_bound(identity,X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.18.2.0','0.26.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.45.0.1',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,X2)) = least_upper_bound(negative_part(X1),greatest_lower_bound(identity,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.45.0.0','0.26.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.45.0.2',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,X2)) = least_upper_bound(negative_part(X1),negative_part(X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.45.0.1','0.26.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.2','L')]).
% 0.85/1.32 cnf('0.45.1.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,X2)) = least_upper_bound(negative_part(X1),negative_part(X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.45.0.2']),
% 0.85/1.32 [weight('<5,26,18,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.45.2.0',plain,
% 0.85/1.32 ( least_upper_bound(negative_part(X1),negative_part(X2)) = negative_part(least_upper_bound(X1,X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.45.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_43]).
% 0.85/1.32 cnf('0.50.0.0',plain,
% 0.85/1.32 ( multiply(X1,least_upper_bound(identity,X2)) = least_upper_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.8.2.0','0.39.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.50.0.1',plain,
% 0.85/1.32 ( multiply(X1,positive_part(X2)) = least_upper_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.50.0.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.50.1.0',plain,
% 0.85/1.32 ( multiply(X1,positive_part(X2)) = least_upper_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.50.0.1']),
% 0.85/1.32 [weight('<5,39,8,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.50.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,positive_part(X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.50.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_48]).
% 0.85/1.32 cnf('0.51.0.0',plain,
% 0.85/1.32 ( multiply(multiply(X1,X2),positive_part(X2)) = multiply(least_upper_bound(X1,multiply(X1,X2)),X2) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.50.2.0','0.10.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.51.0.1',plain,
% 0.85/1.32 ( multiply(X1,multiply(X2,positive_part(X2))) = multiply(least_upper_bound(X1,multiply(X1,X2)),X2) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.51.0.0','0.7.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.51.0.2',plain,
% 0.85/1.32 ( multiply(X1,multiply(X2,positive_part(X2))) = multiply(multiply(X1,positive_part(X2)),X2) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.51.0.1','0.50.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.1','L')]).
% 0.85/1.32 cnf('0.51.0.3',plain,
% 0.85/1.32 ( multiply(X1,multiply(X2,positive_part(X2))) = multiply(X1,multiply(positive_part(X2),X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.51.0.2','0.7.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.51.1.0',plain,
% 0.85/1.32 ( multiply(X2,positive_part(X2)) = multiply(positive_part(X2),X2) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.51.0.3']),
% 0.85/1.32 [weight('<4,50,10,[1,0,0,0]>')]).
% 0.85/1.32 cnf('0.51.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(X1),X1) = multiply(X1,positive_part(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.51.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_49]).
% 0.85/1.32 cnf('0.52.0.0',plain,
% 0.85/1.32 ( multiply(X1,greatest_lower_bound(identity,X2)) = greatest_lower_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.9.2.0','0.39.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.52.0.1',plain,
% 0.85/1.32 ( multiply(X1,negative_part(X2)) = greatest_lower_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.52.0.0','0.26.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.52.1.0',plain,
% 0.85/1.32 ( multiply(X1,negative_part(X2)) = greatest_lower_bound(X1,multiply(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.52.0.1']),
% 0.85/1.32 [weight('<5,39,9,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.52.2.0',plain,
% 0.85/1.32 ( greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,negative_part(X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.52.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_50]).
% 0.85/1.32 cnf('0.55.0.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,X2) = least_upper_bound(X1,least_upper_bound(X2,X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.41.2.0','0.14.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.55.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,X2) = least_upper_bound(X1,least_upper_bound(X2,X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.55.0.0']),
% 0.85/1.32 [weight('<5,41,14,[1,0,0,2]>')]).
% 0.85/1.32 cnf('0.55.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,least_upper_bound(X2,X1)) = least_upper_bound(X1,X2) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.55.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_53]).
% 0.85/1.32 cnf('0.59.0.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,negative_part(X2))) = least_upper_bound(negative_part(X1),negative_part(X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.45.2.0','0.31.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.59.0.1',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,negative_part(X2))) = negative_part(least_upper_bound(X1,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.59.0.0','0.45.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.59.1.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,negative_part(X2))) = negative_part(least_upper_bound(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.59.0.1']),
% 0.85/1.32 [weight('<5,45,31,[1,0,0,3]>')]).
% 0.85/1.32 cnf('0.59.2.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,negative_part(X2))) = negative_part(least_upper_bound(X1,X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.59.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_57]).
% 0.85/1.32 cnf('0.60.0.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),positive_part(X1)) = least_upper_bound(inverse(X1),identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.50.2.0','0.12.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.60.0.1',plain,
% 0.85/1.32 ( multiply(inverse(X1),positive_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.60.0.0','0.17.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.60.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),positive_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.60.0.1']),
% 0.85/1.32 [weight('<5,50,12,[1,0,0,2]>')]).
% 0.85/1.32 cnf('0.60.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),positive_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.60.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_58]).
% 0.85/1.32 cnf('0.67.0.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),negative_part(X1)) = greatest_lower_bound(inverse(X1),identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.52.2.0','0.12.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.67.0.1',plain,
% 0.85/1.32 ( multiply(inverse(X1),negative_part(X1)) = negative_part(inverse(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.67.0.0','0.21.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.67.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),negative_part(X1)) = negative_part(inverse(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.67.0.1']),
% 0.85/1.32 [weight('<5,52,12,[1,0,0,2]>')]).
% 0.85/1.32 cnf('0.67.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),negative_part(X1)) = negative_part(inverse(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.67.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_65]).
% 0.85/1.32 cnf('0.73.0.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),least_upper_bound(X1,X2)) = least_upper_bound(identity,multiply(inverse(X1),X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.8.2.0','0.12.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.73.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),least_upper_bound(X1,X2)) = least_upper_bound(identity,multiply(inverse(X1),X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.73.0.0']),
% 0.85/1.32 [weight('<6,12,8,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.73.1.1',plain,
% 0.85/1.32 ( multiply(inverse(X1),least_upper_bound(X1,X2)) = positive_part(multiply(inverse(X1),X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.73.1.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.73.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),least_upper_bound(X1,X2)) = positive_part(multiply(inverse(X1),X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.73.1.1',theory(equality)]),
% 0.85/1.32 [u,rule_71]).
% 0.85/1.32 cnf('0.77.0.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(inverse(X1),X2),X1) = least_upper_bound(identity,multiply(X2,X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.10.2.0','0.12.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.77.1.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(inverse(X1),X2),X1) = least_upper_bound(identity,multiply(X2,X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.77.0.0']),
% 0.85/1.32 [weight('<6,12,10,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.77.1.1',plain,
% 0.85/1.32 ( multiply(least_upper_bound(inverse(X1),X2),X1) = positive_part(multiply(X2,X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.77.1.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.77.2.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(inverse(X1),X2),X1) = positive_part(multiply(X2,X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.77.1.1',theory(equality)]),
% 0.85/1.32 [u,rule_75]).
% 0.85/1.32 cnf('0.78.0.0',plain,
% 0.85/1.32 ( positive_part(multiply(identity,X1)) = multiply(positive_part(inverse(X1)),X1) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.77.2.0','0.17.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.78.0.1',plain,
% 0.85/1.32 ( positive_part(X1) = multiply(positive_part(inverse(X1)),X1) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.78.0.0','0.1.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.78.1.0',plain,
% 0.85/1.32 ( positive_part(X1) = multiply(positive_part(inverse(X1)),X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.78.0.1']),
% 0.85/1.32 [weight('<5,77,17,[1,0,0,1]>')]).
% 0.85/1.32 cnf('0.78.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),X1) = positive_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.78.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_76]).
% 0.85/1.32 cnf('0.105.0.0',plain,
% 0.85/1.32 ( multiply(positive_part(X1),multiply(X1,X2)) = multiply(multiply(X1,positive_part(X1)),X2) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.7.2.0','0.51.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.105.0.1',plain,
% 0.85/1.32 ( multiply(positive_part(X1),multiply(X1,X2)) = multiply(X1,multiply(positive_part(X1),X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.105.0.0','0.7.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.105.1.0',plain,
% 0.85/1.32 ( multiply(positive_part(X1),multiply(X1,X2)) = multiply(X1,multiply(positive_part(X1),X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.105.0.1']),
% 0.85/1.32 [weight('<6,51,7,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.105.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(X1),multiply(X1,X2)) = multiply(X1,multiply(positive_part(X1),X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.105.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_103]).
% 0.85/1.32 cnf('0.111.0.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X2)) = least_upper_bound(least_upper_bound(X1,negative_part(X2)),negative_part(least_upper_bound(X1,X2))) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.34.2.0','0.59.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.111.0.1',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X2)) = least_upper_bound(X1,least_upper_bound(negative_part(X2),negative_part(least_upper_bound(X1,X2)))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.111.0.0','0.15.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.111.0.2',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X2)) = least_upper_bound(X1,negative_part(least_upper_bound(X2,least_upper_bound(X1,X2)))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.111.0.1','0.45.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.2','L')]).
% 0.85/1.32 cnf('0.111.0.3',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X2)) = least_upper_bound(X1,negative_part(least_upper_bound(X2,X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.111.0.2','0.55.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.2.1','L')]).
% 0.85/1.32 cnf('0.111.1.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(X2)) = least_upper_bound(X1,negative_part(least_upper_bound(X2,X1))) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.111.0.3']),
% 0.85/1.32 [weight('<6,59,34,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.111.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,negative_part(least_upper_bound(X2,X1))) = least_upper_bound(X1,negative_part(X2)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.111.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_109]).
% 0.85/1.32 cnf('0.137.0.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = greatest_lower_bound(positive_part(inverse(X1)),positive_part(X1)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.52.2.0','0.78.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.137.0.1',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = positive_part(greatest_lower_bound(inverse(X1),X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.137.0.0','0.44.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.137.1.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = positive_part(greatest_lower_bound(inverse(X1),X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.137.0.1']),
% 0.85/1.32 [weight('<6,78,52,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.137.1.1',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = positive_part(greatest_lower_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.137.1.0','0.19.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.1','L')]).
% 0.85/1.32 cnf('0.137.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = positive_part(greatest_lower_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.137.1.1',theory(equality)]),
% 0.85/1.32 [u,rule_135]).
% 0.85/1.32 cnf('0.213.0.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(identity,X1),X2) = least_upper_bound(X2,multiply(X1,X2)) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.10.2.0','0.1.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.213.1.0',plain,
% 0.85/1.32 ( multiply(least_upper_bound(identity,X1),X2) = least_upper_bound(X2,multiply(X1,X2)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.213.0.0']),
% 0.85/1.32 [weight('<?,10,1,[1,0,0,1]>')]).
% 0.85/1.32 cnf('0.213.1.1',plain,
% 0.85/1.32 ( multiply(positive_part(X1),X2) = least_upper_bound(X2,multiply(X1,X2)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.213.1.0','0.25.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.213.2.0',plain,
% 0.85/1.32 ( least_upper_bound(X1,multiply(X2,X1)) = multiply(positive_part(X2),X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.213.1.1',theory(equality)]),
% 0.85/1.32 [x,rule_211]).
% 0.85/1.32 cnf('0.214.0.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = least_upper_bound(negative_part(X1),negative_part(inverse(X1))) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.213.2.0','0.67.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.214.0.1',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,inverse(X1))) = least_upper_bound(negative_part(X1),negative_part(inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.214.0.0','0.137.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.214.0.2',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,inverse(X1))) = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.214.0.1','0.45.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.214.1.0',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,inverse(X1))) = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.214.0.2']),
% 0.85/1.32 [weight('<5,213,67,[1,0,0,2]>')]).
% 0.85/1.32 cnf('0.214.2.0',plain,
% 0.85/1.32 ( positive_part(greatest_lower_bound(X1,inverse(X1))) = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.214.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_212]).
% 0.85/1.32 cnf('0.215.0.0',plain,
% 0.85/1.32 ( identity = negative_part(negative_part(least_upper_bound(X1,inverse(X1)))) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.28.2.0','0.214.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.215.0.1',plain,
% 0.85/1.32 ( identity = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.215.0.0','0.31.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.215.1.0',plain,
% 0.85/1.32 ( identity = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.215.0.1']),
% 0.85/1.32 [weight('<5,214,28,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.215.2.0',plain,
% 0.85/1.32 ( negative_part(least_upper_bound(X1,inverse(X1))) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.215.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_213]).
% 0.85/1.32 cnf('0.218.0.0',plain,
% 0.85/1.32 ( least_upper_bound(inverse(X1),negative_part(X1)) = least_upper_bound(inverse(X1),identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.111.2.0','0.215.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.218.0.1',plain,
% 0.85/1.32 ( least_upper_bound(inverse(X1),negative_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.218.0.0','0.17.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.218.1.0',plain,
% 0.85/1.32 ( least_upper_bound(inverse(X1),negative_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.218.0.1']),
% 0.85/1.32 [weight('<5,215,111,[0,0,0,2]>')]).
% 0.85/1.32 cnf('0.218.2.0',plain,
% 0.85/1.32 ( least_upper_bound(inverse(X1),negative_part(X1)) = positive_part(inverse(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.218.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_216]).
% 0.85/1.32 cnf('0.223.0.0',plain,
% 0.85/1.32 ( positive_part(multiply(inverse(inverse(X1)),negative_part(X1))) = multiply(inverse(inverse(X1)),positive_part(inverse(X1))) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.73.2.0','0.218.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.223.0.1',plain,
% 0.85/1.32 ( positive_part(multiply(X1,negative_part(X1))) = multiply(inverse(inverse(X1)),positive_part(inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.223.0.0','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1.1','L')]).
% 0.85/1.32 cnf('0.223.0.2',plain,
% 0.85/1.32 ( positive_part(multiply(X1,negative_part(X1))) = positive_part(inverse(inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.223.0.1','0.60.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.223.0.3',plain,
% 0.85/1.32 ( positive_part(multiply(X1,negative_part(X1))) = positive_part(X1) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.223.0.2','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('R.1','L')]).
% 0.85/1.32 cnf('0.223.1.0',plain,
% 0.85/1.32 ( positive_part(multiply(X1,negative_part(X1))) = positive_part(X1) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.223.0.3']),
% 0.85/1.32 [weight('<5,218,73,[0,0,0,3]>')]).
% 0.85/1.32 cnf('0.223.2.0',plain,
% 0.85/1.32 ( positive_part(multiply(X1,negative_part(X1))) = positive_part(X1) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.223.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_221]).
% 0.85/1.32 cnf('0.225.0.0',plain,
% 0.85/1.32 ( multiply(multiply(X1,negative_part(X1)),positive_part(multiply(X1,negative_part(X1)))) = multiply(positive_part(X1),multiply(X1,negative_part(X1))) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.51.2.0','0.223.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.225.0.1',plain,
% 0.85/1.32 ( multiply(X1,multiply(negative_part(X1),positive_part(multiply(X1,negative_part(X1))))) = multiply(positive_part(X1),multiply(X1,negative_part(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.225.0.0','0.7.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.225.0.2',plain,
% 0.85/1.32 ( multiply(X1,multiply(negative_part(X1),positive_part(X1))) = multiply(positive_part(X1),multiply(X1,negative_part(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.225.0.1','0.223.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2.2','L')]).
% 0.85/1.32 cnf('0.225.0.3',plain,
% 0.85/1.32 ( multiply(X1,multiply(negative_part(X1),positive_part(X1))) = multiply(X1,multiply(positive_part(X1),negative_part(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.225.0.2','0.105.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.225.1.0',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = multiply(positive_part(X1),negative_part(X1)) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.225.0.3']),
% 0.85/1.32 [weight('<5,223,51,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.225.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(X1),negative_part(X1)) = multiply(negative_part(X1),positive_part(X1)) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.225.1.0',theory(equality)]),
% 0.85/1.32 [x,rule_223]).
% 0.85/1.32 cnf('0.227.0.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = positive_part(greatest_lower_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(interreduction_right,[status(thm)],['0.137.2.0'])).
% 0.85/1.32 cnf('0.227.0.1',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.227.0.0','0.214.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.227.1.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = negative_part(least_upper_bound(X1,inverse(X1))) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.227.0.1']),
% 0.85/1.32 [weight('<6,137,214,[0,0,0,0]>')]).
% 0.85/1.32 cnf('0.227.1.1',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = identity ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.227.1.0','0.215.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.227.2.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(X1)),negative_part(X1)) = identity ),
% 0.85/1.32 inference(orient,[status(thm)],['0.227.1.1',theory(equality)]),
% 0.85/1.32 [u,rule_225]).
% 0.85/1.32 cnf('0.283.0.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),multiply(positive_part(X1),X2)) = multiply(positive_part(inverse(X1)),X2) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.7.2.0','0.60.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1','L')]).
% 0.85/1.32 cnf('0.283.1.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),multiply(positive_part(X1),X2)) = multiply(positive_part(inverse(X1)),X2) ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.283.0.0']),
% 0.85/1.32 [weight('<7,60,7,[0,0,0,1]>')]).
% 0.85/1.32 cnf('0.283.2.0',plain,
% 0.85/1.32 ( multiply(inverse(X1),multiply(positive_part(X1),X2)) = multiply(positive_part(inverse(X1)),X2) ),
% 0.85/1.32 inference(orient,[status(thm)],['0.283.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_281]).
% 0.85/1.32 cnf('0.286.0.0',plain,
% 0.85/1.32 ( multiply(positive_part(inverse(inverse(X1))),negative_part(X1)) = multiply(inverse(inverse(X1)),identity) ),
% 0.85/1.32 inference(cp,[status(thm)],['0.283.2.0','0.227.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.2','L')]).
% 0.85/1.32 cnf('0.286.0.1',plain,
% 0.85/1.32 ( multiply(positive_part(X1),negative_part(X1)) = multiply(inverse(inverse(X1)),identity) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.286.0.0','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('L.1.1','L')]).
% 0.85/1.32 cnf('0.286.0.2',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = multiply(inverse(inverse(X1)),identity) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.286.0.1','0.225.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('0.286.0.3',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = inverse(inverse(X1)) ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.286.0.2','0.39.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.286.0.4',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = X1 ),
% 0.85/1.32 inference(reduction,[status(thm)],['0.286.0.3','0.6.2.0',theory(equality)]),
% 0.85/1.32 [pos('R','L')]).
% 0.85/1.32 cnf('0.286.1.0',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = X1 ),
% 0.85/1.32 inference(weigh,[status(thm)],['0.286.0.4']),
% 0.85/1.32 [weight('<5,283,227,[1,0,0,3]>')]).
% 0.85/1.32 cnf('0.286.2.0',plain,
% 0.85/1.32 ( multiply(negative_part(X1),positive_part(X1)) = X1 ),
% 0.85/1.32 inference(orient,[status(thm)],['0.286.1.0',theory(equality)]),
% 0.85/1.32 [u,rule_284]).
% 0.85/1.32 cnf('1.0.0.0',conjecture,
% 0.85/1.32 ( multiply(positive_part(a),negative_part(a)) = a ),
% 0.85/1.32 file('/tmp/WALDMEISTER_5548_n012',conjecture_1)).
% 0.85/1.32 cnf('1.0.0.1',plain,
% 0.85/1.32 ( multiply(negative_part(a),positive_part(a)) = a ),
% 0.85/1.32 inference(reduction,[status(thm)],['1.0.0.0','0.225.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('1.0.0.2',plain,
% 0.85/1.32 ( a = a ),
% 0.85/1.32 inference(reduction,[status(thm)],['1.0.0.1','0.286.2.0',theory(equality)]),
% 0.85/1.32 [pos('L','L')]).
% 0.85/1.32 cnf('1.0.0.3',plain,
% 0.85/1.32 ( $true ),
% 0.85/1.32 inference(trivial,[status(thm)],['1.0.0.2',theory(equality)]),
% 0.85/1.32 [conjecture_1]).
% 0.85/1.32
% 0.85/1.32 Proved Goals:
% 0.85/1.32 No. 1: multiply(positive_part(a),negative_part(a)) ?= a joined, current: a = a
% 0.85/1.32 1 goal was specified, which was proved.
% 0.85/1.32 % SZS output end CNFRefutation
% 0.85/1.32 #END OF PROOF
% 0.85/1.32
% 0.85/1.32 Problem WALDMEISTER_5548_n012
% 0.85/1.32 CPs.gen 17037
% 0.85/1.32 CPs.reexp 0
% 0.85/1.32 Select 732
% 0.85/1.32 R 284
% 0.85/1.32 E 2
% 0.85/1.32 vsize 6.5M
% 0.85/1.32 rss 4.0M
% 0.85/1.32 process.time 0.077s
% 0.85/1.32 wallclock.time 0.353s
% 0.85/1.32 status S
% 0.85/1.32
% 0.85/1.32
% 0.85/1.32 Waldmeister states: Goal proved.
% 0.85/1.32 % SZS status Unsatisfiable
% 0.85/1.32
% 0.85/1.32 Problem WALDMEISTER_5548_n012
% 0.85/1.32 CPs.gen 70275
% 0.85/1.32 CPs.reexp 0
% 0.85/1.32 Select 6550
% 0.85/1.32 R 554
% 0.85/1.32 E 10
% 0.85/1.32 vsize 7.2M
% 0.85/1.32 rss 4.4M
% 0.85/1.32 process.time 0.278s
% 0.85/1.32 wallclock.time 0.354s
% 0.85/1.32 status S
%------------------------------------------------------------------------------