TSTP Solution File: GRP164-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : GRP164-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:39:03 EDT 2023
% Result : Unsatisfiable 1288.33s 177.48s
% Output : CNFRefutation 1288.33s
% Verified :
% SZS Type : Refutation
% Derivation depth : 29
% Number of leaves : 15
% Syntax : Number of clauses : 215 ( 215 unt; 0 nHn; 5 RR)
% Number of literals : 215 ( 214 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 459 ( 52 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',left_identity) ).
cnf(monotony_glb2,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',monotony_glb2) ).
cnf(symmetry_of_glb,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',symmetry_of_glb) ).
cnf(monotony_lub1,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',monotony_lub1) ).
cnf(symmetry_of_lub,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',symmetry_of_lub) ).
cnf(associativity_of_glb,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',associativity_of_glb) ).
cnf(monotony_glb1,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',monotony_glb1) ).
cnf(associativity_of_lub,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',associativity_of_lub) ).
cnf(glb_absorbtion,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',glb_absorbtion) ).
cnf(lub_absorbtion,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',lub_absorbtion) ).
cnf(monotony_lub2,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',monotony_lub2) ).
cnf(idempotence_of_gld,axiom,
greatest_lower_bound(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',idempotence_of_gld) ).
cnf(prove_distrnu,negated_conjecture,
least_upper_bound(a,greatest_lower_bound(b,c)) != greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c)),
file('/export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p',prove_distrnu) ).
cnf(c_0_15,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_16,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_17,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_18,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
cnf(c_0_19,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_20,plain,
multiply(inverse(inverse(X1)),X2) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_21]) ).
cnf(c_0_23,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_24,plain,
multiply(X1,multiply(X2,inverse(multiply(X1,X2)))) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_25,axiom,
multiply(greatest_lower_bound(X1,X2),X3) = greatest_lower_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_glb2 ).
cnf(c_0_26,axiom,
greatest_lower_bound(X1,X2) = greatest_lower_bound(X2,X1),
symmetry_of_glb ).
cnf(c_0_27,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_24]),c_0_21]) ).
cnf(c_0_28,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_29,plain,
greatest_lower_bound(X1,multiply(X2,X1)) = multiply(greatest_lower_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_17]),c_0_26]) ).
cnf(c_0_30,axiom,
multiply(X1,least_upper_bound(X2,X3)) = least_upper_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_lub1 ).
cnf(c_0_31,axiom,
least_upper_bound(X1,X2) = least_upper_bound(X2,X1),
symmetry_of_lub ).
cnf(c_0_32,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_27]),c_0_22]) ).
cnf(c_0_33,plain,
inverse(multiply(X1,inverse(X2))) = multiply(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_28,c_0_27]) ).
cnf(c_0_34,plain,
multiply(greatest_lower_bound(X1,identity),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_23]),c_0_26]) ).
cnf(c_0_35,plain,
multiply(greatest_lower_bound(X1,inverse(X2)),X2) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_16]),c_0_26]) ).
cnf(c_0_36,axiom,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(greatest_lower_bound(X1,X2),X3),
associativity_of_glb ).
cnf(c_0_37,plain,
least_upper_bound(X1,multiply(X1,X2)) = multiply(X1,least_upper_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_21]),c_0_31]) ).
cnf(c_0_38,plain,
multiply(inverse(X1),inverse(X2)) = inverse(multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_27]) ).
cnf(c_0_39,axiom,
multiply(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(multiply(X1,X2),multiply(X1,X3)),
monotony_glb1 ).
cnf(c_0_40,plain,
multiply(greatest_lower_bound(X1,inverse(multiply(X2,X3))),X2) = greatest_lower_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_41,plain,
multiply(X1,inverse(greatest_lower_bound(X1,identity))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
multiply(greatest_lower_bound(X1,greatest_lower_bound(X2,inverse(X3))),X3) = greatest_lower_bound(identity,multiply(greatest_lower_bound(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
multiply(inverse(X1),least_upper_bound(X1,identity)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_31]) ).
cnf(c_0_44,plain,
inverse(multiply(inverse(X1),X2)) = multiply(inverse(X2),X1),
inference(spm,[status(thm)],[c_0_38,c_0_22]) ).
cnf(c_0_45,plain,
multiply(X1,least_upper_bound(X2,inverse(X1))) = least_upper_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_31]) ).
cnf(c_0_46,axiom,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(least_upper_bound(X1,X2),X3),
associativity_of_lub ).
cnf(c_0_47,plain,
greatest_lower_bound(X1,multiply(X1,X2)) = multiply(X1,greatest_lower_bound(X2,identity)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_21]),c_0_26]) ).
cnf(c_0_48,axiom,
greatest_lower_bound(X1,least_upper_bound(X1,X2)) = X1,
glb_absorbtion ).
cnf(c_0_49,axiom,
least_upper_bound(X1,greatest_lower_bound(X1,X2)) = X1,
lub_absorbtion ).
cnf(c_0_50,plain,
greatest_lower_bound(X1,greatest_lower_bound(identity,multiply(X2,X1))) = greatest_lower_bound(identity,multiply(greatest_lower_bound(X2,identity),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_22]),c_0_42]),c_0_22]),c_0_26]),c_0_36]) ).
cnf(c_0_51,plain,
multiply(inverse(X1),least_upper_bound(identity,X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_43,c_0_31]) ).
cnf(c_0_52,plain,
multiply(X1,least_upper_bound(X2,inverse(multiply(X3,X1)))) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_30,c_0_27]) ).
cnf(c_0_53,plain,
multiply(inverse(least_upper_bound(X1,identity)),X1) = inverse(least_upper_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_44,c_0_43]) ).
cnf(c_0_54,plain,
multiply(X1,least_upper_bound(X2,least_upper_bound(X3,inverse(X1)))) = least_upper_bound(identity,multiply(X1,least_upper_bound(X2,X3))),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_55,plain,
multiply(inverse(X1),greatest_lower_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_16]),c_0_26]) ).
cnf(c_0_56,plain,
greatest_lower_bound(X1,least_upper_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_48,c_0_31]) ).
cnf(c_0_57,plain,
least_upper_bound(X1,greatest_lower_bound(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_49,c_0_26]) ).
cnf(c_0_58,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,inverse(X1)),least_upper_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_48]),c_0_26]),c_0_48]),c_0_26]) ).
cnf(c_0_59,plain,
least_upper_bound(X1,least_upper_bound(identity,multiply(X1,X2))) = least_upper_bound(identity,multiply(X1,least_upper_bound(X2,identity))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_22]),c_0_54]),c_0_22]),c_0_31]),c_0_46]) ).
cnf(c_0_60,plain,
multiply(greatest_lower_bound(identity,X1),inverse(X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_34,c_0_26]) ).
cnf(c_0_61,axiom,
multiply(least_upper_bound(X1,X2),X3) = least_upper_bound(multiply(X1,X3),multiply(X2,X3)),
monotony_lub2 ).
cnf(c_0_62,plain,
multiply(inverse(X1),greatest_lower_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_55,c_0_26]) ).
cnf(c_0_63,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X1)) = greatest_lower_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_26]) ).
cnf(c_0_64,plain,
greatest_lower_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
inference(spm,[status(thm)],[c_0_58,c_0_22]) ).
cnf(c_0_65,plain,
least_upper_bound(identity,multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_49]),c_0_31]),c_0_49]),c_0_31]) ).
cnf(c_0_66,plain,
least_upper_bound(X1,multiply(X2,X1)) = multiply(least_upper_bound(X2,identity),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_17]),c_0_31]) ).
cnf(c_0_67,plain,
least_upper_bound(X1,least_upper_bound(X2,X1)) = least_upper_bound(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_56]),c_0_31]) ).
cnf(c_0_68,plain,
multiply(X1,greatest_lower_bound(X2,multiply(inverse(X1),X3))) = greatest_lower_bound(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_69,plain,
greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_16]) ).
cnf(c_0_70,plain,
multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,inverse(X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_64]),c_0_31]),c_0_65]) ).
cnf(c_0_71,plain,
multiply(least_upper_bound(X1,identity),X1) = multiply(X1,least_upper_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_37,c_0_66]) ).
cnf(c_0_72,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X2,X1),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_46,c_0_57]) ).
cnf(c_0_73,plain,
least_upper_bound(X1,least_upper_bound(X2,least_upper_bound(X1,X3))) = least_upper_bound(X2,least_upper_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_67]),c_0_46]),c_0_46]) ).
cnf(c_0_74,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_36,c_0_48]) ).
cnf(c_0_75,plain,
multiply(inverse(greatest_lower_bound(multiply(X1,X2),X3)),X1) = inverse(greatest_lower_bound(X2,multiply(inverse(X1),X3))),
inference(spm,[status(thm)],[c_0_32,c_0_68]) ).
cnf(c_0_76,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_41]),c_0_26]),c_0_69]),c_0_21]) ).
cnf(c_0_77,plain,
multiply(greatest_lower_bound(inverse(multiply(X1,X2)),X3),X1) = greatest_lower_bound(inverse(X2),multiply(X3,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_32]) ).
cnf(c_0_78,plain,
least_upper_bound(identity,inverse(X1)) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_70]),c_0_21]) ).
cnf(c_0_79,plain,
multiply(X1,inverse(greatest_lower_bound(identity,X1))) = inverse(greatest_lower_bound(identity,inverse(X1))),
inference(spm,[status(thm)],[c_0_33,c_0_60]) ).
cnf(c_0_80,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_57,c_0_36]) ).
cnf(c_0_81,plain,
least_upper_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_46,c_0_49]) ).
cnf(c_0_82,plain,
multiply(least_upper_bound(identity,X1),X1) = multiply(X1,least_upper_bound(identity,X1)),
inference(spm,[status(thm)],[c_0_71,c_0_31]) ).
cnf(c_0_83,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X2,least_upper_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_48]),c_0_46]),c_0_46]),c_0_73]) ).
cnf(c_0_84,plain,
least_upper_bound(X1,least_upper_bound(X2,greatest_lower_bound(X3,least_upper_bound(X1,X2)))) = least_upper_bound(X1,X2),
inference(spm,[status(thm)],[c_0_57,c_0_46]) ).
cnf(c_0_85,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(least_upper_bound(X1,X3),X2)) = greatest_lower_bound(least_upper_bound(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_74]),c_0_31]) ).
cnf(c_0_86,plain,
inverse(greatest_lower_bound(X1,inverse(greatest_lower_bound(X2,inverse(X1))))) = inverse(X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_32]),c_0_38]),c_0_40]),c_0_17]) ).
cnf(c_0_87,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,multiply(greatest_lower_bound(X1,X2),X3))) = multiply(greatest_lower_bound(X1,X2),greatest_lower_bound(X3,identity)),
inference(spm,[status(thm)],[c_0_36,c_0_47]) ).
cnf(c_0_88,axiom,
greatest_lower_bound(X1,X1) = X1,
idempotence_of_gld ).
cnf(c_0_89,plain,
multiply(greatest_lower_bound(X1,identity),X1) = multiply(X1,greatest_lower_bound(X1,identity)),
inference(spm,[status(thm)],[c_0_47,c_0_29]) ).
cnf(c_0_90,plain,
multiply(greatest_lower_bound(multiply(X1,inverse(X2)),X3),X2) = greatest_lower_bound(X1,multiply(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_33]),c_0_22]) ).
cnf(c_0_91,plain,
multiply(inverse(X1),least_upper_bound(X2,multiply(X1,X3))) = least_upper_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_30,c_0_18]) ).
cnf(c_0_92,plain,
inverse(greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_78]),c_0_79]),c_0_21]) ).
cnf(c_0_93,plain,
greatest_lower_bound(X1,greatest_lower_bound(least_upper_bound(X2,X1),X3)) = greatest_lower_bound(X1,X3),
inference(spm,[status(thm)],[c_0_36,c_0_56]) ).
cnf(c_0_94,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X1,X3))) = greatest_lower_bound(X2,greatest_lower_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_63]),c_0_36]),c_0_36]) ).
cnf(c_0_95,plain,
least_upper_bound(X1,least_upper_bound(X2,greatest_lower_bound(X3,X1))) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_48]),c_0_46]) ).
cnf(c_0_96,plain,
least_upper_bound(X1,least_upper_bound(X2,least_upper_bound(X3,X1))) = least_upper_bound(X2,least_upper_bound(X3,X1)),
inference(spm,[status(thm)],[c_0_67,c_0_46]) ).
cnf(c_0_97,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,greatest_lower_bound(X2,X3))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_49,c_0_36]) ).
cnf(c_0_98,plain,
least_upper_bound(X1,least_upper_bound(multiply(greatest_lower_bound(X2,identity),X1),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_81,c_0_29]) ).
cnf(c_0_99,plain,
multiply(inverse(greatest_lower_bound(identity,inverse(X1))),greatest_lower_bound(X1,identity)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_34]),c_0_22]) ).
cnf(c_0_100,plain,
multiply(least_upper_bound(identity,X1),greatest_lower_bound(X1,identity)) = multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_82]),c_0_29]) ).
cnf(c_0_101,plain,
least_upper_bound(X1,least_upper_bound(X2,greatest_lower_bound(X3,least_upper_bound(X2,X1)))) = least_upper_bound(X2,X1),
inference(spm,[status(thm)],[c_0_83,c_0_84]) ).
cnf(c_0_102,plain,
least_upper_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3))) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3)),
inference(spm,[status(thm)],[c_0_85,c_0_48]) ).
cnf(c_0_103,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(X2,inverse(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_86]),c_0_22]) ).
cnf(c_0_104,plain,
multiply(greatest_lower_bound(X1,multiply(X2,X3)),inverse(X3)) = greatest_lower_bound(multiply(X1,inverse(X3)),X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_38]),c_0_22]),c_0_22]) ).
cnf(c_0_105,plain,
greatest_lower_bound(identity,multiply(X1,greatest_lower_bound(X1,identity))) = multiply(greatest_lower_bound(X1,identity),greatest_lower_bound(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_87]),c_0_36]),c_0_88]),c_0_89]) ).
cnf(c_0_106,plain,
multiply(X1,inverse(greatest_lower_bound(X2,multiply(X3,X1)))) = inverse(greatest_lower_bound(multiply(X2,inverse(X1)),X3)),
inference(spm,[status(thm)],[c_0_27,c_0_90]) ).
cnf(c_0_107,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_17]) ).
cnf(c_0_108,plain,
multiply(inverse(least_upper_bound(X1,multiply(X2,X3))),X2) = inverse(least_upper_bound(multiply(inverse(X2),X1),X3)),
inference(spm,[status(thm)],[c_0_44,c_0_91]) ).
cnf(c_0_109,plain,
inverse(least_upper_bound(identity,X1)) = greatest_lower_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_22,c_0_92]) ).
cnf(c_0_110,plain,
multiply(X1,greatest_lower_bound(inverse(X1),X2)) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_39,c_0_23]) ).
cnf(c_0_111,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,X3)) = greatest_lower_bound(X2,greatest_lower_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_49]),c_0_36]),c_0_36]),c_0_94]) ).
cnf(c_0_112,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,greatest_lower_bound(X1,X2)))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_56,c_0_36]) ).
cnf(c_0_113,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(greatest_lower_bound(X1,X3),X2)) = least_upper_bound(greatest_lower_bound(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_81]),c_0_26]) ).
cnf(c_0_114,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X3,least_upper_bound(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_48]),c_0_46]),c_0_46]),c_0_96]) ).
cnf(c_0_115,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X2,X1)) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_97,c_0_63]) ).
cnf(c_0_116,plain,
least_upper_bound(X1,least_upper_bound(multiply(greatest_lower_bound(identity,X2),X1),X3)) = least_upper_bound(X1,X3),
inference(spm,[status(thm)],[c_0_98,c_0_26]) ).
cnf(c_0_117,plain,
multiply(greatest_lower_bound(X1,identity),least_upper_bound(identity,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_92]),c_0_100]) ).
cnf(c_0_118,plain,
least_upper_bound(X1,greatest_lower_bound(least_upper_bound(X2,X3),least_upper_bound(X2,X1))) = least_upper_bound(X2,X1),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_119,plain,
greatest_lower_bound(inverse(X1),inverse(greatest_lower_bound(X2,X1))) = inverse(X1),
inference(spm,[status(thm)],[c_0_103,c_0_22]) ).
cnf(c_0_120,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(X1,identity))) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_15]),c_0_23]),c_0_21]),c_0_17]),c_0_26]) ).
cnf(c_0_121,plain,
inverse(greatest_lower_bound(inverse(X1),X2)) = least_upper_bound(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_78]),c_0_106]),c_0_17]),c_0_21]) ).
cnf(c_0_122,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_107]) ).
cnf(c_0_123,plain,
inverse(least_upper_bound(inverse(X1),X2)) = greatest_lower_bound(X1,inverse(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_40]),c_0_17]),c_0_21]) ).
cnf(c_0_124,plain,
greatest_lower_bound(identity,multiply(X1,inverse(greatest_lower_bound(X2,X1)))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_103]),c_0_23]),c_0_22]) ).
cnf(c_0_125,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X3,greatest_lower_bound(X2,X1)))) = greatest_lower_bound(X2,X1),
inference(spm,[status(thm)],[c_0_111,c_0_112]) ).
cnf(c_0_126,plain,
greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3))) = least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X1,X3)),
inference(spm,[status(thm)],[c_0_113,c_0_49]) ).
cnf(c_0_127,plain,
least_upper_bound(X1,least_upper_bound(X2,X3)) = least_upper_bound(X3,least_upper_bound(X2,X1)),
inference(spm,[status(thm)],[c_0_83,c_0_114]) ).
cnf(c_0_128,plain,
least_upper_bound(greatest_lower_bound(X1,X2),least_upper_bound(greatest_lower_bound(X2,X1),X3)) = least_upper_bound(greatest_lower_bound(X1,X2),X3),
inference(spm,[status(thm)],[c_0_46,c_0_115]) ).
cnf(c_0_129,plain,
multiply(inverse(X1),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(multiply(inverse(X1),X2),X3),
inference(spm,[status(thm)],[c_0_39,c_0_18]) ).
cnf(c_0_130,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),least_upper_bound(X1,X3))) = least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),X3)),
inference(spm,[status(thm)],[c_0_116,c_0_30]) ).
cnf(c_0_131,plain,
multiply(greatest_lower_bound(identity,least_upper_bound(X1,X2)),least_upper_bound(X1,identity)) = greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_117,c_0_118]),c_0_36]),c_0_26]),c_0_56]),c_0_26]) ).
cnf(c_0_132,plain,
greatest_lower_bound(inverse(X1),inverse(least_upper_bound(X2,X1))) = inverse(least_upper_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_56]),c_0_26]) ).
cnf(c_0_133,plain,
least_upper_bound(X1,greatest_lower_bound(X2,greatest_lower_bound(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_80,c_0_26]) ).
cnf(c_0_134,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,least_upper_bound(X2,X1)))) = greatest_lower_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_120]),c_0_93]),c_0_26]) ).
cnf(c_0_135,plain,
inverse(greatest_lower_bound(X1,inverse(X2))) = least_upper_bound(X2,inverse(X1)),
inference(spm,[status(thm)],[c_0_121,c_0_26]) ).
cnf(c_0_136,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_16,c_0_122]) ).
cnf(c_0_137,plain,
greatest_lower_bound(inverse(X1),inverse(X2)) = inverse(least_upper_bound(X1,X2)),
inference(spm,[status(thm)],[c_0_123,c_0_22]) ).
cnf(c_0_138,plain,
greatest_lower_bound(identity,multiply(least_upper_bound(X1,X2),inverse(X1))) = identity,
inference(spm,[status(thm)],[c_0_124,c_0_48]) ).
cnf(c_0_139,plain,
greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X2,X3),greatest_lower_bound(X2,X1))) = greatest_lower_bound(X2,X1),
inference(spm,[status(thm)],[c_0_125,c_0_126]) ).
cnf(c_0_140,plain,
least_upper_bound(greatest_lower_bound(X1,X2),X3) = least_upper_bound(X3,greatest_lower_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_127,c_0_115]),c_0_128]) ).
cnf(c_0_141,plain,
multiply(X1,greatest_lower_bound(X2,least_upper_bound(multiply(inverse(X1),X3),X4))) = greatest_lower_bound(multiply(X1,X2),least_upper_bound(X3,multiply(X1,X4))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_129,c_0_91]),c_0_22]),c_0_22]) ).
cnf(c_0_142,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,identity)) = least_upper_bound(X1,greatest_lower_bound(identity,least_upper_bound(X1,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_131]),c_0_102]),c_0_21]) ).
cnf(c_0_143,plain,
multiply(X1,least_upper_bound(multiply(inverse(X1),X2),X3)) = least_upper_bound(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_144,plain,
greatest_lower_bound(identity,multiply(inverse(X1),least_upper_bound(X2,X1))) = identity,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_132]),c_0_16]) ).
cnf(c_0_145,plain,
greatest_lower_bound(X1,inverse(greatest_lower_bound(identity,X1))) = greatest_lower_bound(identity,X1),
inference(spm,[status(thm)],[c_0_120,c_0_26]) ).
cnf(c_0_146,plain,
multiply(X1,multiply(least_upper_bound(X2,inverse(X1)),X3)) = multiply(least_upper_bound(identity,multiply(X1,X2)),X3),
inference(spm,[status(thm)],[c_0_15,c_0_45]) ).
cnf(c_0_147,plain,
multiply(least_upper_bound(identity,inverse(X1)),inverse(least_upper_bound(X1,identity))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_53]),c_0_22]) ).
cnf(c_0_148,plain,
least_upper_bound(X1,greatest_lower_bound(X2,multiply(greatest_lower_bound(X3,identity),X1))) = X1,
inference(spm,[status(thm)],[c_0_133,c_0_29]) ).
cnf(c_0_149,plain,
multiply(X1,least_upper_bound(inverse(X1),X2)) = least_upper_bound(identity,multiply(X1,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_23]) ).
cnf(c_0_150,plain,
least_upper_bound(X1,greatest_lower_bound(identity,least_upper_bound(X2,inverse(X1)))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_134]),c_0_26]),c_0_135]),c_0_136]),c_0_22]) ).
cnf(c_0_151,plain,
inverse(greatest_lower_bound(identity,multiply(X1,inverse(X2)))) = least_upper_bound(identity,multiply(X2,inverse(X1))),
inference(spm,[status(thm)],[c_0_78,c_0_33]) ).
cnf(c_0_152,plain,
multiply(X1,inverse(least_upper_bound(X1,X2))) = greatest_lower_bound(identity,multiply(X1,inverse(X2))),
inference(spm,[status(thm)],[c_0_110,c_0_137]) ).
cnf(c_0_153,plain,
greatest_lower_bound(X1,greatest_lower_bound(X1,X2)) = greatest_lower_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_49]),c_0_26]) ).
cnf(c_0_154,plain,
least_upper_bound(identity,multiply(least_upper_bound(X1,X2),inverse(X1))) = multiply(least_upper_bound(X1,X2),inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_138]),c_0_31]) ).
cnf(c_0_155,plain,
greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X2,X3))) = greatest_lower_bound(X2,X1),
inference(spm,[status(thm)],[c_0_139,c_0_140]) ).
cnf(c_0_156,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,multiply(X2,X3))) = least_upper_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,multiply(X2,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_141,c_0_142]),c_0_143]),c_0_141]),c_0_21]),c_0_143]),c_0_21]),c_0_26]) ).
cnf(c_0_157,plain,
inverse(greatest_lower_bound(identity,multiply(inverse(X1),X2))) = least_upper_bound(identity,multiply(inverse(X2),X1)),
inference(spm,[status(thm)],[c_0_78,c_0_44]) ).
cnf(c_0_158,plain,
multiply(inverse(least_upper_bound(X1,X2)),X2) = greatest_lower_bound(identity,multiply(inverse(X1),X2)),
inference(spm,[status(thm)],[c_0_35,c_0_137]) ).
cnf(c_0_159,plain,
least_upper_bound(identity,multiply(inverse(X1),least_upper_bound(X2,X1))) = multiply(inverse(X1),least_upper_bound(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_144]),c_0_31]) ).
cnf(c_0_160,plain,
least_upper_bound(X1,greatest_lower_bound(identity,inverse(X1))) = least_upper_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_145]),c_0_92]),c_0_22]) ).
cnf(c_0_161,plain,
least_upper_bound(X1,least_upper_bound(X2,greatest_lower_bound(X1,X3))) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_133,c_0_74]),c_0_46]) ).
cnf(c_0_162,plain,
greatest_lower_bound(inverse(X1),inverse(multiply(X2,X1))) = multiply(inverse(X1),greatest_lower_bound(identity,inverse(X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_38]),c_0_26]) ).
cnf(c_0_163,plain,
multiply(least_upper_bound(identity,X1),inverse(least_upper_bound(X1,identity))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_147]),c_0_23]),c_0_21]) ).
cnf(c_0_164,plain,
greatest_lower_bound(identity,inverse(least_upper_bound(identity,X1))) = inverse(least_upper_bound(identity,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_48]),c_0_21]) ).
cnf(c_0_165,plain,
multiply(least_upper_bound(X1,identity),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_23]),c_0_31]) ).
cnf(c_0_166,plain,
least_upper_bound(X1,greatest_lower_bound(X2,multiply(greatest_lower_bound(identity,X3),X1))) = X1,
inference(spm,[status(thm)],[c_0_148,c_0_26]) ).
cnf(c_0_167,plain,
least_upper_bound(identity,multiply(X1,greatest_lower_bound(identity,least_upper_bound(X2,X1)))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_31]),c_0_78]),c_0_79]),c_0_135]),c_0_136]),c_0_22]) ).
cnf(c_0_168,plain,
least_upper_bound(multiply(X1,X2),greatest_lower_bound(X3,multiply(X1,greatest_lower_bound(X2,X4)))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_133,c_0_39]) ).
cnf(c_0_169,plain,
multiply(least_upper_bound(X1,X2),inverse(X1)) = least_upper_bound(identity,multiply(X2,inverse(X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_152]),c_0_153]),c_0_151]),c_0_154]) ).
cnf(c_0_170,plain,
greatest_lower_bound(X1,least_upper_bound(X2,greatest_lower_bound(X1,least_upper_bound(X2,X3)))) = greatest_lower_bound(least_upper_bound(X2,X3),X1),
inference(spm,[status(thm)],[c_0_155,c_0_118]) ).
cnf(c_0_171,plain,
greatest_lower_bound(least_upper_bound(X1,X2),least_upper_bound(X1,X3)) = least_upper_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))),
inference(spm,[status(thm)],[c_0_156,c_0_28]) ).
cnf(c_0_172,plain,
least_upper_bound(X1,least_upper_bound(X1,X2)) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_48]),c_0_31]) ).
cnf(c_0_173,plain,
multiply(inverse(X1),least_upper_bound(X2,X1)) = least_upper_bound(identity,multiply(inverse(X1),X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_157,c_0_158]),c_0_153]),c_0_157]),c_0_159]) ).
cnf(c_0_174,plain,
least_upper_bound(X1,greatest_lower_bound(identity,inverse(greatest_lower_bound(X1,X2)))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_81,c_0_160]),c_0_161]) ).
cnf(c_0_175,plain,
multiply(least_upper_bound(X1,identity),inverse(least_upper_bound(identity,X1))) = identity,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_162,c_0_163]),c_0_22]),c_0_136]),c_0_26]),c_0_56]),c_0_22]),c_0_164]) ).
cnf(c_0_176,plain,
multiply(greatest_lower_bound(inverse(X1),X2),X1) = greatest_lower_bound(identity,multiply(X2,X1)),
inference(spm,[status(thm)],[c_0_25,c_0_16]) ).
cnf(c_0_177,plain,
multiply(least_upper_bound(identity,X1),inverse(X1)) = least_upper_bound(identity,inverse(X1)),
inference(spm,[status(thm)],[c_0_165,c_0_31]) ).
cnf(c_0_178,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),greatest_lower_bound(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_166,c_0_39]) ).
cnf(c_0_179,plain,
least_upper_bound(identity,greatest_lower_bound(X1,least_upper_bound(X2,multiply(X1,X1)))) = least_upper_bound(X1,identity),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_167,c_0_141]),c_0_21]) ).
cnf(c_0_180,plain,
least_upper_bound(multiply(X1,X2),multiply(greatest_lower_bound(X3,X1),greatest_lower_bound(X2,X4))) = multiply(X1,X2),
inference(spm,[status(thm)],[c_0_168,c_0_25]) ).
cnf(c_0_181,plain,
multiply(least_upper_bound(X1,greatest_lower_bound(multiply(X2,X1),X3)),inverse(X1)) = least_upper_bound(identity,greatest_lower_bound(X2,multiply(X3,inverse(X1)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_90]),c_0_22]) ).
cnf(c_0_182,plain,
greatest_lower_bound(multiply(X1,least_upper_bound(identity,X1)),multiply(X2,X1)) = multiply(greatest_lower_bound(least_upper_bound(identity,X1),X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_82]) ).
cnf(c_0_183,plain,
least_upper_bound(X1,greatest_lower_bound(least_upper_bound(X1,X2),X3)) = least_upper_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_171]),c_0_171]),c_0_172]),c_0_170]),c_0_171]) ).
cnf(c_0_184,plain,
least_upper_bound(identity,multiply(least_upper_bound(identity,greatest_lower_bound(X1,X2)),X1)) = multiply(least_upper_bound(identity,greatest_lower_bound(X1,X2)),least_upper_bound(X1,identity)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_173,c_0_174]),c_0_135]),c_0_136]),c_0_31]),c_0_135]),c_0_136]),c_0_31]) ).
cnf(c_0_185,plain,
multiply(least_upper_bound(X1,identity),greatest_lower_bound(identity,inverse(X1))) = identity,
inference(rw,[status(thm)],[c_0_175,c_0_109]) ).
cnf(c_0_186,plain,
multiply(X1,greatest_lower_bound(X2,inverse(X1))) = greatest_lower_bound(identity,multiply(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_23]),c_0_26]) ).
cnf(c_0_187,plain,
greatest_lower_bound(X1,multiply(X2,multiply(X3,X1))) = multiply(greatest_lower_bound(identity,multiply(X2,X3)),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_15]),c_0_26]) ).
cnf(c_0_188,plain,
multiply(inverse(least_upper_bound(X1,X2)),X1) = greatest_lower_bound(identity,multiply(inverse(X2),X1)),
inference(spm,[status(thm)],[c_0_176,c_0_137]) ).
cnf(c_0_189,plain,
inverse(least_upper_bound(X1,identity)) = greatest_lower_bound(identity,inverse(X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_59]),c_0_17]),c_0_67]),c_0_17]),c_0_109]),c_0_153]) ).
cnf(c_0_190,plain,
multiply(least_upper_bound(X1,inverse(multiply(X2,X3))),X2) = least_upper_bound(multiply(X1,X2),inverse(X3)),
inference(spm,[status(thm)],[c_0_61,c_0_32]) ).
cnf(c_0_191,plain,
multiply(least_upper_bound(identity,X1),inverse(X1)) = inverse(greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[c_0_177,c_0_78]) ).
cnf(c_0_192,plain,
least_upper_bound(X1,least_upper_bound(X2,multiply(greatest_lower_bound(identity,X3),X1))) = least_upper_bound(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_178,c_0_48]),c_0_46]) ).
cnf(c_0_193,plain,
least_upper_bound(identity,greatest_lower_bound(X1,multiply(X2,greatest_lower_bound(X1,identity)))) = least_upper_bound(identity,greatest_lower_bound(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_179,c_0_180]),c_0_36]),c_0_47]),c_0_31]) ).
cnf(c_0_194,plain,
least_upper_bound(identity,greatest_lower_bound(X1,multiply(X2,greatest_lower_bound(identity,X1)))) = least_upper_bound(identity,greatest_lower_bound(X1,least_upper_bound(identity,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_181,c_0_182]),c_0_46]),c_0_66]),c_0_31]),c_0_183]),c_0_184]),c_0_109]),c_0_15]),c_0_185]),c_0_21]),c_0_109]),c_0_15]),c_0_186]),c_0_21]) ).
cnf(c_0_195,plain,
multiply(greatest_lower_bound(identity,multiply(X1,X2)),X1) = multiply(X1,greatest_lower_bound(identity,multiply(X2,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_187]),c_0_26]) ).
cnf(c_0_196,plain,
greatest_lower_bound(identity,multiply(least_upper_bound(identity,greatest_lower_bound(X1,X2)),X1)) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_174]),c_0_189]),c_0_35]),c_0_17]),c_0_135]),c_0_136]),c_0_31]) ).
cnf(c_0_197,plain,
greatest_lower_bound(identity,multiply(X1,least_upper_bound(identity,greatest_lower_bound(X1,X2)))) = greatest_lower_bound(identity,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_152,c_0_174]),c_0_189]),c_0_186]),c_0_21]),c_0_135]),c_0_136]),c_0_31]) ).
cnf(c_0_198,plain,
multiply(least_upper_bound(X1,greatest_lower_bound(identity,X2)),least_upper_bound(identity,X2)) = least_upper_bound(X2,multiply(X1,least_upper_bound(identity,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_190,c_0_191]),c_0_22]),c_0_22]),c_0_31]) ).
cnf(c_0_199,plain,
least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),least_upper_bound(X3,X1))) = least_upper_bound(X1,multiply(greatest_lower_bound(identity,X2),X3)),
inference(spm,[status(thm)],[c_0_192,c_0_30]) ).
cnf(c_0_200,plain,
multiply(least_upper_bound(X1,X2),greatest_lower_bound(identity,multiply(inverse(X1),X2))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_158]),c_0_22]) ).
cnf(c_0_201,plain,
least_upper_bound(identity,greatest_lower_bound(X1,least_upper_bound(identity,X2))) = least_upper_bound(identity,greatest_lower_bound(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_193,c_0_26]),c_0_194]) ).
cnf(c_0_202,plain,
greatest_lower_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))) = greatest_lower_bound(X1,X2),
inference(spm,[status(thm)],[c_0_74,c_0_26]) ).
cnf(c_0_203,plain,
multiply(least_upper_bound(identity,greatest_lower_bound(X1,X2)),greatest_lower_bound(identity,X1)) = multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,greatest_lower_bound(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_195,c_0_196]),c_0_197]) ).
cnf(c_0_204,plain,
multiply(greatest_lower_bound(identity,X1),least_upper_bound(identity,greatest_lower_bound(X1,X2))) = least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(identity,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_198,c_0_97]),c_0_199]),c_0_21]) ).
cnf(c_0_205,plain,
multiply(X1,least_upper_bound(X2,greatest_lower_bound(X3,multiply(inverse(X1),X4)))) = least_upper_bound(multiply(X1,X2),greatest_lower_bound(multiply(X1,X3),X4)),
inference(spm,[status(thm)],[c_0_30,c_0_68]) ).
cnf(c_0_206,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(identity,X1)) = greatest_lower_bound(X1,least_upper_bound(identity,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_200,c_0_201]),c_0_136]),c_0_17]),c_0_202]),c_0_203]),c_0_204]) ).
cnf(c_0_207,plain,
multiply(X1,greatest_lower_bound(multiply(inverse(X1),X2),X3)) = greatest_lower_bound(X2,multiply(X1,X3)),
inference(spm,[status(thm)],[c_0_39,c_0_28]) ).
cnf(c_0_208,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X2,multiply(X1,X3))) = greatest_lower_bound(X2,multiply(X1,least_upper_bound(identity,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_205,c_0_206]),c_0_207]),c_0_207]),c_0_21]),c_0_31]) ).
cnf(c_0_209,plain,
multiply(X1,least_upper_bound(X2,multiply(inverse(X1),X3))) = least_upper_bound(multiply(X1,X2),X3),
inference(spm,[status(thm)],[c_0_30,c_0_28]) ).
cnf(c_0_210,negated_conjecture,
least_upper_bound(a,greatest_lower_bound(b,c)) != greatest_lower_bound(least_upper_bound(a,b),least_upper_bound(a,c)),
prove_distrnu ).
cnf(c_0_211,plain,
least_upper_bound(greatest_lower_bound(X1,X2),greatest_lower_bound(X2,X3)) = greatest_lower_bound(X2,least_upper_bound(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_208,c_0_28]),c_0_209]),c_0_21]) ).
cnf(c_0_212,negated_conjecture,
least_upper_bound(a,greatest_lower_bound(b,least_upper_bound(a,c))) != least_upper_bound(a,greatest_lower_bound(b,c)),
inference(rw,[status(thm)],[c_0_210,c_0_171]) ).
cnf(c_0_213,plain,
least_upper_bound(X1,greatest_lower_bound(X2,least_upper_bound(X1,X3))) = least_upper_bound(X1,greatest_lower_bound(X2,X3)),
inference(spm,[status(thm)],[c_0_81,c_0_211]) ).
cnf(c_0_214,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_212,c_0_213])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : GRP164-1 : TPTP v8.1.2. Bugfixed v1.2.1.
% 0.10/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n013.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 : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Tue Oct 3 02:24:59 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/0.44 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.TowBNUEloX/E---3.1_26949.p
% 1288.33/177.48 # Version: 3.1pre001
% 1288.33/177.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1288.33/177.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1288.33/177.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1288.33/177.48 # Starting new_bool_3 with 300s (1) cores
% 1288.33/177.48 # Starting new_bool_1 with 300s (1) cores
% 1288.33/177.48 # Starting sh5l with 300s (1) cores
% 1288.33/177.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27027 completed with status 0
% 1288.33/177.48 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 1288.33/177.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1288.33/177.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1288.33/177.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1288.33/177.48 # No SInE strategy applied
% 1288.33/177.48 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1288.33/177.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1288.33/177.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1288.33/177.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 1288.33/177.48 # Starting new_bool_3 with 136s (1) cores
% 1288.33/177.48 # Starting new_bool_1 with 136s (1) cores
% 1288.33/177.48 # Starting sh5l with 136s (1) cores
% 1288.33/177.48 # sh5l with pid 27038 completed with status 7
% 1288.33/177.48 # Starting SAT001_MinMin_p005000_rr_RG with 130s (1) cores
% 1288.33/177.48 # new_bool_1 with pid 27036 completed with status 7
% 1288.33/177.48 # new_bool_3 with pid 27035 completed with status 7
% 1288.33/177.48 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 27033 completed with status 7
% 1288.33/177.48 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 27031 completed with status 0
% 1288.33/177.48 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 1288.33/177.48 # Preprocessing class: FSMSSMSSSSSNFFN.
% 1288.33/177.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1288.33/177.48 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 1288.33/177.48 # No SInE strategy applied
% 1288.33/177.48 # Search class: FUUPM-FFSF21-SFFFFFNN
% 1288.33/177.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1288.33/177.48 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 811s (1) cores
% 1288.33/177.48 # Preprocessing time : 0.001 s
% 1288.33/177.48 # Presaturation interreduction done
% 1288.33/177.48
% 1288.33/177.48 # Proof found!
% 1288.33/177.48 # SZS status Unsatisfiable
% 1288.33/177.48 # SZS output start CNFRefutation
% See solution above
% 1288.33/177.48 # Parsed axioms : 16
% 1288.33/177.48 # Removed by relevancy pruning/SinE : 0
% 1288.33/177.48 # Initial clauses : 16
% 1288.33/177.48 # Removed in clause preprocessing : 0
% 1288.33/177.48 # Initial clauses in saturation : 16
% 1288.33/177.48 # Processed clauses : 261664
% 1288.33/177.48 # ...of these trivial : 119004
% 1288.33/177.48 # ...subsumed : 137767
% 1288.33/177.48 # ...remaining for further processing : 4893
% 1288.33/177.48 # Other redundant clauses eliminated : 0
% 1288.33/177.48 # Clauses deleted for lack of memory : 329316
% 1288.33/177.48 # Backward-subsumed : 9
% 1288.33/177.48 # Backward-rewritten : 741
% 1288.33/177.48 # Generated clauses : 8143873
% 1288.33/177.48 # ...of the previous two non-redundant : 5294222
% 1288.33/177.48 # ...aggressively subsumed : 0
% 1288.33/177.48 # Contextual simplify-reflections : 0
% 1288.33/177.48 # Paramodulations : 8143873
% 1288.33/177.48 # Factorizations : 0
% 1288.33/177.48 # NegExts : 0
% 1288.33/177.48 # Equation resolutions : 0
% 1288.33/177.48 # Total rewrite steps : 24208419
% 1288.33/177.48 # Propositional unsat checks : 0
% 1288.33/177.48 # Propositional check models : 0
% 1288.33/177.48 # Propositional check unsatisfiable : 0
% 1288.33/177.48 # Propositional clauses : 0
% 1288.33/177.48 # Propositional clauses after purity: 0
% 1288.33/177.48 # Propositional unsat core size : 0
% 1288.33/177.48 # Propositional preprocessing time : 0.000
% 1288.33/177.48 # Propositional encoding time : 0.000
% 1288.33/177.48 # Propositional solver time : 0.000
% 1288.33/177.48 # Success case prop preproc time : 0.000
% 1288.33/177.48 # Success case prop encoding time : 0.000
% 1288.33/177.48 # Success case prop solver time : 0.000
% 1288.33/177.48 # Current number of processed clauses : 4127
% 1288.33/177.48 # Positive orientable unit clauses : 4050
% 1288.33/177.48 # Positive unorientable unit clauses: 77
% 1288.33/177.48 # Negative unit clauses : 0
% 1288.33/177.48 # Non-unit-clauses : 0
% 1288.33/177.48 # Current number of unprocessed clauses: 1406268
% 1288.33/177.48 # ...number of literals in the above : 1406268
% 1288.33/177.48 # Current number of archived formulas : 0
% 1288.33/177.48 # Current number of archived clauses : 766
% 1288.33/177.48 # Clause-clause subsumption calls (NU) : 0
% 1288.33/177.48 # Rec. Clause-clause subsumption calls : 0
% 1288.33/177.48 # Non-unit clause-clause subsumptions : 0
% 1288.33/177.48 # Unit Clause-clause subsumption calls : 6490
% 1288.33/177.48 # Rewrite failures with RHS unbound : 0
% 1288.33/177.48 # BW rewrite match attempts : 119124
% 1288.33/177.48 # BW rewrite match successes : 1876
% 1288.33/177.48 # Condensation attempts : 0
% 1288.33/177.48 # Condensation successes : 0
% 1288.33/177.48 # Termbank termtop insertions : 153742004
% 1288.33/177.48
% 1288.33/177.48 # -------------------------------------------------
% 1288.33/177.48 # User time : 728.501 s
% 1288.33/177.48 # System time : 4.313 s
% 1288.33/177.48 # Total time : 732.815 s
% 1288.33/177.48 # Maximum resident set size: 1576 pages
% 1288.33/177.48
% 1288.33/177.48 # -------------------------------------------------
% 1288.33/177.48 # User time : 765.106 s
% 1288.33/177.48 # System time : 5.590 s
% 1288.33/177.48 # Total time : 770.696 s
% 1288.33/177.48 # Maximum resident set size: 1720 pages
% 1288.33/177.48 % E---3.1 exiting
% 1288.33/177.48 % E---3.1 exiting
%------------------------------------------------------------------------------