%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP163-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 : n020.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:08 PM UTC 2026
% Result : Unsatisfiable 0.10s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP163-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.36 % Computer : n020.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % 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:03:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.38 % Drodi V4.1.1
% 0.10/0.39 % Refutation found
% 0.10/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/0.39 % SZS output start CNFRefutation for theBenchmark
% 0.10/0.39 fof(f4,axiom,(
% 0.10/0.39 (![X,Y]: (greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X) ))),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f5,axiom,(
% 0.10/0.39 (![X,Y]: (least_upper_bound(X,Y) = least_upper_bound(Y,X) ))),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f6,axiom,(
% 0.10/0.39 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f9,axiom,(
% 0.10/0.39 (![X]: (greatest_lower_bound(X,X) = X ))),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f10,axiom,(
% 0.10/0.39 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f16,hypothesis,(
% 0.10/0.39 greatest_lower_bound(a,b) = a ),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f17,hypothesis,(
% 0.10/0.39 greatest_lower_bound(b,c) = b ),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f18,negated_conjecture,(
% 0.10/0.39 greatest_lower_bound(a,c) != a ),
% 0.10/0.39 file('/export/starexec/sandbox2/benchmark/theBenchmark.p')).
% 0.10/0.39 fof(f22,plain,(
% 0.10/0.39 ![X0,X1]: (greatest_lower_bound(X0,X1)=greatest_lower_bound(X1,X0))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f4])).
% 0.10/0.39 fof(f23,plain,(
% 0.10/0.39 ![X0,X1]: (least_upper_bound(X0,X1)=least_upper_bound(X1,X0))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f5])).
% 0.10/0.39 fof(f24,plain,(
% 0.10/0.39 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f6])).
% 0.10/0.39 fof(f27,plain,(
% 0.10/0.39 ![X0]: (greatest_lower_bound(X0,X0)=X0)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f9])).
% 0.10/0.39 fof(f28,plain,(
% 0.10/0.39 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f10])).
% 0.10/0.39 fof(f34,plain,(
% 0.10/0.39 greatest_lower_bound(a,b)=a),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f16])).
% 0.10/0.39 fof(f35,plain,(
% 0.10/0.39 greatest_lower_bound(b,c)=b),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f17])).
% 0.10/0.39 fof(f36,plain,(
% 0.10/0.39 ~greatest_lower_bound(a,c)=a),
% 0.10/0.39 inference(cnf_transformation,[status(thm)],[f18])).
% 0.10/0.39 fof(f37,definition,(
% 0.10/0.39 sF0_fnc=greatest_lower_bound(a,c)),
% 0.10/0.39 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.10/0.39 fof(f38,plain,(
% 0.10/0.39 ~sF0_fnc=a),
% 0.10/0.39 inference(definition_folding,[],[f36,f37])).
% 0.10/0.39 fof(f48,plain,(
% 0.10/0.39 ![X0]: (greatest_lower_bound(a,greatest_lower_bound(c,X0))=greatest_lower_bound(sF0_fnc,X0))),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f37,f24])).
% 0.10/0.39 fof(f79,plain,(
% 0.10/0.39 ![X0]: (greatest_lower_bound(a,greatest_lower_bound(X0,c))=greatest_lower_bound(sF0_fnc,X0))),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f22,f48])).
% 0.10/0.39 fof(f81,plain,(
% 0.10/0.39 greatest_lower_bound(a,c)=greatest_lower_bound(sF0_fnc,c)),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f27,f48])).
% 0.10/0.39 fof(f83,plain,(
% 0.10/0.39 sF0_fnc=greatest_lower_bound(sF0_fnc,c)),
% 0.10/0.39 inference(forward_demodulation,[status(thm)],[f37,f81])).
% 0.10/0.39 fof(f88,plain,(
% 0.10/0.39 greatest_lower_bound(a,b)=greatest_lower_bound(sF0_fnc,b)),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f35,f79])).
% 0.10/0.39 fof(f95,plain,(
% 0.10/0.39 a=greatest_lower_bound(sF0_fnc,b)),
% 0.10/0.39 inference(forward_demodulation,[status(thm)],[f34,f88])).
% 0.10/0.39 fof(f146,plain,(
% 0.10/0.39 greatest_lower_bound(a,sF0_fnc)=greatest_lower_bound(sF0_fnc,sF0_fnc)),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f83,f79])).
% 0.10/0.39 fof(f150,plain,(
% 0.10/0.39 greatest_lower_bound(a,sF0_fnc)=sF0_fnc),
% 0.10/0.39 inference(forward_demodulation,[status(thm)],[f27,f146])).
% 0.10/0.39 fof(f156,plain,(
% 0.10/0.39 least_upper_bound(sF0_fnc,a)=sF0_fnc),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f95,f28])).
% 0.10/0.39 fof(f160,plain,(
% 0.10/0.39 least_upper_bound(a,sF0_fnc)=a),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f150,f28])).
% 0.10/0.39 fof(f206,plain,(
% 0.10/0.39 least_upper_bound(a,sF0_fnc)=sF0_fnc),
% 0.10/0.39 inference(paramodulation,[status(thm)],[f23,f156])).
% 0.10/0.39 fof(f212,plain,(
% 0.10/0.39 a=sF0_fnc),
% 0.10/0.39 inference(forward_demodulation,[status(thm)],[f160,f206])).
% 0.10/0.39 fof(f213,plain,(
% 0.10/0.39 $false),
% 0.10/0.39 inference(forward_subsumption_resolution,[status(thm)],[f212,f38])).
% 0.10/0.39 % SZS output end CNFRefutation for theBenchmark.p
% 0.10/0.41 % Elapsed time: 0.035306 seconds
% 0.10/0.41 % CPU time: 0.068251 seconds
% 0.10/0.41 % Total memory used: 1.901 MB
% 0.10/0.41 % Net memory used: 1.890 MB
%------------------------------------------------------------------------------