%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP170-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n016.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:09 PM UTC 2026
% Result : Unsatisfiable 53.39s 13.82s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : GRP170-2 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.03 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.36 % Computer : n016.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:08:24 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.37 % Drodi V4.1.1
% 53.39/13.82 % Refutation found
% 53.39/13.82 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 53.39/13.82 % SZS output start CNFRefutation for theBenchmark
% 53.39/13.82 fof(f4,axiom,(
% 53.39/13.82 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f6,axiom,(
% 53.39/13.82 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f9,axiom,(
% 53.39/13.82 (![X]: (greatest_lower_bound(X,X) = X ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f10,axiom,(
% 53.39/13.82 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f13,axiom,(
% 53.39/13.82 (![X,Y,Z]: (multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)) ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f15,axiom,(
% 53.39/13.82 (![Y,Z,X]: (multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)) ))),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f16,hypothesis,(
% 53.39/13.82 greatest_lower_bound(a,b) = a ),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f17,hypothesis,(
% 53.39/13.82 greatest_lower_bound(c,d) = c ),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f18,negated_conjecture,(
% 53.39/13.82 greatest_lower_bound(multiply(a,c),multiply(b,d)) != multiply(a,c) ),
% 53.39/13.82 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 53.39/13.82 fof(f22,plain,(
% 53.39/13.82 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f4])).
% 53.39/13.82 fof(f24,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f6])).
% 53.39/13.82 fof(f27,plain,(
% 53.39/13.82 ![X0]: (greatest_lower_bound(X0,X0)=X0)),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f9])).
% 53.39/13.82 fof(f28,plain,(
% 53.39/13.82 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f10])).
% 53.39/13.82 fof(f31,plain,(
% 53.39/13.82 ![X0,X1,X2]: (multiply(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(multiply(X0,X1),multiply(X0,X2)))),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f13])).
% 53.39/13.82 fof(f33,plain,(
% 53.39/13.82 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X0,X2),multiply(X1,X2)))),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f15])).
% 53.39/13.82 fof(f34,plain,(
% 53.39/13.82 greatest_lower_bound(a,b)=a),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f16])).
% 53.39/13.82 fof(f35,plain,(
% 53.39/13.82 greatest_lower_bound(c,d)=c),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f17])).
% 53.39/13.82 fof(f36,plain,(
% 53.39/13.82 ~greatest_lower_bound(multiply(a,c),multiply(b,d))=multiply(a,c)),
% 53.39/13.82 inference(cnf_transformation,[status(thm)],[f18])).
% 53.39/13.82 fof(f37,definition,(
% 53.39/13.82 sF1_fnc=multiply(a,c)),
% 53.39/13.82 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 53.39/13.82 fof(f38,definition,(
% 53.39/13.82 sF2_fnc=multiply(b,d)),
% 53.39/13.82 introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition])).
% 53.39/13.82 fof(f39,definition,(
% 53.39/13.82 sF0_fnc=greatest_lower_bound(sF1_fnc,sF2_fnc)),
% 53.39/13.82 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 53.39/13.82 fof(f40,plain,(
% 53.39/13.82 ~sF0_fnc=sF1_fnc),
% 53.39/13.82 inference(definition_folding,[],[f36,f39,f38,f37])).
% 53.39/13.82 fof(f50,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(X2,greatest_lower_bound(X0,X1)))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f24])).
% 53.39/13.82 fof(f57,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X1,X0),X2))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f24])).
% 53.39/13.82 fof(f59,plain,(
% 53.39/13.82 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X0,X1))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f27,f24])).
% 53.39/13.82 fof(f71,plain,(
% 53.39/13.82 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X0))=greatest_lower_bound(X0,X1))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f59])).
% 53.39/13.82 fof(f104,plain,(
% 53.39/13.82 greatest_lower_bound(sF2_fnc,sF0_fnc)=greatest_lower_bound(sF2_fnc,sF1_fnc)),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f39,f71])).
% 53.39/13.82 fof(f130,plain,(
% 53.39/13.82 greatest_lower_bound(sF2_fnc,sF0_fnc)=greatest_lower_bound(sF1_fnc,sF2_fnc)),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f104])).
% 53.39/13.82 fof(f133,plain,(
% 53.39/13.82 greatest_lower_bound(sF2_fnc,greatest_lower_bound(sF2_fnc,sF0_fnc))=greatest_lower_bound(sF2_fnc,sF1_fnc)),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f104,f59])).
% 53.39/13.82 fof(f138,plain,(
% 53.39/13.82 greatest_lower_bound(sF2_fnc,sF0_fnc)=sF0_fnc),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f39,f130])).
% 53.39/13.82 fof(f142,plain,(
% 53.39/13.82 greatest_lower_bound(sF2_fnc,sF0_fnc)=greatest_lower_bound(sF2_fnc,sF1_fnc)),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f59,f133])).
% 53.39/13.82 fof(f143,plain,(
% 53.39/13.82 sF0_fnc=greatest_lower_bound(sF2_fnc,sF1_fnc)),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f138,f142])).
% 53.39/13.82 fof(f176,plain,(
% 53.39/13.82 ![X0]: (multiply(b,greatest_lower_bound(X0,d))=greatest_lower_bound(multiply(b,X0),sF2_fnc))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f38,f31])).
% 53.39/13.82 fof(f195,plain,(
% 53.39/13.82 ![X0,X1,X2]: (multiply(greatest_lower_bound(X0,X1),X2)=greatest_lower_bound(multiply(X1,X2),multiply(X0,X2)))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f33])).
% 53.39/13.82 fof(f363,plain,(
% 53.39/13.82 ![X0,X1,X2]: (least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,greatest_lower_bound(X1,X2)))=greatest_lower_bound(X0,X1))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f24,f28])).
% 53.39/13.82 fof(f372,plain,(
% 53.39/13.82 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X1,X0))=X0)),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f28])).
% 53.39/13.82 fof(f1635,plain,(
% 53.39/13.82 ![X0,X1]: (greatest_lower_bound(X0,greatest_lower_bound(X0,X1))=greatest_lower_bound(X1,X0))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f27,f50])).
% 53.39/13.82 fof(f1648,plain,(
% 53.39/13.82 ![X0,X1,X2]: (least_upper_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X0,X2)))=X0)),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f50,f28])).
% 53.39/13.82 fof(f1880,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X0,X2))=greatest_lower_bound(greatest_lower_bound(X1,X0),X2))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f1635,f57])).
% 53.39/13.82 fof(f1952,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,greatest_lower_bound(X1,X2)))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f57,f1880])).
% 53.39/13.82 fof(f1953,plain,(
% 53.39/13.82 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X2),X1))),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f1635,f1952])).
% 53.39/13.82 fof(f3879,plain,(
% 53.39/13.82 ![X0]: (multiply(greatest_lower_bound(a,X0),c)=greatest_lower_bound(multiply(X0,c),sF1_fnc))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f37,f195])).
% 53.39/13.82 fof(f5942,plain,(
% 53.39/13.82 ![X0,X1,X2]: (least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X1,greatest_lower_bound(X0,X2)))=greatest_lower_bound(X1,X0))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f22,f363])).
% 53.39/13.82 fof(f8572,plain,(
% 53.39/13.82 ![X0,X1]: (greatest_lower_bound(sF2_fnc,greatest_lower_bound(multiply(b,X0),X1))=greatest_lower_bound(multiply(b,greatest_lower_bound(X0,d)),X1))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f176,f57])).
% 53.39/13.82 fof(f9998,plain,(
% 53.39/13.82 ![X0,X1,X2]: (least_upper_bound(greatest_lower_bound(X0,X1),greatest_lower_bound(X2,greatest_lower_bound(X1,X0)))=greatest_lower_bound(X1,X0))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f50,f5942])).
% 53.39/13.82 fof(f14882,plain,(
% 53.39/13.82 ![X0]: (greatest_lower_bound(sF2_fnc,greatest_lower_bound(multiply(b,c),X0))=greatest_lower_bound(multiply(b,c),X0))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f35,f8572])).
% 53.39/13.82 fof(f15273,plain,(
% 53.39/13.82 ![X0,X1]: (least_upper_bound(greatest_lower_bound(multiply(b,c),X0),greatest_lower_bound(X1,greatest_lower_bound(greatest_lower_bound(multiply(b,c),X0),sF2_fnc)))=greatest_lower_bound(greatest_lower_bound(multiply(b,c),X0),sF2_fnc))),
% 53.39/13.82 inference(paramodulation,[status(thm)],[f14882,f9998])).
% 53.39/13.82 fof(f15434,plain,(
% 53.39/13.82 ![X0]: (greatest_lower_bound(multiply(b,c),X0)=greatest_lower_bound(greatest_lower_bound(multiply(b,c),X0),sF2_fnc))),
% 53.39/13.82 inference(forward_demodulation,[status(thm)],[f1648,f15273])).
% 53.39/13.84 fof(f15436,plain,(
% 53.39/13.84 ![X0]: (greatest_lower_bound(multiply(b,c),X0)=greatest_lower_bound(multiply(b,c),greatest_lower_bound(sF2_fnc,X0)))),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f1953,f15434])).
% 53.39/13.84 fof(f16169,plain,(
% 53.39/13.84 greatest_lower_bound(multiply(b,c),sF1_fnc)=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(paramodulation,[status(thm)],[f143,f15436])).
% 53.39/13.84 fof(f16298,plain,(
% 53.39/13.84 multiply(greatest_lower_bound(a,b),c)=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f3879,f16169])).
% 53.39/13.84 fof(f16299,plain,(
% 53.39/13.84 multiply(a,c)=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f34,f16298])).
% 53.39/13.84 fof(f16300,plain,(
% 53.39/13.84 sF1_fnc=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f37,f16299])).
% 53.39/13.84 fof(f16496,plain,(
% 53.39/13.84 sF1_fnc=greatest_lower_bound(sF0_fnc,multiply(b,c))),
% 53.39/13.84 inference(paramodulation,[status(thm)],[f22,f16300])).
% 53.39/13.84 fof(f16498,plain,(
% 53.39/13.84 greatest_lower_bound(sF2_fnc,sF1_fnc)=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(paramodulation,[status(thm)],[f16300,f14882])).
% 53.39/13.84 fof(f16500,plain,(
% 53.39/13.84 ![X0]: (least_upper_bound(greatest_lower_bound(sF0_fnc,multiply(b,c)),greatest_lower_bound(X0,sF1_fnc))=greatest_lower_bound(multiply(b,c),sF0_fnc))),
% 53.39/13.84 inference(paramodulation,[status(thm)],[f16300,f9998])).
% 53.39/13.84 fof(f16565,plain,(
% 53.39/13.84 sF0_fnc=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f143,f16498])).
% 53.39/13.84 fof(f16566,plain,(
% 53.39/13.84 ![X0]: (least_upper_bound(sF1_fnc,greatest_lower_bound(X0,sF1_fnc))=greatest_lower_bound(multiply(b,c),sF0_fnc))),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f16496,f16500])).
% 53.39/13.84 fof(f16567,plain,(
% 53.39/13.84 sF1_fnc=greatest_lower_bound(multiply(b,c),sF0_fnc)),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f372,f16566])).
% 53.39/13.84 fof(f16568,plain,(
% 53.39/13.84 sF1_fnc=sF0_fnc),
% 53.39/13.84 inference(forward_demodulation,[status(thm)],[f16565,f16567])).
% 53.39/13.84 fof(f16569,plain,(
% 53.39/13.84 $false),
% 53.39/13.84 inference(forward_subsumption_resolution,[status(thm)],[f16568,f40])).
% 53.39/13.84 % SZS output end CNFRefutation for theBenchmark.p
% 32.44/13.96 % Elapsed time: 13.586047 seconds
% 32.44/13.96 % CPU time: 107.360081 seconds
% 32.44/13.96 % Total memory used: 37.047 GB
% 32.44/13.96 % Net memory used: 37.041 GB
%------------------------------------------------------------------------------