%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP193-1 : 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 : n009.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:14 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.49s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP193-1 : 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.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 20:05:43 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.15/0.49 % Refutation found
% 0.15/0.49 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.15/0.49 % SZS output start CNFRefutation for theBenchmark
% 0.15/0.49 fof(f1,axiom,(
% 0.15/0.49 (![X]: (multiply(identity,X) = X ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f4,axiom,(
% 0.15/0.49 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f5,axiom,(
% 0.15/0.49 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f6,axiom,(
% 0.15/0.49 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f10,axiom,(
% 0.15/0.49 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f11,axiom,(
% 0.15/0.49 (![X,Y]: (greatest_lower_bound(X,least_upper_bound(X,Y)) = X ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f15,axiom,(
% 0.15/0.49 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f19,hypothesis,(
% 0.15/0.49 greatest_lower_bound(a,b) = identity ),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f20,hypothesis,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))) = multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)) ),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f21,negated_conjecture,(
% 0.15/0.49 greatest_lower_bound(a,multiply(b,c)) != greatest_lower_bound(a,c) ),
% 0.15/0.49 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.15/0.49 fof(f22,plain,(
% 0.15/0.49 ![X0]: (multiply(identity,X0)=X0)),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f1])).
% 0.15/0.49 fof(f25,plain,(
% 0.15/0.49 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f4])).
% 0.15/0.49 fof(f26,plain,(
% 0.15/0.49 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f5])).
% 0.15/0.49 fof(f27,plain,(
% 0.15/0.49 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f6])).
% 0.15/0.49 fof(f31,plain,(
% 0.15/0.49 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f10])).
% 0.15/0.49 fof(f32,plain,(
% 0.15/0.49 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X0,X1))=X0)),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f11])).
% 0.15/0.49 fof(f36,plain,(
% 0.15/0.49 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f15])).
% 0.15/0.49 fof(f40,plain,(
% 0.15/0.49 greatest_lower_bound(a,b)=identity),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f19])).
% 0.15/0.49 fof(f41,plain,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c)))=multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f20])).
% 0.15/0.49 fof(f42,plain,(
% 0.15/0.49 ~greatest_lower_bound(a,multiply(b,c))=greatest_lower_bound(a,c)),
% 0.15/0.49 inference(cnf_transformation,[status(thm)],[f21])).
% 0.15/0.49 fof(f47,plain,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),multiply(identity,greatest_lower_bound(a,c)))=multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
% 0.15/0.49 inference(forward_demodulation,[status(thm)],[f40,f41])).
% 0.15/0.49 fof(f48,plain,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c))=multiply(greatest_lower_bound(a,b),greatest_lower_bound(a,c))),
% 0.15/0.49 inference(forward_demodulation,[status(thm)],[f22,f47])).
% 0.15/0.49 fof(f49,plain,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c))=multiply(identity,greatest_lower_bound(a,c))),
% 0.15/0.49 inference(forward_demodulation,[status(thm)],[f40,f48])).
% 0.15/0.49 fof(f50,plain,(
% 0.15/0.49 least_upper_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c))=greatest_lower_bound(a,c)),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f22,f49])).
% 0.15/0.51 fof(f69,plain,(
% 0.15/0.51 ![X0,X1]: (greatest_lower_bound(X0,least_upper_bound(X1,X0))=X0)),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f26,f32])).
% 0.15/0.51 fof(f110,plain,(
% 0.15/0.51 ![X0,X1]: (greatest_lower_bound(greatest_lower_bound(X0,X1),X0)=greatest_lower_bound(X0,X1))),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f31,f69])).
% 0.15/0.51 fof(f121,plain,(
% 0.15/0.51 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X0))=greatest_lower_bound(X0,X1))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f27,f110])).
% 0.15/0.51 fof(f335,plain,(
% 0.15/0.51 greatest_lower_bound(b,identity)=greatest_lower_bound(b,a)),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f40,f121])).
% 0.15/0.51 fof(f349,plain,(
% 0.15/0.51 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(greatest_lower_bound(X1,X0),X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f121,f27])).
% 0.15/0.51 fof(f364,plain,(
% 0.15/0.51 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X2)))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f27,f349])).
% 0.15/0.51 fof(f366,plain,(
% 0.15/0.51 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X2)))=greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f27,f364])).
% 0.15/0.51 fof(f862,plain,(
% 0.15/0.51 ![X0,X1]: (multiply(greatest_lower_bound(X0,identity),X1)=greatest_lower_bound(multiply(X0,X1),X1))),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f22,f36])).
% 0.15/0.51 fof(f1050,plain,(
% 0.15/0.51 greatest_lower_bound(greatest_lower_bound(a,multiply(b,c)),greatest_lower_bound(a,c))=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f50,f32])).
% 0.15/0.51 fof(f1058,plain,(
% 0.15/0.51 greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),greatest_lower_bound(a,c)))=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f27,f1050])).
% 0.15/0.51 fof(f1059,plain,(
% 0.15/0.51 greatest_lower_bound(a,greatest_lower_bound(multiply(b,c),c))=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f366,f1058])).
% 0.15/0.51 fof(f1060,plain,(
% 0.15/0.51 greatest_lower_bound(a,multiply(greatest_lower_bound(b,identity),c))=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f862,f1059])).
% 0.15/0.51 fof(f1061,plain,(
% 0.15/0.51 greatest_lower_bound(b,identity)=greatest_lower_bound(a,b)),
% 0.15/0.51 inference(paramodulation,[status(thm)],[f25,f335])).
% 0.15/0.51 fof(f1073,plain,(
% 0.15/0.51 greatest_lower_bound(a,multiply(identity,c))=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(backward_demodulation,[status(thm)],[f1074,f1060])).
% 0.15/0.51 fof(f1074,plain,(
% 0.15/0.51 greatest_lower_bound(b,identity)=identity),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f40,f1061])).
% 0.15/0.51 fof(f1083,plain,(
% 0.15/0.51 greatest_lower_bound(a,c)=greatest_lower_bound(a,multiply(b,c))),
% 0.15/0.51 inference(forward_demodulation,[status(thm)],[f22,f1073])).
% 0.15/0.51 fof(f1084,plain,(
% 0.15/0.51 $false),
% 0.15/0.51 inference(forward_subsumption_resolution,[status(thm)],[f1083,f42])).
% 0.15/0.51 % SZS output end CNFRefutation for theBenchmark.p
% 0.15/0.52 % Elapsed time: 0.142113 seconds
% 0.15/0.52 % CPU time: 0.721652 seconds
% 0.15/0.52 % Total memory used: 14.891 MB
% 0.15/0.52 % Net memory used: 14.746 MB
%------------------------------------------------------------------------------