%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP181-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 12:36:12 PM UTC 2026
% Result : Unsatisfiable 16.03s 2.44s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP181-4 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n004.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:04:20 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 16.03/2.44 % Refutation found
% 16.03/2.44 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 16.03/2.44 % SZS output start CNFRefutation for theBenchmark
% 16.03/2.44 fof(f1,axiom,(
% 16.03/2.44 (![X]: (multiply(identity,X) = X ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f2,axiom,(
% 16.03/2.44 (![X]: (multiply(inverse(X),X) = identity ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f3,axiom,(
% 16.03/2.44 (![X,Y,Z]: (multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f4,axiom,(
% 16.03/2.44 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f5,axiom,(
% 16.03/2.44 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f6,axiom,(
% 16.03/2.44 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f7,axiom,(
% 16.03/2.44 (![X,Y,Z]: (least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f8,axiom,(
% 16.03/2.44 (![X]: (least_upper_bound(X,X) = X ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f11,axiom,(
% 16.03/2.44 (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f12,axiom,(
% 16.03/2.44 (![X,Y,Z]: (multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f13,axiom,(
% 16.03/2.44 (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f16,hypothesis,(
% 16.03/2.44 inverse(identity) = identity ),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f17,hypothesis,(
% 16.03/2.44 (![X]: (inverse(inverse(X)) = X ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f18,hypothesis,(
% 16.03/2.44 (![X,Y]: (inverse(multiply(X,Y)) = multiply(inverse(Y),inverse(X)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f19,hypothesis,(
% 16.03/2.44 greatest_lower_bound(a,c) = greatest_lower_bound(b,c) ),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f20,hypothesis,(
% 16.03/2.44 least_upper_bound(a,c) = least_upper_bound(b,c) ),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f21,hypothesis,(
% 16.03/2.44 (![X,Y]: (inverse(greatest_lower_bound(X,Y)) = least_upper_bound(inverse(X),inverse(Y)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f22,hypothesis,(
% 16.03/2.44 (![X,Y]: (inverse(least_upper_bound(X,Y)) = greatest_lower_bound(inverse(X),inverse(Y)) ))),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f23,negated_conjecture,(
% 16.03/2.44 a != b ),
% 16.03/2.44 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 16.03/2.44 fof(f24,plain,(
% 16.03/2.44 ![X0]: (multiply(identity,X0)=X0)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f1])).
% 16.03/2.44 fof(f25,plain,(
% 16.03/2.44 ![X0]: (multiply(inverse(X0),X0)=identity)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f2])).
% 16.03/2.44 fof(f26,plain,(
% 16.03/2.44 ![X0,X1,X2]: (multiply(multiply(X0,X1),X2)=multiply(X0,multiply(X1,X2)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f3])).
% 16.03/2.44 fof(f27,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f4])).
% 16.03/2.44 fof(f28,plain,(
% 16.03/2.44 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f5])).
% 16.03/2.44 fof(f29,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f6])).
% 16.03/2.44 fof(f30,plain,(
% 16.03/2.44 ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(least_upper_bound(X0,X1),X2))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f7])).
% 16.03/2.44 fof(f31,plain,(
% 16.03/2.44 ![X0]: (least_upper_bound(X0,X0)=X0)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f8])).
% 16.03/2.44 fof(f34,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f11])).
% 16.03/2.44 fof(f35,plain,(
% 16.03/2.44 ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X1),multiply(X0,X2)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f12])).
% 16.03/2.44 fof(f36,plain,(
% 16.03/2.44 ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f13])).
% 16.03/2.44 fof(f39,plain,(
% 16.03/2.44 inverse(identity)=identity),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f16])).
% 16.03/2.44 fof(f40,plain,(
% 16.03/2.44 ![X0]: (inverse(inverse(X0))=X0)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f17])).
% 16.03/2.44 fof(f41,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(multiply(X0,X1))=multiply(inverse(X1),inverse(X0)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f18])).
% 16.03/2.44 fof(f42,plain,(
% 16.03/2.44 greatest_lower_bound(a,c)=greatest_lower_bound(b,c)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f19])).
% 16.03/2.44 fof(f43,plain,(
% 16.03/2.44 least_upper_bound(a,c)=least_upper_bound(b,c)),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f20])).
% 16.03/2.44 fof(f44,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(greatest_lower_bound(X0,X1))=least_upper_bound(inverse(X0),inverse(X1)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f21])).
% 16.03/2.44 fof(f45,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(least_upper_bound(X0,X1))=greatest_lower_bound(inverse(X0),inverse(X1)))),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f22])).
% 16.03/2.44 fof(f46,plain,(
% 16.03/2.44 ~a=b),
% 16.03/2.44 inference(cnf_transformation,[status(thm)],[f23])).
% 16.03/2.44 fof(f56,plain,(
% 16.03/2.44 ![X0]: (multiply(X0,inverse(X0))=identity)),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f40,f25])).
% 16.03/2.44 fof(f69,plain,(
% 16.03/2.44 ![X0,X1]: (multiply(identity,X0)=multiply(X1,multiply(inverse(X1),X0)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f56,f26])).
% 16.03/2.44 fof(f70,plain,(
% 16.03/2.44 ![X0,X1]: (X0=multiply(X1,multiply(inverse(X1),X0)))),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f24,f69])).
% 16.03/2.44 fof(f90,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f28,f34])).
% 16.03/2.44 fof(f92,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,least_upper_bound(greatest_lower_bound(X0,X1),X2)))=greatest_lower_bound(X0,X1))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f34,f29])).
% 16.03/2.44 fof(f93,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(X2,greatest_lower_bound(X0,X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f27,f29])).
% 16.03/2.44 fof(f113,plain,(
% 16.03/2.44 ![X0,X1,X2]: (least_upper_bound(X0,least_upper_bound(X1,X2))=least_upper_bound(X2,least_upper_bound(X0,X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f28,f30])).
% 16.03/2.44 fof(f122,plain,(
% 16.03/2.44 ![X0,X1]: (least_upper_bound(X0,least_upper_bound(X0,X1))=least_upper_bound(X0,X1))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f31,f30])).
% 16.03/2.44 fof(f214,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X2,X0)))=X0)),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f30,f90])).
% 16.03/2.44 fof(f359,plain,(
% 16.03/2.44 ![X0,X1,X2]: (multiply(X0,least_upper_bound(X1,X2))=least_upper_bound(multiply(X0,X2),multiply(X0,X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f28,f35])).
% 16.03/2.44 fof(f364,plain,(
% 16.03/2.44 ![X0,X1]: (multiply(inverse(X0),least_upper_bound(X0,X1))=least_upper_bound(identity,multiply(inverse(X0),X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f25,f35])).
% 16.03/2.44 fof(f400,plain,(
% 16.03/2.44 ![X0,X1]: (multiply(inverse(X0),greatest_lower_bound(X0,X1))=greatest_lower_bound(identity,multiply(inverse(X0),X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f25,f36])).
% 16.03/2.44 fof(f948,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(multiply(inverse(X0),X1))=multiply(inverse(X1),X0))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f40,f41])).
% 16.03/2.44 fof(f950,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(X0)=multiply(X1,inverse(multiply(X0,X1))))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f41,f70])).
% 16.03/2.44 fof(f976,plain,(
% 16.03/2.44 ![X0]: (inverse(greatest_lower_bound(identity,X0))=least_upper_bound(identity,inverse(X0)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f39,f44])).
% 16.03/2.44 fof(f1638,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,least_upper_bound(least_upper_bound(X1,X0),X2))=X0)),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f28,f214])).
% 16.03/2.44 fof(f1689,plain,(
% 16.03/2.44 ![X0,X1,X2]: (greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2)))=X0)),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f30,f1638])).
% 16.03/2.44 fof(f3030,plain,(
% 16.03/2.44 ![X0,X1,X2,X3]: (greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X1,least_upper_bound(X0,X2)),X3))=greatest_lower_bound(X3,X0))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f1689,f93])).
% 16.03/2.44 fof(f3032,plain,(
% 16.03/2.44 ![X0,X1,X2,X3]: (greatest_lower_bound(X0,greatest_lower_bound(least_upper_bound(X1,least_upper_bound(X0,X2)),least_upper_bound(X0,X3)))=greatest_lower_bound(X0,least_upper_bound(X1,least_upper_bound(X0,X2))))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f1689,f92])).
% 16.03/2.44 fof(f3057,plain,(
% 16.03/2.44 ![X0,X1,X2,X3]: (greatest_lower_bound(least_upper_bound(X0,X1),X0)=greatest_lower_bound(X0,least_upper_bound(X2,least_upper_bound(X0,X3))))),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f3030,f3032])).
% 16.03/2.44 fof(f3060,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(least_upper_bound(X0,X1),X0)=X0)),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f1689,f3057])).
% 16.03/2.44 fof(f3075,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(inverse(greatest_lower_bound(X0,X1)),inverse(X0))=inverse(X0))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f44,f3060])).
% 16.03/2.44 fof(f3101,plain,(
% 16.03/2.44 ![X0,X1]: (greatest_lower_bound(least_upper_bound(X0,X1),X1)=X1)),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f28,f3060])).
% 16.03/2.44 fof(f3139,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(least_upper_bound(greatest_lower_bound(X0,X1),X0))=inverse(X0))),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f45,f3075])).
% 16.03/2.44 fof(f3314,plain,(
% 16.03/2.44 ![X0,X1]: (inverse(inverse(X0))=least_upper_bound(greatest_lower_bound(X0,X1),X0))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f3139,f40])).
% 16.03/2.44 fof(f3349,plain,(
% 16.03/2.44 ![X0,X1]: (X0=least_upper_bound(greatest_lower_bound(X0,X1),X0))),
% 16.03/2.44 inference(forward_demodulation,[status(thm)],[f40,f3314])).
% 16.03/2.44 fof(f4814,plain,(
% 16.03/2.44 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,least_upper_bound(X0,X1)))),
% 16.03/2.44 inference(paramodulation,[status(thm)],[f3101,f3349])).
% 16.03/2.45 fof(f5697,plain,(
% 16.03/2.45 ![X0]: (least_upper_bound(X0,least_upper_bound(a,c))=least_upper_bound(c,least_upper_bound(X0,b)))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f43,f113])).
% 16.03/2.45 fof(f7503,plain,(
% 16.03/2.45 least_upper_bound(c,least_upper_bound(a,c))=least_upper_bound(c,b)),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f122,f5697])).
% 16.03/2.45 fof(f7592,plain,(
% 16.03/2.45 least_upper_bound(a,c)=least_upper_bound(c,b)),
% 16.03/2.45 inference(forward_demodulation,[status(thm)],[f4814,f7503])).
% 16.03/2.45 fof(f9120,plain,(
% 16.03/2.45 ![X0,X1]: (multiply(inverse(X0),least_upper_bound(X1,X0))=least_upper_bound(identity,multiply(inverse(X0),X1)))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f25,f359])).
% 16.03/2.45 fof(f9224,plain,(
% 16.03/2.45 multiply(inverse(c),least_upper_bound(a,c))=least_upper_bound(identity,multiply(inverse(c),b))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f7592,f364])).
% 16.03/2.45 fof(f9290,plain,(
% 16.03/2.45 least_upper_bound(identity,multiply(inverse(c),a))=least_upper_bound(identity,multiply(inverse(c),b))),
% 16.03/2.45 inference(forward_demodulation,[status(thm)],[f9120,f9224])).
% 16.03/2.45 fof(f11178,plain,(
% 16.03/2.45 ![X0,X1]: (inverse(greatest_lower_bound(identity,multiply(inverse(X0),X1)))=least_upper_bound(identity,multiply(inverse(X1),X0)))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f948,f976])).
% 16.03/2.45 fof(f11621,plain,(
% 16.03/2.45 multiply(inverse(b),greatest_lower_bound(a,c))=greatest_lower_bound(identity,multiply(inverse(b),c))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f42,f400])).
% 16.03/2.45 fof(f11649,plain,(
% 16.03/2.45 ![X0,X1]: (inverse(inverse(X0))=multiply(greatest_lower_bound(X0,X1),inverse(greatest_lower_bound(identity,multiply(inverse(X0),X1)))))),
% 16.03/2.45 inference(paramodulation,[status(thm)],[f400,f950])).
% 16.03/2.45 fof(f11749,plain,(
% 16.03/2.45 ![X0,X1]: (X0=multiply(greatest_lower_bound(X0,X1),inverse(greatest_lower_bound(identity,multiply(inverse(X0),X1)))))),
% 16.03/2.45 inference(forward_demodulation,[status(thm)],[f40,f11649])).
% 16.03/2.45 fof(f11750,plain,(
% 16.03/2.45 ![X0,X1]: (X0=multiply(greatest_lower_bound(X0,X1),least_upper_bound(identity,multiply(inverse(X1),X0))))),
% 16.03/2.45 inference(forward_demodulation,[status(thm)],[f11178,f11749])).
% 16.03/2.45 fof(f14975,plain,(
% 16.03/2.49 inverse(inverse(b))=multiply(greatest_lower_bound(a,c),inverse(greatest_lower_bound(identity,multiply(inverse(b),c))))),
% 16.03/2.49 inference(paramodulation,[status(thm)],[f11621,f950])).
% 16.03/2.49 fof(f15014,plain,(
% 16.03/2.49 b=multiply(greatest_lower_bound(a,c),inverse(greatest_lower_bound(identity,multiply(inverse(b),c))))),
% 16.03/2.49 inference(forward_demodulation,[status(thm)],[f40,f14975])).
% 16.03/2.49 fof(f15015,plain,(
% 16.03/2.49 b=multiply(greatest_lower_bound(a,c),least_upper_bound(identity,multiply(inverse(c),b)))),
% 16.03/2.49 inference(forward_demodulation,[status(thm)],[f11178,f15014])).
% 16.03/2.49 fof(f15016,plain,(
% 16.03/2.49 b=multiply(greatest_lower_bound(a,c),least_upper_bound(identity,multiply(inverse(c),a)))),
% 16.03/2.49 inference(forward_demodulation,[status(thm)],[f9290,f15015])).
% 16.03/2.49 fof(f15017,plain,(
% 16.03/2.49 b=a),
% 16.03/2.49 inference(forward_demodulation,[status(thm)],[f11750,f15016])).
% 16.03/2.49 fof(f15018,plain,(
% 16.03/2.49 $false),
% 16.03/2.49 inference(forward_subsumption_resolution,[status(thm)],[f15017,f46])).
% 16.03/2.49 % SZS output end CNFRefutation for theBenchmark.p
% 16.03/2.50 % Elapsed time: 2.120794 seconds
% 16.03/2.50 % CPU time: 16.655031 seconds
% 16.03/2.50 % Total memory used: 202.380 MB
% 16.03/2.50 % Net memory used: 198.309 MB
%------------------------------------------------------------------------------