%------------------------------------------------------------------------------
% File : Drodi-SAT---4.1.1
% Problem : GRP140-1 : 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 : n005.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:06 PM UTC 2026
% Result : Unsatisfiable 0.12s 0.39s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP140-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 0.00/0.04 % Command : drodi -satmode(on) -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37 % Computer : n005.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.37 % WCLimit : 300
% 0.12/0.37 % DateTime : Sun Sep 20 20:02:18 UTC 2026
% 0.12/0.37 % CPUTime :
% 0.12/0.38 % Drodi V4.1.1
% 0.12/0.39 % Refutation found
% 0.12/0.39 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.39 % SZS output start CNFRefutation for theBenchmark
% 0.12/0.39 fof(f6,axiom,(
% 0.12/0.39 (![X,Y,Z]: (greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z) ))),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39 fof(f10,axiom,(
% 0.12/0.39 (![X,Y]: (least_upper_bound(X,greatest_lower_bound(X,Y)) = X ))),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39 fof(f16,hypothesis,(
% 0.12/0.39 greatest_lower_bound(a,c) = c ),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39 fof(f17,hypothesis,(
% 0.12/0.39 greatest_lower_bound(b,c) = c ),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39 fof(f18,negated_conjecture,(
% 0.12/0.39 least_upper_bound(greatest_lower_bound(a,b),c) != greatest_lower_bound(a,b) ),
% 0.12/0.39 file('/export/starexec/sandbox/benchmark/theBenchmark.p')).
% 0.12/0.39 fof(f24,plain,(
% 0.12/0.39 ![X0,X1,X2]: (greatest_lower_bound(X0,greatest_lower_bound(X1,X2))=greatest_lower_bound(greatest_lower_bound(X0,X1),X2))),
% 0.12/0.39 inference(cnf_transformation,[status(thm)],[f6])).
% 0.12/0.39 fof(f28,plain,(
% 0.12/0.39 ![X0,X1]: (least_upper_bound(X0,greatest_lower_bound(X0,X1))=X0)),
% 0.12/0.39 inference(cnf_transformation,[status(thm)],[f10])).
% 0.12/0.39 fof(f34,plain,(
% 0.12/0.39 greatest_lower_bound(a,c)=c),
% 0.12/0.39 inference(cnf_transformation,[status(thm)],[f16])).
% 0.12/0.39 fof(f35,plain,(
% 0.12/0.39 greatest_lower_bound(b,c)=c),
% 0.12/0.39 inference(cnf_transformation,[status(thm)],[f17])).
% 0.12/0.39 fof(f36,plain,(
% 0.12/0.39 ~least_upper_bound(greatest_lower_bound(a,b),c)=greatest_lower_bound(a,b)),
% 0.12/0.39 inference(cnf_transformation,[status(thm)],[f18])).
% 0.12/0.39 fof(f37,definition,(
% 0.12/0.39 sF1_fnc=greatest_lower_bound(a,b)),
% 0.12/0.39 introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition])).
% 0.12/0.39 fof(f38,definition,(
% 0.12/0.39 sF0_fnc=least_upper_bound(sF1_fnc,c)),
% 0.12/0.39 introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition])).
% 0.12/0.39 fof(f39,plain,(
% 0.12/0.39 ~sF0_fnc=sF1_fnc),
% 0.12/0.39 inference(definition_folding,[],[f36,f38,f37])).
% 0.12/0.39 fof(f59,plain,(
% 0.12/0.39 ![X0]: (greatest_lower_bound(a,greatest_lower_bound(b,X0))=greatest_lower_bound(sF1_fnc,X0))),
% 0.12/0.39 inference(paramodulation,[status(thm)],[f37,f24])).
% 0.12/0.39 fof(f239,plain,(
% 0.12/0.39 greatest_lower_bound(a,c)=greatest_lower_bound(sF1_fnc,c)),
% 0.12/0.39 inference(paramodulation,[status(thm)],[f35,f59])).
% 0.12/0.39 fof(f244,plain,(
% 0.12/0.39 c=greatest_lower_bound(sF1_fnc,c)),
% 0.12/0.39 inference(forward_demodulation,[status(thm)],[f34,f239])).
% 0.12/0.39 fof(f251,plain,(
% 0.12/0.39 least_upper_bound(sF1_fnc,c)=sF1_fnc),
% 0.12/0.39 inference(paramodulation,[status(thm)],[f244,f28])).
% 0.12/0.39 fof(f255,plain,(
% 0.12/0.39 sF0_fnc=sF1_fnc),
% 0.12/0.39 inference(forward_demodulation,[status(thm)],[f38,f251])).
% 0.12/0.39 fof(f256,plain,(
% 0.12/0.39 $false),
% 0.12/0.39 inference(forward_subsumption_resolution,[status(thm)],[f255,f39])).
% 0.12/0.39 % SZS output end CNFRefutation for theBenchmark.p
% 0.12/0.42 % Elapsed time: 0.045032 seconds
% 0.12/0.42 % CPU time: 0.068480 seconds
% 0.12/0.42 % Total memory used: 3.088 MB
% 0.12/0.42 % Net memory used: 3.063 MB
%------------------------------------------------------------------------------